{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:44:12Z","timestamp":1764402252835},"reference-count":26,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1389-1286(01)00222-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T10:29:16Z","timestamp":1034591356000},"page":"407-423","source":"Crossref","is-referenced-by-count":97,"title":["Hop-by-hop quality of service routing"],"prefix":"10.1016","volume":"37","author":[{"given":"Piet","family":"Van Mieghem","sequence":"first","affiliation":[]},{"given":"Hans","family":"De Neve","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Kuipers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(01)00222-5_BIB1","doi-asserted-by":"crossref","unstructured":"G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, QoS Routing Mechanisms and OSPF extensions, RFC 2676, August 1999","DOI":"10.17487\/rfc2676"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB2","doi-asserted-by":"crossref","unstructured":"G. Apostolopoulos, R. Guerin, S. Kamat, S.K. Tripathi, Improving QoS routing performance under inaccurate link state information, ITC16, 1999, pp. 1351\u20131362","DOI":"10.1109\/GLOCOM.1999.830168"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB3","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB4","unstructured":"S. Chen, K. Nahrstedt, On finding multi-constrained paths, Proc. ICC'98, Atlanta, Georgia, 1998"},{"issue":"8","key":"10.1016\/S1389-1286(01)00222-5_BIB5","doi-asserted-by":"crossref","first-page":"1488","DOI":"10.1109\/49.780354","article-title":"Distributed quality-of-service routing in ad hoc networks","volume":"17","author":"Chen","year":"1999","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/S1389-1286(01)00222-5_BIB6","unstructured":"E.I. Chong, S. Maddila, S. Morley, On finding single-source single-destination k shortest paths, J. Comput. Inf., special issue ICCI'95, 1995, pp. 40\u201347"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB7","author":"Cormen","year":"1991"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB8","doi-asserted-by":"crossref","unstructured":"H. De Neve, P. Van Mieghem, A multiple quality of service routing algorithm for PNNI, IEEE ATM Workshop, Fairfax, May 26\u201329, 1998, pp. 324\u2013328","DOI":"10.1109\/ATM.1998.675192"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB9","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0140-3664(99)00225-X","article-title":"TAMCRA: a tunable accuracy multiple constraints routing algorithm","volume":"23","author":"De Neve","year":"2000","journal-title":"Comput. Commun."},{"key":"10.1016\/S1389-1286(01)00222-5_BIB10","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB11","unstructured":"G.H. Golub, C.F. Van Loan, Matrix Computations, first ed., North Oxford Academic, Oxford, 1983"},{"issue":"3","key":"10.1016\/S1389-1286(01)00222-5_BIB12","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/90.779203","article-title":"QoS routing in networks with inaccurate information: theory and algorithms","volume":"7","author":"Gu\u00e9rin","year":"1999","journal-title":"IEEE\/ACM Trans. Network"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB13","unstructured":"L. Guo, I. Matta, Search space reduction in QoS routing, Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, Texas, June 1999"},{"issue":"1","key":"10.1016\/S1389-1286(01)00222-5_BIB14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S1389-1286(01)00222-5_BIB15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","article-title":"The shortest path problem with two objective functions","volume":"25","author":"Henig","year":"1985","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S1389-1286(01)00222-5_BIB16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constraints","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB17","doi-asserted-by":"crossref","unstructured":"T. Korkmaz, M. Krunz, Multi-constrained optimal path selection, INFOCOM 2001","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB18","unstructured":"F.A. Kuipers, Hop-by-hop routing with QoS constraints, Master Thesis in Electrical Engineering at Delft University of Technology, 2000"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB19","unstructured":"H.L. Royden, Real Analysis, third ed., Macmillan Publishing Company, New York, 1988"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB20","doi-asserted-by":"crossref","unstructured":"B. Sales, P. Van Mieghem, Dual-mode routing: a general framework for IP over ATM integrated routing, Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC'98), June 30\u2013July 2, Athens (Greece), 1998, pp. 326\u2013330","DOI":"10.1109\/ISCC.1998.702541"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB21","unstructured":"D.L. Tennenhouse, S.J. Garland, L. Shrira, M.F. Kaashoek, From Internet to ActiveNet, RFC, January, http:\/\/www.tns.lcs.mit.edu\/publications\/rfc96\/, 1996"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB22","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem, H. De Neve, Aspects of quality of service routing, SPIE'98, Boston, November 1\u20135, [3529A-05], 1998","DOI":"10.1117\/12.333731"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB23","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem, A lower bound for the end-to-end delay in networks: Application to voice over IP, IEEE Globecom'98, November 8\u201312, Sydney (Australia), 1998, pp. 2508\u20132513","DOI":"10.1109\/GLOCOM.1998.775987"},{"key":"10.1016\/S1389-1286(01)00222-5_BIB24","unstructured":"P. Van Mieghem, G. Hooghiemstra, R. van der Hofstad, A scaling law for the hopcount in Internet, Delft University of Technology, report 2000125, 2000, http:\/\/wwwtvs.et.tudelft.nl\/people\/piet\/telconference.html"},{"issue":"7","key":"10.1016\/S1389-1286(01)00222-5_BIB25","first-page":"1188","article-title":"QoS routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/S1389-1286(01)00222-5_BIB26","unstructured":"Z. Zhang, C. Sanchez, B. Salkewicsz, E. Crawley, Quality of service extensions to OSPF or quality of service path first routing (QOSPF), draft-zhang-qos-ospf-01, 1997"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128601002225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128601002225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:54:40Z","timestamp":1555768480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128601002225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1389128601002225"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(01)00222-5","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}