A gateway allocation algorithm for interconnecting existing data networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 1989, Pages 468-473

  Liang, Song Chyau ^a   Yee, James R ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION ALGORITHM; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; CPU TIME; DATA NETWORK; INTERCONNECT NETWORKS; LAGRANGIAN RELAXATION; NP-HARD; OPTIMAL SOLUTIONS; ROUTING ASSIGNMENT; SECOND PHASE; SUBGRADIENT METHODS; TWO PHASE ALGORITHM; VIRTUAL CIRCUIT;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; OPTIMIZATION; TELECOMMUNICATION SYSTEMS; MATHEMATICAL PROGRAMMING, LINEAR; MATHEMATICAL TECHNIQUES--HEURISTIC;

GATEWAYS (COMPUTER NETWORKS); COMPUTER NETWORKS;

GATEWAY ALLOCATION ALGORITHM; GREEDY HEURISTIC ALGORITHM; INTERCONNECT NETWORKS; LAGRANGIAN RELAXATION; LINEAR COMBINATORIAL OPTIMIZATION;

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

References (12)

1. Fisher, M.L., "The Lagrangean Relaxation Method for Solving Integer Programming Problems", Management Science, Vol.27, No.1, January, 1981, pp.1-18.
2. Cornuejols, G., Fisher, M.L. and Nemhauser, G.L., "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms," Management Science, Vol.23, pp.789-810, 1977.
3. Horowitz, E. and S. Sahni, "Computing Partitions with Applications to the Knapsack Problem", Journal of ACM, Vol.21, No.2, pp.277-292, 1974.
4. Toth, P., "Dynamic Programming Algorithms for the Zero-One Knapsack Problem", Computing, 25, pp.29-45, 1980.
5. Martello, S., and P. Toth, "Algorithm for Knapsack Problems", Annals of Discrete Mathematics 31, pp. 213-258, 1987.
6. Lawler, E.L., "Fast Approximation Algorithms for Knapsack Problems", Mathematics of Operations Research, Vol.4, No.4, November, pp.339-356, 1979.
7. Held, M., P. Wolfe, H. Crowder, "Validation of Sub-gradient Optimization," Math Programming, Vol. 6, pp 62-88, 1974.
8. Tanenbaum, A., Computer Networks, Prentice-Hall, 1981.
9. Stallings, W., Data and Computer Communications, Macmillan, 1985
10. Comer, D.E., Internetworking with TCP/IP Principles, Protocols and Architecture, Prentice-Hall, 1988.
11. Cantor, D.G. and M. Gerla, "Optimal Routing in a Packet-Switched Computer Network," IEEE Trans on Computers, pp 1062-1068, 1974.
12. Yee, J.R., "Discrete Capacity Assignments using a Minimax Objective Function," Proc of JCCC, October, 1980.