MEPFQ: Efficient and Fair Scheduling Mechanism for Real-Time Multimedia Applications in Differentiated Services Networks

Tamrat BAYLE; Reiji AIBARA; Kouji NISHIMURA

MEPFQ: Efficient and Fair Scheduling Mechanism for Real-Time Multimedia Applications in Differentiated Services Networks

Tamrat BAYLE, Reiji AIBARA, Kouji NISHIMURA

Full Text Views

0

Cite this

Summary :

One of the key issues in the next generation Internet is end-to-end Quality of Service (QoS) provisioning for real-time applications. The Differentiated Services (DiffServ) architecture offers a scalable alternative to provide QoS in the Internet. However, within this architecture, an efficient scheduling mechanism is still needed to ensure such QoS guarantees. In this paper, scheduling mechanism for supporting QoS differentiation among multiple traffic classes in IP differentiated services networks is studied. A scheduling algorithm called Multiclass Efficient Packet Fair Queueing (MEPFQ) is proposed that enables fair bandwidth sharing while supporting better bounds on end-to-end network delay for QoS-sensitive applications such as voice over IP (VoIP) within the DiffServ framework. The mechanism allows to create service classes and assign proportional weights to such classes efficiently according to their resource requirements. Besides, MEPFQ tries to ensure that packets from low priority class will not be starved even under extreme congestion cases. The results from the simulation studies show that the mechanism is able to ensure both the required end-to-end network delay bounds and bandwidth fairness for QoS-sensitive applications based on the specified service weights under various traffic and network conditions. Another important aspect of the MEPFQ algorithm is that the scheme has lower implementation complexity, along with scalability to accommodate the growing traffic flows at the core routers of high-speed Internet backbone.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.3 pp.615-625

Publication Date: 2004/03/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Internet Technology IV)

Category: Multimedia Communication

Cite this

Copy

Tamrat BAYLE, Reiji AIBARA, Kouji NISHIMURA, "MEPFQ: Efficient and Fair Scheduling Mechanism for Real-Time Multimedia Applications in Differentiated Services Networks" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 3, pp. 615-625, March 2004, doi: .
Abstract: One of the key issues in the next generation Internet is end-to-end Quality of Service (QoS) provisioning for real-time applications. The Differentiated Services (DiffServ) architecture offers a scalable alternative to provide QoS in the Internet. However, within this architecture, an efficient scheduling mechanism is still needed to ensure such QoS guarantees. In this paper, scheduling mechanism for supporting QoS differentiation among multiple traffic classes in IP differentiated services networks is studied. A scheduling algorithm called Multiclass Efficient Packet Fair Queueing (MEPFQ) is proposed that enables fair bandwidth sharing while supporting better bounds on end-to-end network delay for QoS-sensitive applications such as voice over IP (VoIP) within the DiffServ framework. The mechanism allows to create service classes and assign proportional weights to such classes efficiently according to their resource requirements. Besides, MEPFQ tries to ensure that packets from low priority class will not be starved even under extreme congestion cases. The results from the simulation studies show that the mechanism is able to ensure both the required end-to-end network delay bounds and bandwidth fairness for QoS-sensitive applications based on the specified service weights under various traffic and network conditions. Another important aspect of the MEPFQ algorithm is that the scheme has lower implementation complexity, along with scalability to accommodate the growing traffic flows at the core routers of high-speed Internet backbone.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_3_615/_p

Copy

@ARTICLE{e87-b_3_615,
author={Tamrat BAYLE, Reiji AIBARA, Kouji NISHIMURA, },
journal={IEICE TRANSACTIONS on Communications},
title={MEPFQ: Efficient and Fair Scheduling Mechanism for Real-Time Multimedia Applications in Differentiated Services Networks},
year={2004},
volume={E87-B},
number={3},
pages={615-625},
abstract={One of the key issues in the next generation Internet is end-to-end Quality of Service (QoS) provisioning for real-time applications. The Differentiated Services (DiffServ) architecture offers a scalable alternative to provide QoS in the Internet. However, within this architecture, an efficient scheduling mechanism is still needed to ensure such QoS guarantees. In this paper, scheduling mechanism for supporting QoS differentiation among multiple traffic classes in IP differentiated services networks is studied. A scheduling algorithm called Multiclass Efficient Packet Fair Queueing (MEPFQ) is proposed that enables fair bandwidth sharing while supporting better bounds on end-to-end network delay for QoS-sensitive applications such as voice over IP (VoIP) within the DiffServ framework. The mechanism allows to create service classes and assign proportional weights to such classes efficiently according to their resource requirements. Besides, MEPFQ tries to ensure that packets from low priority class will not be starved even under extreme congestion cases. The results from the simulation studies show that the mechanism is able to ensure both the required end-to-end network delay bounds and bandwidth fairness for QoS-sensitive applications based on the specified service weights under various traffic and network conditions. Another important aspect of the MEPFQ algorithm is that the scheme has lower implementation complexity, along with scalability to accommodate the growing traffic flows at the core routers of high-speed Internet backbone.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - MEPFQ: Efficient and Fair Scheduling Mechanism for Real-Time Multimedia Applications in Differentiated Services Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 615
EP - 625
AU - Tamrat BAYLE
AU - Reiji AIBARA
AU - Kouji NISHIMURA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2004
AB - One of the key issues in the next generation Internet is end-to-end Quality of Service (QoS) provisioning for real-time applications. The Differentiated Services (DiffServ) architecture offers a scalable alternative to provide QoS in the Internet. However, within this architecture, an efficient scheduling mechanism is still needed to ensure such QoS guarantees. In this paper, scheduling mechanism for supporting QoS differentiation among multiple traffic classes in IP differentiated services networks is studied. A scheduling algorithm called Multiclass Efficient Packet Fair Queueing (MEPFQ) is proposed that enables fair bandwidth sharing while supporting better bounds on end-to-end network delay for QoS-sensitive applications such as voice over IP (VoIP) within the DiffServ framework. The mechanism allows to create service classes and assign proportional weights to such classes efficiently according to their resource requirements. Besides, MEPFQ tries to ensure that packets from low priority class will not be starved even under extreme congestion cases. The results from the simulation studies show that the mechanism is able to ensure both the required end-to-end network delay bounds and bandwidth fairness for QoS-sensitive applications based on the specified service weights under various traffic and network conditions. Another important aspect of the MEPFQ algorithm is that the scheme has lower implementation complexity, along with scalability to accommodate the growing traffic flows at the core routers of high-speed Internet backbone.
ER -