Stochastic maintenance of overlays in structured P2P systems

Kersch, Peter; Szabó, Rita; Cheng, L.; Jean, K.; Galis, Alex

doi:10.1016/j.comcom.2007.08.017

Cited by 11 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Simulation results illustrated that the performance of the equation-based adaptive search was significantly better than the non-adaptive random walk and other straightforward adaptive mechanisms. Kersch et al [35] defined a loose and stochastic long-range connection maintenance mechanism, which can significantly reduce maintenance overhead in large networks with high churn rates without affecting routing performance. They used Kleinberg's small worlds model to describe and (re)construct long-range connections.…”

Section: Related Research Workmentioning

confidence: 99%

See 1 more Smart Citation

Multi swarms for neighbor selection in peer-to-peer overlay networks

2010

View full text Add to dashboard Cite

Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of neighbor selection (NS) in P2P networks. Particle swarm share some common characteristics with P2P in the dynamic socially environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The portion of the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm, makes an important influence on the particles' ergodic and synergetic performance. We also attempt to theoretically prove that the multiswarm optimization algorithm converges with a probability of 1 towards the global optima. The performance of our This work is supported partially by NSFC Grant 60873054.A. Abraham ( ) Machine Egypt approach is evaluated and compared with other two different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.

show abstract

Section: Related Research Workmentioning

confidence: 99%

“…We also tested other three representative instances (problem (25,1400,12), problem (30,1400,15), problem (35,1400,17) and problem (100, 1400, 20)) further. In our experiments, the algorithms used for comparison were mainly SPSO (standard PSO) (56) and GA (genetic algorithm) [71].…”

Section: Algorithm Performance Demonstrationmentioning

confidence: 99%

Multi swarms for neighbor selection in peer-to-peer overlay networks

2010

View full text Add to dashboard Cite

show abstract

“…Peers maintain neighbor pointers spaced at logarithmic intervals around the Chord ring. Reference [7] proposed a novel maintenance strategy based on the dual roles of short-range and long-range connections to prevent partitioning of the P2P overlay. Maintenance in both Chord and network model in [7] are from the perspective of logical identifier space .…”

Section: A Overlay Maintenance Algorithmsmentioning

confidence: 99%

Study on trust-based maintenance of overlays in structured P2P systems

Ding

Koyanagi

2011

2011 International Conference on Computational Problem-Solving (ICCP)

View full text Add to dashboard Cite

Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing tables are usually based on logical identifiers or proximity.Non-trust neighborhood selection criterion is used. Over the past decade, a respectable number of e-commerce companies, such as Amazon, eBay, and NetFlix, have deployed trust in ranking their products and suppliers. Such rankings are capitalized as effective incentives and low-cost mechanisms, letting e-commerce companies enhance product marketing and sales management. Since the use of trust has brought many benefits to e-commerce companies, we propose to introduce trust to structured P2P overlay maintenance. In this paper, we propose a trust-based maintenance strategy, using quantified "trust" as the judge criterion for neighbor selection and next-hop selection during routing, considering different aspects of trust in common structured P2P systems. The simulation results show that our maintenance strategy, applying to Chord, leads to lower maintenance overhead, while the mean hops of queries are slightly increased but remain O(logN), where N denotes the network size, compared with original Chord.

show abstract

“…Churn has become critical to DHT networks for their design and application consequently. How to provide good performance in dynamic network environments is till an open question [2].…”

Section: Introductionmentioning

confidence: 99%

A heuristic bootstrapping mechanism for Kademlia

Sun

Shen

2010

2010 5th International Conference on Computer Science &Amp; Education

View full text Add to dashboard Cite

Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent by the joining nodes. Theoretical analysis and simulations show that this algorithm can reduce the cost incurred by node joining and boost the system's capability of recovering from churn.

show abstract

Stochastic maintenance of overlays in structured P2P systems

Cited by 11 publications

References 22 publications

Multi swarms for neighbor selection in peer-to-peer overlay networks

Multi swarms for neighbor selection in peer-to-peer overlay networks

Study on trust-based maintenance of overlays in structured P2P systems

A heuristic bootstrapping mechanism for Kademlia

Contact Info

Product

Resources

About