{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T08:15:28Z","timestamp":1697357728167},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,13]],"date-time":"2006-06-13T00:00:00Z","timestamp":1150156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMS"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10287-006-0014-z","type":"journal-article","created":{"date-parts":[[2006,6,12]],"date-time":"2006-06-12T12:05:20Z","timestamp":1150113920000},"page":"225-244","source":"Crossref","is-referenced-by-count":8,"title":["A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance"],"prefix":"10.1007","volume":"3","author":[{"given":"L\u00facia","family":"Martins","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Craveirinha","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,13]]},"reference":[{"key":"14_CR1","first-page":"1291","volume-title":"ITC-16 Teletraffic engineering in a competitive world","author":"CH Antunes","year":"1999","unstructured":"Antunes CH, Craveirinha J, Climaco J, Barrico C (1999). A multiple objective routing algorithm for integrated communication networks. In: Key P, Smith D, (eds). ITC-16 Teletraffic engineering in a competitive world, vol 3b, Elsevier, North Holland, pp. 1291\u20131300"},{"issue":"11","key":"14_CR2","doi-asserted-by":"crossref","first-page":"1748","DOI":"10.1109\/26.241755","volume":"41","author":"GR Ash","year":"1993","unstructured":"Ash GR (1993) An analytical model for adaptative routing networks. IEEE Trans Commun 41(11):1748\u20131759","journal-title":"IEEE Trans Commun"},{"key":"14_CR3","volume-title":"Dynamic routing in telecommunications networks","author":"GR Ash","year":"1998","unstructured":"Ash GR (1998) Dynamic routing in telecommunications networks. McGraw-Hill, New York"},{"key":"14_CR4","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks. Prentice-Hall, Inc., Upper Saddle River"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"J Cl\u00edmaco","year":"1982","unstructured":"Cl\u00edmaco J, Martins EQ (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11:399\u2013404","journal-title":"Eur J Oper Res"},{"key":"14_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0251-7","volume-title":"Dynamic routing in broadband networks","author":"M Conte","year":"2003","unstructured":"Conte M (2003) Dynamic routing in broadband networks. Klumwer, Dordrecht"},{"key":"14_CR7","first-page":"50","volume":"3","author":"J Craveirinha","year":"2003","unstructured":"Craveirinha J, Martins L, Gomes T, Antunes CH, Cl\u00edmaco J.(2003) A new multiple objective dynamic routing method using implied costs. J Telecommun Inf Technol 3:50\u201359","journal-title":"J Telecommun Inf Technol"},{"issue":"11","key":"14_CR8","doi-asserted-by":"crossref","first-page":"2828","DOI":"10.1109\/JLT.2003.819528","volume":"21","author":"A Elwalid","year":"2003","unstructured":"Elwalid A, Mitra D, Saniee I, Widjaja I (2003) Routing and protection in GMPLS networks: from shortest paths to optimized designs. J. Lightwave Technol 21(11):2828\u20132838","journal-title":"J. Lightwave Technol"},{"issue":"7","key":"14_CR9","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/49.414639","volume":"13","author":"A Farag\u00f3","year":"1995","unstructured":"Farag\u00f3 A, Blaabjerg S, Ast L, Gordos G, Henk T, (1995)A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration. IEEE J Select Areas Commun 13(7): 1199\u20131206","journal-title":"IEEE J Select Areas Commun"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Gelenbe E, Lent R, Montuori A, Xu Z(2002) Cognitive packet networks: QoS and performance. In: MASCOTS symposium, IEEE Computer Society.","DOI":"10.1109\/MASCOT.2002.1167055"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gelenbe E, Lent R, Nunez A(2004) Self-aware networks and QoS. In: Proceedings of, the IEEE, vol 92, pp 1478\u20131489","DOI":"10.1109\/JPROC.2004.832952"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1093\/imamci\/7.1.77","volume":"7","author":"RJ Gibbens","year":"1990","unstructured":"Gibbens RJ, Kelly FP (1990) Dynamic routing in fully connected networks. IMA J Math Control Inf 7:77\u2013111","journal-title":"IMA J Math Control Inf"},{"key":"14_CR13","first-page":"1019","volume-title":"Teletraffic science for new cost-effective systems, networks and services. ITC-12\u2019","author":"RJ Gibbens","year":"1989","unstructured":"Gibbens RJ, Kelly FP, Key PB (1989). Dynamic alternative routing \u2013 modelling and behaviour. In: Bonatti M (eds). Teletraffic science for new cost-effective systems, networks and services. ITC-12\u2019. Elsevier, North-Holland, pp. 1019\u20131025"},{"key":"14_CR14","first-page":"235","volume":"21","author":"T Gomes","year":"2001","unstructured":"Gomes T, Martins L, Craveirinha JF (2001) An efficient algorithm for calculating k shortest paths with a maximum number of arcs. Invest Operacional 21:235\u2013244","journal-title":"Invest Operacional"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Jorge L, Craveirinha J, Gomes T (2004) Network performance of multi-service circuit switched networks:simulational comparison of variants of DAR and RTNR. In: International symposium on modelling, analysis, and simulation of computer and telecommunications systems (MASCOTS04). The IEEE Computer Society, pp 513\u2013521","DOI":"10.1109\/MASCOT.2004.1348307"},{"issue":"10","key":"14_CR16","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1109\/TCOM.1981.1094894","volume":"29","author":"JS Kaufman","year":"1981","unstructured":"Kaufman JS (1981) Blocking in a shared resource environment. IEEE Trans Commun 29(10): 1474\u20131481","journal-title":"IEEE Trans Commun"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"112","DOI":"10.2307\/1427273","volume":"20","author":"FP Kelly","year":"1988","unstructured":"Kelly FP (1988) Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv Appl Probabil 20:112\u2013144","journal-title":"Adv Appl Probabil"},{"issue":"4","key":"14_CR18","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/moor.15.4.771","volume":"15","author":"FP Kelly","year":"1990","unstructured":"Kelly FP (1990) Routing and capacity allocation in networks with trunk reservation. Math Operat Res 15(4):771\u2013793","journal-title":"Math Operat Res"},{"issue":"12","key":"14_CR19","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MCOM.2002.1106159","volume":"40","author":"F Kuipers","year":"2002a","unstructured":"Kuipers F, Korkmaz T, Krunz M, Mieghem P (2002a) An overview of constraint-based path selection algorithms for QoS routing. IEEE Commun Mag 40(12):50\u201355","journal-title":"IEEE Commun Mag"},{"key":"14_CR20","unstructured":"Kuipers F, Korkmaz T, Krunz M, Mieghem P (2002b) A review of constraint-based routing algorithms, Technical report, Delft University of Technology. http:\/\/wwwtvs.et.tudelft.nl\/people\/fernando\/papers\/TRreviewqosalg.pdf"},{"issue":"4","key":"14_CR21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/65.397043","volume":"9","author":"WC Lee","year":"1995","unstructured":"Lee WC, Hluchyj MG, Humblet PA (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):46\u201355","journal-title":"IEEE Netw"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"EQV Martins","year":"1999","unstructured":"Martins EQV, Pascoal MMB, Santos JLE (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10:247\u2013263","journal-title":"Int J Found Comput Sci"},{"key":"14_CR23","unstructured":"Martins L, Craveirinha J, Cl\u00edmaco J (2003a), A new multiobjective dynamic routing method for multiservice networks \u2013 modelling and performance evaluation, Technical report, INESC \u2013 Coimbra"},{"key":"14_CR24","first-page":"60","volume":"3","author":"L Martins","year":"2003b","unstructured":"Martins L, Craveirinha J, Cl\u00edmaco J, Gomes T (2003b) Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks. J Telecommun Inf Technol 3:60\u201366","journal-title":"J Telecommun Inf Technol"},{"issue":"3","key":"14_CR25","first-page":"828","volume":"166","author":"L Martins","year":"2005","unstructured":"Martins L, Craveirinha J, Cl\u00edmaco J, Gomes T (2005) On a bi-dimensional dynamic alternative routing method. Eur J Operat Res Spec Issue Adv Complex Syst Model 166(3):828\u2013842","journal-title":"Eur J Operat Res Spec Issue Adv Complex Syst Model"},{"issue":"12","key":"14_CR26","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/MCOM.2002.1106166","volume":"40","author":"D Medhi","year":"2002","unstructured":"Medhi D (2002) QoS routing computation with path caching: a framework and network performance. IEEE Commun Mag 40(12):106\u2013113","journal-title":"IEEE Commun Mag"},{"issue":"6","key":"14_CR27","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/90.365417","volume":"2","author":"D Mitra","year":"1994","unstructured":"Mitra D, Morrison JA (1994) Erlang capacity and uniform approximations for shared unbuffered resources. IEEE\/ACM Transact Netw 2(6):558\u2013570","journal-title":"IEEE\/ACM Transact Netw"},{"issue":"1","key":"14_CR28","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/bltj.2268","volume":"6","author":"D Mitra","year":"2001","unstructured":"Mitra D, Ramakrishnan K (2001) Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Tech J 6(1):139\u2013151","journal-title":"Bell Labs Tech J"},{"issue":"-37","key":"14_CR29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0166-5316(99)00027-9","volume":"36","author":"D Mitra","year":"1999","unstructured":"Mitra D, Morrison JA, Ramakrishnan KG (1999) Optimization and design of network routing using refined asymptotic approximations. Perform Eval Int J 36\u201337:267\u2013288","journal-title":"Perform Eval Int J"},{"issue":"1","key":"14_CR30","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/26.68281","volume":"39","author":"D Mitra","year":"1991","unstructured":"Mitra D, Seery JB (1991) Comparative evaluation of randomized and dynamic routing strategies for circuit-switched networks. IEEE Trans Commun 39(1):102\u2013116","journal-title":"IEEE Trans Commun"},{"key":"14_CR31","unstructured":"Roberts JW (1983) Teletraffic models for the telecom 1 integrated services network. In: Proceedings of the 10th International teletraffic congress, Montreal"},{"key":"14_CR32","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"JM Rodrigues","year":"1999","unstructured":"Rodrigues JM, Cl\u00edmaco JC, Current JR (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Operat Res 26:789\u2013798","journal-title":"Comput Operat Res"},{"issue":"7","key":"14_CR33","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z Wang","year":"1996","unstructured":"Wang Z, Crowcroft J (1996). Quality-of-service routing for supporting multimedia appications. IEEE J Select Areas Commun 14(7):1228\u20131234","journal-title":"IEEE J Select Areas Commun"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0014-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-006-0014-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0014-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:46Z","timestamp":1559131966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-006-0014-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,13]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s10287-006-0014-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,13]]}}}