Polynomial Time Algorithm for Hop Constrained QoS Routing

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5245, Issue , 2003, Pages 131-135

  Verma, Shekhar ^a   Saxena, Anil Kishore ^a  

^a ABV INDIAN INSTITUTE OF INFORMATION TECHNOLOGY AND MANAGEMENT   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); INTERNET; POLYNOMIALS; ROUTERS; TELECOMMUNICATION NETWORKS;

MINIMUM HOP ROUTING; QOS-BASED ROUTING;

QUALITY OF SERVICE;

EID: 1642432884     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.511062     Document Type: Conference Paper

References (15)

1. S. Chen and K. Nahrstedt, "An overview of quality of service routing for next-generation high-speed networks: problems and solutions," IEEE Network, pp.64-79, Nov./Dec. 1998.
2. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. S. SIbal, A. De SIrnone, "Controlling Alternate Routing in General MutiPacket Flow Networks," ACM SIGCOMM '94, London, U.K., August 1994.
4. Z. Wang, J. Crowcroft, "QoS Routmg for Supporting multimedia applications", IEEE JSAC 14(7): 1228-1234, Sept. 1998.
5. Q. Ma, P. Steekiste and H. Zhang. "Routing and Bandwidth Traffic in Max Mm Far Share Networks", in Proceeding of ACM SIGCOMM'96, pp. 206-217, Stanford, CA, USA, Aug. 1998.
6. J.M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, 14:95-116, 1984.
7. A. Jüttner, B. Szviatovszki, I. Mëcs and Z. Rajkö, "Lagrange relaxation based method for the QoS routing problem", INFOCOM'2001, Alaska, 2001.
8. G. Apololoulos, R. Guerin, S. Kamat, S. K. Trlpathy, "Quality of Service Based Routing: A Performance Perspective, ACM SIGCQMM'98, Vancouver, Canada, Sept. 1998.
9. J.M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, 14:95-116, 1984.
10. R. Hassin, "Approximation scheme for the restricted shortest path problem," Mathematics of Operation Research, 17(1): 36-42, Feb. 1992.
11. A. Jüttner, B. Szviatovszki, I. Mëcs and Z. Rajkö, "Lagrange relaxation based method for the QoS routing problem", INFOCOM'2001, Alaska, 2001.
12. Dumitrescu, Irina and Boland, Natashia, "Algorithms for the Weight Constrained Shortest Path Problem.Available ttp://www.intellektik.informatik.tu-darmstadt.de/»irina/itor.ps.gz
13. Dumitrescu, Irina, "Constrained Path and Cycle Problems" Available: http://www.intellektik.informatik.tu-darmstadt.de/»irina/thesis.ps.gz
14. G. Feng, C. Doulgeris, K. Makki and N. Pissinou, "Heuristic and Exact Algorithms for QoS Routing with Multiple Constraints," submitted to IEICE Trans. Communications, November 2001, available at http://www.students.miami.edu/p_gfeng/.
15. GT ITM Georgia Teach Internetwork Topology Models. URL: http://www.cc.gatech.edu/pro]ects/gtltm