Article

Node clustering based on link delay in P2P networks

Authors:

Fillia Makedon,

James FordAuthors Info & Claims

SAC '05: Proceedings of the 2005 ACM symposium on Applied computing

Pages 744 - 749

https://doi.org/10.1145/1066677.1066845

Published: 13 March 2005 Publication History

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

[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]

N. Daswani, H. Garcia-Molina, and B. Yang, "Open problems in data-sharing peer-to-peer systems," in 9th International Conference on Database Theory(ICDT), 2003.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[9]

B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," in IEEE International Conference on Communication, 1997, pp. 376--380.

Digital Library

[10]

L. Ramaswamy, A. Iyengar, L. Liu, and F. Douglis, "Connectivity based node clustering in decentralized peer-to-peer networks," in the 3rd International Conference on Peer-to-Peer Computing, 2003.

Digital Library

[11]

Kazaa website. {Online}. Available: http://www.kazaa.com

[12]

S.Basagni, "Distributed clustering for ad hoc networks," in 99' International Symp. On Parallel architecture, algorithms, and Networks (I-SPAN'99), 1999, pp. 310--315.

Digital Library

[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]

S. van Dongen, "A cluster algorithm for graphs," in Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, May 2000.

Digital Library

[16]

P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan, "A cluster-based approach for routing in dynamic networks," ACM Computer Communications Review, vol. 27, no. 2, pp. 49--64, 1997.

Digital Library

[17]

J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Discrete mobile centers," in the 17th ACM Symposium on Computational Geometry (SoCG'01), 2001, pp. 188--196.

Digital Library

Cited By

Hai MGuo S(2010)A distributed node clustering mechanism in P2P networksProceedings of the 6th international conference on Advanced data mining and applications - Volume Part II10.5555/1948448.1948507(553-560)Online publication date: 19-Nov-2010
https://dl.acm.org/doi/10.5555/1948448.1948507
Abi-Lahoud ESavonnet MTerrasse MViviani MYétongnon KGabillon ASheng QMansoor W(2010)A Community-based Approach for Service-based Application Composition in an EcosystemWeb-Based Information Technologies and Distributed Systems10.2991/978-94-91216-32-9_1(1-24)Online publication date: 2010
https://doi.org/10.2991/978-94-91216-32-9_1
Singh AHaahr M(2007)Decentralized Clustering In Pure P2P Overlay Networks Using Schelling's Model2007 IEEE International Conference on Communications10.1109/ICC.2007.310(1860-1866)Online publication date: Jun-2007
https://doi.org/10.1109/ICC.2007.310
Show More Cited By

Index Terms

Node clustering based on link delay in P2P networks
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

A distributed node clustering mechanism in P2P networks
ADMA'10: Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II

A P2P network is an important computing model because of its scalability, adaptability, self-organization, etc. How to organize the nodes in P2P networks effectively is an important research issue. The node clustering aims to provide an effective method ...
A Selfish-SCM Based Scheme for Node Clustering in Decentralized Peer-to-Peer Networks
ICICSE '08: Proceedings of the 2008 International Conference on Internet Computing in Science and Engineering

Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. We are interested in the dynamic cluster formation process and ...
Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks
SITIS '07: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System

Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '05: Proceedings of the 2005 ACM symposium on Applied computing

March 2005

1814 pages

ISBN:1581139640

DOI:10.1145/1066677

Conference Chair:
Hisham M. Haddad
Kennesaw State University
,
Editor:
Lorie M. Liebrock
New Mexico Institute of Mining and Technology, Socorro, NM
,
Program Chairs:
Andrea Omicini
Alma Mater Studiorum, Universita di Bologna, Italy
,
Roger L. Wainwright
Univerity of Tulsa, OK

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 March 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC05

Sponsor:

SIGAPP

SAC05: The 2005 ACM Symposium on Applied Computing

March 13 - 17, 2005

New Mexico, Santa Fe

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
608
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hai MGuo S(2010)A distributed node clustering mechanism in P2P networksProceedings of the 6th international conference on Advanced data mining and applications - Volume Part II10.5555/1948448.1948507(553-560)Online publication date: 19-Nov-2010
https://dl.acm.org/doi/10.5555/1948448.1948507
Abi-Lahoud ESavonnet MTerrasse MViviani MYétongnon KGabillon ASheng QMansoor W(2010)A Community-based Approach for Service-based Application Composition in an EcosystemWeb-Based Information Technologies and Distributed Systems10.2991/978-94-91216-32-9_1(1-24)Online publication date: 2010
https://doi.org/10.2991/978-94-91216-32-9_1
Singh AHaahr M(2007)Decentralized Clustering In Pure P2P Overlay Networks Using Schelling's Model2007 IEEE International Conference on Communications10.1109/ICC.2007.310(1860-1866)Online publication date: Jun-2007
https://doi.org/10.1109/ICC.2007.310
Abu-Ghazaleh NLewis M(2006)Short Paper: Toward Self Organizing Grids2006 15th IEEE International Conference on High Performance Distributed Computing10.1109/HPDC.2006.1652167(324-328)Online publication date: 2006
https://doi.org/10.1109/HPDC.2006.1652167
Yang WAbu-Ghazaleh NLewis M(2006)Automatic Clustering for Self-Organizing Grids2006 IEEE International Conference on Cluster Computing10.1109/CLUSTR.2006.311891(1-9)Online publication date: Sep-2006
https://doi.org/10.1109/CLUSTR.2006.311891

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten