A distributed routing algorithm for virtual circuit data networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 1989, Pages 200-207

  Lin, Yeong Sung ^a   Yee, James R ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE NUMBERS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; CPU TIME; DATA NETWORK; DECISION VARIABLES; DISTRIBUTED ALGORITHM; DISTRIBUTED COMPUTATIONS; DISTRIBUTED ROUTING ALGORITHM; LAGRANGEAN RELAXATION; MULTICOMMODITY FLOW PROBLEMS; NONLINEAR INTEGER PROGRAMMING PROBLEM; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; ORIGIN-DESTINATION PAIRS; ROUTING PROBLEMS; VIRTUAL CIRCUIT;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DISTRIBUTED COMPUTER SYSTEMS; INTEGER PROGRAMMING; OPTIMIZATION; DATA TRANSMISSION--PACKET SWITCHING; MATHEMATICAL PROGRAMMING, NONLINEAR;

PROBLEM SOLVING; COMPUTER NETWORKS;

DISTRIBUTED ROUTING ALGORITHM; LAGRANGEAN RELAXATION; MULTIPLIER ADJUSTMENT PROCEDURE; NONLINEAR MULTICOMMODITY FLOW PROBLEM; VIRTUAL CIRCUIT DATA NETWORKS;

EID: 0024646582     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1989.101453     Document Type: Conference Paper

References (29)

1. D.G. Cantor and M. Gerla. Optimal routing in a packet switched computer network. IEEE Transactions on Computers, C-23:1062-1069, 1974.
2. P.J. Courtois and P. Semal. An algorithm for the optimization of nonbifurcated flows in computer communication networks. Performance Evaluation, 1:139-152, 1981.
3. A. Danet, R. Despres, A.L. Rest, G. Pichon, and S. Ritzenthaler. The French public packet switching service: The transpac network. In Proceeding Third International Computer Communication Conference, pages 251-260, 1976.
4. M.L. Fisher. The lagrangian relaxation method for solving integer programming problems. Management Science, 27(1):1-18, January 1981.
5. L. Fratta, M. Gerla, and L. Kleinrock. The flow deviation method: An approach to store-and-forward communication network design. Networks, 3:97-133, 1973.
6. R.G. Gallager. A minimum delay routing algorithm using distributed computation. IEEE Transactions on Communications, COM-25(1):73-85, January 1977.
7. B. Gavish. Topological design of centralized computer networks: formulations and algorithms. Networks, 12:355-377, 1982.
8. B. Gavish and S.L. Hantler. An algorithm for optimal route selection in SNA networks. IEEE Transactions on Computers, COM-31(10):1154-1160, October 1983.
9. A.M. Geoffrion. Lagrangean relaxation and its uses in integer programming. Math. Programming Study, 2:82-114, 1974.
10. M. Gerla. Routing and flow control ISDN's. In Proc. 1986 ICCC, pages 643-647, 1986.
11. J.P. Gray and T.B. McNeill. SNA multiple-system networking. IBM System Journal, 18:263-297, 1979.
12. GTE Telenet Communications Corp., Vienna, VA. Functional Description of GTE Telenet Packet Switching Networks, May 1982.
13. M. Held and R.M. Karp. The traveling salesman problem and minimum spanning trees. Operations Res., 18:1138-1162, 1970.
14. M. Held, P. Wolfe, and H.D. Crowder. Validation of subgradient optimization. Math. Programming, 6:62-88, 1974.
15. V.L. Hoberecht. SNA function management. IEEE Transactions on Communications, COM-28:594-603, 1980.
16. L. Kleinrock. Queueing Systems, volume 1 and 2. New York: Wiley-Interscience, 1975 and 1976.
17. D.G. Luenberger. Linear and Nonlinear Programming. Addison Wesley, 1984.
18. J. McQuillan. Adaptive Routing Algorithms for Distributed Computer Networks. PhD thesis, Harvard University, May 1974.
19. A. Mirzaian. Lagrangean relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks, 15:1-20, 1985.
20. A. Rajaraman. Routing in TYMNET. In Proceeding European Comput. Conf, 1978.
21. D. Rotem, N. Santoro, and J.B. Sidney. Distributed sorting. IEEE Transactions on Communications, C-34(4):372-376, April 1985.
22. H. Rudin. On routing and 'delta routing': A taxonomy and performance comparison of techniques for packet-switched networks. IEEE Transactions on Communications, COM-24(1):43-58, January 1976.
23. M. Schwartz and T.E. Stern. Routing techniques used in computer communication networks. IEEE Transactions on Communications, COM-28:539-552, 1980.
24. A. Segall. Optimal routing for virtual line-switched data networks. IEEE Transactions on Communications, COM-26, 1977.
25. A. Segall. Advances in verifiable fail-safe routing procedures. IEEE Transactions on Communications, COM-29-.491-497, 1981.
26. A. Segall. Distributed network protocols. IEEE Transactions on Information Theory, IT-29(1):23-35, January 1983.
27. L.R. Tymes. Routing and flow control in TYMNET. IEEE Transactions on Communications, COM-29:392-398, 1981.
28. J.R. Yee. Distributed Routing and Flow Control Algorithms for Communication Networks. PhD thesis, Massachusetts Institute of Technology, December 1985.
29. S. Zaks. Optimal distributed algorithms for sorting and ranking. IEEE Transactions on Computers, C-34(4):376-379, April 1985.