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

Authors:
Mohammad Hamed Firooz;Alireza Nasiri Avanaki;Mohammad Reza Pakravan;Keivan Ronasi
Affiliations:
Department of Electrical Engineering, University of Washington, Box 352500, Seattle, WA 98195, USA;Control and Intelligent Processing Center of Excellence, School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;The Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Electrical and Computer Engineering Department at the University of British Columbia, Vancouver, Canada
Venue:
Journal of Network and Computer Applications
Year:
2009

Citing 14
Cited 2

Distributing streaming media content using cooperative networking

NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Dynamic parallel access to replicated content in the internet

IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput

IEEE/ACM Transactions on Networking (TON)
Scalable and Continuous Media Streaming on Peer-to-Peer Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
PROMISE: peer-to-peer media streaming using CollectCast

MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
A High-Performance Multimedia Streaming Model on Multi-Source Streaming Approach in Peer-to-Peer Networks

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
A Scalable Multimedia Streaming Model Based-on Multi-source Streaming Concept

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
GnuStream: a P2P media streaming system prototype

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials
Peer-to-peer based multimedia distribution service

IEEE Transactions on Multimedia
Multiple description video coding for scalable and robust transmission over IP

IEEE Transactions on Circuits and Systems for Video Technology
Bandwidth estimation: metrics, measurement techniques, and tools

IEEE Network: The Magazine of Global Internetworking

An ant-based rate allocation algorithm for media streaming in peer to peer networks: Extension to multiple sessions and dynamic networks

Journal of Network and Computer Applications
An ID-based approach to the caching and distribution of peer-to-peer, proxy-based video content

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.