Paper Info
Title
DDC: A Dynamic and Distributed Clustering Algorithm for Networked Virtual Environments Based on P2P networks
Abstract
We present a distributed algorithm for the clus- tering of peers in a Networked Virtual Environment (NVE) that are organized using a peer-to-peer (P2P) network based on the Delaunay triangulation. The algorithm is dynamic in the sense that whenever a peer joins or leaves the NVE, the clustering will be adapted if necessary by either splitting a cluster or merging clusters. The main idea of the algorithm is to classify links between adjacent peers into short intra-cluster and long inter-cluster links. The advantages of clustering are multiple: clustering allows to limit queries to the peers of a cluster avoiding to flood the entire network. Since clusters can be seen as a level of abstraction that reduces the amount of information/detail exposed about the NVE, clustering allows for faster navigation in the NVE and reduces the number of messages a node receives when he travels through the NVE. Index Terms—clustering, Delaunay triangulation, NVE, P2P, social networks.
Year
DOI
Venue
2006
10.1109/INFOCOM.2006.47
IEEE INFOCOM
Keywords
Field
DocType
main idea,networked virtual environment,short intra-cluster connection,new peer,p2p network,nve,long inter-cluster connection,social networks,clustering algorithm,p2p,clustering,clustering algorithms,distributed algorithms,computer networks,navigation,mesh generation,social network,indexing terms,ddc,scalability,delaunay triangulation,distributed algorithm,virtual environment
Cluster (physics),Joins,Virtual machine,Data stream clustering,Computer science,Computer network,Distributed algorithm,Cluster analysis,Mesh generation,Delaunay triangulation,Distributed computing
Conference
ISSN
ISBN
Citations 
0743-166X
1-59593-197-X
7
PageRank 
References 
Authors
0.73
9
2
Name
Order
Citations
PageRank
Moritz Steiner171544.39
Ernst Biersack22176220.80