{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T06:40:20Z","timestamp":1698561620540},"reference-count":13,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3299,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1999,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper shows that the genetic algorithm can be used to solve the delay\u2010constrained least\u2010cost least\u2010inter\u2010destination\u2010delay\u2010variation multicast problem efficiently. The proposed genetic algorithm performs well when the number of destination nodes is small relative to the size of the network.<\/jats:p>","DOI":"10.1002\/ett.4460100506","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T13:50:44Z","timestamp":1221227444000},"page":"513-516","source":"Crossref","is-referenced-by-count":6,"title":["Letter Computation of Constrained Multicast Trees Using a Genetic Algorithm"],"prefix":"10.1002","volume":"10","author":[{"given":"Quan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Langendoerfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"IEEE Journal on Selected Areas in Communications 1997 15 3 Special issue on Network Support for Multipoint Communications","DOI":"10.1109\/JSAC.1997.564127"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"e_1_2_1_4_2","unstructured":"R.Widyono The Design and Evaluation of Routing Algorithms for Real\u2010Time Channels. Technical Report TR\u201094\u2013024 Tenet Group Department of EECS University of California at Berkeley 1994."},{"key":"e_1_2_1_5_2","unstructured":"Q.Zhu M.Parsa J. J.Garcia\u2010Luna\u2010Aceves A Source\u2010Based Algorithm for Near\u2010Optimum Delay\u2010Constrained Multicasting. InProc. IEEE\/NFOCOM pages377\u2013385 1995."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.564133"},{"key":"e_1_2_1_7_2","unstructured":"B. K.Haberman G. N.Rouskas Cost Delay and Delay Variation Conscious Multicast Routing. Technical Report TR\u201097\u201303 Dept. of Computer Science North Carolina State University Raleigh March1997."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260403"},{"issue":"3","key":"e_1_2_1_10_2","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/49.564132","article-title":"Evaluation of Multicast Routing Algorithms for Real\u2010Time Communication on High\u2010Speed Networks","volume":"15","author":"Salama H. F.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"e_1_2_1_11_2","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J. H.","year":"1975"},{"key":"e_1_2_1_12_2","volume-title":"Genetic Algorithms in search, optimization and Machine Learning","author":"Goldberg D. E.","year":"1989"},{"key":"e_1_2_1_13_2","unstructured":"Q.Sun A Genetic Algorithm for Delay\u2010Constrained Minimum\u2010Cost Multicasting. Technical Report Institute of Operating Systems and Computer Networks TU Braunschweig Bueltenweg 74\/75 38106 Braunschweig Germany Jan. 1999 (available from http: \/\/www.cs.tu\u2010bs.de\/\u223csun\/GA\u2010s.ps)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460100506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460100506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T21:39:56Z","timestamp":1698529196000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460100506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["10.1002\/ett.4460100506"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460100506","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}