Distribution of end-to-end delay in message-switched networks

doi:10.1016/0376-5075(78)90038-7

Computer Networks (1976)

Volume 2, Issue 1, February 1978, Pages 44-49

https://doi.org/10.1016/0376-5075(78)90038-7 Get rights and content

Abstract

An open queueing network model is used to derive the distribution of end-to-end delay in a message-switched network. It is shown that under fixed routing, the end-to-end delay of messages belonging to a particular source-destination node pair is given by a sum of independent and exponentially distributed random variables. The generalization of this basic result to random routing and to messages belonging to a group of a source-destination pairs is also considered. Numerical examples based on a hypothetical network are presented.

References (8)

L. Kleinrock
Communication Nets-Stochastic Message Flow and Delays
(1964)
L. Kleinrock
L. Kleinrock
Queueing Systems, Volume 2: Computer Applications
F. Baskett et al.
Open, Closed, and Mixed Network of Queues with Different Classes of Customers
J. ACM
(1975)

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

Cited by (20)

Distributed packet switching queueing network design
1983, Computers and Electrical Engineering
An overall design of a distributed packet switching communication network with many clusters of users, several host-computers, intermediate processors and concentrators is described. The proposed approach takes into account such factors as nonlinearity of cost functions, reliability requirements of every cluster, provides least-cost network configuration by an appropriate selection of flow routing strategies, and capacities of all links with their acceptable delays. This is achieved by three major modules of the algorithm: preparation of tables, multiple usage of recursive subroutines, and finally, via parametric search. Recent computer experiments demonstrate startling agreement with the theoretically predicted polynomial time- and space-complexities of those proposed in the paper.
Queuing network models of packet switching networks part 1: Open networks
1982, Performance Evaluation
An overview of the application of product-form queuing network models to the performance analysis of store-and-forward packet-switching networks is presented. Multiple routing chains are used to model the different routing behaviors of data packets. Queuing networks with open chains are considered in this paper. Kleinrock's formula for the mean end-to-end delay of packets is first derived. The application of this delay formula to optimal channel capacity assignment and optimal routing is discussed. Analytic results for the mean and distribution of the end-to-end delay of each chair are presented. The issue of fairness among chains is also addressed.
The application of queuing networks with closed chains and population size constraints to the performance analysis of store-and-forward packet-switching networks is illustrated in a companion paper [1].
A derivation of response time distributions for a multi-class feedback queueing systems
1981, Performance Evaluation
A single server queue with feedback and multiple customer types is analyzed. Arrival processes are independent Poisson processes. After receiving a quantum of service, a customer may depart or rejoin the end of the queue for more service. The number of quanta of service required by a customer of a specific type is a random variable having a general distribution with finite support. Each quantum of service is exponentially distributed. We derived the moment generating function of customer response time conditioned on the number of quanta of service required. An efficient algorithm for calculating the second-order statistics of the conditional response time is given. Numerical results are shown illustrating the variance of the conditional response time for different service requirement distributions and customer types. The performance of the FCFS and round-robin scheduling disciplines are compared.
End-to-end delay approximation in packet-switched networks
2020, arXiv
Hot potatoes and postmen: how packet switching became ARPANET’s greatest legacy
2019, Internet Histories
A Flexible model for dimensioning mixed service 3G wireless networks
2005, IEEE International Conference on Communications

View all citing articles on Scopus

^☆: This work was supported by the Department of Communications and the National Research Council of Canada.

View full text

Distribution of end-to-end delay in message-switched networks☆

Abstract

Communication Nets-Stochastic Message Flow and Delays

Queueing Systems, Volume 2: Computer Applications

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

J. ACM