"Infrastructure Design for IPTV Services,"

517 views

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
517
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
18
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • OLT: optical line termination
  • "Infrastructure Design for IPTV Services,"

    1. 1. Infrastructure Design for IPTV Services IPTV Asia November 8-9, 2006 Grand Copthorne Waterfront Hotel, Singapore Sue Moon Joint Work with Meeyoung Cha (KAIST) W. Art Chaovalitwongse (Rutgers/DIMACS) Gagan Choudhury, Zihui Ge, Aman Shaikh, Jenniver Yates (AT&T)
    2. 2. Push behind IPTV <ul><li>TV service over IP </li></ul><ul><ul><li>Replacement of TV distribution networks </li></ul></ul><ul><ul><li>Core service of “Triple Play” (voice, data, video) and “Quadruple Play” (+wireless/mobile) </li></ul></ul><ul><li>Evolution Path </li></ul><ul><ul><li>Controversy over distinction between broadcasting and communication </li></ul></ul><ul><ul><li>Bundled vs blended services </li></ul></ul><ul><ul><li>As seen here so far!  </li></ul></ul>
    3. 3. Technical Challenges of IPTV <ul><li>Distribution network </li></ul><ul><ul><li>WAN, MAN, and access technologies </li></ul></ul><ul><ul><ul><li>Resilient design required </li></ul></ul></ul><ul><ul><li>QoS guarantee </li></ul></ul><ul><ul><ul><li>Same level of quality as today’s TV offers </li></ul></ul></ul><ul><li>Platform </li></ul><ul><ul><li>Standardizations: AV coding, EPG/ESG (eletronic programming/service guide), device mgmt, ... </li></ul></ul><ul><ul><li>Middleware, settop box </li></ul></ul><ul><ul><li>DRM (digital rights mgmt) </li></ul></ul><ul><ul><ul><li>Today’s conditional access system not enough </li></ul></ul></ul>
    4. 4. Talk Outline <ul><li>Service Architecture Overview </li></ul><ul><li>Comparison of Design Choices [Cha06-1] </li></ul><ul><li>Path Protection Routing in WDM Mesh Networks [Cha06-2] </li></ul><ul><li>Efficient and Scalable Algorithms [Cha06-3] </li></ul>
    5. 5. Service Architecture of IPTV SHO Regional Network Video Hub Office (VHO) 2 SHOs and 40 VHOs across the US customers Regional Network Backbone Distribution Network Super Hub Offices (SHO) VHO VHO Broadcast TV VoD Regional Network How can we provide reliable IPTV services over the backbone network?
    6. 6. IPTV Traffic <ul><li>Type </li></ul><ul><ul><li>Broadcast TV: realtime, 1-3Gb/s </li></ul></ul><ul><ul><li>Popular VoD: non-realtime download to VHOs </li></ul></ul><ul><ul><li>Niche (esoteric) VoD: realtime, 0-3 Gb/s per VHO </li></ul></ul><ul><li>Characteristics </li></ul><ul><ul><li>Uni-directional and high-bandwidth </li></ul></ul><ul><ul><li>High traffic variability expected for VoD </li></ul></ul><ul><ul><li>Multicast for broadcast TV / unicast for VoD </li></ul></ul>
    7. 7. Comparison of Design Choices
    8. 8. Design Space <ul><ul><li>Technology: layer 1 optical vs. layer 3 IP/MPLS </li></ul></ul><ul><ul><li>Service layer topology: hub-and-spoke vs. meshed (ring-based) </li></ul></ul><ul><ul><li>Access connections: dual-homed vs. ring </li></ul></ul>Dual-homed Ring Backbone Backbone VHO
    9. 9. Design Space <ul><ul><li>Reliability </li></ul></ul><ul><ul><ul><li>Goal: resilient to single SHO/router/link failures </li></ul></ul></ul><ul><ul><ul><li>Mechanisms: Fast-failover + routing protocols </li></ul></ul></ul>working path Src Dst Failure switching Optical layer SONET protection Src Dst working path protection path IP layer fast-reroute (FRR) Failure
    10. 10. Potential IPTV Designs <ul><ul><li>New dedicated IP backbone for IPTV </li></ul></ul><ul><ul><li>Integrating with existing IP backbone </li></ul></ul><ul><ul><li>Dedicated overlay over existing IP backbone </li></ul></ul><ul><ul><li>Directly inter-connect IP routers (no backbone) </li></ul></ul><ul><ul><li>Integrating with existing optical backbone </li></ul></ul>IP designs Optical design
    11. 11. Alt #1: Integrate With Existing IP Backbone SHO SHO Backbone VHO VHO <ul><li>Support IPTV as multicast application (VoD as unicast) </li></ul><ul><ul><li>VHO receives single stream from the nearest SHO </li></ul></ul><ul><ul><li>Single network to manage </li></ul></ul><ul><ul><li>Backbone links are shared (careful QoS) </li></ul></ul><ul><ul><li>Various access connections, fast-failover schemes </li></ul></ul>
    12. 12. Alt #2: Dedicated Overlay of Existing IP Backbone Backbone SHO SHO VHO VHO <ul><li>Inter-connect common backbone routers with dedicated links </li></ul><ul><ul><li>Backbone links are dedicated for IPTV (no QoS) </li></ul></ul><ul><ul><li>Overhead for managing overlay </li></ul></ul><ul><ul><li>Various access connections, fast-failover schemes </li></ul></ul>
    13. 13. Alt #3: Flat IP (No Backbone) <ul><li>Connect geographically close VHOs into regional rings </li></ul><ul><li>Inter-connect rings with long haul links </li></ul><ul><li>Security is higher than using IP backbone </li></ul><ul><li>No access part </li></ul><ul><li>Fast-failover </li></ul><ul><li>Meshed topology (carry “ through ” traffic) </li></ul>Long haul links SHO SHO VHO VHO
    14. 14. Alt #4: Integrating with Existing Optical Backbone <ul><li>Multicast capabilities at optical nodes (new technology) </li></ul><ul><li>SHOs establish multicast trees, VHO receiving single best stream </li></ul><ul><li>Fast-failover is not yet supported in optical multicasting </li></ul>SHO SHO L1 network VHO
    15. 15. Review: Design Choices Technology Service layer topology Fast-failover Link capacity IP or optical SONET links, fast-reroute, or physically diverse paths Dedicated or shared Hub-and-spoke or highly meshed Access Dual-homed or ring
    16. 16. Design Instances Alt #1 Alt #2 Alt #3 Alt #4 Disjoint paths Dual-homed Time-divisioned Optical Opt-Switched SONET links Fast re-route None .. Dedicated .. Optical .. P2P-DWDM P2P-DWDM-FRR SONET links Fast re-route SONET links Fast re-route Dual-homed .. Ring .. Dedicated .. .. .. IP .. .. .. Ded-IP-HS Ded-IP-HS-FRR Ded-IP-Ring Ded-IP-Ring-FRR SONET links Fast re-route SONET links Fast re-route Dual-homed .. Ring .. Shared .. .. .. IP .. .. .. Int-IP-HS Int-IP-HS-FRR Int-IP-Ring Int-IP-Ring-FRR Fast-Failover Access Type Link-Capacity Layer Design
    17. 17. Cost Analysis: Capital Expense vs Traffic Loads M a +U b : multicast a Gb/s + unicast b Gb/s <ul><li>Increase in VoD loads has significant impact on the overall cost. </li></ul><ul><li>-> Having highly accurate VoD load forecasts is important! </li></ul>Multicast Multicast Unicast + Multicast Unicast + Multicast
    18. 18. Capital Expense Across Designs (Broadcast TV) <ul><li>Optical designs are more economical than IP-based ones. </li></ul><ul><li>Cost is dominated by access part (except for flat IP designs). </li></ul><ul><li>For IP designs, FRR is economical then using SONET links. </li></ul>
    19. 19. Access Structure vs Traffic Loads Ring access Dual-homed access multicast only multicast + VoD multicast only multicast + VoD <ul><li>Ring access is more economical when only multicast traffic is considered. Dual-homed is better for VoD (no through traffic). </li></ul><ul><li>Flat IP design becomes expensive when VoD considered. </li></ul>Dual-homed Ring
    20. 20. Summary <ul><ul><li>Explore potential IPTV designs in backbone network </li></ul></ul><ul><ul><li>Comparison across different architectural alternatives (use realistic capital cost model) </li></ul></ul><ul><ul><li>Design instances generated based on real topologies </li></ul></ul><ul><ul><li>Significant benefits of using multicast for broadcast TV </li></ul></ul><ul><ul><li>Optical design more economical than IP designs </li></ul></ul><ul><ul><li>Ring access attractive for broadcast TV </li></ul></ul><ul><ul><li>Dual-homed access attractive for VoD </li></ul></ul>
    21. 21. Path Protection Routing in WDM Mesh Networks
    22. 22. Motivation <ul><li>Optical design known most economical [cha06-01] </li></ul><ul><li>Fast fail-over not yet available in optical multicast </li></ul><ul><li>Provisioning approach in optical backbone [SRLG] </li></ul><ul><li>- Design multicast trees (from SHOs to VHOs) in a failure-resilient and cost-effective manner </li></ul>
    23. 23. What is SRLG (Shared Risk Link Group)? <ul><li>Layered architecture </li></ul><ul><li>Link failure in one layer -> multiple failures in the upper layer </li></ul><ul><li>Two disjoint links may belong to a common SRLG </li></ul>
    24. 24. Examples of SRLGs two sources multiple destinations risks path conduit bridge, tunnel
    25. 25. IPTV Backbone Design Goals <ul><li>Fault Tolerance </li></ul><ul><ul><li>Customers expect “always-on” service </li></ul></ul><ul><ul><li>Resiliency against SRLG failures </li></ul></ul><ul><ul><li>Use redundant SRLG diverse paths from SHOs to VHOs </li></ul></ul><ul><li>Low Cost </li></ul><ul><ul><li>To be competitive in the market </li></ul></ul><ul><ul><li>Each link associated with port / transport cost </li></ul></ul><ul><ul><li>Find minimum cost multicast trees </li></ul></ul>Service Requirements of IPTV
    26. 26. Path Protection Routing Problem SHO SHO VHO VHO VHO VHO Backbone VHO Path Protection Routing Problem How to create two multicast trees such that (1) provisioning cost is minimized and (2) VHOs have physically disjoint paths to SHOs?
    27. 27. Link-Diverse vs SRLG-Diverse d1 s2 s1 d2 d3 d1 s2 s1 d2 d3 (a) Link-diverse routing, cost=8 (b) SRLG-diverse routing, cost=9 risk1 risk2 risk1 risk2 unused Multicast path by s1 Multicast path by s2
    28. 28. An SRLG-Diverse Solution: Active Path First 1. Construct a minimum spanning tree from one source 2. Remove all SRLG links of the first tree 3. Build the second minimum spanning tree with remaining links d1 s2 s1 d2 d3 d1 s2 s1 d2 d3 First tree from s1 Second tree from s2 (reduced graph) (a) Active Path First routing, cost=10 risk1 risk2
    29. 29. Trap Situation of APF d1 s2 s1 d2 d3 d1 s2 s1 d2 d3 First tree from s2 Fail to find second tree from s1 (b) Active Path First routing, trap situation risk1 risk2
    30. 30. Our Provisioning Approach <ul><li>Include SRLG-diverse constraints and solve the problem thru Integer Programming (IP) </li></ul><ul><li>Compare against </li></ul><ul><ul><li>APF (Active Path First) heuristic </li></ul></ul><ul><ul><li>Less resilient source-diverse design </li></ul></ul><ul><ul><li>Less resilient link-diverse design </li></ul></ul>
    31. 31. Integer Programming Formulation Minimize total cost SRLG diversity Flow conservation
    32. 32. Applying Our IP Formulation <ul><li>Dataset 2 SHO and 40 VHO locations in the US </li></ul><ul><li>IP formulation amenable to realistic topologies! </li></ul>
    33. 33. Cost Comparison Across Designs <ul><ul><ul><li>ILP design more economical than heuristic. </li></ul></ul></ul><ul><ul><ul><li>Cost for increased reliability affordable. </li></ul></ul></ul>Most reliable Most Reliable cost Reduced reliability Reduced reliability
    34. 34. Summary <ul><li>First work on supporting IPTV on optical mesh network with SRLG constraints </li></ul><ul><li>Compact Integer Programming formulation </li></ul><ul><ul><li>Minimum design cost </li></ul></ul><ul><ul><li>SRLG-diversity shown affordable </li></ul></ul>
    35. 35. Efficient and Scalable Algorithms for Large Network Topologies
    36. 36. Motivation <ul><li>Improve path quality </li></ul><ul><ul><li>Set maximum latency </li></ul></ul><ul><ul><li>Limit # of intermediate nodes and links </li></ul></ul><ul><li>Solving an ILP exact algorithm not scalable </li></ul>Net3
    37. 37. New Heuristic Approach <ul><li>Divide-and-Conquer technique for large network topologies: </li></ul><ul><ul><li>Partition the problem into smaller ones </li></ul></ul><ul><ul><li>Solve each small problem </li></ul></ul><ul><ul><li>Integrate the solutions “well” </li></ul></ul>
    38. 38. Proposed Heuristics <ul><li>Greedy Local (GL) </li></ul><ul><ul><li>Divide into subgraphs with two sources and a destination </li></ul></ul><ul><ul><li>Solve for each graph, and consolidate solutions </li></ul></ul><ul><li>Improved Greedy Local (IGL) </li></ul><ul><ul><li>Do GL and find the minimum cost graph </li></ul></ul><ul><ul><li>Fix the shorter of the two paths and solve the rest </li></ul></ul><ul><li>Adaptive Search </li></ul><ul><ul><li>Use any routing algorithm to find initial tree </li></ul></ul><ul><ul><li>Find SRLG-diverse paths; for those w/o such, run baseline ILP. </li></ul></ul><ul><li>Modified Active Path First </li></ul><ul><ul><li>Build one MST first; then for each destination, check if a SRLG-diverse path exists. </li></ul></ul><ul><ul><li>If yes, then fix the path; otherwise, run baseline ILP. </li></ul></ul>
    39. 39. Greedy Local (GL) SHO SHO VHO VHO VHO <ul><ul><li>Step1: For each VHO, find redundant SRLG diverse paths by ILP </li></ul></ul><ul><ul><li>Step2: Consolidate solutions </li></ul></ul>SRLG diverse SRLG diverse SRLG diverse Consolidate!
    40. 40. Improved Greedy Local (IGL) SHO SHO VHO VHO VHO <ul><ul><li>Step1: Run GL </li></ul></ul><ul><ul><li>Step2: For each VHO, fix the shorter path </li></ul></ul><ul><ul><li>Step3: Find missing paths all together using ILP </li></ul></ul>Leave only shorter paths Solution from GL Find missing paths
    41. 41. Adaptive Search (AS) SHO SHO VHO VHO VHO SRLG-diverse? Yes! Then, fix as solution. SRLG-diverse? No! Then, replace with SRLG diverse paths. <ul><ul><li>Step1: Use any initial routing scheme to find paths </li></ul></ul><ul><ul><li>Step2: For each VHO, make sure paths are SRLG-diverse </li></ul></ul>Initial routing paths
    42. 42. Modified Active Path First (MAPF) <ul><ul><li>Step1: Find minimum spanning tree from one source </li></ul></ul><ul><ul><li>Step2: For each VHO, make sure SRLG counterpart part path exists </li></ul></ul><ul><ul><li>Step3: Find the missing paths all together using ILP </li></ul></ul>SHO SHO VHO VHO VHO Does SRLG-diverse counterpart path exist? Yes! Then, fix as solution. Does SRLG-diverse counterpart path exist? No! Then, replace with SRLG diverse paths. Not possible! SRLG diverse SRLG diverse Minimum spanning tree Find missing paths w/ ILP
    43. 43. Capital Expense Comparison Net5 (800sec) Net6 (2sec)
    44. 44. CAPEX Scalability Analysis Net5
    45. 45. Computation Time Analysis Net5
    46. 46. Summary <ul><li>Additional quality improvements of SRLG-diverse paths </li></ul><ul><ul><li>latency limits </li></ul></ul><ul><ul><li># of intermediate nodes and links </li></ul></ul><ul><ul><li>per-path upper bound of SRLGs </li></ul></ul><ul><li>Efficient and scalable solutions for realistic network topologies </li></ul>
    47. 47. Implications for Other Networks <ul><li>Cross-layer optimization </li></ul><ul><ul><li>Optical + IP layer info combined </li></ul></ul><ul><li>Topological constraints </li></ul><ul><ul><li>Mesh vs star </li></ul></ul><ul><ul><li>WAN vs MAN </li></ul></ul><ul><li>Cost constraints </li></ul><ul><ul><li>OXC port vs router port </li></ul></ul>
    48. 48. IPTV Service Monitoring [Kerpez] <ul><li>Elements of IPTV Service Assurance </li></ul><ul><ul><li>Subscriber management </li></ul></ul><ul><ul><ul><li>Billing, subscriptions, AAA, DRM </li></ul></ul></ul><ul><ul><li>Video headend </li></ul></ul><ul><ul><ul><li>Converged services, VoD, Broadcast </li></ul></ul></ul><ul><ul><li>Transport network </li></ul></ul><ul><ul><ul><li>IP/MPLS, Ethernet, DSLAM/OLT, Gateways </li></ul></ul></ul>
    49. 49. References <ul><li>[Cha06-1] Cha et al., “Case study: resilient backbone design for IPTV services,” IPTV Workshop (WWW 2006), Edinburgh, May, 2006. </li></ul><ul><li>[Cha06-2] Cha et al., “Path protection routing with SRLG constraints to support IPTV in WDM mesh networks,” 9 th IEEE Global Internet Symposium , Barcelona, April, 2006. </li></ul><ul><li>[Cha06-3] Cha et al., “Efficient and scalable provisioning solutions for always-on multicast streaming services,” (in submission). </li></ul><ul><li>[SRLG] Sebos et al., “Auto-discovery of shared risk link groups,” IEEE OFC , March 2001. </li></ul><ul><li>[APF] Xu et al., “On the complexity of and algorithms for finding the shortest path with a disjoint counterpart,” IEEE/ACM ToN , 14(1):147-158, 2006. </li></ul><ul><li>[Kerpez] K. Kerpez et al., “IPTV Service Assurance,” IEEE Communications , September, 206 </li></ul>

    ×