SemanticCast: Content-Based Data Distribution over Self-Organizing Semantic Overlay Networks

2010 ◽  
Author(s):  
Zhong Zheng ◽  
Yijie Wang
Keyword(s):  
Overlay Networks ◽  
Data Distribution ◽  
Self Organizing

WOW: Self-organizing Wide Area Overlay Networks of Virtual Workstations

2007 ◽  
Vol 5 (2) ◽  
pp. 151-172 ◽  
Author(s):  
A. Ganguly ◽  
A. Agrawal ◽  
P. O. Boykin ◽  
R. J. Figueiredo
Keyword(s):  
Overlay Networks ◽  
Wide Area ◽  
Self Organizing

scholarly journals THE RELAXED-RING: A FAULT-TOLERANT TOPOLOGY FOR STRUCTURED OVERLAY NETWORKS

2008 ◽  
Vol 18 (03) ◽  
pp. 411-432 ◽  
Author(s):  
BORIS MEJÍAS ◽  
PETER VAN ROY
Keyword(s):  
Fault Tolerance ◽  
Overlay Networks ◽  
Fault Tolerant ◽  
Ring Topology ◽  
Failure Handling ◽  
Periodic Maintenance ◽  
Structured Overlay ◽  
Structured Overlay Networks ◽  
Self Organizing

Fault-tolerance and lookup consistency are considered crucial properties for building applications on top of structured overlay networks. Many of these networks use the ring topology for the organization or their peers. The network must handle multiple joins, leaves and failures of peers while keeping the connection between every pair of successor-predecessor correct. This property makes the maintenance of the ring very costly and temporarily impossible to achieve, requiring periodic stabilization for fixing the ring. We introduce the relaxed-ring topology that does not rely on a perfect successor-predecessor relationship and it does not need a any periodic maintenance. Leaves and failures are considered as the same type of event providing a fault-tolerant and self-organizing maintenance of the ring. Relaxed-ring's limitations with respect to failure handling are formally identified, providing strong guarantees to develop applications on top of the architecture. Besides permanent failures, the paper analyses temporary failures and false suspicions caused by broken links, which are often ignored.

scholarly journals Development of algorithms of self-organizing network for reliable data exchange between autonomous robots

Dependability ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 35-42
Author(s):  
A. V. Ermakov ◽  
L. I. Suchkova
Keyword(s):  
Data Exchange ◽  
Overlay Networks ◽  
Data Transfer ◽  
Autonomous Robots ◽  
Global Network ◽  
Message Delivery ◽  
Network Nodes ◽  
Global Status ◽  
Network Status ◽  
Self Organizing

Factors affecting the reliability of data transmission in networks with nodes with periodic availability were considered. The principles of data transfer between robots are described; the need for global connectivity of communications within an autonomous system is shown, since the non-availability of information on the intentions of other robots reduces the effectiveness of the robotics system as a whole and affects the fault tolerance of a team of independent actors performing distributed activities. It is shown that the existing solutions to the problem of data exchange based on general-purpose IP networks have drawbacks; therefore, as the basis for organizing autonomous robot networks, we used developments in the domain of topological models of communication systems allowing us to build self-organizing computer networks. The requirements for the designed network for reliable message transfer between autonomous robots are listed, the option of organizing reliable message delivery using overlay networks, which expand the functionality of underlying networks, is selected. An overview of existing popular controlled and non-controlled overlay networks is given; their applicability for communication within a team of autonomous robots is evaluated. The features and specifics of data transfer in a team of autonomous robots are listed. The algorithms and architecture of the overlay self-organizing network were described by means of generally accepted methods of constructing decentralized networks with zero configurations. As a result of the work, general principles of operation of the designed network were proposed, the message structure for the delivery algorithm was described; two independent data streams were created, i.e. service and payload; an algorithm for sending messages between network nodes and an algorithm for collecting and synchronizing the global network status were developed. In order to increase the dependability and fault tolerance of the network, it is proposed to store the global network status at each node. The principles of operation of a distributed storage are described. For the purpose of notification on changes in the global status of the network, it is proposed to use an additional data stream for intra-network service messages. A flood routing algorithm was developed to reduce delays and speed up the synchronization of the global status of a network and consistency maintenance. It is proposed to provide network connectivity using the HELLO protocol to establish and maintain adjacency relations between network nodes. The paper provides examples of adding and removing network nodes, examines possible scalability problems of the developed overlay network and methods for solving them. It confirms the criteria and indicators for achieving the effect of self-organization of nodes in the network. The designed network is compared with existing alternatives. For the developed algorithms, examples of latency estimates in message delivery are given. The theoretical limitations of the overlay network in the presence of intentional and unintentional defects are indicated; an example of restoring the network after a failure is set forth.

scholarly journals An Efficient Control Mechanism for Self-Organizing Overlay Networks of Large-Scale P2P Systems

2007 ◽  
Vol 13 (2) ◽  
pp. 227-237 ◽  
Author(s):  
Hiroaki KOBAYASHI ◽  
Hiroyuki TAKIZAWA ◽  
Takuro OKAWA ◽  
Tsutomu INABA
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Control Mechanism ◽  
P2p Systems ◽  
Efficient Control ◽  
Self Organizing
Sign in / Sign up

Export Citation Format

Share Document