Application layer multicast for efficient peer-to-peer applications

Author

Wierzbicki, Adam ; Szczepaniak, R. ; Buszka, Marcin

Author_Institution

Polish-Japanese Inst. of Inf. Technol., Warsaw, Poland

fYear

2003

Firstpage

126

Lastpage

130

Abstract

Application layer multicast (ALM) can be useful for many types of peer-to-peer (P2P) applications. We compare a group of ALM algorithms, that take into account network topology measurements, using Monte-Carlo simulation. A new algorithm, called Fastcast, is introduced. Fastcast allows to control the tradeoff between used traffic and the worst-case length of the application layer path. ALM algorithms for P2P applications can benefit from the possibility of limiting the number of children in the ALM tree, since many nodes could be connected by slow modem connections. We study the impact of such a limitation on ALM algorithm performance.

Keywords

Internet; Monte Carlo methods; communication complexity; multicast communication; telecommunication channels; telecommunication traffic; tree data structures; Fastcast algorithm; Monte-Carlo simulation; application layer multicast algorithms; communication complexity; modem connections; network topology measurement; network traffic; overlay network; peer-to-peer applications; tree; virtual network; Application software; Communication system traffic control; Computer networks; Electronic mail; Information technology; Internet; Length measurement; Multicast algorithms; Peer to peer computing; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Applications. WIAPP 2003. Proceedings. The Third IEEE Workshop on

Print_ISBN

0-7695-1972-5

Type

conf

DOI

10.1109/WIAPP.2003.1210297

Filename

1210297