Naohiro Hayashibara

Naohiro Hayashibara
Kyoto Sangyo University · Faculty of Information Science and Engineering

Ph.D. (Information Science)

About

104
Publications
13,155
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
934
Citations
Additional affiliations
April 2013 - present
Kyoto Sangyo University
Position
  • Professor (Associate)
April 2008 - March 2013
Kyoto Sangyo University
Position
  • Professor (Assistant)
April 2005 - March 2008
Tokyo Denki University
Position
  • Research Associate

Publications

Publications (104)
Chapter
Random walks, including the Nomadic Lévy Walk, play a crucial role in various computer science domains such as networking, distributed systems, and optimization. The Nomadic Lévy Walk, a variant of the Homesick Lévy Walk, holds promise as a potential candidate for message ferry routing schemes. This approach combines the homing behavior characteris...
Chapter
Message ferry is to provide communication service for mobile nodes in Delay-Tolerant Networks (DTNs). Various routing schemes for message ferries have been proposed so far. The efficiency of message delivery using message ferries depends on the routing scheme. Nomadic Lévy Walk, a variant of Lévy Walk, is an eligible candidate for a message ferry r...
Chapter
Message ferry is a way of communication in Delay-Tolerant Networks (DTNs). Various routing schemes for message ferries have been proposed so far. The efficiency of message delivery using message ferries depends on the routing scheme. Nomadic Lévy Walk that is a variant of Lévy Walk, is an eligible candidate for a message ferry routing scheme. It in...
Chapter
Random walks play an essential role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Lévy walk is a family of random walks whose distance of a walk is chosen from the power-law distribution. Lévy walk is widely used for various applications such as modeling pe...
Chapter
Message ferry is a way of communication in Intermittently Connected Delay-Tolerant Networks. It is for collecting data from stationary sensor nodes. The efficiency of message delivery using message ferries depends on the routing scheme. Nomadic Lévy Walk that is a variant of Lévy Walk, is an eligible candidate for a message ferry routing scheme. It...
Article
Cloud-based Content delivery networks (CCDNs) support multimedia services to improve availability, efficient access, and load balancing with satisfying QoS requirements. CCDNs offer faster content access to users by deploying or caching popular content at servers close to the appropriate users. However, content placement with QoS requirements and s...
Chapter
Message ferry is a way of communication in Intermittently Connected Delay-Tolerant Wireless Sensor Networks. It is for collecting data from stationary sensor nodes. The efficiency of message delivery using message ferries depends on the routing scheme. Nomadic Lévy Walk that is a variant of Lévy Walk is an eligible candidate for a message ferry rou...
Chapter
Mobile ad-hoc network consists of a collection of mobile devices that are interconnected to each other. It has attracted attention in various areas, such as information sharing and intelligent transportation. In particular, information sharing on MANET in an emergency is crucial for victims. In this situation, information on relief supplies and saf...
Chapter
Opportunistic communication is one of the key technologies for advertisement, information sharing, disaster evacuation guidance in delay-tolerant networks (DTNs), vehicular ad hoc networks (VANETs), and so on. The efficiency of message delivery in opportunistic communication is correlated to the routing protocols and the movement model of mobile en...
Chapter
Mobile ad-hoc network consists of a collection of mobile devices that are interconnected each other. It has attracted attention in various areas, such as information sharing and intelligent transportation. In particular, information sharing on MANET in an emergency is crucial for victims. In this situation, information on relief supplies and safety...
Article
Mobile ad-hoc network consists of a collection of mobile devices that are interconnected each other. It has attracted attention in various areas such as information sharing and intelligent transportation. In particular, information sharing on MANET in an emergency is crucial for victims. In this situation, information on relief supplies and safety...
Chapter
Lévy walk has attracted attention to its search efficiency. Nomadic Lévy Walk is a variant of Homesick Lévy Walk, which has homing behavior in addition to the trajectory of Lévy Walk. In this walk pattern, each agent relocates its home (sink) position based on some particular strategy with a given probability. In this paper, we propose a novel stra...
Article
Full-text available
Opportunistic communication is one of the key technologies in the area of advertisement, information sharing, disaster evacuation guidance in delay-tolerant networks (DTNs), vehicular ad hoc networks (VANETs) and so on. The efficiency of opportunistic communication is correlated with the movement pattern. Random walks are often used as the movement...
Chapter
Opportunistic communication is one of the key technologies for advertisement, information sharing, disaster evacuation guidance in delay-tolerant networks (DTNs), vehicular ad hoc networks (VANETs) and so on. The efficiency of message delivery in opportunistic communication is correlated to the routing protocols and the movement pattern of mobile e...
Chapter
In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smartphones). Although it is easy to construct an ad-hoc network, there are several problems, for instance, the management of the network under node churn. On messag...
Chapter
Lévy walk is a family of random walks whose distance of a walk is chosen from the power law distribution. There are lots of works of Lévy walk in the context of target detection in swarm robotics, analyzing human walk patterns, and modeling the behavior of animal foraging in recent years. According to these results, it is known as an efficient meth...
Chapter
Mobile ad-hoc network consists of a collection of mobile devices that are interconnected each other. It has attracted attention in various areas such as information sharing and intelligent transportation. In particular, information sharing on MANET in an emergency is crucial for victims. In this situation, information on relief supplies and safety...
Chapter
Collaborative editing is one of fundamental problems in distributed systems. It includes a consistent update on shared data. Many approaches for this issue have been proposed but most of them are for two-dimensional data such as documents, pictures, etc. In contrast, ChainVoxel has been developed as a conflict-free data structure for 3D models for...
Chapter
Agreement problems are essential building blocks for fault-tolerant distributed applications. Among them, consensus protocols have been developing actively over the last decade. Raft consensus protocol is a simple leader-based consensus protocol. It is widely used in distributed databases and storage systems such as Apache Kudu, RavenDB, and so on....
Conference Paper
Collaborative editing is one of the fundamental problems in distributed systems. It includes a consistent update on shared data. Many approaches to this issue have been proposed, but most of them are for two-dimensional data such as documents, pictures, etc. In this paper, we extend the notion of ChainVoxel which is based on conflict-free replicate...
Conference Paper
In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smartphones). Although it is easy to construct an ad-hoc network, there are several problems, for instance, the management of the network, message delivery and so on...
Conference Paper
Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Homesick Lévy walk is a family of random walks whose the distance of a walk is chosen from the power law distribution. It also comes back to a starting point in a certain prob...
Conference Paper
Protocols which solve agreement problems are essential building blocks for fault-tolerant distributed applications. Raft consensus protocol proposed by Ongaro and Ousterhout is a simple consensus protocol. It basically consumes every resource in the system for achieving an agreement. Thus, there is a problem on resource and energy consumption. This...
Chapter
Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Lévy walk is a family of random walks whose the distance of a walk is chosen from the power law distribution. There are lots of works of Lévy walk in the context of target det...
Article
In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smart phones). On message delivery over the network, it is very difficult to assume the static routing if each node is assumed to move. In this paper, we suppose to...
Article
Exception handling is one of the most important factors in software development. It provides fault-tolerant functionality for possible errors occurred during execution. Most of modern programming languages~(e.g., Java, C++, OCaml, Ruby, etc.) have such function. On the other hand, it is able to make the program complicated. One of the main drawback...
Conference Paper
To operate actuators (e.g., robots) with a certain controller in smart environment, it requires some programming for connecting between them. However, such programming without any structure often causes the system with the lack of extensibility and flexibility. In this paper, we show an implementation of the programming framework, called Squarekno...
Conference Paper
In the application layer, communication between two nodes is usually done on a communication channel. On the other hand, connection and disconnection occur intermittently in lower layers. Persistent connection is often required by several applications (e.g., HTTP, large data transfer, etc.). It has to be available continuously till the application...
Article
It is widely recognised that distributed systems would greatly benefit from the availability of a generic failure detection service. In this paper, we highlighted the issue on the construction of the monitoring network of failure detectors. We proposed an algorithm to construct and manage the monitoring network that each failure detector is monitor...
Conference Paper
Full-text available
A wireless sensor-actuator network (WSAN) is composed of sensor and actuator nodes interconnected in a wireless channel. Sensor nodes can deliver messages to only nearer nodes due to weak radio and messages are forwarded by sensor nodes to an actuator node. Messages sent by nodes might be lost due to collision and noise. We discuss the redundant da...
Conference Paper
Full-text available
Peer-to-peer (P2P) systems are widely used in various types of applications. In this paper, we evaluate the superpeer-based two-layer (SBTL) P2P overlay network with the charge-based flooding (CBF) algorithm to detect target peers which have target files, proposed as our previous work. The SBTL P2P overlay network is composed of two layers, normal...
Conference Paper
In this paper, we analyze the performance of the implementation of the phi failure detector with interrogation-style interaction though many failure detector implementations have been evaluating based on heartbeat interaction. Intuitively, interrogation-based failure detector seems to be imprecise due to the difficulty on the estimation of two-ways...
Conference Paper
Full-text available
In peer-to-peer (P2P) applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a meeting schedule of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every proce...
Conference Paper
Full-text available
Servers can be fault-tolerant through replication and checkpointing technologies in the client server model. However, application programs cannot be performed and servers might block in the two-phase commitment protocol due to the client fault. In this paper, we discuss the transactional agent model to make application programs fault-tolerant by ta...
Conference Paper
Full-text available
In a wireless sensor and actuator network (WSAN), a group of sensor, actuator, and actuation device nodes are interconnected in wireless networks. Sensor nodes send sensed values of an event to actuator nodes. Messages may be lost due to collision and noise and nodes may be faulty. Here, actuator nodes have to perform appropriate actions on actuati...
Conference Paper
Full-text available
In a wireless sensor-actuator network (WSAN), sensor and actuator nodes exchange messages in a wireless channel. Sensor nodes can deliver messages to only close nodes while actuator can deliver to distant nodes. Messages sent by nodes might be lost due to collision and noise. The more number of sensor nodes are located in an event area, the more nu...
Conference Paper
Full-text available
In distributed applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a date for a meeting of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every process is...
Conference Paper
Full-text available
In a wireless sensor-actuator network (WSAN), sensors send sensed values to actuators in a wireless channel. Messages sent by nodes might be lost due to collision and noise if multiple nodes simultaneously send the messages. If a message is detected to be lost, the source node retransmits the message to the destination nodes. It takes at least thre...
Conference Paper
Full-text available
In a wireless sensor-actuator network (WSAN), sensor nodes and actuator nodes are interconnected with wireless channels. Messages sent by sensor nodes might be lost due to collision and noise if multiple sensor nodes simultaneously send the messages in a wireless channel. In sensing applications, sensed values are in nature required to be delivered...
Article
Full-text available
Peer-to-peer (P2P) systems are now getting popular and are widely used in various types of applications. In this paper, we newly propose a superpeer-based two-layer P2P overlay network with the charge-based flooding (CBF) algorithm, a look-up protocol for distributed multimedia objects. The layers of normal peer and superpeer are composed of a set...
Article
Full-text available
In this paper, we discuss how to realize fault-tolerant applications on distributed objects. Servers supporting objects can be fault-tolerant by taking advantage of replication and checkpointing technologies. However, there is no discussion on how application programs being performed on clients are tolerant of clients faults. For example, servers m...
Article
Full-text available
A subject doing a job function plays a role in an enterprise. In the role-based access control model, a role is a set of access rights. A subject granted a role can issue an access request in the role. In addition, objects are required to be consistent even if multiple transactions concurrently manipulate an object in a conflicting way. Here, a sub...
Conference Paper
Full-text available
In this paper, we discuss a peer-to-peer (P2P) based fully distributed system where each peer process autonomously makes a decision by itself using information obtained from its acquaintance peers without any centralized coordinator. An acquaintance of a peer p is another peer about whose service p knows and with which p can directly communicate. H...
Conference Paper
In a wireless sensor and actuator network (WSAN), a group of sensor nodes, actuators, and actuation devices are geographically distributed and linked by wireless networks. Sensor nodes gather information for an event occurring in the physical world and send them to actuators. Actuators perform appropriate actions on actuation devices by making a de...
Article
Full-text available
In a peer-to-peer (P2P) overlay network, a large number and various types of peer processes are interconnected in networks and are cooperating by using multimedia contents like movies and music. Here, multimedia contents are in nature distributed to peers in various ways like downloading and caching to the peers. Multimedia streaming is a key techn...
Conference Paper
Full-text available
We discuss how to realize the multimedia streaming service by using multiple peers in a peer-to-peer (P2P) overlay network. Here, multimedia contents are required to be reliably delivered to processes in a real-time manner. Multimedia contents are distributed to peers in various ways like downloading. A peer which holds a content can provide other...
Conference Paper
Full-text available
In a peer-to-peer (P2P) overlay network, a large number and various types of peers are cooperating by exchanging multimedia contents. Here, multimedia streaming is a key technology to realize multimedia applications. A multimedia content is distributed to multiple peers and these peers named contents peers can support other leaf peers with the cont...
Conference Paper
It is widely recognized that distributed systems would greatly benefit from the availability of a generic failure detection service. There are however several issues that must be addressed before such a service can actually be implemented. Traditionally, failure detectors or failure detection services provide a list of processes that are currently...
Conference Paper
Much previous work has been done on distributed dynamic resource allocation of resources like nodes and connected links in networks. It is not easy to find ways to allocate resources and analyze the performance of the way due to the scalability and change of the network. In this paper, we discuss a novel macro-level, zone-based approach. Zone-based...
Conference Paper
Full-text available
In a wireless sensor and actor network (WSAN), a group of sensors and actors are geographically distributed and linked by wireless networks. Sensors gather information sensed for an event in the physical world and send them to actors. Actors perform appropriate actions on actuation devices by making a decision on receipt of sensed information from...
Conference Paper
In this paper, we explain an implementation of an accrual failure detector, that we call the . failure detector. The particularity of the . failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior...
Conference Paper
Full-text available
Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding an...
Conference Paper
Full-text available
Multimedia contents are distributed to peers in various ways like downloading in peer-to-peer (P2P) overlay networks. A peer which holds a content, even a part of a content can provide other peers with the content. Multimedia streaming is more significant in multimedia applications than downloading way. We discuss how to support the multimedia stre...
Conference Paper
Full-text available
Multimedia contents are distributed to peers in various ways in peer-to-peer (P2P) overlay networks. A peer which holds a content, even a part of a content can provide other peers with the content. Multimedia streaming is more significant in multimedia applications than downloading ways in Internet applications. We discuss how to support peers with...
Conference Paper
Full-text available
An object is a unit of resource distributed in a peer-to-peer (P2P) overlay network. Service supported by an object is modeled to be a set of methods. It is critical to discuss which peer can manipulate an object in which method, i.e. only a peer granted an access right (permission) can manipulate an object. First, an application has to find target...
Conference Paper
Full-text available
A transactional agent is a mobile agent to manipulate objects distributed on computers with some commitment condition like atomic commitment. Computers may stop by fault. In the client-server model, servers can be fault-tolerant according to replication and checkpointing technologies. However, an application program cannot be performed if a client...
Conference Paper
Full-text available
In a wireless sensor and actor network (WSAN), a group of sensors, actors, and actuation devices are geographically distributed and linked by wireless networks. Sensors gather information for an event occurring in the physical world and send them to actors. Actors can perform appropriate actions on actuation devices by making a decision on receipt...
Conference Paper
Full-text available
A transactional agent is a mobile agent to manipulate objects distributed on computers with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one commitment condition. Computers may stop by fault while networks are assumed to be reliable. In th...
Conference Paper
Full-text available
In peer-to-peer (P2P) overlay networks, objects are distributed to peers in various ways like downloading. Service supported by an object is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what me...
Conference Paper
Full-text available
Service supported by an object is modeled to be a set of methods and quality of service (QoS). In addition to finding a peer which holds a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay ne...
Conference Paper
Full-text available
A transactional agent is a mobile agent to manipulate objects with some type of commitment condition. We assume computers may stop by fault while networks are reliable. In the client-server model, servers are fault-tolerant according to the replication and checkpointing technologies. However, an application program cannot be performed if a client i...
Conference Paper
In this paper, we explain an implementation of an accrual failure detector, that we call the y failure detector. The particularity of the y failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior...
Conference Paper
Full-text available
Various types of multimedia objects are manipulated on peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of multimedia objects. We discuss types of acquaintance relations of peers with respect to types of objects and access rights. We discuss a ch...
Conference Paper
Full-text available
In multimedia streaming applications on P2P overlay networks, multimedia data in contents peers has to be efficiently and reliably delivered to large number of leaf peers in a real-time manner. In this paper, we propose an asynchronous multi-source streaming (AMSS) model where multiple contents peers transmit packets of multimedia contents to each...
Conference Paper
It is widely recognized that distributed systems would greatly benefit from the availability of a generic failure detection service. There are however several issues that must be addressed before such a service can actually be implemented. In this paper, we highlight the issue related to propagating information on failures in the phi failure detect...
Conference Paper
Peer-to-peer (P2P) systems are composed of large number and various types of processes interconnected in networks. Peers may not suffer from only stop fault but also Byzantine fault. We have to discuss how to make a system tolerant of Byzantine faults of processes. In order to reduce the overhead of Byzantine agreement (BA), we consider a hierarchi...
Article
Full-text available
Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object....
Conference Paper
Full-text available
In peer-to-peer (P2P) networks, large number of peer processes are cooperating. In this paper, we discuss a scalable group of processes where processes are widely distributed in networks. Clocks of computers in every local network are synchronized by using the network time protocol (NTP) with a GPS time server. We discuss a global clock group (GCG)...
Conference Paper
Full-text available
A transactional agent is a mobile agent to manipulate distributed objects. A transactional agent is composed of routing and manipulation subagents. After visiting computers, a routing agent makes a decision on commitment by using its commitment condition. Objects in each computer are manipulated in a manipulation agent. In addition, objects obtaine...
Article
Full-text available
According to the advance of computer and network technologies, information systems are getting scalable. Especially, peer-to-peer (P2P) overlay networks and Grid computing system are now taking a central position in information systems. In these systems, a large number of peer processes are cooperating. In group communication, each peer process sen...
Conference Paper
Peer-to-peer (P2P) systems are composed of large number and various types of peer processes interconnected in networks. Peers may not only stop by fault but also be arbitrarily faulty by attacks like hacking. We have to discuss how to make a system tolerant of Byzantine faults of processes. Byzantine agreement protocols imply large communication ov...
Conference Paper
Full-text available
In a peer-to-peer (P2P) overlay network, a large number of peer processes are cooperating. Multimedia contents are distributed to peers in various ways like downloading and caching. In multimedia streaming applications, multimedia data is required to be delivered to processes in a real-time manner. In this paper, we newly discuss an asynchronous mu...
Conference Paper
Full-text available
For many years, people have been advocating the development of failure detection as a basic service, but, unfortunately, without meeting much success so far. We believe that this comes from the fact that important system engineering issues have not yet been addressed adequately, thus preventing the definition of a truly generic service. Ultimately,...
Conference Paper
Detecting failures is a fundamental issue for fault-tolerance in distributed systems. Recently, many people have come to realize that failure detection ought to be provided as some form of generic service, similar to IP address lookup or time synchronization. However, this has not been successful so far. One of the reasons is the difficulty to sati...
Article
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze their performance, especially the performance of their fault tolerance mechanisms. In this paper, we compare two wellknown asynchronous consensus algorithms. In both...