A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks

Author

Chlamtac, Imrich ; Faragó, András ; Zhang, Hongbiao ; Fumagalli, Andrea

Author_Institution

Sch. of Eng. & Comput. Sci., Texas Univ., Richardson, TX, USA

Volume

6

Issue

4

fYear

1998

fDate

8/1/1998 12:00:00 AM

Firstpage

422

Lastpage

431

Abstract

We analyze the worst-case behavior of general connection-oriented networks, with first-in-first-out (FIFO) queueing policy, forwarding packets along an arbitrary system of routes. A worst-case bound is proven for the end-to-end queueing delay and buffer size needed to guarantee loss-free packet delivery, given that sources satisfy a given source rate condition. The results are based on a novel deterministic approach and help in reconciling the discrepancy between the unstable worst-case behavior of FIFO-based networks and their good practical performance

Keywords

asynchronous transfer mode; buffer storage; packet switching; queueing theory; telecommunication network routing; ATM; FIFO-based networks; buffer size; connection-oriented networks; deterministic approach; end-to-end analysis; end-to-end queueing delay; first-in-first-out queueing policy; loss-free packet delivery; packet flows; packet forwarding; performance; source rate condition; unstable worst-case behavior; worst-case bound; Asynchronous transfer mode; Communication networks; Communication switching; Communication system traffic control; Delay; Intelligent networks; Multiprocessor interconnection networks; Queueing analysis; Switching circuits; Traffic control;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.720877

Filename

720877