Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks
In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minim...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2952 https://ink.library.smu.edu.sg/context/sis_research/article/3952/viewcontent/AnalysisTradeoffsBufferQoSReq_2009_winet.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-3952 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-39522016-01-28T07:15:08Z Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks ROM, Raphael TAN, Hwee-Pink In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as throughput and average delay, our performance analysis of the scheduler permits the evaluation of higher-order metrics, which are needed to evaluate the buffer requirement. We show that variants of the proposed scheduler can achieve high overall throughput or fairness as well as low buffer requirement when compared to other wireless schedulers that either make use only of the instantaneous channel state or are channel-state independent in a heterogenous channel. 2009-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2952 info:doi/10.1007/s11276-007-0095-9 https://ink.library.smu.edu.sg/context/sis_research/article/3952/viewcontent/AnalysisTradeoffsBufferQoSReq_2009_winet.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Adaptive wireless scheduling QoS Heterogenous channel Buffer requirements Fairness Computer and Systems Architecture Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Adaptive wireless scheduling QoS Heterogenous channel Buffer requirements Fairness Computer and Systems Architecture Software Engineering |
spellingShingle |
Adaptive wireless scheduling QoS Heterogenous channel Buffer requirements Fairness Computer and Systems Architecture Software Engineering ROM, Raphael TAN, Hwee-Pink Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
description |
In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as throughput and average delay, our performance analysis of the scheduler permits the evaluation of higher-order metrics, which are needed to evaluate the buffer requirement. We show that variants of the proposed scheduler can achieve high overall throughput or fairness as well as low buffer requirement when compared to other wireless schedulers that either make use only of the instantaneous channel state or are channel-state independent in a heterogenous channel. |
format |
text |
author |
ROM, Raphael TAN, Hwee-Pink |
author_facet |
ROM, Raphael TAN, Hwee-Pink |
author_sort |
ROM, Raphael |
title |
Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
title_short |
Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
title_full |
Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
title_fullStr |
Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
title_full_unstemmed |
Analysis of Tradeoffs between Buffer and QoS Requirements in Wireless Networks |
title_sort |
analysis of tradeoffs between buffer and qos requirements in wireless networks |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2009 |
url |
https://ink.library.smu.edu.sg/sis_research/2952 https://ink.library.smu.edu.sg/context/sis_research/article/3952/viewcontent/AnalysisTradeoffsBufferQoSReq_2009_winet.pdf |
_version_ |
1770572747240374272 |