A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
Imrich Chlamtac, András Faragó, Hongbiao Zhang, Andrea Fumagalli · IEEE/ACM Transactions on Networking · 1998
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.