
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue, "QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming," IEEE Transactions on Computers, vol. 55, no. 7, pp. 815829, July, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.109, author = {Ying Xiao and Krishnaiyan Thulasiraman and Guoliang Xue}, title = {QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {7}, issn = {00189340}, year = {2006}, pages = {815829}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.109}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming IS  7 SN  00189340 SP815 EP829 EPD  815829 A1  Ying Xiao, A1  Krishnaiyan Thulasiraman, A1  Guoliang Xue, PY  2006 KW  Constrained shortest path KW  linear programming KW  simplex method KW  graph algorithms KW  communication networks KW  routing protocols KW  QoS routing. VL  55 JA  IEEE Transactions on Computers ER   
[1] “Private NetworkNetwork Interface Specification Version 1.0 (PNNI 1.0),” technical report, ATM Forum Technical Committee, Mar. 1996.
[2] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows. PrenticeHall, 1993.
[3] Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Sprintson, “Algorithms for Computing QoS Paths with Restoration,” IEEE Trans. Networking, vol. 13, no. 3, pp. 648661, 2005.
[4] D.P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, Mass.: Athena Scientific, 1998.
[5] B. Blokh and G. Gutin, “An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters,” Australasian J. Combinatorics, vol. 14, pp. 157164, 1996.
[6] A. Chakrabarti and G. Manimaran, “Reliability Constrained Routing in QoS Networks,” IEEE Trans. Networking, vol. 13, no. 3, pp. 662675, 2005.
[7] S. Chen and K. Nahrstedt, “On Finding MultiConstrained Path,” Proc. Int'l Conf. Comm. (ICC), pp. 874879, 1998.
[8] V. Chvátal, Linear Programming. New York: W.H. Freeman, 1983.
[9] E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick, “A Framework for QoS Based Routing in the Internet,” RFC 2386, Internet Eng. Task Force, Nov. 1997, fttp://fttp.ietf.org/internetdraftsdraftietfqosrframework02.txt .
[10] R. Guerin, S. Kamat, A. Orda, and T. Przygienda, “QoS Routing Mechanisms and OSPF Extensions,” RFC 2676, Internet Eng. Task Force, Mar. 1997.
[11] G. Handler and I. Zang, “A Dual Algorithm for the Constrained Shortest Path Problem,” Networks, vol. 10, pp. 293310, 1980.
[12] R. Hassin, “Approximation Schemes for the Restricted Shortest Path Problem,” Math. Operations Research, vol. 17, no. 1, pp. 3642, 1992.
[13] A. Iwata, R. Izmailov, B. Sengupta, D.S. Lee, G. Ramamurthy, and H. Suzuki, “ATM Routing Algorithms with Multiple QoS Requirements for Multimedia Internetworking,” IEICE Trans. Comm., vol. 8, pp. 9991006, 1996.
[14] J.M. Jaffe, “Algorithms for Finding Paths with Multiple Constraints,” Networks, vol. 14, pp. 95116, 1984.
[15] A. Jüttner, “On Resource Constrained Optimization Problems,” in review, 2003.
[16] A. Jüttner, B. Szviatovszki, I. Mécs, and Z. Rajkó, “Lagrange Relaxation Based Method for the QoS Routing Problem,” Proc. INFOCOM, pp. 859868, 2001.
[17] T. Korkmaz and M. Krunz, “MultiConstrained Optimal Path Selection,” Proc. INFOCOM, pp. 834843, 2001.
[18] T. Korkmaz and M. Krunz, “A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements,” Computer Networks, vol. 36, nos. 2/3, pp. 251268, 2001.
[19] F.A. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem, “An Overview of ConstraintBased Path Selection Algorithms for QoS Routing,” IEEE Comm. Magazine, vol. 40, pp. 5055, 2002.
[20] G. Liu and K.G. Ramakrishnan, “A*prune: An Algorithm for Finding k Shortest Paths Subject to Multiple Constraints,” Proc. INFOCOM, pp. 743749, 2001.
[21] D. Lorenz and D. Raz, “A Simple Efficient Approximation Scheme for the Restricted Shortest Paths Problem,” Operations Research Letters, vol. 28, pp. 213219, 2001.
[22] G. Luo, K. Huang, J. Wang, C. Hobbs, and E. Munter, “MultiQoS Constraints Based Routing for IP and ATM Networks,” Proc. IEEE Workshop QoS Support for RealTime Internet Applications, 1999.
[23] K. Mehlhorn and M. Ziegelmann, “Resource Constrained Shortest Paths,” Proc. Ann. European Symp. Algorithms (ESA), pp. 326337, 2000.
[24] P. Van Mieghem and F.A. Kuipers, “Concepts of Exact QoS Routing Algorithms,” IEEE/ACM Trans. Networking, vol. 12, no. 5, pp. 851864, 2004.
[25] P. Van Mieghem, H. De Neve, and F.A. Kuipers, “HopbyHop Quality of Service Routing,” Computer Networks, vol. 37, nos. 3/4, pp. 407423, 2001.
[26] H. De Neve and P. Van Mieghem, “Tamcra: A Tunable Accuracy Multiple Constraints Routing Algorithm,” Computer Comm., vol. 23, pp. 667679, 2000.
[27] A. Orda and A. Sprintson, “Efficient Algorithms for Computing Disjoint QoS Paths,” Proc. INFOCOM, pp. 727738, 2004.
[28] C.R. Palmer and J.G. Steffan, “Generating Network Topologies that Obey Power Laws,” Proc. IEEE GLOBECOM, pp. 434438, 2000.
[29] C.A. Phillips, “The Network Inhibition Problem,” Proc. Ann. ACM Symp. Theory of Computing (STOC), pp. 776785, 1993.
[30] R. Ravindran, K. Thulasiraman, A. Das, K. Huang, G. Luo, and G. Xue, “Quality of Services Routing: Heuristics and Approximation Schemes with a Comparative Evaluation,” Proc. Int'l Symp. Circuits and Systems (ISCAS), pp. 775778, 2002.
[31] S. Shenkar, C. Patridge, and R. Guering, “Specification of Guaranteed Quality of Service,” RFC 2212, Internet Eng. Task Force, Sept. 1997.
[32] K. Thulasiraman and M.N. Swamy, Graphs: Theory and Algorithms. New York: Wiley Interscience, 1992.
[33] Z. Wang and J. Crowcroft, “QualityofService Routing for Supporting Multimedia Applications,” IEEE J. Selected Areas in Comm., vol. 14, no. 7, pp. 12281234, 1996.
[34] B.M. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 16171622, Dec. 1988.
[35] Y. Xiao, K. Thulasiraman, and G. Xue, “Equivalence, Unification and Generality of Two Approaches to the Constrained Shortest Path Problem with Extension,” Proc. Allerton Conf. Control, Comm. , and Computing, pp. 905914, 2003.
[36] Y. Xiao, K. Thulasiraman, and G. Xue, “The Primal Simplex Approach to the QoS Routing Problem,” Proc. Int'l Conf. Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE), pp. 120129, 2004.
[37] Y. Xiao, K. Thulasiraman, and G. Xue, “Constrained Shortest LinkDisjoint Paths Selection: A Network Programming Based Approach,” IEEE Trans. Circuits and Systems, to appear.
[38] Y. Xiao, K. Thulasiraman, and G. Xue, “GENLARAC: A Generalized Approach to the Constrained Shortest Path Problem under Multiple Additive Constraints,” Proc. Int'l Symp. Algorithms and Computation (ISAAC), pp. 92105, 2005.
[39] Y. Xiao, K. Thulasiraman, G. Xue, and A. Jüttner, “The Constrained Shortest Path Problem: Algorithmic Approaches and an Algebraic Study with Generalization,” AKCE Int'l J. Graphs and Combinatorics, vol. 2, no. 2, pp. 6386, 2005.
[40] G. Xue, “MinimumCost QoS Multicast and Unicast Routing in Communication Networks,” IEEE Trans. Comm., vol. 51, pp. 817827, 2003.
[41] G. Xue, A. Sen, and R. Banka, “Routing with Many Additive QoS Constraints,” Proc. Int'l Computer Conf. (ICC), pp. 223227, 2003.
[42] X. Yuan, “Heuristic Algorithms for Multiconstrained QualityofService Routing,” IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 244256, 2002.
[43] M. Ziegelmann, “Constrained Shortest Paths and Related Problems,” PhD thesis, MaxPlanckInstitut für Informatik, 2001.