Show simple item record

dc.contributor.authorKleis, Michael
dc.contributor.authorKeong Lua, Eng
dc.contributor.authorZhou, Xiaoming
dc.contributor.editorMüller, Paul
dc.contributor.editorGotzhein, Reinhard
dc.contributor.editorSchmitt, Jens B.
dc.date.accessioned2019-10-11T09:44:16Z
dc.date.available2019-10-11T09:44:16Z
dc.date.issued2005
dc.identifier.isbn3-88579-390-3
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28424
dc.description.abstractThe usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware class of Lightweight SuperPeer Topologies (LSTs). The proposed LST is based on the geometric principle of Yao-Graphs, a class of graphs allowing the development of simple and efficient broadcast algorithms. The pre-requisite of the LST approach is a function for mapping nodes in a network into a geometric space. In this paper we use the ”Highways” proximity clustering and geometric placement model, introduced by one of the authors for this purpose. LST is evaluated based on PlanetLab measurements.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofKommunikation in Verteilten Systemen (KiVS)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-61
dc.titleA case for lightweight super peer topologiesen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages185-188
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationKaiserslautern
mci.conference.date28. Februar bis 3. März 2005


Files in this item

Thumbnail

Show simple item record