File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Channel capacity fair queueing in wireless networks: Issues and a new algorithm

TitleChannel capacity fair queueing in wireless networks: Issues and a new algorithm
Authors
KeywordsFair queueing
Fairness
Performance guarantees
Quality of service
Wireless networks
Issue Date2002
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2002, v. 5, p. 3116-3120 How to Cite?
AbstractWireless fair queueing algorithms have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified - a two states (good or bad) channel is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors are time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two sessions. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone sessions.
Persistent Identifierhttp://hdl.handle.net/10722/46287
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWang, Len_HK
dc.contributor.authorKwok, YKen_HK
dc.contributor.authorLau, WCen_HK
dc.contributor.authorLau, VKNen_HK
dc.date.accessioned2007-10-30T06:46:32Z-
dc.date.available2007-10-30T06:46:32Z-
dc.date.issued2002en_HK
dc.identifier.citationIeee International Conference On Communications, 2002, v. 5, p. 3116-3120en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46287-
dc.description.abstractWireless fair queueing algorithms have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified - a two states (good or bad) channel is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors are time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two sessions. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone sessions.en_HK
dc.format.extent215369 bytes-
dc.format.extent4989 bytes-
dc.format.extent2590 bytes-
dc.format.extent10776 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2002 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.en_HK
dc.subjectFair queueingen_HK
dc.subjectFairnessen_HK
dc.subjectPerformance guaranteesen_HK
dc.subjectQuality of serviceen_HK
dc.subjectWireless networksen_HK
dc.titleChannel capacity fair queueing in wireless networks: Issues and a new algorithmen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=5&spage=3116&epage=3120&date=2002&atitle=Channel+Capacity+Fair+Queueing+in+Wireless+Networks:+Issues+and+A+New+Algorithmen_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICC.2002.997411en_HK
dc.identifier.scopuseid_2-s2.0-0036279871en_HK
dc.identifier.hkuros67383-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036279871&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume5en_HK
dc.identifier.spage3116en_HK
dc.identifier.epage3120en_HK
dc.identifier.scopusauthoridWang, L=36851821000en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK
dc.identifier.scopusauthoridLau, WC=7402933201en_HK
dc.identifier.scopusauthoridLau, VKN=7005811464en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats