Characteristics of deterministic optimal routing for a simple traffic control problem

1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999

Volumn , Issue , 1999, Pages 386-392

  Oida, Kazumasa ^a   Shinjo, Kazumasa ^a  

^a ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TRAFFIC CONTROL;

AVERAGE PACKET DELAYS; DESTINATION NODES; NUMERICAL SOLUTION; OPTIMAL ROUTING; PARALLEL PATH; ROUTING ASSIGNMENT; ROUTING PROBLEMS; SHORT PACKETS;

NETWORK ROUTING;

EID: 77949618089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.1999.749463     Document Type: Conference Paper

References (18)

1. L. Fratta, M. Gerla, and L. Kleinrock, "The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design," Networks, Vol. 3, No. 3, pp. 97-133, 1973.
2. D. Cantor and M. Gerla, "Optimal Routing in a Packet-Switched Computer Network," IEEE Transactions on Computer, Vol. 23, pp. 1062-1069, 1974.
3. R. G. Gallager, "A Minimum Delay Routing Algorithm Using Distributed Computation," IEEE Transactions on Communications, Vol. 23, pp. 73-85, 1977.
4. T. P. Yum, "The Design and Analysis of a Semidy-namic Deterministic Routing Rule," IEEE Transactions on Communications, Vol. 29, No. 4, pp. 498-504, 1981.
5. B. Mohanty and C. G. Cassandras, "Effect of Model Uncertainty on Some Optimal Routing Problems," Journal of Optimization Theory and Applications, Vol. 77, No. 2, 1993.
6. W. Winston, "Optimality of the Shortest Line Discipline," Journal of Applied Probability, Vol. 14, pp. 181-189, 1977.
7. A. Ephremides, P. Varaiya, and J. Walrand, "A Simple Dynamic Routing Problem," IEEE Transactions on Automatic Control, Vol. 25, No. 4, pp. 690-693, 1980.
8. R. W. Weber, "On the Optimal Assignment of Customers to Parallel Servers," Journal of Applied Probability, Vol. 15, pp. 406-413, 1978.
9. W. Whitt, "Deciding Which Queue to Join: Some Counterexamples," Operations Research, Vol. 34, No. 1, pp. 55-62, 1986.
10. M. Aicardi, R. Minciardi, and R. Pesenti, "Optimal Routing in a Simple Network with Deterministic Arrival and Service Times," Proceeding of Annual Aller-ton Conference on Communication, Control, and Computing, pp. 640-649, 1990.
11. T. P. Yum and M. Schwartz, "The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks," IEEE Transactions on Communications, Vol. 29, No. 4, pp. 505-511, 1981.
12. S. Shenker and A. Weinrib, "The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing," IEEE Transaction on Computers, Vol. 38, No. 12, pp. 1724-1735, 1989.
13. K. Shinjo and T. Sasada, "Hamiltonian Systems with Many Degrees of Freedom: Asymmetric Motion and Intensity of Motion in Phase Space," Physical Review, E54, 4685, 1996.
14. P. Naor, "The Regulation of Queue Size by Levying Tolls," Econometrica, Vol. 37, No. 1, pp. 15-24, 1969.
15. C. E. Bell and S. Stidham Jr., "Individual versus Social Optimization in the Allocation of Customers to Alternative Servers," Management science, Vol. 29, No. 7, pp. 831-839, 1983.
16. C. E. Agnew, "On Quadratic Adaptive Routing Algorithms," Communications of the ACM, Vol. 19, No. 1, pp. 18-22, 1976.
17. D. P. Bertsekas and R. G. Gallager, "Data Networks," Prentice Hall International, 1991.
18. M. E. Streenstrup, "Routing in Communications Networks," Prentice Hall International, 1995.