network coding multicast networks with qos guarantees n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Network-Coding Multicast Networks With QoS Guarantees PowerPoint Presentation
Download Presentation
Network-Coding Multicast Networks With QoS Guarantees

Loading in 2 Seconds...

play fullscreen
1 / 30

Network-Coding Multicast Networks With QoS Guarantees - PowerPoint PPT Presentation


  • 75 Views
  • Uploaded on

Network-Coding Multicast Networks With QoS Guarantees. Abdullah Şahin Hasan Saygın Arkan 10.01.2010. Outline. What we are going to present …. Define The Problem …. Solve for Unicast. Convert to Multicast. Introduction. Introduction.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Network-Coding Multicast Networks With QoS Guarantees' - lanza


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
network coding multicast networks with qos guarantees

Network-Coding Multicast Networks With QoS Guarantees

Abdullah Şahin

Hasan Saygın Arkan

10.01.2010

introduction1
Introduction
  • “Network-Coding Multicast Networks With QoSGuarantees”
    • Xuan, Y.: Lea, C.-T.
    • IEEE/ACM Transactions on Networking
    • 30 August 2010
  • Related Work
  • Terms
    • QoS, Network Coding, unicast, multicast…
problem definition
Problem Definition
  • Admission Control – How?
  • New QoS Architecture – Non-Blocking Network!
    • No admission control
  • Low throughput for multicast
    • Impractical
  • Data Transmission
    • Transmission in Client – Local Server TRIVIAL
    • Transmission in Backbone PROBLEM!
problem definition1
Problem Definition
  • Transmission in Backbone PROBLEM!
unicast
Unicast

Data Packet

Data Packet

multicast
Multicast

Data Packet

Data Packet

Data Packet

Data Packet

unicast solution
Unicast Solution
  • tij= traffic rate from i edge to j edge
  • αi= ingress traffic & βi = egress traffic
  • (αi, βi) = (Θ αi’ , Θ βi’)
  • Task is maximizing Θ

Edge Router

αi= ingress traffic

βi = egress traffic

unicast solution1
Unicast Solution
  • Σtij< αi’
  • Σtij< βi’
  • Not Applicable on Multicast
    • α = β for unicast, but not for multicast

Edge Router

multicast solution
Multicast Solution

G = multicast edge group

= { sg, D(g), tg }

source, destination set, data rate

Binary Vectors:

ϒg(i) = 1, if i = sgδg(j) = 1, if j € D(g)

0, otherwise 0, otherwise

multicast solution1
Multicast Solution
  • Σϒg(i) . tg< αi’ - ingress traffic
  • Σδg(j). tg< βi’ - egress traffic
  • tij = Σ(δg(j) .ϒg(i) . tg)
optimal routing3
Optimal Routing
  • For IP networks
    • Calculation on weights
  • MPLS-Type Explicit Routing Networks
    • Arbitrarily chosen nodes, and calculation of max loaded link
numerical results1
Numerical Results
  • Constraint-Based Routing Approach
  • Non-Blocking Based Approach
    • 15 Nodes, 62 directed links, capacity of 300.
    • 10 consecutive rejects = fully loaded
    • Number of receivers per multicast flow is random (binomial distribution [2, N-1] , N is total edge
numerical results2
Numerical Results
  • Nonblocking Multicast Networks
  • b/a ratio, average fan-out = 3, 15 edge nodes
numerical results3
Numerical Results
  • Nonblocking Multicast Networks
  • b/a ratio, average fan-out = 4, 15 edge nodes
numerical results4
Numerical Results
  • Nonblockingvs CBR
  • 5 edge nodes, average fan-out = 3
numerical results5
Numerical Results
  • Nonblockingvs CBR
  • 15 edge nodes, average fan-out = 3
numerical results6
Numerical Results
  • Nonblockingvs CBR
  • 15 edge nodes, average fan-out = 4
conclusion
Conclusion
  • Better to have admission control at the edge, NOT inside it!
  • Non-Blocking removes that need
  • Main Problem – low throughput
  • Optimal Paths in Unicast = Optimal Paths in Multicast Nonblocking with Network Coding