Layer allocation algorithms in layered peer-to-peer streaming

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In layered peer-to-peer streaming, as the bandwidth and data availability (number of layers received) of each peer node are constrained and heterogeneous, the media server can still become overloaded, and the streaming qualities of the receiving nodes may also be constrained for the limited number of supplying peers. This paper identifies these issues and presents two layer allocation algorithms, which aim at the two scenarios of the available bandwidth between the media server and the receiving node, to reach either or two of the goals: 1) minimize the resource consumption of the media server, 2) maximize the streaming qualities of the receiving nodes. Simulation results demonstrate the efficiencies of the proposed algorithms. © IFIP International Federation for Information Processing 2004.

Cite

CITATION STYLE

APA

Liu, Y., Dou, W., & Liu, Z. (2004). Layer allocation algorithms in layered peer-to-peer streaming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 167–174. https://doi.org/10.1007/978-3-540-30141-7_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free