{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:21Z","timestamp":1742913321902,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233886"},{"type":"electronic","value":"9783540301417"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30141-7_57","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:57:27Z","timestamp":1284847047000},"page":"407-410","source":"Crossref","is-referenced-by-count":0,"title":["Load Balancing Routing in Low-Cost Parallel QoS Sensitive Network Architecture"],"prefix":"10.1007","author":[{"given":"Furong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"The ATMForum: Private Network-to-network Interface Specification Version 1.0 (pnni 1.0). fpnni-0055.000 (1996)","key":"57_CR1"},{"key":"57_CR2","volume-title":"Proceedings of GLOBECOM 2000","author":"K.-S. Lui","year":"2000","unstructured":"Lui, K.-S., Nahrstedt, K.: Topology Aggregation and Routing in Bandwidth-delay Sensitive Networks. In: Proceedings of GLOBECOM 2000, IEEE, Los Alamitos (2000)"},{"doi-asserted-by":"crossref","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications\u00a014 (1996)","key":"57_CR3","DOI":"10.1109\/49.536364"},{"key":"57_CR4","volume-title":"Computers and Intractability - A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NPCompleteness. Freeman, California (1979)"},{"doi-asserted-by":"crossref","unstructured":"Estrin, D., Rekhter, Y., Hotz, S.: Scalable Inter-Domain Routing Architecture. In: Proceedings of ACM SIGCOMM 1992, Maryland (1992)","key":"57_CR5","DOI":"10.1145\/144179.144203"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0140-3664(01)00358-9","volume":"25","author":"T. Korkmaz","year":"2002","unstructured":"Korkmaz, T., Krunz, M., Tragoudas, S.: An Efficient Algorithm for Find-ing a Path Subject to Two Additive Constraints. Computer Communications Journal\u00a025, 225\u2013238 (2002)","journal-title":"Computer Communications Journal"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30141-7_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T18:25:37Z","timestamp":1559672737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30141-7_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233886","9783540301417"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30141-7_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}