{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T05:07:17Z","timestamp":1682485637211},"reference-count":29,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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 Communications"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0140-3664(02)00210-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"759-765","source":"Crossref","is-referenced-by-count":12,"title":["Optimal multichannel data transmission in computer networks"],"prefix":"10.1016","volume":"26","author":[{"given":"Guoliang","family":"Xue","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00210-4_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","article-title":"Routing to multiple destinations in computer networks","volume":"31","author":"Bharath-Kumar","year":"1983","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","article-title":"Finding the k quickest simple paths in a network","volume":"50","author":"Chen","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(93)90057-G","article-title":"On the quickest path problem","volume":"46","author":"Chen","year":"1993","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB5","unstructured":"J. Czyzyk, S. Mehrotra, M. Wagner, S.J. Wright, PCx User Guide (Version 1.1), Technical Report OTC96\/01, Optimization Technology Center, Argonne National Lab and Northwestern University."},{"key":"10.1016\/S0140-3664(02)00210-4_BIB6","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.1080\/00207729408949334","article-title":"The multichannel quickest-path problem","volume":"25","author":"Dai","year":"1994","journal-title":"International Journal of Systems Sciences"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","article-title":"Constructing maximal dynamic flows from static flows","volume":"6","author":"Ford","year":"1958","journal-title":"Operations Research"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB8","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB9","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB10","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/0167-8191(92)90048-C","article-title":"Distributed algorithms for the quickest path problem","volume":"18","author":"Hung","year":"1992","journal-title":"Parallel Computing"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB11","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/90.748092","article-title":"A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks","volume":"6","author":"Jia","year":"1998","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB12","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1016\/S0140-3664(97)00095-9","article-title":"A delay-bounded multicast routing algorithm in WANs","volume":"20","author":"Jia","year":"1997","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-60220-8_71","article-title":"On the computation of fast data transmission in networks with capacities and delays","volume":"9555","author":"Kagaris","year":"1995","journal-title":"WADS'95, Lectures Notes in Computer Science"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J","article-title":"Transmissions in a network with capacities and delays","volume":"33","author":"Kagaris","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(93)90214-T","article-title":"The all-pairs quickest path problem","volume":"45","author":"Lee","year":"1993","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01193338","article-title":"Effcienmt solutions to multicast routing in communication networks","volume":"1","author":"Makki","year":"1996","journal-title":"Mobile Networks and Applications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB17","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/90.720901","article-title":"An iterative algorithm for delay-constrained minimum-cost multicasting","volume":"6","author":"Parsa","year":"1998","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB19","doi-asserted-by":"crossref","unstructured":"N.S.V. Rao, G.L. Xue, Private communications, November 30, 1999.","DOI":"10.1080\/00103629909370271"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB20","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/4234.625044","article-title":"Algorithms for minimum end-to-end delay paths","volume":"1","author":"Rao","year":"1997","journal-title":"IEEE Communications Letters"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB21","first-page":"11","article-title":"QoS Routing via multiple paths using bandwidth reservation","author":"Rao","year":"1998","journal-title":"IEEE INFOCOM'98, The Conference on Computer Communications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB22","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithms for the quickest path problem and the enumeration of quickest paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB23","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB24","series-title":"Introduction to Graph Theory","author":"West","year":"1996"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB25","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/4234.681357","article-title":"End-to-end data paths: quickest or most reliable?","volume":"2","author":"Xue","year":"1998","journal-title":"IEEE Communications Letters"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB26","first-page":"610","article-title":"Provably good approximation to minimum cost delay-constrained multicast trees","author":"Xue","year":"1999","journal-title":"IC3N'99: IEEE International Conference on Computer and Communications and Networks"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB27","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/26.768755","article-title":"Optimal multicast trees in communication systems with channel capacities and channel reliabilities","volume":"47","author":"Xue","year":"1999","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB28","first-page":"22","article-title":"Minimum time message transmission in networks","author":"Xue","year":"1992","journal-title":"Proceedings of the IEEE ICCI'92, International Conference on Computing and Information"},{"key":"10.1016\/S0140-3664(02)00210-4_BIB29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0020-0190(98)00047-7","article-title":"Fast data transmission and maximal dynamic flow","volume":"66","author":"Xue","year":"1998","journal-title":"Information Processing Letters"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T04:51:17Z","timestamp":1682398277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":29,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0140366402002104"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00210-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}