Node clustering based on link delay in P2P networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Node clustering based on link delay in P2P networks

Full text

Pdf (179 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents

Santa Fe, New Mexico

SESSION: Distributed systems and grid computing (DSGC) table of contents

Pages: 744 - 749

Year of Publication: 2005

ISBN:1-58113-964-0

Authors

Wei Zheng	Dartmouth College, NH
Sheng Zhang	Dartmouth College, NH
Yi Ouyang	Dartmouth College, NH
Fillia Makedon	Dartmouth College, NH
James Ford	Dartmouth College, NH

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 62, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066677.1066845 What is a DOI?

ABSTRACT

Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks is still a challenge needs to be addressed. Node clustering is a mechanism that aims to provide an optimal infrastructure to organize the nodes in a P2P network. This paper describes an approach to implement node clustering based on link delay of node communications in the P2P network. This approach is completely distributed, in which each node only depends on its neighbors to implement node clustering. In this approach, we propose two distributed algorithms: T-closure algorithm and hierarchical node clustering algorithm to find node clusters automatically in a P2P network. We explore the node connectivity together with the connection quality. As a result, the link delay of communication between the super-node and the peer-node in node clustering can be limited, which will improve the overall performance of P2P networks.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. Wu and I. Stojmenovic, "Ad hoc network," Computer:Ad Hoc Network, vol. 37, no. 2, 2004.
	2	M. Singh, V. K. Prasanna, J. Rolim, and C. S. Raghavendra, "Collaborative and distributed computation in mesh-like sensor arrays," in the IFIP-TC6 8th International Conference on Personal Wireless Communications(PWC), 2003.
	3	Neil Daswani , Hector Garcia-Molina , Beverly Yang, Open Problems in Data-Sharing Peer-to-Peer Systems, Proceedings of the 9th International Conference on Database Theory, p.1-15, January 08-10, 2003
	4	J. Li and P. Mohapatra, "A novel mechanism for flooding based route discovery in ad hoc networks," in Wireless Communications Symposium, GLOBECOM, 2003.
	5	P. Mohapatra, C. Gui, and J. Li, "Group communications in mobile ad hoc networks," IEEE Computer, Special Issue on Ad Hoc Networks, 2004.
	6	S.-J. Lee, J. Hsu, R. Hayashida, M. Gerla, and R. Bagrodia, "Selecting a routing strategy for your ad hoc network," Computer Communications, special issue on Advances in Computer Communications and Networks: Algorithms and Applications, vol. 26, no. 7, pp. 723--733, 2003.
	7	B. Yang and H. Garcia-Molina, "Designing a super-peer network," in the 19th International Conference on Data Engineering (ICDE), Bangalore, India, 2003.
	8	A. McDonald and T. Znati, "A mobility based framework for adaptive clustering in wireless ad-hoc networks," IEEE Journal On Selected Area of Communications, vol. 17, no. 8, pp. 1466--1487, 1999.
	9	Bevan Das , Raghupathy Sivakumar , Vaduvur Bharghavan, Routing in Ad Hoc Networks Using a Spine, Proceedings of the 6th International Conference on Computer Communications and Networks, p.34, September 22-25, 1997
	10	Lakshmish Ramaswamy , Bugra Gedik , Ling Liu, Connectivity Based Node Clustering in Decentralized Peer-to-Peer Networks, Proceedings of the 3rd International Conference on Peer-to-Peer Computing, p.66, September 01-03, 2003
	11	Kazaa website. {Online}. Available: http://www.kazaa.com
	12	Stefano Basagni, Distributed Clustering for Ad Hoc Networks, Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), p.310, June 23-25, 1999
	13	A. Amis, R. Prakash, T. Vuong, and D. Huynh, "Max-min d-cluster formation in wireless ad hoc networks," in IEEE INFOCOM '2000, 2000.
	14	D. Kim, S. Ha, and Y. Choi, "K-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks," in IEEE Vehicular Technology Conference, 1998, pp. 224--228.
	15	Stijn Dongen, A cluster algorithm for graphs, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 2000
	16	P. Krishna , N. H. Vaidya , M. Chatterjee , D. K. Pradhan, A cluster-based approach for routing in dynamic networks, ACM SIGCOMM Computer Communication Review, v.27 n.2, p.49-64, Apr. 1997 [doi>10.1145/263876.263885]
	17	Jie Gao , Leonidas Guibas , John Hershberger , Li Zhang , An Zhu, Discrete mobile centers, Proceedings of the seventeenth annual symposium on Computational geometry, p.188-196, June 2001, Medford, Massachusetts, United States [doi>10.1145/378583.378666]