HyPeer: Structured overlay with flexible-choice routing

Serbu, Sabina; Felber, Pascal; Kropf, Peter

doi:10.1016/j.comnet.2010.09.006

Cited by 10 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…By adopting a master-slave model, whereby the master takes care of the common functionality thus alleviating the burden from its associated slaves, the overall maintenance costs across all overlays are minimized with reductions up to 60% as reported in Hsu et al (2010). Furthermore, Serbu et al (2011) propose a novel P2P DHTbased overlay that allows for flexible routing choices by supporting multiple, redundant paths in the overlay, which are constructed and maintained based on different objectives, such as fault tolerance, low latency and load balancing. The authors propose a hybercube approximation DHT overlay structure to support the diverse paths.…”

Section: Representative Cases Of Multi-layer Overlaysmentioning

confidence: 97%

See 1 more Smart Citation

State-of-the-art survey on P2P overlay networks in pervasive computing environments

Malatras

2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

a b s t r a c t P2P overlay networks have attracted significant research interest due to their utility as virtualized abstractions of complex network infrastructures, optimized to satisfy specific criteria, e.g. minimum delay or shortest diameter. In the context of modern pervasive environments, which are characterized by complexity, heterogeneity, dynamicity, and mobility in terms of the underlying networks, the utilization of P2P overlays accordingly offers a series of advantages by countering the aforementioned adverse characteristics. The widespread deployment of pervasive environments and the plethora of proposed P2P systems, both call for a systematic way to study related research works. In this paper we review related research on P2P (peer-to-peer) overlay networks in pervasive environments. In this respect, we therefore analyze relevant requirements and discuss the application and deployment of P2P overlays and systems on top of the networking infrastructures that are supported by pervasive environments. Aspects such as scalability, resource discovery, algorithmic complexity, security, and support for dynamicity are examined for existing research works, in an effort to identify the most suitable P2P overlay for the requirements set by the nature of pervasive environments. We also taxonomize P2P overlays using the well-established classification scheme in regard to their structure or lack of it. Furthermore, we study the notions of multi-layer and bio-inspired P2P overlays that have great synergies with pervasive environments due to their inherent characteristics, especially in terms of flexibility and robustness. By describing and critically analyzing existing systems and discussing current research and open issues, we aim to instigate further research in this domain, while at the same time this work should serve as a point of reference for state-of-the-art P2P overlays in pervasive environments.

show abstract

Section: Representative Cases Of Multi-layer Overlaysmentioning

confidence: 97%

“…HyPeer (Serbu et al, 2011): Structured P2P overlay that extends the traditional ring structure of Chord-like overlays to that of a hybercube in order to provide redundant paths for lookup and routing and eventually to support flexible routing strategies.…”

Section: Z-ringmentioning

confidence: 99%

State-of-the-art survey on P2P overlay networks in pervasive computing environments

Malatras

2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…It is the lightest approach, since it does not require any routing table modification. This approach has been adopted by Hypeer [23], which aims at introducing latency-awareness in Chord by changing the order of its hops. Its authors show that by making Chord choose the next hop based also on latency improves its overall performance.…”

Section: Locality-awarenessmentioning

confidence: 99%

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Tato

Bertier

Tedeschi

2018

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)

View full text Add to dashboard Cite

Current cloud computing infrastructures and their management are highly centralized, and therefore they suffer from limitations in terms of network latency, energy consumption, and possible legal restrictions. Decentralizing the Cloud has been recently proposed as an alternative. However, the efficient management of a geographically dispersed platform brings new challenges related to service localization, network utilization and locality-awareness. We here consider a cloud topology composed of many small datacenters geographically dispersed within the backbone network. In this paper, we present the design, development and experimental validation of Koala, a novel overlay network that specifically targets such a geographically distributed cloud platform. The three key characteristics of Koala are laziness, latencyawareness and topology-awareness. By using application traffic, Koala maintains the overlay lazily while it takes locality into account in each routing decision. Although Koala's performance depends on application traffic, through simulation experiments we show that for a uniformly distributed traffic, Koala delivers similar routing complexity and reduced latency compared to a traditional proactive protocol, such as Chord. Additionally, we show that despite its passive maintenance, Koala can appropriately deal with churn by keeping the number of routing failures low, without significantly degrading the routing performance. Finally, we show how such an overlay adapts to a decentralized cloud composed of multiple small datacenters.

show abstract

“…It is the lightest approach, since it does not require any routing table modification. This approach has been adopted by Hypeer [21], which aims at introducing latency-awareness in Chord by changing the order of its hops. Its authors show that by making Chord choose the next hop based also on latency improves its overall performance.…”

Section: Latency-awarenessmentioning

confidence: 99%

Designing Overlay Networks for Decentralized Clouds

Tato

Bertier²,

Tedeschi³

2017

2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

View full text Add to dashboard Cite

Recent increase in demand for next-to-source data processing and low-latency applications has shifted attention from the traditional centralized cloud to more distributed models such as edge computing. In order to fully leverage these models it is necessary to decentralize not only the computing resources but also their management. While a decentralized cloud has various inherent advantages, it also introduces different challenges with respect to coordination and collaboration between resources. A large-scale system with multiple administrative entities requires an overlay network which enables data and service localization based only on a partial view of the network. Numerous existing overlay networks target different properties but they are built in a generic context, without taking into account the specific requirements of a decentralized cloud. In this paper we identify some of these requirements and introduce Koala, a novel overlay network designed specifically to meet them.

show abstract

HyPeer: Structured overlay with flexible-choice routing

Cited by 10 publications

References 14 publications

State-of-the-art survey on P2P overlay networks in pervasive computing environments

State-of-the-art survey on P2P overlay networks in pervasive computing environments

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Designing Overlay Networks for Decentralized Clouds

Contact Info

Product

Resources

About