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

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.

Download Full-text

SONNET: subscription using path queries over structured overlay networks

Frontiers of Computer Science in China ◽

10.1007/s11704-007-0022-3 ◽

2007 ◽

Vol 1 (2) ◽

pp. 213-225

Author(s):

Weining Qian ◽

Linhao Xu ◽

Aoying Zhou ◽

Minqi Zhou

Keyword(s):

Overlay Networks ◽

Structured Overlay ◽

Path Queries ◽

Structured Overlay Networks

Download Full-text

Structured Overlay Networks as an Enabler for Future Internet ServicesStrukturierte Overlay Netze als Wegbereiter für NGI Dienste

it - Information Technology ◽

10.1524/itit.2008.0509 ◽

2009 ◽

Vol 50 (6) ◽

Cited By ~ 1

Author(s):

Gerald Kunzmann ◽

Andreas Binzenhöfer ◽

Fabian Stäber

Keyword(s):

User Experience ◽

Technological Progress ◽

Overlay Networks ◽

Future Internet ◽

Basic Principles ◽

Internet Applications ◽

Next Generation Internet ◽

Powerful Means ◽

Structured Overlay ◽

Structured Overlay Networks

AbstractThe next generation Internet will not only be defined by its technological progress but also by innovative Internet applications which offer new features, more interactivity, and a better user experience. Structured overlay networks, which create a well-defined virtual topology above the basic transport network, are a powerful means to easily create such Internet applications. There are many different approaches to realize structured overlay networks which in their core functions share the same basic principles. In this work we summarize the fundamentals of structured overlay networks, describe their inherent problems, and present an overview of our solutions. We then show how all these ideas have been put into practice in terms of a distributed carrier grade communication platform.

Download Full-text

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

Applied Sciences ◽

10.3390/app10238596 ◽

2020 ◽

Vol 10 (23) ◽

pp. 8596

Author(s):

Tomoya Kawakami

Keyword(s):

Overlay Networks ◽

Previous Method ◽

Sensor Data ◽

Specific Time ◽

Time Intervals ◽

Structured Overlay ◽

Physical Node ◽

Simulation Results ◽

Structured Overlay Networks ◽

Computer Node

Sensor data which relate to the specific geographical positions, areas, and time are strongly expected in IoT. The author has studied overlay networks to efficiently process interval queries which have specific time intervals and the actual users tend to request. However, unfairness and a concentration of the loads occur for the specific processing computer (node) in the previous method because the density of data or those generators/providers is different from those related values. In this paper, the author proposes the enhanced scheme for structured overlay networks based on multiple different time intervals. The proposed method uses node virtualization to equalize the loads of each real (physical) node. The simulation results showed that the proposed method can increase the fairness of the number of the assigned data among physical nodes.

Download Full-text

Fault-Tolerant Protocols Using Fault-Tolerance Programming Languages

Application-Layer Fault-Tolerance Protocols ◽

10.4018/978-1-60566-182-7.ch005 ◽

2009 ◽

pp. 161-174

Author(s):

Vincenzo De Florio

Keyword(s):

Fault Tolerance ◽

Programming Languages ◽

Programming Language ◽

Fault Tolerant ◽

Object Oriented ◽

Significant Part ◽

Functional Languages ◽

Failure Handling ◽

Run Time ◽

Object Oriented Languages

The programming language itself is the focus of this chapter: Fault-tolerance is not embedded in the program (as it is the case e.g. for single-version fault-tolerance), nor around the language (through compilers or translators); on the contrary, faulttolerance is provided through the syntactical structures and the run-time executives of fault-tolerance programming languages. Also in this case a significant part of the complexity of dependability enforcement is moved from each single code to the architecture, in this case the programming language. Many cases exist of fault-tolerance programming languages; this chapter proposes a few of them, considering three cases: Object-oriented languages, functional languages, and hybrid languages. In particular it is discussed the case of Oz, a multi-paradigm programming language that achieves both transparent distribution and translucent failure handling.

Download Full-text

Skip Suffix Array: A Partial Match Retrieval Method on Structured Overlay Networks

2020 International Conference on Information Networking (ICOIN) ◽

10.1109/icoin48656.2020.9016436 ◽

2020 ◽

Author(s):

Ryohei Banno ◽

Kazuyuki Shudo

Keyword(s):

Overlay Networks ◽

Suffix Array ◽

Partial Match ◽

Retrieval Method ◽

Structured Overlay ◽

Structured Overlay Networks ◽

Partial Match Retrieval

Download Full-text

Continuous Join Query Processing over Structured Overlay Networks

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.467-469.859 ◽

2011 ◽

Vol 467-469 ◽

pp. 859-861

Author(s):

Yang Liu ◽

Ke Jun Zhao ◽

Yi Hong Qiu ◽

Qi Liu

Keyword(s):

Query Processing ◽

Network Traffic ◽

Overlay Networks ◽

Data Flow ◽

P2p Network ◽

Distributed Data ◽

Structured Overlay ◽

Structured Overlay Networks ◽

Global Query ◽

P2p Overlay

P2P network is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous join query in structured p2p overlay networks. In the algorithm proposed, the data that cannot contribute the queries’ results will not be distributed in the network based on global query indices. Experiment shows that the algorithm ensures the availability of join query and network traffic is reduced.

Download Full-text