File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systems

TitleEfficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systems
Authors
KeywordsDistributed mobile computing
Fair queueing
Fairness
Performance guarantees
Quality of service
Scheduling
Wireless networks
Issue Date2004
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1383-469X
Citation
Mobile Networks And Applications, 2004, v. 9 n. 4, p. 297-309 How to Cite?
AbstractIn a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high utilization of the precious bandwidth resources while satisfying users' QoS (quality of service) demands. An important class of scheduling techniques, namely, the wireless 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-state channel (good or bad) 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 is 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 data connections. 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 connections.
Persistent Identifierhttp://hdl.handle.net/10722/74070
ISSN
2015 Impact Factor: 1.538
2015 SCImago Journal Rankings: 0.718
ISI Accession Number ID
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.accessioned2010-09-06T06:57:30Z-
dc.date.available2010-09-06T06:57:30Z-
dc.date.issued2004en_HK
dc.identifier.citationMobile Networks And Applications, 2004, v. 9 n. 4, p. 297-309en_HK
dc.identifier.issn1383-469Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/74070-
dc.description.abstractIn a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high utilization of the precious bandwidth resources while satisfying users' QoS (quality of service) demands. An important class of scheduling techniques, namely, the wireless 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-state channel (good or bad) 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 is 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 data connections. 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 connections.en_HK
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1383-469Xen_HK
dc.relation.ispartofMobile Networks and Applicationsen_HK
dc.subjectDistributed mobile computingen_HK
dc.subjectFair queueingen_HK
dc.subjectFairnessen_HK
dc.subjectPerformance guaranteesen_HK
dc.subjectQuality of serviceen_HK
dc.subjectSchedulingen_HK
dc.subjectWireless networksen_HK
dc.titleEfficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1383-469X&volume=9&issue=4&spage=297&epage=309&date=2004&atitle=Efficient+Packet+Scheduling+Using+Channel+Adaptive+Fair+Queueing+in+Distributed+Mobile+Computing+Systemsen_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1023/B:MONE.0000031589.32967.0fen_HK
dc.identifier.scopuseid_2-s2.0-3042834420en_HK
dc.identifier.hkuros105741en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-3042834420&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume9en_HK
dc.identifier.issue4en_HK
dc.identifier.spage297en_HK
dc.identifier.epage309en_HK
dc.identifier.isiWOS:000221961000006-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridWang, L=36851817400en_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