A Concentric Multi-ring Overlay for Highly Reliable P2P Networks

Wepiwé, Giscard; Simeonov, Plamen L.

doi:10.1109/nca.2005.1

Cited by 12 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first four principles were defined in (Simeonov, 2002a/b), whereas he last one was added later in the HiPeer architecture (Wepiwé, & Simeonov, 2005-2006 which was based on WARAAN algorithm (Simeonov, 2002a/c). The WLI program implementation is based on Lamport's Temporal Logic of Actions, TLA (Lamport, 1994) for generating C/C++ code.…”

Section: The Wli Principlesmentioning

confidence: 99%

“…The Resource Usage and Availability Principle (RUAP) was defined and realized in the HiPeer architecture (Wepiwé, & Simeonov, 2005-2006. It simply states that the more the network resources are used, the more stable and reliable, i.e.…”

Section: The Resource Usage and Availability Principle (Ruap)mentioning

confidence: 99%

“…There might be different implementations of this principle such as differential logical distribution (Wepiwé, & Simeonov, 2005-2006. In P2P networks all the netbots are considered equivalent., unless a mechanism such as the Resource Usage and Availability Principle establishes a priority hierarchy.…”

Section: A Comparison Of Wli and Mesmentioning

confidence: 99%

See 2 more Smart Citations

WLIMES, the Wandering LIMES: Towards a Theoretical Framework for Wandering Logic Intelligence Memory Evolutive Systems

Ehresmann

Simeonov²

2012

Integral Biomathics

View full text Add to dashboard Cite

This paper compares two complementary theories, Simeonov's Wandering Logic Intelligence and Ehresmann's & Vanbremeersch's Memory Evolutive Systems, in view of developing a common framework for the study of multiscale complex systems such as living systems. It begins by a brief summary of WLI and MES, then analyzes their resemblances and differences. Finally, the article provides an outlook for a future research.Keywords: Wandering logic intelligence; Memory evolutive systems; Hierarchy; Emergence; Self-organization; Autopoiesis; Genetic transcoding; Virtualization; Distribution; Non-locality; Category theory. IntroductionThis paper is divided in 3 parts:(i) The first one gives a brief summary on the Wandering Logic Intelligence (WLI); a biology-inspired theoretical and practical framework for designing evolutionary communication architectures and their services and applications in terms of an always growing model of ever changing software and hardware. The WLI approach represents a next step of network virtualization and evolution of application-and user-aware networks as adaptive systems consolidating both network element and infrastructure flexibility. Now this approach is taken back to biology to model the operational semantics of complex emergent formations and processes.(ii) The second part presents the main ideas at the basis of the Memory Evolutive Systems; a dynamic model for self-organized multi-scale complex systems such as living, cognitive or social systems; these systems have a hierarchy of components changing over time, and their dynamic is modulated by the cooperation/competition between a net of agents, the coregulators, each operating locally with its own rhythm, function and logic. The model is based on a dynamic category theory which gives tools for representing the notion of hierarchy. It emphasizes 2 main properties of such systems: the Multiplicity Principle, a kind of 'flexible redundancy' which is shown to be at the root of the emergence of higher complexity, robustness and flexibility; and the synchronicity laws that the co-regulators must respect and which generate cascades of failures/repair at different levels.

show abstract

Section: The Wli Principlesmentioning

confidence: 99%

Section: The Resource Usage and Availability Principle (Ruap)mentioning

confidence: 99%

See 1 more Smart Citation

WLIMES, the Wandering LIMES: Towards a Theoretical Framework for Wandering Logic Intelligence Memory Evolutive Systems

Ehresmann

Simeonov²

2012

Integral Biomathics

View full text Add to dashboard Cite

show abstract

“…10 The P-Grid bisection of the key space; the picture is from [134] (a) (b) (c) Fig. 11 a Node joins/leaves in the HiPeer concentric multi-ring topology; the picture is from [135]. b Complete Kautz graph K(2, 3); the picture is from [136].…”

Section: Topology Evolutionmentioning

confidence: 99%

Survey on hierarchical routing schemes in “flat” distributed hash tables

Korzun

Gurtov

2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The first generation of DHT designs offered a completely flat structure of the key space that is randomly partitioned among participating DHT nodes. That has certain advantages, for example, even distribution of workload among nodes. On the other hand, grouping keys under a single authority or achieving latency guarantees for queries is difficult. To address these shortcomings, various kinds of hierarchy have been proposed over recent years. The last generation is hierarchical DHTs (HDHTs) where nodes are organized onto layers; each next layer consists of supernodes for the previous layer. In this survey paper, we thoroughly go over the evolution of DHTs from pure flat to pre-hierarchical. Our focus is on hierarchical schemes in DHT routing. We argue that their application is not restricted within HDHT designs. We sequentially built a set of design principles; each pro-

show abstract

“…Wepiwé et al [14] propose a concentric multi-ring overlay for high reliability, where the nodes on a given inner ring form a de Bruijn graph. This overlay assumes knowledge about the reliability of the nodes, which normally is not a constant in any system.…”

Section: Fault Tolerance With Other Structuresmentioning

confidence: 99%

Improving the Dependability of Prefix-Based Routing in DHTs

Serbu

Kropf

Felber

On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS

View full text Add to dashboard Cite

Abstract. Under frequent node arrival and departure (churn) in an overlay network structure, the problem of preserving accessibility is addressed by maintaining valid entries in the routing tables towards nodes that are alive. However, if the system fails to replace the entries of dead nodes with entries of live nodes in the routing tables soon enough, requests may fail. In such cases, mechanisms to route around failures are required to increase the tolerance to node failures. Existing Distributed Hash Tables (DHTs) overlays include extensions to provide fault tolerance when looking up keys, however, these are often insufficient. We analyze the case of greedy routing, often preferred for its simplicity, but with limited dependability even when extensions are applied. The main idea is that fault tolerance aspects need to be dealt with already at design time of the overlay. We thus propose a simple overlay that offers support for alternative paths, and we create a routing strategy which takes advantage of all these paths to route the requests, while keeping maintenance cost low. Experimental evaluation demonstrates that our approach provides an excellent resilience to failures.

show abstract

A Concentric Multi-ring Overlay for Highly Reliable P2P Networks

Cited by 12 publications

References 9 publications

WLIMES, the Wandering LIMES: Towards a Theoretical Framework for Wandering Logic Intelligence Memory Evolutive Systems

WLIMES, the Wandering LIMES: Towards a Theoretical Framework for Wandering Logic Intelligence Memory Evolutive Systems

Survey on hierarchical routing schemes in “flat” distributed hash tables

Improving the Dependability of Prefix-Based Routing in DHTs

Contact Info

Product

Resources

About