Research Article
IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks
@INPROCEEDINGS{10.1109/COMSWA.2007.382553, author={Mohammad Hamed Firooz and Keivan Ronasi and Mohammad Reza Pakravan and Alireza Nasiri Avanaki}, title={IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks}, proceedings={2nd International IEEE Conference on Communication System Software and Middleware}, publisher={IEEE}, proceedings_a={COMSWARE}, year={2007}, month={7}, keywords={Multi-Sender Multimedia Streaming Peer-to-Peer Networks}, doi={10.1109/COMSWA.2007.382553} }
- Mohammad Hamed Firooz
Keivan Ronasi
Mohammad Reza Pakravan
Alireza Nasiri Avanaki
Year: 2007
IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2007.382553
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.
Copyright © 2007–2024 IEEE