Locating Internet Gateways to Minimize Nonlinear Congestion Costs

IEEE Transactions on Communications

Volumn 42, Issue 9, 1994, Pages 2740-2750

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

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; ELECTRIC DELAY LINES; ELECTRIC NETWORK TOPOLOGY; MULTIPLEXING EQUIPMENT; NETWORK PROTOCOLS; PACKET SWITCHING; RELAXATION PROCESSES; TELECOMMUNICATION TRAFFIC; WIDE AREA NETWORKS;

CONVEX PROGRAMMING; DATAGRAM NETWORKS; GRID NETWORKS; INTERNET GATEWAYS; INTERNET PACKET DELAYS; INTERNET TRAFFIC; LAGRANGIAN RELAXATION; NONLINEAR COMBINATORIAL OPTIMIZATION PROBLEM; NONLINEAR CONGESTION COSTS; ROUTING ASSIGNMENTS;

GATEWAYS (COMPUTER NETWORKS);

EID: 0028494736     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.317415     Document Type: Article

References (19)

1. W. Stallings, Data and Computer Communications. New York: Macmillan, 1985.
2. D. E. Comer, Internetworking with TCP/IP Principles, Protocols and Architecture. Englewood Cliffs, NJ: Prentice—Hall, 1988.
3. P. E. Green, Jr., Ed., Network Interconnection and Protocol Conversion. New York: IEEE Press, 1988.
4. L. Fratta, M. Gerla, and L. Kleinrock, “The flow deviation method: An approach to store-and-forward communication network design,” Networks, vol. 3, pp. 97-133, 1973.
5. D. G. Cantor and M. Gerla, “Optimal routing in a packet-switched computer network,” IEEE Trans. Comput., vol. C-23, pp. 1062-1068, 1974.
6. D. P. Bertsekas and E. M. Gafni, “Projected Newton methods and optimization of multicommodity flows,” IEEE Trans. Automat. Contr., vol. AC-28, pp. 1090-1096.
7. Y. S. Lin and J. Yee, “A distributed routing algorithm for virtual circuit data networks,” in Proc. IEEE INFOCOM 1989, Apr., pp. 200-207.
8. J. R. Yee and Y. S. Lin, “A routing algorithm for virtual circuit data networks with multiple traffic types,” Networks, 1989
9. B. Gavish, “Topological design of centralized computer networks—Formulations Formulations and algorithms,” Networks, vol. 12, pp. 355-377, 1982.
10. C.-C. Lo and A. Kershenbaum, “A two-phase algorithm and performance bounds for the star—star concentrator location problem,” IEEE Trans. Commun., vol. 37, pp. 1151-1163, Nov. 1989.
11. M. Gerla and L. Kleinrock, “On the topological design of distributed computer networks,” IEEE Trans. Commun., vol. COM-25, pp. 48-60, Jan. 1977.
12. S. C. Liang and J. Yee, “A gateway allocation algorithm for interconnecting existing data networks,” in Proc. IEEE INFOCOM 1989, Apr. 1989, pp. 468-473.
13. ―, “A model and algorithm for interconnecting two WAN’s,” Tech. Rep. Commun. Sci. Inst., USC, Los Angeles, CA, December 1989; also in Proc. IEEE SMC Conf., Nov. 1990.
14. ―, “Algorithms for interconnecting Ethernets with multi-port bridges,” Tech. Rep. 90-09-02, Commun. Sci. Inst., Sept. 1990.
15. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, “Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms,” Management Sci., vol. 23, 789-810, 1977.
16. A. Geoffrion and R. McBride, “Lagrangean relaxation applied to capacitated facility location problems,” AIIE Trans., vol. 10, no. 1, pp. 40-47, 1978.
17. T. L. Magnanti and R. T. Wong, “Network design and transportation planning: Models and algorithms,” Transportation Sci., vol. 18, no. 1, pp. 1-55, Feb. 1984.
18. E. Horowitz and S. Sahni, “Computing partitions with applications to the knapsack problem,” J. ACM, vol. 21, no. 2, pp. 277-292, 1974.
19. D. G. Luenberger, Linear and Nonlinear Programming. New York: Addison-Wesley, 1984.