IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks

Author

Firooz, Mohammad Hamed ; Ronasi, Keivan ; Pakravan, Mohammad Reza ; Avanaki, Alireza Nasiri

Author_Institution

Sch. of Electr. & Comput. Eng., Tehran Univ., Tehran, Iran

fYear

2007

fDate

7-12 Jan. 2007

Firstpage

1

Lastpage

5

Abstract

Due to the constraints of P2P networks (such as bandwidth limitation) multiple senders should be employed for reliable multimedia streaming. This paper introduces a mathematic approach to select a set of senders among all available senders to provide the most reliable stream for the receiver. This selection is based on upload bandwidths and availability of peers as well as bandwidth of links connecting the senders and the receiver. Our method is called IPROMISE as it is an improved version of the PROMISE algorithm. Simulation results demonstrate improved media quality delivered to the receiver, while the complexity of sender selection remains the same.

Keywords

computer network reliability; media streaming; peer-to-peer computing; IPROMISE reliable multisender algorithm; P2P networks; peer-to-peer networks; reliable multimedia streaming; Application software; Availability; Bandwidth; Computational complexity; Computer network reliability; Computer networks; Network servers; Network topology; Peer to peer computing; Streaming media; Multi-Sender; Multimedia Streaming; Peer-to-Peer Networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems Software and Middleware, 2007. COMSWARE 2007. 2nd International Conference on

Conference_Location

Bangalore

Print_ISBN

1-4244-0613-7

Type

conf

DOI

10.1109/COMSWA.2007.382553

Filename

4267977