The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Hitoshi Asaeda(12hit)

1-12hit
  • Channel Reflector: An Interdomain Channel Directory System

    Hitoshi ASAEDA  Wacharapol POKAVANICH  Soh YAMAMOTO  

     
    PAPER-Internet

      Vol:
    E89-B No:10
      Page(s):
    2860-2867

    An end-user who wants to participate in group communication on the Internet must first resolve the session information including the contents type, data source and destination addresses. An effective session directory system is therefore the necessary component for the delivery of the maximum group communication value to a large number of world-wide users. In this paper, we formalize a distributed session directory system called "Channel Reflector (CR)." The advantage of CR is that, while an end-user can retrieve interesting session information from CR through a regular web interface, there is no contradiction to the dynamic nature of the session announcement scheme and the scoping technique in this architecture. For the deployment purpose, we show the actual implementation and the measurement results on the session synchronization delay given by the PlanetLab overlay network testbed.

  • Policy and Scope Management for Multicast Channel Announcement

    Hitoshi ASAEDA  Vincent ROCA  

     
    PAPER-Networks

      Vol:
    E88-D No:7
      Page(s):
    1638-1645

    A scalable multicast session announcement system is a key component of a group communication framework over the Internet. It enables the announcement of session parameters (like the {source address; group address} pair) to a potentially large number of users, according to each site administrator's policy. This system should accommodate any flavor of group communication system, like the Any-Source Multicast (ASM) and Source-Specific Multicast (SSM) schemes. In this paper we first highlight the limitations of the current Session Announcement Protocol (SAP) and study several other information distribution protocols. This critical analysis leads us to formulate the requirements of an ideal multicast session announcement system. We then introduce a new session announcement system called "Channel Reflector". It appears as a hierarchical directory system and offers an effective policy and scope control technique. We finally mention some design aspects, like the protocol messages and configuration structures the Channel Reflector uses.

  • A Hybrid Trust Management Framework for Wireless Sensor and Actuator Networks in Cyber-Physical Systems Open Access

    Ruidong LI  Jie LI  Hitoshi ASAEDA  

     
    INVITED PAPER

      Vol:
    E97-D No:10
      Page(s):
    2586-2596

    To secure a wireless sensor and actuator network (WSAN) in cyber-physical systems, trust management framework copes with misbehavior problem of nodes and stimulate nodes to cooperate with each other. The existing trust management frameworks can be classified into reputation-based framework and trust establishment framework. There, however, are still many problems with these existing trust management frameworks, which remain unsolved, such as frangibility under possible attacks. To design a robust trust management framework, we identify the attacks to the existing frameworks, present the countermeasures to them, and propose a hybrid trust management framework (HTMF) to construct trust environment for WSANs in the paper. HTMF includes second-hand information and confidence value into trustworthiness evaluation and integrates the countermeasures into the trust formation. We preform extensive performance evaluations, which show that the proposed HTMF is more robust and reliable than the existing frameworks.

  • Cefore: Software Platform Enabling Content-Centric Networking and Beyond Open Access

    Hitoshi ASAEDA  Atsushi OOKA  Kazuhisa MATSUZONO  Ruidong LI  

     
    INVITED PAPER

      Pubricized:
    2019/03/22
      Vol:
    E102-B No:9
      Page(s):
    1792-1803

    Information-Centric or Content-Centric Networking (ICN/CCN) is a promising novel network architecture that naturally integrates in-network caching, multicast, and multipath capabilities, without relying on centralized application-specific servers. Software platforms are vital for researching ICN/CCN; however, existing platforms lack a focus on extensibility and lightweight implementation. In this paper, we introduce a newly developed software platform enabling CCN, named Cefore. In brief, Cefore is lightweight, with the ability to run even on top of a resource-constrained device, but is also easily extensible with arbitrary plugin libraries or external software implementations. For large-scale experiments, a network emulator (Cefore-Emu) and network simulator (Cefore-Sim) have also been developed for this platform. Both Cefore-Emu and Cefore-Sim support hybrid experimental environments that incorporate physical networks into the emulated/simulated networks. In this paper, we describe the design, specification, and usage of Cefore as well as Cefore-Emu and Cefore-Sim. We show performance evaluations of in-network caching and streaming on Cefore-Emu and content fetching on Cefore-Sim, verifying the salient features of the Cefore software platform.

  • A Node Design and a Framework for Development and Experimentation for an Information-Centric Network Open Access

    George PARISIS  Dirk TROSSEN  Hitoshi ASAEDA  

     
    INVITED PAPER

      Vol:
    E96-B No:7
      Page(s):
    1650-1660

    Information-centric networking has been touted as an alternative to the current Internet architecture. Our work addresses a crucial part of such a proposal, namely the design of a network node within an information-centric networking architecture. Special attention is given in providing a platform for development and experimentation in an emerging network research area; an area that questions many starting points of the current Internet. In this paper, we describe the service model exposed to applications and provide background on the operation of the platform. For illustration, we present current efforts in deployment and experimentation with demo applications presented, too.

  • Architecture for IP Multicast Deployment: Challenges and Practice Open Access

    Hitoshi ASAEDA  Shinsuke SUZUKI  Katsushi KOBAYASHI  Jun MURAI  

     
    INVITED PAPER

      Vol:
    E89-B No:4
      Page(s):
    1044-1051

    IP multicast technology is highly advantageous for various applications and future needs in the Internet. Yet, it is generally recognized that the IP multicast routing protocol is fairly complex and non-scalable and requires additional maintenance and operational cost to network administrators. Although there has been much research related to IP multicast and most router vendors already support basic IP multicast routing protocols, there is still a big gap between what is reported as the state-of-the-art in the literature from what is implemented in practice. In this paper, we clarify the complexities of traditional multicast communication and describe possible solutions using the one-to-many multicast communication model called Source-Specific Multicast (SSM). We explain this communication model and the corresponding routing architecture and examine the statistics obtained for the number of multicast routing entries in our backbone router, which is connected to the international backbone. We also introduce our international collaboration activities that are contributing to the deployment and promotion of IP multicast services in the Internet.

  • Self-Organizing Name Resolution System in a Small World

    Suyong EUM  Masahiro JIBIKI  Masayuki MURATA  Hitoshi ASAEDA  Nozomu NISHINAGA  

     
    PAPER

      Vol:
    E97-B No:12
      Page(s):
    2606-2615

    This article introduces a self-organizing model which builds the topology of a DHT mapping system for ICN. Due to its self-organizing operation and low average degree of maintenance, the management overhead of the system is reduced dramatically, which yields inherent scalability. The proposed model can improve latency by around 10% compared to an existing approach which has a near optimal average distance when the number of nodes and degree are given. In particular, its operation is simple which eases maintenance concerns. Moreover, we analyze the model theoretically to provide a deeper understanding of the proposal.

  • Design and Analysis of IGMPv3 and MLDv2 Host-Side Protocol Implementations

    Hitoshi ASAEDA  

     
    PAPER-Protocols, Applications and Services

      Vol:
    E87-D No:12
      Page(s):
    2602-2609

    Source-Specific Multicast (SSM) is recognized as the most feasible multicast communication model for a wide use throughout the Internet because it eliminates many complexities associated with traditional many-to-many multicast communication model. Regarding the SSM communication, however, implementations of the Internet Group Multicast Protocol version 3 (IGMPv3) for IPv4 and the Multicast Listener Discovery version 2 (MLDv2) for IPv6 are indispensable on every end-host. Accurate implementations of these protocols are necessary studies for the smooth deployment. In this document, we illustrate IGMPv3 and MLDv2 host-side implementations applied to the 4.4BSD kernel. While presenting the concept and the design of these implementations, we verify the behavior and evaluate the response times for (*,G) and (S,G) joins requested on top of both implementations.

  • Local Tree Hunting: Finding Closest Contents from In-Network Cache

    Hiroshi SHIMIZU  Hitoshi ASAEDA  Masahiro JIBIKI  Nozomu NISHINAGA  

     
    PAPER-Internet Architecture and Protocols

      Pubricized:
    2014/12/11
      Vol:
    E98-D No:3
      Page(s):
    557-564

    How to retrieve the closest content from an in-network cache is one of the most important issues in Information-Centric Networking (ICN). This paper proposes a novel content discovery scheme called Local Tree Hunting (LTH). By adding branch-cast functionality to a local tree for content requests to a Content-Centric Network (CCN) response node, the discovery area for caching nodes expands. Since the location of such a branch-casting node moves closer to the request node when the content is more widely cached, the discovery range, i.e. the branch size of the local tree, becomes smaller. Thus, the discovery area is autonomously adjusted depending on the content dissemination. With this feature, LTH is able to find the “almost true closest” caching node without checking all the caching nodes in the in-network cache. The performance analysis employed in Zipf's law content distribution model and which uses the Least Recently Used eviction rule shows the superiority of LTH with respect to identifying the almost exact closest cache.

  • Real-Time Monitoring of Multicast Group Information

    Achmad BASUKI  Achmad Husni THAMRIN  Hitoshi ASAEDA  Jun MURAI  

     
    PAPER-Information Network

      Vol:
    E93-D No:8
      Page(s):
    2213-2222

    This paper presents a method to monitor information of a large-sized multicast group that can follow the group's dynamics in real-time while avoiding feedback implosion by using probabilistic polling. In particular, this paper improves the probabilistic-polling-based approach by deriving a reference mean value as the reference control value for the number of expected feedback from the properties of a binomial estimation model. As a result, our method adaptively changes its estimation parameters depending on the feedback from receivers in order to achieve a fast estimate time with high accuracy, while preventing the possible occurrence of feedback implosion. Our experimental implementation and evaluation on PlanetLab showed that the proposed method effectively controls the number of feedback and accurately estimates the size of a dynamic multicast group.

  • FOREWORD Open Access

    Hitoshi Asaeda  

     
    FOREWORD

      Vol:
    E99-B No:12
      Page(s):
    2469-2469
  • A Survey of Information-Centric Networking: The Quest for Innovation Open Access

    Hitoshi ASAEDA  Kazuhisa MATSUZONO  Yusaku HAYAMIZU  Htet Htet HLAING  Atsushi OOKA  

     
    INVITED PAPER-Network

      Pubricized:
    2023/08/22
      Vol:
    E107-B No:1
      Page(s):
    139-153

    Information-Centric Networking (ICN) is an innovative technology that provides low-loss, low-latency, high-throughput, and high-reliability communications for diversified and advanced services and applications. In this article, we present a technical survey of ICN functionalities such as in-network caching, routing, transport, and security mechanisms, as well as recent research findings. We focus on CCNx, which is a prominent ICN protocol whose message types are defined by the Internet Research Task Force. To facilitate the development of functional code and encourage application deployment, we introduce an open-source software platform called Cefore that facilitates CCNx-based communications. Cefore consists of networking components such as packet forwarding and in-network caching daemons, and it provides APIs and a Python wrapper program that enables users to easily develop CCNx applications for on Cefore. We introduce a Mininet-based Cefore emulator and lightweight Docker containers for running CCNx experiments on Cefore. In addition to exploring ICN features and implementations, we also consider promising research directions for further innovation.