Achieving proportional delay and loss differentiation in a wireless network with a multi-state link

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many algorithms for providing proportional delay differentiation and proportional loss differentiation have been proposed under wired networks. However, these algorithms suffer from low performance at encountering some distinct characteristics, such as location-dependent and time-varying channel capacity, which exist in wireless networks. This paper proposes a novel algorithm, Wireless Proportional Delay and Loss differentiation (WPDL) including a capacity-aware scheduler and a debt-aware dropper, to provide the proportional delay differentiation and proportional loss differentiation in a wireless network with a multi-state link. WPDL considers the channel state and debt information in order to improve the performance of scheduling and dropping. From simulation results, WPDL actually achieves proportional delay differentiation, proportional loss differentiation, lower queueing delay and loss, and higher throughput, compared with other methods in the wireless environment. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lai, Y. C., & Szu, Y. C. (2008). Achieving proportional delay and loss differentiation in a wireless network with a multi-state link. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5200 LNCS, pp. 811–820). Springer Verlag. https://doi.org/10.1007/978-3-540-89524-4_80

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