Some approaches to solving a multihour broadband network capacity design problem with single-path routing

Telecommunication Systems

Volumn 13, Issue 2-4, 2000, Pages 269-291

  Medhi, D ^a   Tipper, D ^b  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044519733     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA Journal on Computing 6 (1994) 161-173.
2. A. Arvidsson, Management of reconfigurable virtual path networks, in: Proc. of the 14th Internat. Teletraffic Congress, Antibes, France (June 1994) pp. 931-940.
3. G.R. Ash, R.H. Cardwell and R.P. Murray, Design and optimization of networks with dynamic routing, Bell Systems Technical Journal 60(8) (1981) 1787-1820.
4. G.R. Ash, A.H. Kafker and K.R. Krishnan, Servicing and real-time control of networks with dynamic routing, Bell Systems Technical Journal 60 (1981) 1821-1845.
5. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1992).
6. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).
7. J. Burgin, Broadband ISDN resource management, Computer Networks & ISDN Systems 20 (1990) 323-331.