Characteristics of deterministic optimal routing for a simple traffic control problem

This paper deals with a routing problem for a pair of parallel paths connecting a source node and a destination node. The problem is to find the optimal routing that minimizes the average packet delay under the condition that all of the packets' arrival times at the source node as well as all of the packets' sizes are completely deterministic. The numerical solutions of the problem show that the optimal routing assigns most of the short packets to one path and most of the long packets to the other path when the input traffic intensity is high. This new routing assignment is called the fix-queue-based-on-size (FS) policy. It is shown mathematically that the expected average packet delay of the FS policy is smaller than that of the send-to-shortest-delay (SSD) policy if a large number of packets simultaneously arrive at the source node.

[1]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2]  Tak-Shing Peter Yum,et al.  The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks , 1981, IEEE Trans. Commun..

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[5]  Kazumasa,et al.  Hamiltonian systems with many degrees of freedom: Asymmetric motion and intensity of motion in phase space. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  P. Naor.  The Regulation of Queue Size by Levying Tolls , 1969 .

[7]  C. Cassandras,et al.  Effect of model uncertainty on some optimal routing problems , 1993 .

[8]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[9]  S. Stidham,et al.  Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .

[10]  Scott Shenker,et al.  The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing , 1989, IEEE Trans. Computers.

[11]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[12]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[13]  Tak-Shing Peter Yum.  The Design and Analysis of a Semidynamic Deterministic Routing Rule , 1981, IEEE Trans. Commun..

[14]  C. E. Agnew,et al.  On quadratic adaptive routing algorithms , 1976, CACM.

[15]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[16]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..