Broker Placement in Latency-aware Peer-to-Peer Networks

P. Garbacki, D. Epema, M.R. van Steen

Research output: Contribution to JournalArticleAcademicpeer-review


In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of broker in order to act as intermediaries for finding the shared resources. When some notion of distance between nodes such as the internode latency is defined, a brokers may be responsible for maintaining information about resources shared by a group of nodes that are close to each other, with the set of nodes assigned to a broker being determined by the broker's location. In this paper, we present a broker-placement algorithm that finds a suitable location for a new broker when some broker is overloaded in such a way that some of the nodes are reassigned from the overloaded to the new broker. With latency as a metric, an overlay network can be embedded in an Euclidean space R
Original languageEnglish
Pages (from-to)1617-1633
JournalComputer Networks (1999)
Issue number8
Publication statusPublished - 2008

Bibliographical note



Dive into the research topics of 'Broker Placement in Latency-aware Peer-to-Peer Networks'. Together they form a unique fingerprint.

Cite this