{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:03:06Z","timestamp":1747713786830,"version":"3.40.5"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":["Journal of Heuristics"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1023\/a:1009609609199","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"21-38","source":"Crossref","is-referenced-by-count":3,"title":["ATM Routing Algorithms for Multimedia Traffic in Private ATM Networks"],"prefix":"10.1007","volume":"6","author":[{"given":"R.","family":"Izmailov","sequence":"first","affiliation":[]},{"given":"A.","family":"Iwata","sequence":"additional","affiliation":[]},{"given":"B.","family":"Sengupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"255496_CR1","unstructured":"Cormen, T., C. Leiserson, and R. Rivest. (1997). Introduction to Algorithms. MIT press."},{"key":"255496_CR2","volume-title":"Optimization Algorithms for Networks and Graphs","author":"J.R. Evans","year":"1992","unstructured":"Evans, J.R. and E. Minieka. (1992). Optimization Algorithms for Networks and Graphs. NewYork: Marcel Dekker, Inc."},{"key":"255496_CR3","volume-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability-A Guide to the Theory of NP-Completeness. California, USA: Freeman."},{"key":"255496_CR4","doi-asserted-by":"crossref","unstructured":"Guillen, A., R.N. Kia, and B. Sales. (1993). \u201cAn Architecture for Virtual Circuit\/QoS Routing.\u201d Proceedings of 1993 International Conference on Network Protocols. Los Alamitos, CA.","DOI":"10.1109\/ICNP.1993.340930"},{"key":"255496_CR5","unstructured":"Izmailov, R., A. Iwata, D.-S. Lee, G. Ramamurthy, B. Sengupta, and H. Suzuki. (1995). \u201cRouting Algorithms for ATM Networks with Multiple Quality of Service Requirements.\u201d Proceedings of the First Workshop on ATM Traffic Management, Paris, France. pp. 349\u2013356."},{"key":"255496_CR6","first-page":"999","volume":"8","author":"A. Iwata","year":"1996","unstructured":"Iwata, A., R. Izmailov, D.-S. Lee, G. Ramamurthy, B. Sengupta, and H. Suzuki. (1996). \u201cATM routing algorithms with multiple QOS requirements for multimedia internetworking,\u201d IEICE Transactions on Communications, E79-B, 8, pp. 999\u20131007.","journal-title":"IEICE Transactions on Communications, E79-B"},{"key":"255496_CR7","unstructured":"Jordan, T.P., and M.J. Morse. (1994). \u201cRouting Algorithms in ATM Networks.\u201d Proceedings of IEE Eleventh UK Teletraffic Symposium. London, UK."},{"key":"255496_CR8","doi-asserted-by":"crossref","unstructured":"Lee, W.C., M.G. Hluchyj, and P.A. Humblet. (1995). \u201cRouting subject to service constraints in integrated communication networks,\u201d IEEE Network, pp. 46\u201355.","DOI":"10.1109\/65.397043"},{"key":"255496_CR9","unstructured":"PNNI 1.0. (1996). Private Network-Network interface Specification Version 1.0 (PNNI 1.0)."},{"key":"255496_CR10","unstructured":"Zhu, T., C. Liu, and H.T. Mouftah. (1995). \u201cDynamic Routing for Multimedia Traffic over ATM Networks.\u201d Proceedings of IEEE Symposium on Computers and Communications, Alexandria, Egypt, pp. 91\u201397."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009609609199.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009609609199\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009609609199.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:55:18Z","timestamp":1747652118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009609609199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["255496"],"URL":"https:\/\/doi.org\/10.1023\/a:1009609609199","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}