Streaming in a mixed wired / wireless environment is hampered by packet loss, limited bandwidth and temporary link loss. Conventional scheduling algorithms at the transport layer have not been designed for all of these problems, and are only partially able to conceal the effects of these restrictions. This paper presents a novel priority based scheduler where the reliability, i.e. the probability by which a packet can be presented at the client, can be tuned independently for each priority class. Simulation results in a wireless streaming scenario indicate that the new algorithm is superior to conventional earliest deadline first or priority based adaption scheduling without tunability. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Kritzner, J., Horn, U., Kampmann, M., & Sachs, J. (2004). Priority based packet scheduling with tunable reliability for wireless streaming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3079, 707–717. https://doi.org/10.1007/978-3-540-25969-5_64
Mendeley helps you to discover research relevant for your work.