File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Scheduling delay-sensitive and best-effort traffics in wireless networks

TitleScheduling delay-sensitive and best-effort traffics in wireless networks
Authors
KeywordsCommunications
Issue Date2003
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2003, v. 3, p. 2208-2212 How to Cite?
AbstractIn this paper we propose a novel wireless scheduling algorithm for delay-sensitive (DS) and best-effort (BE) traffics. Unlike the majority of the previous wireless scheduling, where the wireless links are modeled as having only two states, our algorithm is applicable to links with multiple states. For DS flows, the algorithm is capable of providing statistical delay violation bounds. Such bounds are derived, analytically, using the idea of the statistical service envelope. For BE flows, we propose a new notion of fairness, called long-term link-quality-weighted outcome-fair, which we believe is more suited to wireless networks than pure outcome-fair or effortfair. The algorithm achieves a balance between bandwidth efficiency requirement and fairness requirement, and guarantees minimal goodput levels for BE flows.
Persistent Identifierhttp://hdl.handle.net/10722/46370
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorCao, Yen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorCao, Zen_HK
dc.date.accessioned2007-10-30T06:48:23Z-
dc.date.available2007-10-30T06:48:23Z-
dc.date.issued2003en_HK
dc.identifier.citationIeee International Conference On Communications, 2003, v. 3, p. 2208-2212en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46370-
dc.description.abstractIn this paper we propose a novel wireless scheduling algorithm for delay-sensitive (DS) and best-effort (BE) traffics. Unlike the majority of the previous wireless scheduling, where the wireless links are modeled as having only two states, our algorithm is applicable to links with multiple states. For DS flows, the algorithm is capable of providing statistical delay violation bounds. Such bounds are derived, analytically, using the idea of the statistical service envelope. For BE flows, we propose a new notion of fairness, called long-term link-quality-weighted outcome-fair, which we believe is more suited to wireless networks than pure outcome-fair or effortfair. The algorithm achieves a balance between bandwidth efficiency requirement and fairness requirement, and guarantees minimal goodput levels for BE flows.en_HK
dc.format.extent316787 bytes-
dc.format.extent4152649 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
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©2003 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.subjectCommunicationsen_HK
dc.titleScheduling delay-sensitive and best-effort traffics in wireless networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=3&spage=2208&epage=2212&date=2003&atitle=Scheduling+delay-sensitive+and+best-effort+traffics+in+wireless+networksen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICC.2003.1204050en_HK
dc.identifier.scopuseid_2-s2.0-0037970587en_HK
dc.identifier.hkuros81696-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0037970587&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3en_HK
dc.identifier.spage2208en_HK
dc.identifier.epage2212en_HK
dc.identifier.scopusauthoridCao, Y=7404524695en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridCao, Z=7402432380en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats