Abstract

Abstract 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.

Highlights

  • With the advancement of broadband network deployment and digital multimedia streaming technology to residences, the Internet protocol television (IPTV) service has been pervasively adapted and actively studied.The IPTV is multimedia services delivered over Internet protocol (IP)-based networks managed to support the required level of quality of service (QoS)/quality of experience (QoE)

  • This paper presents a new dynamic multicast routing algorithm for broadband IPTV services that satisfies bandwidth constraints with the minimum usage of bandwidth in order to accommodate the feature of the IPTV network http://jwcn.eurasipjournals.com/content/2013/1/127 environment where the multicast channel changes rapidly

  • From a traffic engineering perspective, the residual bandwidth is considered as a criterion for measuring the acceptance rate of the future request on the multicast routing path

Read more

Summary

Introduction

With the advancement of broadband network deployment and digital multimedia streaming technology to residences, the Internet protocol television (IPTV) service has been pervasively adapted and actively studied. From the perspective of QoS/QoE, the IPTV service should provide a two-way interactive communication between the content provider and end-users to efficiently satisfy the broadband capacity requirement of a large number of viewers, for which IP multicast is considered as a promising solution. We propose a new dynamic multicast routing algorithm that satisfies bandwidth constraints with the minimum usage of bandwidth and apply it to three different algorithms. The performance of the proposed algorithm is measured in terms of the cost of the multicast tree found and evaluated through simulations under different network topologies. Minimum interference routing algorithm (MIRA) that aims to select path as to ensure that the chosen path blocks future requests to the least possible extent is proposed [12]. There is a tradeoff between complexity of computing the interferences and the (b)

System model and mathematical formulation
Online algorithm
Computational cost
Bandwidth constraint multicast routing algorithms
Performance evaluation
Remarks
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.