IEICE TRANSACTIONS on Communications
Fair Scheduling for Delay-Sensitive VoIP Traffic
Summary :
With the wide expansion of voice services over the IP networks (VoIP), the volume of this delay sensitive traffic is steadily growing. The current packet schedulers for IP networks meet the delay constraint of VoIP traffic by simply assigning its packets the highest priority. This technique is acceptable as long as the amount of VoIP traffic is relatively very small compared to other non-voice traffic. With the notable expansion of VoIP applications, however, the current packet schedulers will significantly sacrifice the fairness deserved by the non-voice traffic. In this paper, we extend the conventional Deficit Round-Robin (DRR) scheduler by including a packet classifier, a Token Bucket and a resource reservation scheme and propose an integrated packet scheduler architecture for the growing VoIP traffic. We demonstrate through both theoretical analysis and extensive simulation that the new architecture makes it possible for us to significantly improve the fairness to non-voice traffic while still meeting the tight delay requirement of VoIP applications.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.10 pp.3115-3125
- Publication Date
- 2009/10/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.3115
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shawish AHMED, Xiaohong JIANG, Susumu HORIGUCHI, "Fair Scheduling for Delay-Sensitive VoIP Traffic" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 10, pp. 3115-3125, October 2009, doi: 10.1587/transcom.E92.B.3115.
Abstract: With the wide expansion of voice services over the IP networks (VoIP), the volume of this delay sensitive traffic is steadily growing. The current packet schedulers for IP networks meet the delay constraint of VoIP traffic by simply assigning its packets the highest priority. This technique is acceptable as long as the amount of VoIP traffic is relatively very small compared to other non-voice traffic. With the notable expansion of VoIP applications, however, the current packet schedulers will significantly sacrifice the fairness deserved by the non-voice traffic. In this paper, we extend the conventional Deficit Round-Robin (DRR) scheduler by including a packet classifier, a Token Bucket and a resource reservation scheme and propose an integrated packet scheduler architecture for the growing VoIP traffic. We demonstrate through both theoretical analysis and extensive simulation that the new architecture makes it possible for us to significantly improve the fairness to non-voice traffic while still meeting the tight delay requirement of VoIP applications.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3115/_p
Copy
@ARTICLE{e92-b_10_3115,
author={Shawish AHMED, Xiaohong JIANG, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair Scheduling for Delay-Sensitive VoIP Traffic},
year={2009},
volume={E92-B},
number={10},
pages={3115-3125},
abstract={With the wide expansion of voice services over the IP networks (VoIP), the volume of this delay sensitive traffic is steadily growing. The current packet schedulers for IP networks meet the delay constraint of VoIP traffic by simply assigning its packets the highest priority. This technique is acceptable as long as the amount of VoIP traffic is relatively very small compared to other non-voice traffic. With the notable expansion of VoIP applications, however, the current packet schedulers will significantly sacrifice the fairness deserved by the non-voice traffic. In this paper, we extend the conventional Deficit Round-Robin (DRR) scheduler by including a packet classifier, a Token Bucket and a resource reservation scheme and propose an integrated packet scheduler architecture for the growing VoIP traffic. We demonstrate through both theoretical analysis and extensive simulation that the new architecture makes it possible for us to significantly improve the fairness to non-voice traffic while still meeting the tight delay requirement of VoIP applications.},
keywords={},
doi={10.1587/transcom.E92.B.3115},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Fair Scheduling for Delay-Sensitive VoIP Traffic
T2 - IEICE TRANSACTIONS on Communications
SP - 3115
EP - 3125
AU - Shawish AHMED
AU - Xiaohong JIANG
AU - Susumu HORIGUCHI
PY - 2009
DO - 10.1587/transcom.E92.B.3115
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2009
AB - With the wide expansion of voice services over the IP networks (VoIP), the volume of this delay sensitive traffic is steadily growing. The current packet schedulers for IP networks meet the delay constraint of VoIP traffic by simply assigning its packets the highest priority. This technique is acceptable as long as the amount of VoIP traffic is relatively very small compared to other non-voice traffic. With the notable expansion of VoIP applications, however, the current packet schedulers will significantly sacrifice the fairness deserved by the non-voice traffic. In this paper, we extend the conventional Deficit Round-Robin (DRR) scheduler by including a packet classifier, a Token Bucket and a resource reservation scheme and propose an integrated packet scheduler architecture for the growing VoIP traffic. We demonstrate through both theoretical analysis and extensive simulation that the new architecture makes it possible for us to significantly improve the fairness to non-voice traffic while still meeting the tight delay requirement of VoIP applications.
ER -
English
