{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:44:07Z","timestamp":1745210647532,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":99,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201939"},{"type":"electronic","value":"9783540451907"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45190-7_3","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T20:06:17Z","timestamp":1277841977000},"page":"80-117","source":"Crossref","is-referenced-by-count":18,"title":["Quality of Service Routing"],"prefix":"10.1007","author":[{"given":"P.","family":"Van Mieghem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. A.","family":"Kuipers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Korkmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Krunz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Curado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X.","family":"Masip-Bruin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Sol\u00e9-Pareta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"S\u00e1nchez-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Andrew, L.H., Kusuma, A.A.N.: Generalized analysis of a qos-aware routing algorithm. In: Proc. of IEEE GLOBECOM 1998, Piscataway, NJ, USA, vol.\u00a01, pp. 1\u20136 (1998)","DOI":"10.1109\/GLOCOM.1998.775684"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45859-X_20","volume-title":"From QoS Provisioning to QoS Charging","author":"T. Anjali","year":"2002","unstructured":"Anjali, T., Scoglio, C., de Oliveira, J., Chen, L.C., Akyldiz, I.F., Smith, J.A., Uhl, G., Sciuto, A.: A new path selection algorithm for MPLS networks based on available bandwidth estimation. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds.) QofIS 2002 and ICQT 2002. LNCS, vol.\u00a02511, pp. 205\u2013214. Springer, Heidelberg (2002)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Quality of service based routing: a performance perspective. In: Proc. of ACM SIGCOMM 1998, Vancouver, British Columbia, Canada, August\/September 1998, pp. 17\u201328 (1998)","DOI":"10.1145\/285243.285251"},{"key":"3_CR4","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Server based qos routing. In: Proc. of IEEE GLOBECOM 1999 (1999)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Apostolopoulos, G., Williams, D., Kamat, S., Guerin, R., Orda, A., Przygienda, T.: QoS routing mechanisms and OSPF extensions. RFC 2676 (August 1999)","DOI":"10.17487\/rfc2676"},{"key":"3_CR6","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.: Improving qos routing performance under inaccurate link state information. In: Proc. of the 16th International Teletraffic Congress (ITC 16), Edinburgh, United Kingdom, June 7-11 (1999)"},{"key":"3_CR7","unstructured":"The, A.T.M.: Forum, Private network-to-network interface specification version 1.1 (PNNI 1.1), af-pnni-0055.002 (April 2002)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Basturk, E., Stirpe, P.: A hybrid spanning tree algorithm for efficient topology distribution in PNNI. In: Proc. of the 1st IEEE International Conference on ATM (ICATM 1998), pp. 385\u2013394 (1998)","DOI":"10.1109\/ICATM.1998.688203"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bellur, B., Ogier, R.G.: A reliable, efficient topology broadcast protocol for dynamic networks. In: IEEE INFOCOM 1999, vol.\u00a01, pp. 178\u2013186 (1999)","DOI":"10.1109\/INFCOM.1999.749266"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. RFC 2475 (December 1998)","DOI":"10.17487\/rfc2475"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Braden, R., Clark, D., Shenker, S.: Integrated services in the internet architecture: an overview. RFC 1633 (June 1994)","DOI":"10.17487\/rfc1633"},{"key":"3_CR12","unstructured":"Chen, S., Nahrstedt, K.: On finding multi-constrained paths. In: Proc. of ICC 1998, New York, pp. 874\u2013879 (1998)"},{"key":"3_CR13","unstructured":"Chen, S., Nahrstedt, K.: Distributed qos routing with imprecise state information. In: Proc. of 7th IEEE International Conference of Computer, Communications and Networks, Lafayette, LA, October 1998, pp. 614\u2013621 (1998)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Chen, T.M., Oh, T.H.: Reliable services in MPLS. IEEE Communications Magazine, 58\u201362 (1999)","DOI":"10.1109\/35.809386"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1002\/(SICI)1520-6750(199812)45:8<769::AID-NAV2>3.0.CO;2-#","volume":"45","author":"R.K. Cheung","year":"1998","unstructured":"Cheung, R.K.: Iterative methods for dynamic stochastic shortest path problems. Naval Research Logistics\u00a0(45), 769\u2013789 (1998)","journal-title":"Naval Research Logistics"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-36480-3_8","volume-title":"Quality of Service in Multiservice IP Networks","author":"M. Curado","year":"2003","unstructured":"Curado, M., Reis, O., Brito, J., Quadros, G., Monteiro, E.: Stability and scalability issues in hop-by-hop class-based routing. In: Ajmone Marsan, M., Listanti, G.C.M., Roveri, A. (eds.) QoS-IP 2003. LNCS, vol.\u00a02601, pp. 103\u2013116. Springer, Heidelberg (2003)"},{"key":"3_CR17","unstructured":"Chong, E.I., Maddila, S., Morley, S.: On finding single-source single-destination k shortest paths. J. Computing and Information, special issue ICCI 1995, 40-47 (1995)"},{"key":"3_CR18","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2000","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2000)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1145\/359657.359665","volume":"21","author":"Y.K. Dalal","year":"1978","unstructured":"Dalal, Y.K., Metcalfe, R.M.: Reverse path forwarding of broadcast packets. Communications of the ACM\u00a0(21), 1040\u20131048 (1978)","journal-title":"Communications of the ACM"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"De Neve, H., Van Mieghem, P.: A multiple quality of service routing algorithm for PNNI. In: IEEE ATM workshop, Fairfax, May 26-29, pp. 324\u2013328 (1998)","DOI":"10.1109\/ATM.1998.675192"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/S0140-3664(99)00225-X","volume":"23","author":"H. De Neve","year":"2000","unstructured":"De Neve, H., Van Mieghem, P.: TAMCRA: a tunable accuracy multiple constraints routing algorithm. Computer Communications\u00a023, 667\u2013679 (2000)","journal-title":"Computer Communications"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a0(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/trsc.19.1.75","volume":"19","author":"A. Eiger","year":"1985","unstructured":"Eiger, A., Mirchandani, P.B., Soroush, H.: Path preferences and optimal paths in probabilistic networks. Transportation Science\u00a019(1), 75\u201384 (1985)","journal-title":"Transportation Science"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: IEEE INFOCOM 2000, vol.\u00a02, pp. 519\u2013528 (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H. Frank","year":"1969","unstructured":"Frank, H.: Shortest paths in probabilistic graphs. Oper. Res.\u00a017, 583\u2013599 (1969)","journal-title":"Oper. Res."},{"key":"3_CR26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"3_CR27","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 1st edn. North Oxford Academic, Oxford (1983)","edition":"1"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/90.779203","volume":"7","author":"R. Guerin","year":"1999","unstructured":"Guerin, R., Orda, A.: QoS routing in networks with inaccurate information: theory and algorithms. IEEE\/ACM Transactions on Networking\u00a07(3), 350\u2013364 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"3_CR29","unstructured":"Guerin, R., Orda, A.: Networks with advance reservations: the routing perspective. In: IEEE INFOCOM 2000, Israel, March 26-30 (2000)"},{"key":"3_CR30","unstructured":"Guo, L., Matta, I.: Search space reduction in qos routing. In: Proc. of the 19th III Int. Conference on Distributed Computing Systems, May 1999, vol.\u00a0III, pp. 142\u2013149 (1999)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Guo, Y., Kuipers, F.A., Van Mieghem, P.: A Link-Disjoint Paths Algorithm for Reliable QoS Routing. To appear in International Journal of Communication Systems (2003)","DOI":"10.1002\/dac.612"},{"issue":"1","key":"3_CR32","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M.I. Henig","year":"1985","unstructured":"Henig, M.I.: The shortest path problem with two objective functions. European J. of Operational Research\u00a025, 281\u2013291 (1985)","journal-title":"European J. of Operational Research"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0169-7552(89)90066-4","volume":"16","author":"P.A. Humblet","year":"1988","unstructured":"Humblet, P.A., Soloway, S.R.: Topology broadcast algorithms. Computer Networks and ISDN Systems\u00a016, 179\u2013186 (1988\/1989)","journal-title":"Computer Networks and ISDN Systems"},{"issue":"8","key":"3_CR35","first-page":"999","volume":"E79-B","author":"A. Iwata","year":"1996","unstructured":"Iwata, A., Izmailov, R., Lee, D.-S., Sengupta, B., Ramamurthy, G., Suzuki, H.: ATM routing algorithms with multiple qos requirements for multimedia internetworking. IEICE Transactions and Communications\u00a0E79-B(8), 999\u20131006 (1996)","journal-title":"IEICE Transactions and Communications"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J.M. Jaffe","year":"1984","unstructured":"Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks\u00a0(14), 95\u2013116 (1984)","journal-title":"Networks"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Jia, Y., Nikolaidis, I., Gburzynski, P.: Multiple path routing in networks with inaccurate link state information. In: IEEE ICC, vol.\u00a08, pp. 2583\u20132587 (2001)","DOI":"10.1109\/ICC.2001.936616"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Jianxin, W., Weiping, W., Jianer, C., Songqiao, C.: A randomized qos routing algorithm on networks with inaccurate link-state information. In: Proc. of the International Conference on Communication Technology (WCC - ICCT 2000), vol.\u00a02, pp. 1617\u20131622 (2000)","DOI":"10.1109\/ICCT.2000.890970"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovszki, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the qos routing problem. In: IEEE INFOCOM 2001, April 2001, vol.\u00a02, pp. 859\u2013868.","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1287\/opre.33.3.696","volume":"33","author":"J. Kamburowski","year":"1985","unstructured":"Kamburowski, J.: A note on the stochastic shortest route problem. Operations Research\u00a033(3), 696\u2013698 (1985)","journal-title":"Operations Research"},{"key":"3_CR41","volume-title":"An Engineering Approach to Computer Networking: ATM networks, the Internet, and the Telephone Network","author":"S. Keshav","year":"1997","unstructured":"Keshav, S.: An Engineering Approach to Computer Networking: ATM networks, the Internet, and the Telephone Network. Addison-Wesley, Reading (1997)"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Khanna, A., Zinky, J.: The revised ARPANET routing metric. In: SIGCOMM 1989 (1989)","DOI":"10.1145\/75246.75252"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Kim, S., Lee, M.: Server based qos routing with implicit network state updates. In: IEEE GLOBECOM 2001, San Antonio, Texas, November 2001, vol.\u00a04, pp. 2182\u20132187 (2001)","DOI":"10.1109\/GLOCOM.2001.966167"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: IEEE INFOCOM 2000, pp. 902\u2013911 (2000)","DOI":"10.1109\/INFCOM.2000.832265"},{"issue":"4","key":"3_CR45","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/369534.369542","volume":"10","author":"T. Korkmaz","year":"2000","unstructured":"Korkmaz, T., Krunz, M.: Source-oriented topology aggregation with multiple qos parameters in hierarchical networks. The ACM Transactions on Modeling and Computer Simulation (TOMACS)\u00a010(4), 295\u2013325 (2000)","journal-title":"The ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"key":"3_CR46","unstructured":"Korkmaz, T., Krunz, M.: Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination. In: IEEE GLOBECOM 2002 Conference - High-Speed Networks Symposium (November 2002)"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Bandwidth-delay constrained path selection under inaccurate state information. To appear in IEEE\/ACM Transactions on Networking (2003)","DOI":"10.1109\/TNET.2003.813047"},{"key":"3_CR48","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S1389-1286(00)00209-7","volume":"36","author":"T. Korkmaz","year":"2001","unstructured":"Korkmaz, T., Krunz, M.: A randomized algorithm for finding a path subject to multiple qos requirements. Computer Networks\u00a036, 251\u2013268 (2001)","journal-title":"Computer Networks"},{"key":"3_CR49","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: IEEE INFOCOM (2001)"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-45412-8_9","volume-title":"Quality of Future Internet Services","author":"F.A. Kuipers","year":"2001","unstructured":"Kuipers, F.A., Van Mieghem, P.: QoS routing: average complexity and hopcount in m dimensions. In: Smirnov, M., Crowcroft, J., Roberts, J., Boavida, F. (eds.) QofIS 2001. LNCS, vol.\u00a02156, pp. 110\u2013126. Springer, Heidelberg (2001)"},{"key":"3_CR51","first-page":"801","volume":"25\/8","author":"F.A. Kuipers","year":"2002","unstructured":"Kuipers, F.A., Van Mieghem, P.: MAMCRA: a constrained-based multicast routing algorithm. Computer Communications\u00a025\/8, 801\u2013810 (2002)","journal-title":"Computer Communications"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Kuipers, F.A., Van Mieghem, P.: The impact of correlated link weights on qos routing. In: IEEE INFOCOM, San Francisco, USA (April 2003)","DOI":"10.1109\/INFCOM.2003.1208978"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-45188-4_11","volume-title":"Quality for All","author":"F.A. Kuipers","year":"2003","unstructured":"Kuipers, F.A., Van Mieghem, P.: Bi-directional search in qos routing. In: Karlsson, G., Smirnov, M. (eds.) QofIS 2003. LNCS, vol.\u00a02811, pp. 102\u2013111. Springer, Heidelberg (2003)"},{"key":"3_CR54","volume-title":"Combinatorial Optimization: networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: networks and matroids. Holt, Rinehart and Winston, NewYork (1976)"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Lee, W.C., Hluchyi, M.G., Humblet, P.A.: Routing subject to quality of service constraints in integrated communication networks. IEEE Network, 46\u201355 (July\/August 1995)","DOI":"10.1109\/65.397043"},{"key":"3_CR56","unstructured":"Lekovic, B., Van Mieghem, P.: Link state update policies for quality of service routing. In: IEEE Eighth Symposium on Communications and Vehicular Technology in the Benelux (SCVT 2001), Delft, The Netherlands, October 18, pp. 123\u2013128 (2001)"},{"key":"3_CR57","unstructured":"Liu, G., Ramakrishnan, K.G.: A*Prune: an algorithm for finding K shortest paths subject to multiple constraints. In: IEEE INFOCOM (2001)"},{"issue":"9","key":"3_CR58","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"R.P. Loui","year":"1983","unstructured":"Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Communications of ACM\u00a026(9), 670\u2013676 (1983)","journal-title":"Communications of ACM"},{"issue":"6","key":"3_CR59","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/90.748088","volume":"6","author":"D.H. Lorenz","year":"1998","unstructured":"Lorenz, D.H., Orda, A.: QoS routing in networks with uncertain parameters. IEEE\/ACM Transactions on Networking\u00a06(6), 768\u2013778 (1998)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"3_CR60","doi-asserted-by":"crossref","unstructured":"Ma, Q., Steenkiste, P.: Quality-of-service routing with performance guarantees. In: Proc. of 4th Int. IFIP Workshop on QoS (May 1997)","DOI":"10.1007\/978-0-387-35170-4_12"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Ma, Q., Steenkiste, P.: Supporting dynamic inter-class resource sharing: a multiclass qos routing algorithm. IEEE INFOCOM (1999)","DOI":"10.1109\/INFCOM.1999.751451"},{"key":"3_CR62","unstructured":"Ma, Z., Zhang, P., Kantola, R.: \u201cInfluence of link state updating on the performance and cost of qos routing in an intranet. In: 2001 IEEE Workshop on High Performance Switching and Routing (HPSR 2001), Dallas, Texas, USA, May 29-31 (2001)"},{"key":"3_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-36480-3_7","volume-title":"Quality of Service in Multiservice IP Networks","author":"X. Masip-Bruin","year":"2003","unstructured":"Masip-Bruin, X., S\u00e1nchez-L\u00f3pez, S., Sol\u00e9-Pareta, J., Domingo-Pascual, J.: A qos routing mechanism for reducing inaccuracy effects. In: Ajmone Marsan, M., Listanti, G.C.M., Roveri, A. (eds.) QoS-IP 2003. LNCS, vol.\u00a02601, pp. 90\u2013102. Springer, Heidelberg (2003)"},{"key":"3_CR64","unstructured":"Masip-Bruin, X., S\u00e1nchez-L\u00f3pez, S., Sol\u00e9-Pareta, J., Domingo-Pascual, J.: QoS routing algorithms under inaccurate routing information for bandwidth constrained applications. In: Proceedings of International Communications Conference, IEEE ICC 2003, Anchorage, Alaska (May 2003)"},{"issue":"2","key":"3_CR65","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/trsc.34.2.198.12304","volume":"34","author":"E.D. Miller-Hooks","year":"2000","unstructured":"Miller-Hooks, E.D., Mahmassani, H.S.: Least expected time paths in stochastic, time-varying transportation networks. Transportation Science\u00a034(2), 198\u2013215 (2000)","journal-title":"Transportation Science"},{"key":"3_CR66","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0305-0548(76)90017-4","volume":"3","author":"P.B. Mirchandani","year":"1976","unstructured":"Mirchandani, P.B.: Shortest distance and reliability of probabilistic networks. Comput. & Ops. Res.\u00a03, 347\u2013355 (1976)","journal-title":"Comput. & Ops. Res."},{"issue":"4","key":"3_CR67","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0305-0548(85)90034-6","volume":"12","author":"P.B. Mirchandani","year":"1985","unstructured":"Mirchandani, P.B., Soroush, H.: Optimal paths in probabilistic networks: a case with temporal preferences. Comput. and Operations Research\u00a012(4), 365\u2013381 (1985)","journal-title":"Comput. and Operations Research"},{"key":"3_CR68","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"3_CR69","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0377-2217(97)00264-6","volume":"103","author":"I. Murthy","year":"1997","unstructured":"Murthy, I., Sarkar, S.: Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function. European Journal of Operational Research\u00a0103, 209\u2013229 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"3_CR70","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/mnsc.44.11.S125","volume":"44","author":"I. Murthy","year":"1998","unstructured":"Murthy, I., Sarkar, S.: Stochastic shortest path problems with piecewise-linear concave utility functions. Management Science\u00a044(11), S125\u2014S136 (1998)","journal-title":"Management Science"},{"key":"3_CR71","doi-asserted-by":"crossref","unstructured":"Nahrstedt, K., Chen, S.: Coexistence of qos and best effort flows - routing and scheduling. In: Proc. of 10th IEEE Tyrrhenian International Workshop on Digital Communications: Multimedia Communications, Ischia, Italy (September 1998)","DOI":"10.1007\/978-1-4471-0859-7_14"},{"key":"3_CR72","doi-asserted-by":"crossref","unstructured":"Nelakuditi, S., Zhang, Z., Tsang, R.P.: Adaptive proportional routing: a localized qos routing approach. In: IEEE INFOCOM 2000, pp. 1566-1575 (2000)","DOI":"10.1109\/INFCOM.2000.832555"},{"key":"3_CR73","doi-asserted-by":"crossref","unstructured":"Oliveira, M., Brito, J., Melo, B., Quadros, G., Monteiro, E.: Quality of service routing in the differentiated services framework. In: Proc. of SPIE\u2019s International Symposium on Voice, Video, and Data Communications (Internet III: Quality of Service and Future Directions), Boston, Massachusetts, USA, November 5-8 (2000)","DOI":"10.1117\/12.417493"},{"issue":"3","key":"3_CR74","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/90.779205","volume":"7","author":"A. Orda","year":"1999","unstructured":"Orda, A.: Routing with end-to-end qos guarantees in broadband networks. IEEE\/ACM Transactions on Networking\u00a07(3), 365\u2013374 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"Orda, A., Sprintson, A.: QoS routing: the precomputation perspective. In: IEEE INFOCOM 2000, pp. 128-136 (2000)","DOI":"10.1109\/INFCOM.2000.832181"},{"issue":"8","key":"3_CR76","first-page":"605","volume":"20","author":"M. Peyravian","year":"1997","unstructured":"Peyravian, M., Kshemkalyani, A.D.: Network path caching: issues, algorithms and a simulation study. Performance Evaluation\u00a020(8), 605\u2013614 (1997)","journal-title":"Performance Evaluation"},{"key":"3_CR77","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0167-6377(91)90005-A","volume":"10","author":"G.H. Polychronopoulos","year":"1991","unstructured":"Polychronopoulos, G.H., Tsitsiklis, J.N.: Stochastic shortest path problems with recourse. Operations Research Letters\u00a010, 329\u2013334 (1991)","journal-title":"Operations Research Letters"},{"issue":"2","key":"3_CR78","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/90.842145","volume":"8","author":"D.S. Reeves","year":"2000","unstructured":"Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE\/ACM Transactions on Networking\u00a08(2), 239\u2013250 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"3_CR79","doi-asserted-by":"crossref","unstructured":"Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol label switching architecture. RFC 3031 (January 2001)","DOI":"10.17487\/rfc3031"},{"key":"3_CR80","doi-asserted-by":"crossref","unstructured":"Shaikh, A., Rexford, J., Shin, K.: Load-sensitive routing of long-lived IP flows. In: ACM SIGCOMM 1999 (1999)","DOI":"10.1145\/316188.316225"},{"issue":"3","key":"3_CR81","first-page":"332","volume":"15","author":"H.F. Salama","year":"1997","unstructured":"Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE JSAC\u00a015(3), 332\u2013345 (1997)","journal-title":"IEEE JSAC"},{"issue":"1","key":"3_CR82","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.35.1.37.10141","volume":"35","author":"S. Sen","year":"2001","unstructured":"Sen, S., Pillai, R., Joshi, S., Rathi, A.K.: A mean-variance model for route guidance in advanced traveler information systems. Transportation Science\u00a035(1), 37\u201349 (2001)","journal-title":"Transportation Science"},{"key":"3_CR83","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, vol.\u00a0A-C. Springer, Berlin (2003)"},{"issue":"5","key":"3_CR84","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","volume":"28","author":"C.E. Sigal","year":"1980","unstructured":"Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.: Stochastic shortest route problem. Operations Research\u00a028(5), 1122\u20131129 (1980)","journal-title":"Operations Research"},{"issue":"4","key":"3_CR85","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/trsc.28.4.309","volume":"28","author":"R.A. Sivakumar","year":"1994","unstructured":"Sivakumar, R.A., Batta, R.: The variance-constrained shortest path problem. Transportation Science\u00a028(4), 309\u2013316 (1994)","journal-title":"Transportation Science"},{"key":"3_CR86","doi-asserted-by":"crossref","unstructured":"Taft-Plotkin, N., Bellur, B., Ogier, R.: Quality-of-service routing using maximally disjoint paths. In: Proc. of the Seventh International Workshop on Quality of Service (IWQoS 1999), London, England, May\/June 1999, pp. 119-128 (1999)","DOI":"10.1109\/IWQOS.1999.766485"},{"issue":"3-4","key":"3_CR87","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S1389-1286(01)00222-5","volume":"37","author":"P. Van Mieghem","year":"2001","unstructured":"Van Mieghem, P., De Neve, H., Kuipers, F.A.: Hop-by-hop quality of service routing. Computer Networks\u00a037(3-4), 407\u2013423 (2001)","journal-title":"Computer Networks"},{"key":"3_CR88","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1017\/S0269964801154070","volume":"15","author":"P. Van Mieghem","year":"2001","unstructured":"Van Mieghem, P.: Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences (PEIS)\u00a015, 535\u2013555 (2001)","journal-title":"Probability in the Engineering and Informational Sciences (PEIS)"},{"issue":"20","key":"3_CR89","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1016\/S1389-1286(99)00066-3","volume":"31","author":"P. Van Mieghem","year":"1999","unstructured":"Van Mieghem, P.: Topology information condensation in hierarchical networks. Computer Networks\u00a031(20), 2115\u20132137 (1999)","journal-title":"Computer Networks"},{"key":"3_CR90","unstructured":"Van Mieghem, P., De Neve, H.: Aspects of quality of service routing. In: Proc. of SPIE 1998, Boston (USA), 3529A-05, November 1-6 (1998)"},{"key":"3_CR91","doi-asserted-by":"crossref","unstructured":"Van Mieghem, P.: Estimation of an optimal PNNI topology. In: IEEE ATM Workshop, pp. 570\u2013577 (1997)","DOI":"10.1109\/ATM.1997.624740"},{"key":"3_CR92","doi-asserted-by":"crossref","unstructured":"Vutukury, S., Garcia-Luna-Aceves, J.J.: A simple approximation to minimumdelay routing. In: ACM SIGCOMM 1999 (1999)","DOI":"10.21236\/ADA461850"},{"issue":"1","key":"3_CR93","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/65.819168","volume":"14","author":"B. Wang","year":"2000","unstructured":"Wang, B., Hou, J.C.: Multicast routing and its qos extension: problems, algorithms, and protocols. IEEE Network\u00a014(1), 22\u201336 (2000)","journal-title":"IEEE Network"},{"key":"3_CR94","doi-asserted-by":"crossref","unstructured":"Wang, Z., Crowcroft, J.: Shortest path first with emergency exits. In: SIGCOMM 1990, Philadelphia, USA (September 1990)","DOI":"10.1145\/99508.99548"},{"issue":"7","key":"3_CR95","first-page":"1228","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE JSAC\u00a014(7), 1228\u20131234 (1996)","journal-title":"IEEE JSAC"},{"key":"3_CR96","doi-asserted-by":"crossref","unstructured":"Wang, J., Nahrstedt, K.: Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In: IEEE INFOCOM (2002)","DOI":"10.1145\/774749.774760"},{"issue":"9","key":"3_CR97","first-page":"1617","volume":"6","author":"B.M. Waxman","year":"1998","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE JSAC\u00a06(9), 1617\u20131622 (1998)","journal-title":"IEEE JSAC"},{"issue":"2","key":"3_CR98","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/65.768484","volume":"13","author":"X. Xiao","year":"1999","unstructured":"Xiao, X., Ni, L.M.: Internet qos: a big picture. IEEE Network\u00a013(2), 8\u201318 (1999)","journal-title":"IEEE Network"},{"key":"3_CR99","doi-asserted-by":"crossref","unstructured":"Yuan, X.: Heuristic algorithms for multiconstrained quality-of-service routing. IEEE\/ACM Transactions on Networking\u00a010(2) (April 2002)","DOI":"10.1109\/90.993305"}],"container-title":["Lecture Notes in Computer Science","Quality of Future Internet Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45190-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T10:01:58Z","timestamp":1740218518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-45190-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201939","9783540451907"],"references-count":99,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45190-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}