An Efficient Superpeer Overlay Construction and Broadcasting Scheme Based on Perfect Difference Graph

Li, Jung-Shian; Chao, Chih-Hung

doi:10.1109/tpds.2009.94

Cited by 14 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…UDHT supports both complex, multirange queries as well as ones for rare objects, thus leveraging the benefits of both main categories of P2P overlays. (Li and Chao, 2010): The two-tier hierarchical topology of superpeers and ordinary nodes found in this overlay is very similar to that of FastTrack and other hierarchical unstructured overlay. In this work however, the connections between superpeers are not random, but they rather form a perfect difference graph that has desired properties such as graph diameter of just 2 (see Parhami and Rakov, 2005 for further information).…”

Section: Other Approachessupporting

confidence: 58%

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: Other Approachessupporting

confidence: 58%

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

“…As the value of θ increases, the Zipf distribution produces increasingly skewed demand patterns. Thus, as also identified in the literature (), the Zipf distribution can efficiently model the client demand patterns for data in wireless data‐broadcasting environments, which are typically characterized by a certain amount of commonality in client demand patterns.…”

Section: Performance Evaluationmentioning

confidence: 92%

“…This is the Zipf distribution, used in other relevant papers as well . θ is a parameter named access skew coefficient.…”

Section: Performance Evaluationmentioning

confidence: 99%

On low‐complexity adaptive wireless push‐based data broadcasting

Polatoglou

Nicopolitidis

Papadimitriou

2012

Int J Communication

View full text Add to dashboard Cite

This letter addresses a low-complexity adaptive wireless data broadcasting system. Specifically, it proposes a way for reducing the computational complexity of the estimation process for the item demands, which in turn leads to a lower computational complexity to the broadcast server for selecting a data item to broadcast. We assume no a priori knowledge of the client demands for information items as happens in real environments. Simulation results reveal that the lowering of the computational complexity of the proposed system does not affect the performance offered to the system clients.

show abstract

“…Some of the research works used super peers [18], [19] to control the broadcasted queries over the network. But this approach might suffer from single-pointof-failure issues and the scalability of the network is limited with the departure of these super peers [20].…”

Section: Related Workmentioning

confidence: 99%

CCLBR: Congestion Control-Based Load Balanced Routing in Unstructured P2P Systems

Shen

Chang

Liu

et al. 2018

IEEE Systems Journal

View full text Add to dashboard Cite

Given the growing popularity of the peer-to-peer (P2P) network systems in the recent years, efficient query routing under highly dynamic environments is still lacking in several P2P network systems. In response to this challenge, this paper proposes a new churn-resilient system to find alternative routing paths for the purpose of balancing the query loads under higher network churns and heavy workloads, ultimately to improve the search efficiency. Two novel methods are devised to balance the network query loads among both inter-and intragroup level peers. First, a resource grouping and a rewiring method is proposed to spontaneously organize and cluster the peers having same resources together. This strategy facilitates the peers to evolve the network into a cluster-like topology and balances the query loads among the intergroup peers. Second, a collaborative Q-learning method is proposed to balance the query loads among the intragroup peers in order to intelligently avoid queries being forwarded to the congested peers in the network. Experiments conducted under dynamic network scenarios demonstrate that our proposed method achieves better search performances with a more balanced network load than the existing methods, and further exhibits higher robustness and adaptability under higher network churns and heavy network loads.Index Terms-Collaborative Q-learning, congestion control, load balancing, query routing, unstructured peer-to-peer (P2P) systems.

show abstract

An Efficient Superpeer Overlay Construction and Broadcasting Scheme Based on Perfect Difference Graph

Cited by 14 publications

References 30 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

On low‐complexity adaptive wireless push‐based data broadcasting

CCLBR: Congestion Control-Based Load Balanced Routing in Unstructured P2P Systems

Contact Info

Product

Resources

About