Loading...

A fast and reliable multi-sender algorithm for peer-to-peer networks

Firooz, M. H ; Sharif University of Technology | 2009

613 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.jnca.2008.06.004
  3. Publisher: 2009
  4. Abstract:
  5. Due to special constraints in peer-to-peer (P2P) networks (such as bandwidth limitation) and because of their highly dynamic characteristics, a single node cannot provide a reliable multimedia stream to the receivers. Several multi-sender algorithms are proposed to reliably deliver a media stream to the receiver through the intrinsically unreliable P2P networks. Based on upload bandwidths and availability of peers as well as the bandwidths of the links connecting the senders and the receiver, PROMISE selects a set of active senders to maximize the expected bit-rate delivered to the receiver. By careful investigation of PROMISE, in this paper, we present why and how it deviates from finding the optimal solution. The proposed algorithm, we call IPROMISE, consistently provides a higher media quality to the receiver, with a computational complexity similar to PROMISE. We also introduce FastIPROMISE which provides the same quality as IPROMISE but requires much less computations. That is achieved by shrinking the search space. © 2008 Elsevier Ltd. All rights reserved
  6. Keywords:
  7. Algorithms ; Computational complexity ; Distributed computer systems ; Internet ; Telecommunication networks ; Telecommunication systems ; Bandwidth limitations ; Bit rates ; Dynamic characteristics ; End-to-end bandwidth estimation ; Media qualities ; Media streams ; Multi-sender algorithms ; Multimedia streaming over Internet ; Multimedia streams ; Optimal solutions ; P2p networks ; Peer to peers ; Peer-to-peer networks ; Search spaces ; Bandwidth
  8. Source: Journal of Network and Computer Applications ; Volume 32, Issue 3 , 2009 , Pages 733-740 ; 10848045 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S1084804508000647