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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rejaie, R., Ortega, A.: PALS: Peer-to-Peer Adaptive Layered Streaming. In: Proc. of ACM NOSSDAV (2003)
Cui, Y., Nahrstedt, K.: Layered Peer-to-Peer Streaming. In: Proc. of ACM NOSSDAV (2003)
Malhotra, V.M., Kumar, M.P., Maheshwari, S.N.: An O(|V|3 ) Algorithm For Finding Maximum Flows in Networks. In: Information Processing Letters (1978)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Porc. of MMCN, San Jose (2002)
Calvert, K., Doar, M., Zegura, E.: Modeling Internet Topology. IEEE Communication Magazine 35, 160–163 (1997)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Liu, Y., Dou, W., Liu, Z. (2004). Layer Allocation Algorithms in Layered Peer-to-Peer Streaming. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive