Load Sharing in Peer-to-Peer Networks using Dynamic Replication

Rajasekhar, S.; Rong, Bin; Lai, Kuan‐Chou; Khalil, Ibrahim; Tari, Zahir

doi:10.1109/aina.2006.207

Cited by 10 publications

(5 citation statements)

References 10 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic Replication Schemes: Dynamic replication [68], which is used in superpeer P2P architecture, takes the cost of searching a data item and successfully replicates the most frequently accessed data files based on the access probabilities. Two novel techniques to share the load using replication techniques are proposed: periodic push-based replication (PPR) and on-demand replication (ODR).…”

Section: Decentralized Replication Algorithmsmentioning

confidence: 99%

Survey of Search and Replication Schemes in Unstructured P2p Networks

Thampi

2010

NPA

View full text Add to dashboard Cite

P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of research challenges. In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications. The classifications of search and replication techniques and their advantages and disadvantages are briefly explained. Finally, the various issues on searching and replication for unstructured P2P networks are discussed.

show abstract

Section: Decentralized Replication Algorithmsmentioning

confidence: 99%

Survey of Search and Replication Schemes in Unstructured P2p Networks

Thampi

2010

NPA

View full text Add to dashboard Cite

show abstract

“…Rajasekhar et al [64] addresses the problem of load sharing in P2P networks across heterogeneous super-peers, and propose two novel techniques to share the load using replication techniques. In the first technique, called Periodic Push-based Replication (PPR), super-peers periodically send replicas of the most frequently accessed files to remote super-peers.…”

Section: Unstructured P2psmentioning

confidence: 99%

Load Balancing Schemes for a Hierarchical Peer-to-Peer File Search System

Cao

Fujita

2010

2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

View full text Add to dashboard Cite

In a Peer-to-Peer (P2P) system, multiple interconnected peers or nodes contribute a portion of their resources (e.g., files, disk storage, network bandwidth) in order to inexpensively handle tasks that would normally require powerful servers. Since the emergency of P2P file sharing, load balancing has been considered as a primary concern, as well as other issues such as autonomy, fault tolerance and security. In a process of file search, a heavily loaded peer may incur a long latency or failure in query forwarding or responding. If there are many such peers in a system, it may cause link congestion or path congestion, and consequently affect the performance of overall system. To avoid such situation, some of general techniques used in Web systems such as caching and paging are adopted into P2P systems. However, it is highly insufficient for load balancing since peers often exhibit high heterogeneity and dynamicity in P2P systems. To overcome such a difficulty, the use of super-peers is currently being the most promising approach in optimizing allocation of system load to peers, i.e., it allocates more system load to high capacity and stable super-peers by assigning task of index maintenance and retrieval to them.In this thesis, we focused on two kinds of super-peer based hierarchical architectures of P2P systems, which are distinguished by the organization of super-peers. In each of them, we discussed system load allocation, and proposed novel load balancing algorithms for alleviating load imbalance of super-peers, aiming to decrease average and variation of query response time during index retrieval process.iv More concretely, in this thesis, our contribution to load management solutions for hierarchical P2P file search are the following:• In Qin's hierarchical architecture, indices of files held by the user peers in the bottom layer are stored at the super-peers in the middle layer, and the correlation of those two bottom layers is controlled by the central server(s) in the top layer using the notion of tags. In Qin's system, a heavily loaded super-peer can move excessive load to a lightly loaded super-peer by using the notion of task migration. However, such a task migration approach is not sufficient to balance the load of super-peers if the size of tasks is highly imbalanced. To overcome such an issue, in this thesis, we propose two task migration schemes for this architecture, aiming to ensure an even load distribution over the super-peers.The first scheme controls the load of each task in order to decrease the total cost of task migration. The second scheme directly balances the load over tasks by reordering the priority of tags used in the query forwarding step. The effectiveness of the proposed schemes are evaluated by simulation. The result of simulations indicates that all the schemes can work in coordinate, in alleviating the bottleneck situation of super-peers. • In DHT-based super-peer architecture, indices of files held by the user peers in the lower layer are stored at the DHT connected super-peer...

show abstract

“…Some dynamic replication schemes are given in [35,36]. These replication techniques aim at finding a good trade-off between redundancy and cost-efficiency of resources.…”

Section: Related Workmentioning

confidence: 99%

Optimal network locality in distributed virtualized data-centers

Leblet

Simon

et al. 2011

Computer Communications

View full text Add to dashboard Cite

Cost efficiency is a key aspect in deploying distributed service in networks within decentralized service delivery architectures. In this paper, we address this aspect from an optimization and algorithmic standpoint. The research deals with the placement of service components to network sites, where the performance metric is the cost for acquiring components between the sites. The resulting optimization problem, which we refer to as the k-Component Multisite Placement Problem, is applicable to service distribution in a wide range of communication networking scenarios. We provide a theoretical analysis of the problem's computational complexity, and develop an integer programming model for providing reference results for performance benchmarking. On the algorithmic side, we present four approaches: an algorithm with approximation guarantee and three heuristics algorithms. The first heuristic is derived from graph theory on domatic partition. The second heuristic, built on intuition, admits distributed computation. The third heuristic emphasizes on fairness in cost distribution among the sites. We report simulation results for sets of networks where cost is represented by round-trip time (RTT) originating from real measurements. For small networks, the integer model is used to study algorithm performance in terms of optimality. Large networks are used to compare the al- * Corresponding author1 The work of this author is supported by CENIIT, Linköping University, Sweden 2 The work of this author is supported by Vipeer project and Agence Nationale de la Recherche, France February 11, 2011 gorithms relatively to each other. Among the algorithms, the heuristic based on intuition has close-to-optimal performance, and the fairness heuristic achieves a good balance between single-site cost and the overall one. In addition, the experiments demonstrate the significance of optimization for cost reduction in comparison to a the random allocation strategy. Preprint submitted to Elsevier

show abstract

Load Sharing in Peer-to-Peer Networks using Dynamic Replication

Abstract: The peer -to-peer (P2P)

Cited by 10 publications

References 10 publications

Survey of Search and Replication Schemes in Unstructured P2p Networks

Survey of Search and Replication Schemes in Unstructured P2p Networks

Load Balancing Schemes for a Hierarchical Peer-to-Peer File Search System

Optimal network locality in distributed virtualized data-centers

Contact Info

Product

Resources

About