A simple constructing approach to build P2P global computing overlay network

Authors:
Dou Wen;Jia Yan;Liu Zhong;Zou Peng
Affiliations:
Dept. of Computer Science, Changsha Institute of Technology, Hunan, China;Dept. of Computer Science, Changsha Institute of Technology, Hunan, China;Dept. of Computer Science, Changsha Institute of Technology, Hunan, China;Dept. of Computer Science, Changsha Institute of Technology, Hunan, China
Venue:
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Year:
2003

Citing 3
Cited 0

Javelin++: scalability issues in global computing

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Building Low-Diameter P2P Networks

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Volunteer computing

Volunteer computing

Quantified Score

Hi-index	0.00

Visualization

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.