A system for the design of packet-switched communication networks with economic tradeoffs

Computer Communications

Volumn 21, Issue 18, 1998, Pages 1670-1680

  Amiri, Ali ^a  

^a WEBER STATE UNIVERSITY   (United States)

Author keywords

Capacity assignment; Packet switched communication network; Response time; Route selection

Indexed keywords

COSTS; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; QUEUEING NETWORKS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

LAGRANGIAN RELAXATION;

PACKET NETWORKS;

EID: 0032292859     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(98)00175-3     Document Type: Article

References (22)

1. B. Gavish, S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31 (1983) 1154-1161.
2. B. Gavish, I. Neuman, A system for routing and capacity assignment in computer networks, IEEE Transactions on Communications 37 (1989) 360-366.
3. B. Gavish, K. Altinkemer, Backbond network design tools with economic tradeoffs, ORSA Journal on Computing 2 (1990) 226-252.
4. M. Gerla, Deterministic and adaptive routing policies in packet-switched computer networks, ACM IEEE 3rd Data Communications Symposium, Tampa, FL (1973).
5. S. Narasimhan, H. Pirkul, P. De, Route selection in backbone data communication networks, Computer Networks and ISDN Systems 15 (1988) 121-133.
6. H. Pirkul, S. Narasimhan, Primary and secondary route selection in backbone communication networks, ORSA Journal on Computing 6 (1994) 50-60.
7. H. Pirkul, A. Amiri, Routing in packet-switched communication networks, Computer Communications 17 (1994) 307-316.
8. D. Tcha, K. Maruyama, On the selection of primary paths for a communication network, Computer Networks and ISDN Systems 9 (1985) 257-265.
9. E. Rosenberg, A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network, Operations Research 35 (1987) 354-364.
10. H. Gershet, R. Weihmayer, Joint optimization of data network design and facility location, IEEE Journal on Selected Areas in Communications 8 (1990) 149-152.
11. L. LeBlanc, R.V. Simmons, Continuous models for capacity design of large packet-switched telecommunication networks, ORSA Journal on Computing 1 (1989) 271-286.
12. C. Monma, D. Shallcross, Methods for designing communication networks with certain two-connected survivability constraints, Operations Research 37 (1989) 531-541.
13. T. Ng, D. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communications network, IEEE Transactions on Communications 35 (1987) 202-209.
14. L. Kleinrock, Communications Nets: Stochastic Message Flow and Delay, Dover, New York, 1964.
15. L. Kleinrock, Queueing Systems, Vols 1 & 2, Wiley-Interscience, New York, 1975, 1976.
16. M. Gerla, A.J. Monreiro, R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE Journal on Selected Areas in Communications 7 (1989) 1253-1262.
17. J. Monreiro, M. Gerla, Bandwidth allocation in ATM networks, Annals of Operations Research 49 (1994) 25-50.
18. M.M. Syslo, N. Deo, J.S. Kowalik, Discrete Optimization Algorithms with Pascal Programs, Prentice-Hall, NJ, 1983.
19. B. Gavish, On obtaining the 'best' multipliers for a Lagrangean relaxation for integer programming, Computers and Operations Research 5 (1978) 55-71.
20. M.S. Bazaraa, J.J. Goode, A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality, European Journal of Operational Research 3 (1979) 322-328.
21. M. Held, P. Wolfe, H.P. Cowder, Validation of subgradient optimization, Mathematical Programming 5 (1974) 62-68.
22. B.T. Poljack, A general method of solving extremum problems, Soviet Math. Doklady 8 (1967) 593-597.