Nested sliding window protocols with packet fragmentation

Abstract

A single-hop OSI structured network with multiple layers of sliding window flow control and packet fragmentation between layers is analyzed. An approximation algorithm is presented to hierarchically reduce the network to a single queue whose performance characteristics represent the original network. Network transmission characteristics are restricted to Erlang distributions. Validation against exact and simulation results showed that the approximation algorithm has a satisfactory error level.

Analysis of an open tandem queueing network with population constraint and constant service times 1

“…Pi == 1 -Ph, and Ph is approximately taken to be equal to f. Thus, the mean waiting time in the queueing network is approximated by the quantity: (21) where WI, the mean waiting time of a GI/ D/1 queue with service time~and W 2 , the mean waiting time for a GI/ D/l queue with service time s":…”

“…Fdida, Perros and Wilk [4] then analyzed using Marie's approximation method [14]. Shapiro and Perros [21] presented a hierarchical method for analyzing nested sliding window flow control mechanisms with packet fragmentation and reassembly. An approximation algorithm was presented to hierarchically reduce the network to a single queue whose performance characteristics represented the original network.…”