On reassembly delay in packet switching networks

doi:10.1016/0169-7552(88)90052-9

Computer Networks and ISDN Systems

Volume 15, Issue 1, 1988, Pages 1-25

Computer Networks an...

https://doi.org/10.1016/0169-7552(88)90052-9 Get rights and content

Abstract

The purpose of this paper is to develop an algorithm to compute the reassembly delay of a multi-packet message in a packet switching network. The network is assumed to employ virtual circuits subject to window flow control. A direct consequence of this algorithm is an expression for the mean message delay in such a network. The heart of the algorithm is the computation of the probability distribution for the location of the trailing packet of a packet pair. Two exact methods, based upon the convolution algorithm and the mean value analysis, are developed for product-form queueing networks. Heuristics were developed in order to render the algorithm computationally feasible, and to extend it to non product-form networks. Simulations are employed to validate the results in all cases.

References (20)

F. Basket et al.
Open, Closed and Mixed Networks of Queues with Different Classes of Customers
J. ACM 22
(April 1975)
S.C. Bruell et al.
Computational algorithms for Closed Queueing Networks
(1980)
J.P. Buzen
Computational Algorithms for Closed Queueing Networks with Exponential Servers
Comm. of the ACM
(Sept. 1973)
C. Evequoz, “On the Choice on Packet Sizes in Computer Communication Networks”, Research Report TR-SOCS-86.20, School...
V. Fernandes et al.
Some Performance Models of Distributed Systems
G.L. Fultz
Adaptive Routing Techniques for Message Switching Computer-Communication Networks
W.J. Gordon et al.
Closed Queueing Systems with Exponential Servers
Operation Research
(March 1967)
Information Research Associates
PAWS 2.0 Performance Analyst's Workbench System User's Manual
(1984)
L. Kleinrock
L. Kleinrock

There are more references available in the full text version of this article.

Cited by (1)

Optimal packet sizes in virtual circuit computer networks
1992, Computer Networks and ISDN Systems
The purpose of this paper is to determine the optimal packet size into which a message should be segmented in order to minimize its transit delay. Two models are considered. The first model assumes that the network has a product form solution. In this case, a closed form solution is found. However, product form networks impose the restriction that the packet sizes on each connection sharing a common link must be of identical lengths. When this requirement is not met, no closed form solution exists. To overcome this difficulty, in the second model assumptions are formulated and validated via simulation in order to develop heuristics for determining the optimal packet size.

^☆: This research was sponsored by the National Sciences and Engineering Council of Canada.

View full text

Computer Networks and ISDN Systems

On reassembly delay in packet switching networks☆

Abstract

Open, Closed and Mixed Networks of Queues with Different Classes of Customers

J. ACM 22

Computational algorithms for Closed Queueing Networks

Computational Algorithms for Closed Queueing Networks with Exponential Servers

Comm. of the ACM

Some Performance Models of Distributed Systems

Adaptive Routing Techniques for Message Switching Computer-Communication Networks

Closed Queueing Systems with Exponential Servers

Operation Research

PAWS 2.0 Performance Analyst's Workbench System User's Manual

Optimal packet sizes in virtual circuit computer networks