{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T08:35:34Z","timestamp":1700037334777},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Commun. Netw."],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1109\/jcn.2002.6596917","type":"journal-article","created":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T19:47:04Z","timestamp":1413488824000},"page":"246-255","source":"Crossref","is-referenced-by-count":11,"title":["Efficient implementations of a delay-constrained least-cost multicast algorithm"],"prefix":"10.23919","volume":"4","author":[{"given":"Gang","family":"Feng","sequence":"first","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]},{"given":"Niki","family":"Pissinou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref12","first-page":"144","article-title":"QoSMIC: Quality of service sensitive multicast internet proto cot","author":"faloutsos","year":"1998","journal-title":"SIGCOMM '98"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2000.6596737"},{"key":"ref14","author":"lawler","year":"1976","journal-title":"Combinatorial Optimization and Matroids Holt Rinehart and Winston"},{"key":"ref15","article-title":"Fast algorithms for delay-constrained least-cost unicast routinq","author":"feng","year":"2000","journal-title":"shortened version presented on INFORMS'200t Miami Beach"},{"key":"ref16","article-title":"Laqranqe relaxation based method for the QoS routing problem","author":"juttner","year":"2001","journal-title":"INFOCOM'200t"},{"key":"ref17","article-title":"The design and evaluation of routing algorithms for realtime channels","author":"widyono","year":"1994","journal-title":"Tech Rep ICSI TR-94-024 University of California at Berkley International Computer Science Institute"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref4","first-page":"377","article-title":"A source-based algorithm for delay-constrained minimum-cost multicasting","volume":"1","author":"zhu","year":"1995","journal-title":"IEEE INFO-COM'95"},{"key":"ref27","first-page":"594","article-title":"How to model an inter-network","author":"zegura","year":"1996","journal-title":"INFOCOM'96"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/49.564132"},{"key":"ref6","article-title":"OSPF version 2","author":"moy","year":"1998","journal-title":"Stands track RFC 2328 IETE"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/90.720901"},{"key":"ref8","article-title":"Routinq information protocol","author":"hedric","year":"1988","journal-title":"RFC 1058"},{"key":"ref7","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 Trans Net-working"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193338"},{"key":"ref9","year":"0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/65.752646"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref22","first-page":"2273","article-title":"Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relax-ation","volume":"4","author":"feng","year":"2002","journal-title":"ICCAD '02"},{"key":"ref21","article-title":"Heuristic and exact algorithms for QoS routing with multiple constraints","author":"feng","year":"0","journal-title":"IEICE Trans Communications"},{"key":"ref24","first-page":"1433","article-title":"An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership","author":"hong","year":"1998","journal-title":"INFO-COMM'98"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref25","article-title":"An approximate algorithm for combinatorial optimization problems with two parameters","author":"blokh","year":"1995","journal-title":"IMADA preprint PP-1995-14 (Department of Mathematics and Computer Science Univ of Southern Denmark)"}],"container-title":["Journal of Communications and Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5449605\/6596908\/06596917.pdf?arnumber=6596917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T17:38:32Z","timestamp":1621359512000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6596917\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jcn.2002.6596917","relation":{},"ISSN":["1229-2370","1976-5541"],"issn-type":[{"value":"1229-2370","type":"print"},{"value":"1976-5541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}