Reference : A Self-Organized clustering scheme for overlay networks
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/3326
A Self-Organized clustering scheme for overlay networks
English
Cantin, François [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Gueye, Cheikh Ahmadou Bamba [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Kaafar, Mohamed Ali [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Leduc, Guy mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Dec-2008
Lecture Notes in Computer Science
Springer
5343
59-70
Yes
No
International
0302-9743
Berlin
Germany
IWSOS 2008
10-12 déc. 2008
Vienna
Austria
[en] Overlay ; Coordinate system ; Clustering
[en] Hierarchical approaches, where nodes are clustered based on their network distances, have been shown to allow for robust and scalable topology-aware overlays. Moreover, recent research works have shown that cluster-based deployments of Internet Coordinates Systems (ICS), where nodes estimate both intra-cluster and inter-cluster distances, do mitigate the impact of Triangle Inequality Violations (TIVs) on the distance predictions, and hence offer more accurate internet latency estimations. To allow the construction of such useful clusters we propose a self-organized distributed clustering scheme. For better scalability and efficiency, our algorithm uses the coordinates of a subset of nodes, known by running an ICS system, as first approximations of node positions. We designed and evaluated two variants of this algorithm. The first one, based on some cooperation among nodes, aims at reducing the expected time to construct clusters. The second variant, where nodes are selfish, aims at reducing the induced communication overhead.
EU FP6 ANA
Researchers
http://hdl.handle.net/2268/3326
10.1007/978-3-540-92157-8_6

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Restricted access
IWSOS2008.pdfPublisher postprint518.66 kBRequest copy
Open access
1569139191.pdfAuthor postprint250.56 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.