Please use this identifier to cite or link to this item:
|Title:||Multicode-DRR: A packet-scheduling algorithm for delay guarantee in a multicode-CDMA network||Authors:||Kong, P.-Y.
|Keywords:||Deficit round robin (DRR)
Multicode code division multiple access (multicode-CDMA)
|Issue Date:||Nov-2005||Citation:||Kong, P.-Y., Chua, K.-C., Bensaou, B. (2005-11). Multicode-DRR: A packet-scheduling algorithm for delay guarantee in a multicode-CDMA network. IEEE Transactions on Wireless Communications 4 (6) : 2694-2703. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2005.858027||Abstract:||Multicode-code division multiple access (CDMA) supports a variety of transmission rates within a wireless network. However, providing packet-delay guarantees in a multicode-CDMA network is difficult because its transmission capacity is time varying even in an error-free wireless channel. In this paper, we develop a packet-scheduling algorithm called multicode-deficit round robin (DRR) as a solution to the problem. The basic idea of multicode-DRR is to separate the time-varying capacity into a deterministic component and a variable component, and to use these components to serve time-sensitive and non-time-sensitive traffic, respectively. With the proposed scheduling algorithm, simulation results have confirmed that the maximum packet delays for time-sensitive traffic never exceed their target upper bounds. © 2005 IEEE.||Source Title:||IEEE Transactions on Wireless Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/56709||ISSN:||15361276||DOI:||10.1109/TWC.2005.858027|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 9, 2019
WEB OF SCIENCETM
checked on Oct 2, 2019
checked on Oct 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.