By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chlamtac, I. ; Sch. of Eng. & Comput. Sci., Texas Univ., Richardson, TX, USA ; Farago, A. ; Hongbiao Zhang ; Fumagalli, A.

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

Published in:

Networking, IEEE/ACM Transactions on  (Volume:6 ,  Issue: 4 )