Routing Subject to Quality of Service Constraints in Integrated Communication Networks

IEEE Network

Volumn 9, Issue 4, 1995, Pages 46-55

  Lee, Whay C ^a   Hluchyj, Michael G ^a   Humblet, Pierre A ^b  

^a MOTOROLA INC   (United States)

^b EURECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; RESOURCE ALLOCATION; TELECOMMUNICATION CONTROL; TELECOMMUNICATION TRAFFIC;

INTEGRATED COMMUNICATION NETWORKS; QUALITY OF SERVICE; ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 0029333760     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/65.397043     Document Type: Article

References (38)

1. W. Lee, M. Hluchyj, and P. Humblet, “Rule-Based Call-by-Call Source Routing for Integrated Communication Net Proc. IEEE INFOCOM 987–993.
2. D. Bertsekas and R. Gallager, Data Networks, (Prentice-Hall, 1987).
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, (W. H. Freeman, 1979).
4. D. Mitra and J. B. Seery, “Comparative Evaluations of Randomized and Dynamic Routing Strategies for Circuit-Switched Networks,” IEEE Trans. on Commun., vol. 39, no. 1, Jan. 102–116.
5. G. R. Ash, R. H. Cardwell, and R. P. Murray, “Design and Optimization of Networks with Dynamic Routing,” Bell Labs. Tech. Journal, vol. 60, no. 8, Oct. 1981.
6. G. R. Ash, “Use of a Trunk Status Map for Real-Time DNHR,'’ Proc. of the 11th Int'l Teletraffic Congress, Kyoto, Japan, Sept. 1985.
7. G. R. Ash and B. D. Huang, “An Analytical Model for Adaptive Routing Networks,” IEEE Trans. on Communications, vol. 41, no. 11, Nov. 1993, 1748–1759.
8. J. Regnier and W. H. Cameron, “State-Dependent Dynamic Traffic Management for Telephone Networks,” IEEE Commun. Mag., vol. 28, no. 10, Oct. 1990, pp. 42–53.
9. K. S. Narendra, E. A. Wright, and L. G. Mason, “Application of Learning Automata to Telephone Traffic Routing and Control,” IEEE Trans. on Systems, Man, and Cybernetics, vol. SMC-7, no. 11, Nov. 1977, pp. 785–792.
10. V. V. Marbukh, “Investigation of a Fully Connected Channel Switching Network with Many Nodes and Alternative Routes,” Simulation of Behavior and Intelligence, (Plenum Publishing 1984), pp. 1601–1608.
11. P. B. Key and G. A. Cope, “Distributed Dynamic Routing Schemes,” IEEE Commun. Oct. 1990, 54–64.
12. A. Krasniewski, “Fuzzy Automata as Adaptive Algorithms for Telephone Traffic Routing,” Proc. IEEEICC’84, 61-66, May 1984.
13. S. Chang, “Fair Integration of Routing and Flow Control in Communication Networks,” IEEE Trans. on Commun., vol. 40, no. 4, April 1992, 821–834.
14. F. Lin and J. R. Yee, “A Real-Time Distributed Routing and Admission Control Algorithm for ATM Networks,” Proc. IEEE INFOCOM '93, 1993, pp. 792–801.
15. A. Kolarov and J. Hui, “Least Cost Routing in Multiple-Service Networks,” Proc. IEEE INFOCOM '94, 1994, 1482–1489.
16. J. Moy, “OSPF Version 2,” RFC 1247, July 1991.
17. D. D. Clark, “Policy Routing in Internetworks,” Internetworking: Research and Experience, vol. 1, 1990, pp. 35–52.
18. J. M. Jaffe, “Algorithms for Finding Paths with Multiple Constraints,” Networks, vol. 14, 1984, 95–116.
19. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Trans. on Networking, vol. 1, no. 3, June 1993.
20. M. I. Henig, “The Shortest Path Problem with Two Objective Functions,” European Journal of Operational Research, 25, 1985, pp. 281–291.
21. J. A. Garay and I. S. Gopal, “Call Preemption in Communication Proc. IEEE INFOCOM 1043–1050.
22. R. P. Lippmann, “New Routing and Preemption Algorithms for Circuit-Switched Mixed-Media Networks,” Proc. IEEE MILCOM '85, 1985, pp. 660–666.
23. G. Gopal, A. Kumar, and A. Weinrib, “Routing in a Circuit-Switched Network with Priority Classes,” Proc. IEEE INFOCOM '89, 1989, 792–799.
24. J. F. Stach, “Expert Systems Find a New Place in Data Networks,” in Networking Software, Ungaro, ed., Data Communication Book 1987), 75–83.
25. C. Wang and P. N. Weissler, “The Use of Artificial Neural Networks for Optimal Message Routing,” IEEE Network Mag., March/April 1995, 16–24.
26. ANSI X3.102-1983, “American National Standard for Information Systems—Data Communications Systems and Services — User-Oriented Performance Parameters.”
27. J. S. Richters and C. A. Dvorak, “A Framework for Defining the Quality of Communications Services,” IEEE Commun. Mag., vol. 26, no. 10, Oct. 1988.
28. H. Gilbert, O. Aboul-Magd, and V. Phung, “Developing a Cohesive Traffic Management Strategy for ATM Networks,” IEEE Commun. Mag., vol. 29, no. 10, Oct. 1991, pp. 36–45.
29. ATM Forum Traffic Management Draft Specification, Version 4.0, April 1995.
30. A. Campbell, G. Coulson, and D. Hutchison, “A Quality of Service Architecture,” ACM SIGCOMM Computer Communication Review, vol. 24, no. 2, April 1994, pp. 6–27.
31. A. A. Lazar, A. Temple, and R. Gidron, “An Architecture for Integrated Networks that Guarantees Qualify of Service,” Int'l J. and Comm. Systems, vol. 3, no. 2, 1990.
32. A. A. Lazar and G. Pacifici, “Control of Resources in Broadband Networks with Quality of Service Guarantees,” IEEE Commun. Mag., vol. 29, no. 10, Oct. 1991, pp. 66–73.
33. J. Jung and A. Gravey, “QoS Management and Performance Monitoring in ATM Networks,” Proc. IEEE GLOBECOM 1993, 708–712.
34. J. Jung and D. Seret, “Translation of QoS Parameters into ATM Performance Parameters in B-ISDN,” Proc. IEEE INFOCOM’93, 1993, pp. 748–755.
35. J. Kurose, “Open Issues and Challenges in Providing Quality of Service Guarantees in High-Speed Networks,” ACM SIGCOMM Computer Commun. Review, vol. 23, no. 1, Jan. 1993, pp. 6–15.
36. W. Lee and P. Kamat, “Integrated Packet Networks with Quality of Service Constraints,” Proc. IEEE GLOBECOM '91, Dec. 2–5, 1991, 8A.3.1-8A.3.5.
37. W. Lee and P. Kamat, “Quality of Service Matching for Integrated Fast Packet Networks,” Proc. IEEE GLOBECOM '92, Dec. 6–9, 1992, 931–937.
38. ATM Forum PNNI Draft Specification, April 1995.