Packet Routing in Telecommunication Networks with Path and Flow Restrictions

References

• Altinkemer K. , Gavish B. Augmented Lagrangean method for routing in frame and cell relay networks with time restrictions. Proc. 4th Internat. Conf. Telecomm. Systems: Model. Anal. (1996) Nashville, TN 285 294 Google Scholar
• Balakrishnan A. , Altinkemer K. Using a hop-constrained model to generate alternative communication network designs. ORSA J. Comput. (1992) 4 192 205 Link, Google Scholar
• Barr R. , Farhangian K. , Kennington J. Networks with side-constraints: An LU factorization update. Ann. Soc. Logist. Engineers (1986) 1 66 85 Google Scholar
• Bazaraa M. , Shetty C. Nonlinear Programming: Theory and Algorithms (1979) (Wiley, NY) 331 342 Google Scholar
• Chari K. Multi-hour design of computer backbone networks. Telecomm. Systems (1996) 6 347 365 Crossref, Google Scholar
• CISCO, HyperSwitch A100 Architecture (1997) . http://www.cisco.com/warp/public/614/3.html Google Scholar
• CISCO, Bandwidth Management and Queuing (1997) . http://www.cisco.com/warp/public/731/Protocol/dlsw5_rg.html Google Scholar
• Daganzo C. On the traffic assignment problem with flow dependent costs—II. Transportation Res. (1977) 11 439 441 Crossref, Google Scholar
• Doverspike R. Private communication. (1997) . Bellcore, Room 3G-111, 331 Newman Springs Road, Red Bank, NJ 07701-5699 Google Scholar
• Farvolden J. , Powell W. , Lustig I. A primal partitioning solution of the arc-chain formulation of a multicommodity network flow problem. Oper. Res. (1993) 41 669 693 Link, Google Scholar
• Fratta L. , Gerla M. , Kleinrock L. The flow-deviation algorithm: An approach to store-and-forward computer communication network design. Networks (1973) 3 97 133 Crossref, Google Scholar
• Gavish B. , Hantler S. An algorithm for optimal route selection in SNA networks. IEEE Trans. Comm. (1983) 31 1154 1161 Crossref, Google Scholar
• Gouveia L. Using the miller-tucker-zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Comput. Oper. Res. (1995) 22 959 970 Crossref, Google Scholar
• Gouveia L. Multicommodity flow models for spanning trees with hop constraints. Eur. J. Oper. Res. (1996) 95 1 178 190 Crossref, Google Scholar
• Halpern J. , Priess I. Shortest-paths with time constraints on movement and parking. Networks (1974) 4 241 253 Crossref, Google Scholar
• Harder J. (1997) . Private communication, President, Renaissance Telecommunications Associates. 616 Marriott Dr., Suite 260, Nashville, TN 37214-5048 Google Scholar
• Jocksh H. The shortest route problem with constraints. J. Math. Anal. Appl. (1966) 14 191 197 Crossref, Google Scholar
• Johnson D. , Lenstra J. , Rinnooy Kan A. The complexity of the network design problem. Networks (1978) 8 279 285 Crossref, Google Scholar
• Lawler E. Combinatorial Optimization: Networks and Matroids (1976) (Holt, Rinehart & Winston, NY) 82 Google Scholar
• LeBlanc L. Mathematical programming models for large-scale network equilibrium and network design problems. (1973) (Department of IE/MS, Northwestern University, Evanston, IL 60201) . Doctoral thesis Google Scholar
• LeBlanc L. , Reddoch R. Reliable link topology/capacity design and routing in backbone telecommunications networks. (1990) . Working paper 90-08, Vanderbilt University Google Scholar
• LeBlanc L. , Park J. , Sridhar V. , Kalvenes J. Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach. Telecomm. Systems (1996) 6 21 43 Crossref, Google Scholar
• McCallum C. A generalized upper bounding approach to a communications network planning problem. Networks (1977) 7 1 23 Crossref, Google Scholar
• Maurras J. , Vaxes Y. GUB partitioning for multicommodity flow revisited. Discrete Math. (1997) 165/166 481 486 Crossref, Google Scholar
• Minoux M. Plus courts chemins avec constraintes: Algorithmes et applications. Annales des Telecomm. (1975) 30 383 394 Crossref, Google Scholar
• Minoux M. Structures algebriques generalisees des problemes de cheminement dans les graphes. RAIRO-Recherche Operationnelle (1976) 10 33 62 Google Scholar
• Neuman I. A system for priority routing and capacity assignment in packet-switched networks. Ann. Oper. Res. (1992) 36 225 246 Crossref, Google Scholar
• Neuman I. Class-dependent routing in backbone computer networks. (1989) . Working paper 131, Center for Research on Information Systems, New York University, New York, NY 10006 Google Scholar
• Park J. Private communication. Department of Management Science. (1997) (University of Iowa, Iowa City, IA 52242-1000) Google Scholar
• Ribeiro C. Algorithmes de recherche de plus courts chemins avec constraintes. (1983) (Ecole Nationale Superieure des Telecommunications, Paris, France) . Doctoral thesis Google Scholar
• Sohraby K. , Fratta L. , Gopal I. , Lazar A. Congestion control in high-speed packet switched networks. IEEE J. Selected Areas Comm. (1991) 9 965 966 Google Scholar
• Sung C. , Park S. An algorithm for configuring embedded networks in reconfigurable telecommunication networks. Telecomm. Systems (1995) 4 241 271 Crossref, Google Scholar
• Tanenbaum A. Computer Networks (1996) 3rd ed. (Prentice Hall PTR, NJ, 365) Google Scholar
• Woolston K. , Albin S. The design of centralized networks with reliability and availability constraints. Comput. Oper. Res. (1988) 15 207 17 Crossref, Google Scholar