Abstract
Load-balancing is of major significance for large-scale decentralized networks such as Peer-to-Peer (P2P networks in terms of enhanced scalability and performance. P2P networks are considered to be the most important development for content distribution and sharing infrastructures. Load balancing among peers in P2P networks is critical and a key challenge. This paper addresses the out-of-date problem as a result of node’s state changes during loads movement among nodes. Consequently, this work proposes a load balancing algorithm that is based on extensive stochastic analysis and virtual server concept in P2P System. Finally, this work is complemented with extensive simulations and experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Load thrashing is a condition when the load balancing algorithm is engaged in moving virtual servers back and forth between nodes. .
- 2.
A stationary stochastic process has the property that the joint distribution don not depend on the time origin. The stochastic process {Q(t); t∈ℑ} is called stationary if t i ∈ℑ and t i + s ∈ℑ, i = 1, 2, …, k (k is any positive integer), then {Q(t 1 ), …, Q(t k )} and {Q(t 1 + s), …, Q(t k + s)} have the same joint distribution [22].
References
Shirky C (2000) Modern P2P definition. http://wwwopenp2p.com/pub/a/p2p/2000/11/24/shirky1-whatisp2p.html
Saroiu S et al (2002) A measurement study of peer-to-peer sharing systems. In: Proceedings multimedia computing and networking conf (MMCN)
Sotica I et al (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM’01 pp 149–160
Rowstron A, Druschel P (2001) Pastry: Scalable distributed object location and routing for large-scale peer-to-peer systems. In Proceedings middleware
Ratnasamy S et al (2001) A scalable content- addressable network. In Proceedings ACM SIGCOMM’01, California
Derk I et al (1986) Adaptive load sharing in homogenous distributed systems. IEEE Trans on Soft Eng 12(5)
Bharambe AR et al (2004) Mercury: supporting scalable multi-attribute range queries. In Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication. ACM, New York
Dabek F et al (2001) Wide-area cooperative storage with CFS. In:Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP’01), pp 2020-2215
Godfrey et al (2004) Load balancing in dynamic structured P2P systems. In: Proceedings IEEE INFOCOM
Byers J (2003) Simple load balancing for distributed hash table. In: Proceedings of the second international workshop on peer-to-peer systems (IPTPS’03)
Rao A et al (2003) Load balancing in structured P2P systems. In Proceedings Of the second international . Workshop on peer-to-peer systems (IPTPS’03)
Godfrey PB, Stoica I (2005) Heterogeneity and load balance in distributed hash table. In: Proceedings IEEE INFOCOM
Li J, Kameda H (1994) A decomposition algorithm for optimal static load balancing in Tree hierarchy network configurations. IEEE Trans on parallel and distributed systems, 5(5)
Casavant TL, Kuhl JG ( 1988) A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans Softw Eng 14(2):141–154
Shivaratri NG et al (1992) Load distributing for locally distributed systems. Computer 25(12):33–44
Goscinski A (1991) Distributed operating system: the logical design, Addison-Wesly
Zhou S (1988) A Trace-driven simulation study of dynamic load balancing. IEEE Trans Softw Eng 14(9):1327–1341
Eager DL et al (1985) A comparison of receiver-initiated and sender-initiated adaptive load sharing. SIGMETRICS Perform Eval Rev 13:2
Kruger P, Shivaratri NG (1994) Adaptive location policies for global schedule. IEEE Soft Eng 20:432–443
Zhou S et al (1993) Utopia: a load sharing facility for large, heterogeneous distributed computer systems. Softw Pract Experience 1305–1336
Dandamudi SP, Lo KC (1997) A hierarchical load sharing policy for distributed systems. In: Proceedings of the 5th International. Workshop on modeling, analysis, and simulation of computer and telecommunications systems, MASCOTS. IEEE CS, Washington, DC
Heyman DP (1982) Stochastic models in operation research, vol I. MxGraw-Hill Inc, New York
Kobayshi H (1978) Modeling and analysis: an introduction to system performance evaluation methodology. Addison-Wesley
Hisashi kobayshi et al (2009) System modeling and analysis: foundations of system performance evaluation. Prentice Hall
Zhu Y Hu Y (2005) Efficient proximity-aware load balancing for DHT-based P2P systems. IEEE Trans On Parallel Distributed Syst, 16(4) 349–361
Andrzejak A, Graupner S, Kotov V, Trinks H (2007) Algorithms for self-organization and adaptive service placement in dynamic distributed systems. Internet systems and storage laboratory
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Ragab, K., Yahia, M.E. (2013). Addressing the Out-of-date Problem for Efficient Load Balancing Algorithm in P2P Systems. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_56
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_56
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)