Abstract
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some small-world characteristics such as higher clustering coefficient and short path length, which leads to an efficient heuristic task scheduling algorithm on which any volunteer peer with limited knowledge about the global network can dispatch its excrescent computation tasks to powerful nodes globally, in a way contrary to the current global computing system in which a global broker is responsible for the task scheduling. We argue that our approach is a starting point to eliminate the broker component which makes current global systems unscalable.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. O. Neary, S. P. Brydon, P. Kmiec, S. Rollins, P. Capello, “Javelin++: Scalability Issues in Global Computing,” Proceedings of the ACM Java Grande 1999 Conference, June 12–14, 1999, San Francisco, California.
Luis F. G. Sarmenta, “Volunteer Computing”, Ph.D. Thesis, MIT Department of Electrical Engineering and Computer Science, March 2001.
H. Zhang, A. Goel, R. Govindan. “Using the Small World Model to Improve Freenet Performance. Proceedings, IEEE Infocom., 2002
A. Montresor, “Anthill: a Framework for the Design and Analysis of Peer-to-Peer Systems”, 4th European Research Seminar on Advances in Distributed Systems (ERSADS’ 01), Bertinoro, Italy (May 2001).
A. Montresor, Hein Meling, Ozalp Babaoglu, “Towards Self-Organizing, Self-Repairing and Resilient Peer-to-Peer Systems”, Proceedings of the 1st International Workshop on Future Directions in Distributed Computing, Bertinoro, Forlí, Italy, June 2002.
S. Milgram: The Small World Problem, Psychology Today 1(1), 60–67 (1967)
D. J. Watts and S. H. Strogatz. Collective dynamics of’ small-world’ networks, Nature 393, 440–442 (1998). Networks, Nature 393, 440–442, 1998.
G. Pandurangan, P. Raghavan, E. Upfal, Building Low-Diameter P2P Networks, Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001
http://paradropper.nudt.edu.cn
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wen, D., Yan, J., Zhong, L., Peng, Z. (2003). A Simple Constructing Approach to Build P2P Global Computing Overlay Network. In: Kaynak, O., Alpaydin, E., Oja, E., Xu, L. (eds) Artificial Neural Networks and Neural Information Processing — ICANN/ICONIP 2003. ICANN ICONIP 2003 2003. Lecture Notes in Computer Science, vol 2714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44989-2_72
Download citation
DOI: https://doi.org/10.1007/3-540-44989-2_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40408-8
Online ISBN: 978-3-540-44989-8
eBook Packages: Springer Book Archive