Design of an IPTV Multicast System for Internet Backbone Networks

T H Szymanski,D Gilbert

doi:10.1155/2010/169140

Abstract

The design of an IPTV multicast system for the Internet backbone network is presented and explored through extensive simulations. In the proposed system, a resource reservation algorithm such as RSVP, IntServ, or DiffServ is used to reserve resources (i.e., bandwidth and buffer space) in each router in an IP multicast tree. Each router uses an Input-Queued, Output-Queued, or Crosspoint-Queued switch architecture with unity speedup. A recently proposedRecursive Fair Stochastic Matrix Decompositionalgorithm used to compute near-perfect transmission schedules for each IP router. The IPTV traffic is shaped at the sources usingApplication-Specific Token Bucker Traffic Shapers, to limit the burstiness of incoming network traffic. The IPTV traffic is shaped at the destinations usingApplication-Specific Playback Queues, to remove residual network jitter and reconstruct the original bursty IPTV video streams at each destination. All IPTV traffic flows are regenerated at the destinations with essentially zero delay jitter and essentially-perfect QoS. The destination nodes deliver the IPTV streams to the ultimate end users using the same IPTV multicast system over a regional Metropolitan Area Network. It is shown that all IPTV traffic is delivered with essentially-perfect end-to-end QoS, with deterministic bounds on the maximum delay and jitter on each video frame. Detailed simulations of an IPTV distribution system, multicasting several hundred high-definition IPTV video streams over several essentially saturated IP backbone networks are presented.

Highlights

Multimedia traffic such as IPTV and video-on-demand represent a rapidly growing segment of the total Internet traffic
The provisioned GR rate of 440 Mbps per multicast tree established in Section 2 requires 11 time-slot reservations per scheduling frame
The low-jitter schedules remove most of the cell delay jitter associated with the sub optimal dynamic scheduling algorithms used in existing IP routers and minimize the amount of buffering required in the IP routers

Summary

Introduction

Multimedia traffic such as IPTV and video-on-demand represent a rapidly growing segment of the total Internet traffic. The US Federal Communication Commission (FCC) has required that all TV broadcasts occur in digital format in 2009, and the growing fraction of multimedia traffic threatens to overwhelm the current Internet infrastructure. A “sm√all buffer rule” was proposed in [32], where B = O(C · T/ N), and where N is the number of long-lived TCP flows traversing the router. With the same parameters, [33] suggests that average buffer sizes of between 20–50 IP packets or equivalently about 30,000–75,000 bytes of memory may suffice if 3 important conditions can be met; (a) the jitter of incoming traffic at the source node is sufficiently small, (b) the IP routers introduce a sufficiently small jitter, and (c) 10–15% of the throughput is sacrificed. The paper in [33]

Methods

Results

Conclusion