A Basic Dynamic Routing Problem and Diffusion

Diffusion theory has sometimes been successful in providing excellent approximate solutions to difficult queueing problems. Here we explore whether such methods can be used to analyze a basic dynamic routing strategy associated with a single idealized node in a data network. We analyze a dynamic routing policy where messages, or packets, that arrive at a certain node are routed to leave the node on the link having the shorter queue. In the model, message or packet arrivals are Poisson and the service time is exponentially distributed. We explore a heavy traffic diffusion method and we also discuss the limitations of an ad hoc approach to applying diffusion. For a node with K outgoing queues we find, under the assumption of heavy traffic, the optimum dynamic strategy, in the sense of minimizing the average delay. When this optimum dynamic strategy is compared to a static strategy where the outgoing traffic is split among the K queues, we find that the average delay for the dynamic system is better by a factor of K .

[1]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[2]  J. J. Stoker Surface waves in water of variable depth , 1947 .

[3]  A. S. Peters Water waves over sloping beaches and the solution of a mixed boundary value problem for δ2ø−k2ø = 0 in a sector , 1952 .

[4]  H. Trotter Approximation of semi-groups of operators , 1958 .

[5]  M. Schechter A generalization of the problem of transmission , 1960 .

[6]  J. Kingman Two Similar Queues in Parallel , 1961 .

[7]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[8]  D. Gaver Diffusion approximations and models for certain congestion problems , 1968, Journal of Applied Probability.

[9]  Iosif Ilitch Gikhman,et al.  Introduction to the theory of random processes , 1969 .

[10]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[11]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

[12]  W. Whitt Multiple channel queues in heavy traffic. III: random server selection , 1970, Advances in Applied Probability.

[13]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[14]  Mirosław Krzyżański Partial differential equations of second order , 1971 .

[15]  J. Harrison The heavy traffic approximation for single server queues in series , 1973, Journal of Applied Probability.

[16]  Hisashi Kobayashi,et al.  Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions , 1974, JACM.

[17]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[18]  D. Heyman An approximation for the busy period of the M/G/1 queue using a diffusion model , 1974, Journal of Applied Probability.

[19]  Hisashi Kobayashi,et al.  Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling , 1974, JACM.

[20]  D. P. Heyman A diffusion model approximation for the GI/G/1 queue in heavy traffic , 1975, The Bell System Technical Journal.

[21]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[22]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[23]  H. McKean,et al.  Two queues in parallel , 1977 .

[24]  John H. Rath The Optimal Policy for a Controlled Brownian Motion Process , 1977 .

[25]  Eugene Wong,et al.  Stochastic processes in information and dynamical systems , 1979 .