A hierarchical characterization of a live streaming media workload
IEEE/ACM Transactions on Networking (TON)
Dimensioning multicast-enabled networks for IP-transported TV channels
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Multimedia Tools and Applications
Approximating performance measures of a triple play loss network model
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Multimedia Tools and Applications
Hi-index | 0.00 |
This paper presents three approaches to estimate the required resources in an infrastructure where digital TV channels can be delivered in unicast or multicast (broadcast) mode. Such situations arise for example in Cable TV, IPTV distribution networks or in (future) hybrid mobile TV networks. The three approaches presented are an exact calculation, a Gaussian approximation and a simulation tool. We investigate two scenarios that allow saving bandwidth resources. In a static scenario, the most popular channels are multicast and the less popular channels rely on unicast. In a dynamic scenario, the list of multicast channels is dynamic and governed by the users' behavior. We prove that the dynamic scenario always outperforms the static scenario. We demonstrate the robustness, versatility and the limits of our three approaches. The exact calculation application is limited because it is computationally expensive for cases with large numbers of users and channels, while the Gaussian approximation is good exactly for such systems. The simulation tool takes long to yield results for small blocking probabilities. We explore the capacity gain regions under varying model parameters. Finally, we illustrate our methods by discussing some realistic network scenarios using channel popularities based on measurement data as much as possible.