Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network

Geunhyung KIM; Cheeha KIM

doi:10.1093/ietcom/e88-b.7.2887

Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network

Geunhyung KIM, Cheeha KIM

Full Text Views

0

Share
Cite this

Summary :

With the occurrence of new applications such as Voice over IP (VoIP) and multimedia conference, there is an ongoing discussion about realizing QoS in the Internet today. Because of its potential scalability in support of QoS guarantees, the Differentiated Service (DiffServ) architecture with aggregate packet scheduling has recently attracted much attention in the networking community as a feasible solution for providing Internet QoS. Thus, it is important to understand delay bound of an individual flow in the DiffServ architecture in order to provide delay-sensitive applications. In this paper, we study, via both analysis and simulation, the deterministic bound on edge-to-edge delay of a flow in a DiffServ network domain with FIFO aggregation and a class-based Latency Rate (LR) server that provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bound for a single flow as a function of allocated service rate for a traffic class, token bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. We compare the obtained delay bound with previous works using analytic results, and then conduct simulation to confirm the results. The derived bound is less than that of previous studies in all cases.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.7 pp.2887-2895

Publication Date: 2005/07/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.7.2887

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Geunhyung KIM, Cheeha KIM, "Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 7, pp. 2887-2895, July 2005, doi: 10.1093/ietcom/e88-b.7.2887.
Abstract: With the occurrence of new applications such as Voice over IP (VoIP) and multimedia conference, there is an ongoing discussion about realizing QoS in the Internet today. Because of its potential scalability in support of QoS guarantees, the Differentiated Service (DiffServ) architecture with aggregate packet scheduling has recently attracted much attention in the networking community as a feasible solution for providing Internet QoS. Thus, it is important to understand delay bound of an individual flow in the DiffServ architecture in order to provide delay-sensitive applications. In this paper, we study, via both analysis and simulation, the deterministic bound on edge-to-edge delay of a flow in a DiffServ network domain with FIFO aggregation and a class-based Latency Rate (LR) server that provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bound for a single flow as a function of allocated service rate for a traffic class, token bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. We compare the obtained delay bound with previous works using analytic results, and then conduct simulation to confirm the results. The derived bound is less than that of previous studies in all cases.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.7.2887/_p

Copy

@ARTICLE{e88-b_7_2887,
author={Geunhyung KIM, Cheeha KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network},
year={2005},
volume={E88-B},
number={7},
pages={2887-2895},
abstract={With the occurrence of new applications such as Voice over IP (VoIP) and multimedia conference, there is an ongoing discussion about realizing QoS in the Internet today. Because of its potential scalability in support of QoS guarantees, the Differentiated Service (DiffServ) architecture with aggregate packet scheduling has recently attracted much attention in the networking community as a feasible solution for providing Internet QoS. Thus, it is important to understand delay bound of an individual flow in the DiffServ architecture in order to provide delay-sensitive applications. In this paper, we study, via both analysis and simulation, the deterministic bound on edge-to-edge delay of a flow in a DiffServ network domain with FIFO aggregation and a class-based Latency Rate (LR) server that provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bound for a single flow as a function of allocated service rate for a traffic class, token bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. We compare the obtained delay bound with previous works using analytic results, and then conduct simulation to confirm the results. The derived bound is less than that of previous studies in all cases.},
keywords={},
doi={10.1093/ietcom/e88-b.7.2887},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network
T2 - IEICE TRANSACTIONS on Communications
SP - 2887
EP - 2895
AU - Geunhyung KIM
AU - Cheeha KIM
PY - 2005
DO - 10.1093/ietcom/e88-b.7.2887
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2005
AB - With the occurrence of new applications such as Voice over IP (VoIP) and multimedia conference, there is an ongoing discussion about realizing QoS in the Internet today. Because of its potential scalability in support of QoS guarantees, the Differentiated Service (DiffServ) architecture with aggregate packet scheduling has recently attracted much attention in the networking community as a feasible solution for providing Internet QoS. Thus, it is important to understand delay bound of an individual flow in the DiffServ architecture in order to provide delay-sensitive applications. In this paper, we study, via both analysis and simulation, the deterministic bound on edge-to-edge delay of a flow in a DiffServ network domain with FIFO aggregation and a class-based Latency Rate (LR) server that provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bound for a single flow as a function of allocated service rate for a traffic class, token bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. We compare the obtained delay bound with previous works using analytic results, and then conduct simulation to confirm the results. The derived bound is less than that of previous studies in all cases.
ER -