{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:37:00Z","timestamp":1648985820112},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,11]],"date-time":"2013-05-11T00:00:00Z","timestamp":1368230400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>With the rapid growth of broadband network deployment and multimedia streaming development, Internet protocol (IP) multicast networks have become a delivery mechanism for Internet protocol television (IPTV). IPTV provides a two-way interactive service to the viewers, which generates the path request for IP multicast network. Thus, it is essential to evaluate the path rejection probability accurately and further to reduce it. In this paper, we propose a new dynamic multicast routing algorithm for broadband IPTV services and apply it to three legacy algorithms. These integrated multicast routing algorithms support the minimum cost and the traffic engineering features, in order to maximize the acceptance rate for bandwidth constraint path request under IPTV service environments. Furthermore, we compare their network performances in terms of the acceptance rate and delay by experimental simulations. The simulation result gives us that the nearest node first Dijkstra algorithm can be the optimal solution of multicast connection for IPTV service delivery.<\/jats:p>","DOI":"10.1186\/1687-1499-2013-127","type":"journal-article","created":{"date-parts":[[2013,5,11]],"date-time":"2013-05-11T12:14:15Z","timestamp":1368274455000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrated multicast routing algorithms considering traffic engineering for broadband IPTV services"],"prefix":"10.1186","volume":"2013","author":[{"given":"Sungkwan","family":"Youm","sequence":"first","affiliation":[]},{"given":"Taeshik","family":"Shon","sequence":"additional","affiliation":[]},{"given":"Eui-Jik","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,11]]},"reference":[{"issue":"11","key":"748_CR1","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/MCOM.2007.4378332","volume":"45","author":"Y Xiao","year":"2007","unstructured":"Xiao Y, Du X, Zhang J, Hu F, Guizani S: Internet protocol television (IPTV): the killer application for the next generation internet. IEEE Commun. Mag. 2007, 45(11):126-134.","journal-title":"IEEE Commun. Mag"},{"issue":"4","key":"748_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MPOT.2011.940903","volume":"30","author":"MNO Sadiku","year":"2011","unstructured":"Sadiku MNO, Nelatury SR: IPTV: an alternative to traditional cable and satellite television. IEEE Potentials 2011, 30(4):44-46.","journal-title":"IEEE Potentials"},{"issue":"4","key":"748_CR3","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/JSYST.2011.2165601","volume":"5","author":"S Zeadally","year":"2011","unstructured":"Zeadally S, Moustafa H, Siddiqui F: Internet protocol television (IPTV): architecture, trends, and challenges. IEEE Syst. J. 2011, 5(4):518-527.","journal-title":"IEEE Syst. J"},{"key":"748_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289","volume-title":"Spanning Trees and Optimization Problems","author":"BY Wu","year":"2004","unstructured":"Wu BY, Chao K: Spanning Trees and Optimization Problems. Boca Raton: Chapman & Hall\/CRC Press; 2004."},{"key":"748_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Commun","author":"RM Karp","year":"1972","unstructured":"Karp RM: Reducibility among combinatorial problems. In Complexity of Computer Commun. Edited by: Miller RE, Thatcher JW. New York: Plenum; 1972:85-103."},{"key":"748_CR6","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Gareg","year":"1979","unstructured":"Gareg MR, Johnson DS: Computer and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman; 1979."},{"key":"748_CR7","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/INFCOM.1991.147651","volume-title":"Proc. The 10th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM\u201991","author":"CH Chow","year":"1991","unstructured":"Chow CH: On multicast path finding algorithms. In Proc. The 10th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM\u201991. Bal Harbour: IEEE Computer Society; 1991:1274-1283."},{"issue":"6","key":"748_CR8","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi H, Mutsuyama A: An approximate solution for the Steiner problem in graphs. Mathematic Japonica 1980, 24(6):573-577.","journal-title":"Mathematic Japonica"},{"issue":"9","key":"748_CR9","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman BM: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 1988, 6(9):1617-1622. 10.1109\/49.12889","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"748_CR10","first-page":"2086","volume-title":"Proc. The 11th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM\u201992","author":"H Tode","year":"2012","unstructured":"Tode H, Sakai Y, Yamamoto M, Okada H, Tezuka Y: Multicast routing algorithm for nodal load balancing. In Proc. The 11th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM\u201992. Orlando: IEEE Computer Society; 2012:2086-2095."},{"key":"748_CR11","first-page":"455","volume-title":"Proc. IEEE Symposium on Computers and Communications ISCC\u201902","author":"Y Seok","year":"2002","unstructured":"Seok Y, Lee Y, Choi Y, Kim C: Explicit Multicast Routing Algorithms for Constrained Traffic Engineering. In Proc. IEEE Symposium on Computers and Communications ISCC\u201902. Taormina: IEEE Computer Society; 2002:455-461."},{"key":"748_CR12","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-39404-4_19","volume":"2839","author":"G R\u00e9tv\u00e1ri","year":"2003","unstructured":"R\u00e9tv\u00e1ri G: Minimum interference routing: the precomputation perspective. Lect. Notes Comput. Sc. 2003, 2839: 246-258. 10.1007\/978-3-540-39404-4_19","journal-title":"Lect. Notes Comput. Sc"},{"issue":"4","key":"748_CR13","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TNET.2003.815302","volume":"11","author":"M Kodialam","year":"2003","unstructured":"Kodialam M, Lakshman TV, Sengupta S: Online multicast routing with bandwidth guarantees: a new approach using multicast network flow. IEEE\/ACM Trans. Netw. 2003, 11(4):676-686. 10.1109\/TNET.2003.815302","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"748_CR14","first-page":"44","volume-title":"Proc. The International Conference on Communications in Computing CIC\u201904","author":"B Rong","year":"2004","unstructured":"Rong B, Bennani M, Kadoch M, Elhakeem AK: Employing Active Admission Control as Traffic Engineering Mechanism in QoS Multicast Routing. In Proc. The International Conference on Communications in Computing CIC\u201904. Las Vegas: CSREA Press; 2004:44-50."},{"key":"748_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-44884-5_7","volume":"2707","author":"S Bhatnagar","year":"2003","unstructured":"Bhatnagar S, Nath B, Acharya A: Distributed admission control for heterogeneous multicast with bandwidth guarantees. Lect. Notes Comput. Sc. 2003, 2707: 115-134. 10.1007\/3-540-44884-5_7","journal-title":"Lect. Notes Comput. Sc"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2013-127\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T00:36:16Z","timestamp":1630542976000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2013-127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,11]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2013-127","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,11]]},"assertion":[{"value":"2 February 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2013","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"127"}}