File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICNP.2001.992900
- Scopus: eid_2-s2.0-0035699364
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Optimal admission control algorithms for scheduling burst data in CDMA multimedia systems
Title | Optimal admission control algorithms for scheduling burst data in CDMA multimedia systems |
---|---|
Authors | |
Keywords | Computers Computer networks |
Issue Date | 2001 |
Publisher | IEEE. |
Citation | 9th International Conference on Network Protocols (ICNP 2001), Riverside, CA, 11-14 November 2001. In International Conference On Network Protocols, 2001, p. 202-210 How to Cite? |
Abstract | 3rd generation mobile systems are mostly based on the wideband CDMA platform to support high bit rate packet data services. One important component to offer packet data service in CDMA is a burst admission control algorithm. In this paper, we propose and study a novel jointly adaptive burst admission algorithm, namely the jointly adaptive burst admission-spatial dimension algorithm (JABA-SD) to effectively allocate valuable resources in wideband CDMA systems to burst requests. In the physical layer, we have a variable rate channel-adaptive modulation and coding system which offers variable throughput depending on the instantaneous channel condition. In the MAC layer, we have an optimal multiple-burst admission algorithm. We demonstrate that synergy could be attained by interactions between the adaptive physical layer and the burst admission layer. We formulate the problem as an integer programming problem and derive an optimal scheduling policy for the jointly adaptive design. Both the forward link and the reverse link burst requests are considered and the system is evaluated by dynamic simulations which takes into account of the user mobility, power control and soft-handoff. We found that significant performance improvement, in terms of average packet delay, data user capacity and coverage, could be achieved by our scheme compared to the existing burst assignment algorithms. |
Persistent Identifier | http://hdl.handle.net/10722/46285 |
ISSN | 2020 SCImago Journal Rankings: 0.339 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwok, YK | en_HK |
dc.contributor.author | Lau, VKN | en_HK |
dc.date.accessioned | 2007-10-30T06:46:30Z | - |
dc.date.available | 2007-10-30T06:46:30Z | - |
dc.date.issued | 2001 | en_HK |
dc.identifier.citation | 9th International Conference on Network Protocols (ICNP 2001), Riverside, CA, 11-14 November 2001. In International Conference On Network Protocols, 2001, p. 202-210 | en_HK |
dc.identifier.issn | 1092-1648 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46285 | - |
dc.description.abstract | 3rd generation mobile systems are mostly based on the wideband CDMA platform to support high bit rate packet data services. One important component to offer packet data service in CDMA is a burst admission control algorithm. In this paper, we propose and study a novel jointly adaptive burst admission algorithm, namely the jointly adaptive burst admission-spatial dimension algorithm (JABA-SD) to effectively allocate valuable resources in wideband CDMA systems to burst requests. In the physical layer, we have a variable rate channel-adaptive modulation and coding system which offers variable throughput depending on the instantaneous channel condition. In the MAC layer, we have an optimal multiple-burst admission algorithm. We demonstrate that synergy could be attained by interactions between the adaptive physical layer and the burst admission layer. We formulate the problem as an integer programming problem and derive an optimal scheduling policy for the jointly adaptive design. Both the forward link and the reverse link burst requests are considered and the system is evaluated by dynamic simulations which takes into account of the user mobility, power control and soft-handoff. We found that significant performance improvement, in terms of average packet delay, data user capacity and coverage, could be achieved by our scheme compared to the existing burst assignment algorithms. | en_HK |
dc.format.extent | 817773 bytes | - |
dc.format.extent | 4989 bytes | - |
dc.format.extent | 10776 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | International Conference on Network Protocols | en_HK |
dc.rights | ©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Computers | en_HK |
dc.subject | Computer networks | en_HK |
dc.title | Optimal admission control algorithms for scheduling burst data in CDMA multimedia systems | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Kwok, YK:ykwok@eee.hku.hk | en_HK |
dc.identifier.authority | Kwok, YK=rp00128 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICNP.2001.992900 | - |
dc.identifier.scopus | eid_2-s2.0-0035699364 | en_HK |
dc.identifier.hkuros | 67381 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0035699364&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 202 | en_HK |
dc.identifier.epage | 210 | en_HK |
dc.identifier.scopusauthorid | Kwok, YK=7101857718 | en_HK |
dc.identifier.scopusauthorid | Lau, VKN=7005811464 | en_HK |
dc.identifier.issnl | 1092-1648 | - |