Deterministic edge-to-edge delay bounds for a flow in a DiffServ network domain
SCIE
SCOPUS
- Title
- Deterministic edge-to-edge delay bounds for a flow in a DiffServ network domain
- Authors
- Kim, G; Kim, C
- Date Issued
- 2004-01
- Publisher
- SPRINGER-VERLAG BERLIN
- Abstract
- It is important to understand delay bounds of an individual flow in the Internet in order to provide real-time applications such as Voice over IP (VoIP). In this paper, we study the deterministic bounds on edge-to-edge delay of a flow in a Differentiated Service (DiffServ) network domain with FIFO aggregation and class-based Guaranteed-Rate (GR) scheduler which provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bounds of a flow as a function of service rate allocated for a traffic class and leaky-bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. The resulting bounds are less than previously derived delay bounds, especially in the case where the burstiness of aggregated traffic is high and the edge-to-edge path is long.
- Keywords
- CONNECTION-ORIENTED NETWORKS; PACKET FLOWS; END ANALYSIS; CALCULUS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/17700
- DOI
- 10.1007/978-3-540-25978-7_38
- ISSN
- 0302-9743
- Article Type
- Article
- Citation
- LECTURE NOTES IN COMPUTER SCIENCE, vol. 3090, page. 370 - 379, 2004-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.