measurement and modelling i:

Upload: 23wings

Post on 30-May-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/14/2019 Measurement and Modelling I:

    1/36

    Measurement and Modelling I:End-to-End Bandwidth Measurements

    6.829 Lecture 11

    October 10, 2002

    Jacob Strauss

    1

  • 8/14/2019 Measurement and Modelling I:

    2/36

    End-to-End Measurements

    Goal: Bandwidth-Aware Applications

    Is a path fast enough? Which path is faster?

    What is bandwidth?

    Link Capacity: physical link speed (e.g. 100 Mbps Ethernet)

    for link i, link capacity ci.

    Path Capacity: minimum capacity link along a path

    C= mini=0...n(ci)

    Link Utilization: fraction of link capacity used over some time interval

    0 ui 1

    Available Bandwidth: minimum spare capacity along a path over some interval

    A = mini=0...n(1 ui)ci

    2

  • 8/14/2019 Measurement and Modelling I:

    3/36

    Example Topology

    C=10 Mbps, u=0.2C=100 Mbps, u=0.95

    C=20 Mbps, u=0.5X

    Y

    Capacity from X to Y?

  • 8/14/2019 Measurement and Modelling I:

    4/36

    Example Topology

    C=10 Mbps, u=0.2C=100 Mbps, u=0.95

    C=20 Mbps, u=0.5X

    Y

    Capacity from X to Y? C = 10Mbps

    Available bandwidth from X to Y?

  • 8/14/2019 Measurement and Modelling I:

    5/36

    Example Topology

    C=10 Mbps, u=0.2C=100 Mbps, u=0.95

    C=20 Mbps, u=0.5X

    Y

    Capacity from X to Y? C = 10Mbps

    Available bandwidth from X to Y? A = 5Mbps

    3

  • 8/14/2019 Measurement and Modelling I:

    6/36

    Problem: Capacity Estimation

    X Y

    C1

    C2

    C3

    How can we measure the path capacity between X and Y?

    4

  • 8/14/2019 Measurement and Modelling I:

    7/36

    Packet Pair on an unloaded path

    X Y

    tt

    C1

    C2

    C3

    Send two packets, of P bits each, back-to-back

    Record the difference between arrival times, t.

    Path Capacity is Pt

    5

  • 8/14/2019 Measurement and Modelling I:

    8/36

    Packet Pair Complications: Cross Traffic

    X Y

    t

    C1

    C2

    C3

    t

    other packet

    probe packet

    t >P

    C

    6

  • 8/14/2019 Measurement and Modelling I:

    9/36

    Packet Pair Complications: Multiple Queues

    X Y

    C1

    C2

    C3

    t

    other packet

    probe packet

    t

    t nyu.ron.lcs.mit.edu

    1

    500B

    500B

    sen

    tgap

    b2b

    14

  • 8/14/2019 Measurement and Modelling I:

    23/36

    New Problem: Available Bandwidth Estimation

    Can we use the same packet train to estimate A?

  • 8/14/2019 Measurement and Modelling I:

    24/36

    New Problem: Available Bandwidth Estimation

    Can we use the same packet train to estimate A?

    No, but we can determine whether P/ > A or P/ < A

    Later well build on this test to estimate A

  • 8/14/2019 Measurement and Modelling I:

    25/36

    New Problem: Available Bandwidth Estimation

    Can we use the same packet train to estimate A?

    No, but we can determine whether P/ > A or P/ < A

    Later well build on this test to estimate A

    Basic idea: instead of just comparing wn+1 to wn, compare wn to

    wn+1, wn+2, wn+3, . . .

    Method: Plot evolution of wn versus n

    15

  • 8/14/2019 Measurement and Modelling I:

    26/36

    Pathload Delay Model

    The packet train consists of K packets of size L sent at a constant

    rate R.

    Path consists ofH links, each with capacity Ci, available bandwidth

    Ai, and queue length qki when the kth probe packet arrives

  • 8/14/2019 Measurement and Modelling I:

    27/36

    Pathload Delay Model

    The packet train consists of K packets of size L sent at a constant

    rate R.

    Path consists ofH links, each with capacity Ci, available bandwidth

    Ai, and queue length qki when the kth probe packet arrives

    The One-Way-Delay for probe k is:

    Dk =Hi=1

    L

    Ci+

    qkiCi

  • 8/14/2019 Measurement and Modelling I:

    28/36

    Pathload Delay Model

    The packet train consists of K packets of size L sent at a constant

    rate R.

    Path consists ofH links, each with capacity Ci, available bandwidth

    Ai, and queue length qki when the kth probe packet arrives

    The One-Way-Delay for probe k is:

    Dk =Hi=1

    L

    Ci+

    qkiCi

    Dk Dk+1Dk =Hi=1

    qkiCi

    16

  • 8/14/2019 Measurement and Modelling I:

    29/36

    Increasing Trends

    If R > A, then Dk > 0 for k 1

    If R A, then Dk = 0 for k 1

  • 8/14/2019 Measurement and Modelling I:

    30/36

    Increasing Trends

    If R > A, then Dk > 0 for k 1

    If R A, then Dk = 0 for k 1

    Intuition for a single link i with Ai < R:

    Queue grows longer with each probe packet that arrives

    qki = (L + uiCiT)C1T = (RAi)T > 0

    For a single link with Ai R:

    qki = 0

    By induction, show that Dk > 0 when R > A

  • 8/14/2019 Measurement and Modelling I:

    31/36

    Increasing Trends

    If R > A, then Dk > 0 for k 1

    If R A, then Dk = 0 for k 1

    Intuition for a single link i with Ai < R:

    Queue grows longer with each probe packet that arrives

    qki = (L + uiCiT)C1T = (RAi)T > 0

    For a single link with Ai R:

    qki = 0

    By induction, show that Dk > 0 when R > A

    Plot Dk if Dk > 0 then R > A

    17

  • 8/14/2019 Measurement and Modelling I:

    32/36

    Complications

    Ai not a constant

    varies on both short and long time scales

    Need to choose K and L carefully

    Too short cant tell if Dk > 0

    Too long flood link

    Compromise use multiple trains

    How did we choose R initially?

    18

  • 8/14/2019 Measurement and Modelling I:

    33/36

    Iterative Search for A

    maintain two state variables: Rmax and Rmin.

    always have Rmin A Rmax .

    Pick a new R halfway between Rmax and Rmin

    Test whether R A, update either Rmax or Rmin

    Stop when Rmax and Rmin are close enough.

    In practice the search is more complicated because the outcome of

    testing R A is sometimes unsure

    19

  • 8/14/2019 Measurement and Modelling I:

    34/36

    Pathload Block Diagram

    Timestamps

    Filters

    Estimates

    Network

    Packet Source

    20

  • 8/14/2019 Measurement and Modelling I:

    35/36

    Available Bandwidth isnt the full story

    0

    0.1

    0.2

    0.3

    0.4

    0.5

    0.6

    0.7

    0.8

    0.9

    1

    0.01 0.1 1 10 100

    CDF

    BTC / Pathload rate

    BTC vs Pathload: 15 RON hosts -- one test per path

    21

  • 8/14/2019 Measurement and Modelling I:

    36/36

    Conclusion

    Theres a lot you can learn with simple probes

    packet pair packet trains regular interval, constant packet size

    Just by looking at packet delay variations you can determine

    Path Capacity

    Common Packet Sizes

    Available Bandwidth

    22