Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/COMSWA.2007.382553 | Bangalore |
Keywords | Field | DocType |
computer network reliability,media streaming,peer-to-peer computing,IPROMISE reliable multisender algorithm,P2P networks,peer-to-peer networks,reliable multimedia streaming,Multi-Sender,Multimedia Streaming,Peer-to-Peer Networks | Bandwidth limitation,Peer-to-peer,Computer science,Upload,Peer to peer computing,Computer network,Dead Peer Detection,Communication source,Algorithm,Bandwidth (signal processing),Distributed computing | Conference |
ISBN | Citations | PageRank |
1-4244-0613-7 | 1 | 0.36 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad H. Firooz | 1 | 141 | 11.12 |
| Keivan Ronasi | 2 | 32 | 3.79 |
| Mohammad Reza Pakravan | 3 | 28 | 6.20 |
| Alireza Nasiri Avanaki | 4 | 48 | 8.82 |