Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    Computer Networks: Delay, Loss and Throughput Layered Architectures

    Uploaded by

    satish2628
    This document discusses computer networks and the sources of delay, loss, and throughput in networks. It covers four main sources of packet delay: nodal processing, queueing, transmission, and propagation. Queueing delay depends on the level of congestion in routers and can become large as traffic intensity approaches link capacity. Packet loss occurs when packets arrive at a full router buffer. Throughput is the rate at which bits are transferred between sender and receiver, and the average end-to-end throughput depends on the capacities of the sender, links, and receiver.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Computer Networks: Delay, Loss and Throughput Layered Architectures

    Uploaded by

    satish2628
    34 views10 pages
    This document discusses computer networks and the sources of delay, loss, and throughput in networks. It covers four main sources of packet delay: nodal processing, queueing, transmission, and propagation. Queueing delay depends on the level of congestion in routers and can become large as traffic intensity approaches link capacity. Packet loss occurs when packets arrive at a full router buffer. Throughput is the rate at which bits are transferred between sender and receiver, and the average end-to-end throughput depends on the capacities of the sender, links, and receiver.

    Original Description:

    Networks

    Original Title

    networks5-ch1-2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses computer networks and the sources of delay, loss, and throughput in networks. It covers four main sources of packet delay: nodal processing, queueing, transmission, and propagation. Queueing delay depends on the level of congestion in routers and can become large as traffic intensity approaches link capacity. Packet loss occurs when packets arrive at a full router buffer. Throughput is the rate at which bits are transferred between sender and receiver, and the average end-to-end throughput depends on the capacities of the sender, links, and receiver.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    34 views10 pages

    Computer Networks: Delay, Loss and Throughput Layered Architectures

    Uploaded by

    satish2628
    This document discusses computer networks and the sources of delay, loss, and throughput in networks. It covers four main sources of packet delay: nodal processing, queueing, transmission, and propagation. Queueing delay depends on the level of congestion in routers and can become large as traffic intensity approaches link capacity. Packet loss occurs when packets arrive at a full router buffer. Throughput is the rate at which bits are transferred between sender and receiver, and the average end-to-end throughput depends on the capacities of the sender, links, and receiver.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 10

    Computer

    Networks
    Delay, loss and throughput
    Layered architectures

    Delay, loss, layered architectures

    How do loss and delay occur?


    packets queue in router buers
    packet arrival rate to link exceeds output link capacity
    packets queue, wait for turn
    packet being transmiBed (delay)

    A
    B

    packets queueing (delay)

    free (available) buers: arriving packets


    dropped (loss) if no free buers

    Delay, loss, layered architectures

    Four sources of packet delay


    1.
    2.

    3.

    Nodal processing:

    check bit errors


    determine output link

    Queueing

    Kme waiKng at output link for


    transmission
    depends on congesKon level of
    router

    2.

    transmission

    Transmission delay:

    aka store & forward delay


    R=link bandwidth (bps)
    L=packet length (bits)
    Kme to send bits into link = L/R

    PropagaKon delay:

    d = length of physical link


    s = propagaKon speed in medium
    (~2x108 m/sec)
    propagaKon delay = d/s

    propagation

    nodal
    processing

    queueing

    Note: s and R are very


    dierent quanKKes!

    Delay, loss, layered architectures

    Caravan analogy
    100 km
    ten-car
    caravan

    toll
    booth

    cars propagate at
    100 km/hr
    toll booth takes 12 sec to service
    car (transmission Kme)
    car~bit; caravan ~ packet
    Q: How long unKl caravan is lined
    up before 2nd toll booth?
    Time to push enKre caravan
    through toll booth onto highway =
    12*10 = 120 sec
    Time for last car to propagate from
    1st to 2nd toll both: 100km/
    (100km/hr)= 1 hr
    A: 62 minutes

    100 km
    toll
    booth
    Cars now propagate at
    1000 km/hr
    Toll booth now takes 1 min to
    service a car
    Q: Will cars arrive to 2nd booth
    before all cars serviced at 1st
    booth?
    1st bit of packet can arrive at 2nd
    router before packet is fully
    transmiBed at 1st router!

    Delay, loss, layered architectures

    Nodal delay
    dproc = processing delay
    typically a few microsecs or less

    dqueue = queuing delay

    depends on congesKon

    dtrans = transmission delay


    = L/R, signicant for low-speed links

    dprop = propagaKon delay


    a few microsecs to hundreds of msecs

    Delay, loss, layered architectures

    Queueing delay (revisited)


    R=link bandwidth (bps)
    L=packet length (bits)
    a=average packet arrival
    rate
    trac intensity = La/R
    La/R ~ 0: average queueing delay small
    La/R -> 1: delays become large
    La/R > 1: more work arriving than can be

    serviced, average delay innite!

    Delay, loss, layered architectures

    Real Internet delays and routes


    What do real Internet delay & loss look like?
    Traceroute program: provides delay measurement
    from source to router along end-end Internet path
    towards desKnaKon. For all i:
    sends three packets that will reach router i on path towards
    desKnaKon
    router i will return packets to sender
    sender Kmes interval between transmission and reply.
    3 probes

    3 probes

    3 probes

    Delay, loss, layered architectures

    Real Internet delays and routes


    traceroute: gaia.cs.umass.edu to www.eurecom.fr
    Three delay measurements from
    gaia.cs.umass.edu to cs-gw.cs.umass.edu
    1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
    2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms
    3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms
    4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms
    5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms
    6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms
    7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms trans-oceanic
    8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
    link
    9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms
    10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms
    11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms
    12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms
    13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms
    14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms
    15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms
    16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
    17 * * *
    * means no response (probe lost, router not replying)
    18 * * *
    19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
    Delay, loss, layered architectures

    Packet loss
    queue (aka buer) preceding link in buer has
    nite capacity
    packet arriving to full queue dropped (aka lost)
    lost packet may be retransmiBed by previous
    node, by source end system, or not at all
    buffer
    (waiting area)

    A
    B

    packet being transmitted

    packet arriving to
    full buffer is lost
    Delay, loss, layered architectures

    Throughput
    throughput: rate (bits/Kme unit) at which
    bits transferred between sender/receiver
    instantaneous: rate at given point in Kme
    average: rate over longer period of Kme

    link
    capacity
    that
    can carry
    server,
    server
    sendswith
    bits pipe
    R
    bits/sec
    fluid
    file of
    F pipe
    bits
    s at rate
    (fluid)
    into
    Rs bits/sec)
    to send to client

    link that
    capacity
    pipe
    can carry
    Rfluid
    bits/sec
    c
    at rate
    Rc bits/sec)

    Delay, loss, layered architectures

    Throughput (more)
    Rs < Rc What is average end-end throughput?
    Rs bits/sec

    Rc bits/sec

    Rs > Rc What is average end-end throughput?


    Rs bits/sec

    Rc bits/sec

    bo7leneck link
    link on end-end path that constrains end-end throughput
    Delay, loss, layered architectures

    Throughput: Internet scenario


    per-connecKon
    end-end
    throughput: min
    (Rc,Rs,R/10)
    in pracKce: Rc or Rs
    is ocen boBleneck

    Rs
    Rs

    Rs
    R

    Rc

    Rc
    Rc

    10 connections (fairly) share


    backbone bottleneck link R bits/sec
    Delay, loss, layered architectures

    Protocol Layers
    Networks are complex!
    many pieces:
    hosts
    routers
    links of various media
    applicaKons
    protocols
    hardware, socware

    QuesKon:
    Is there any hope of organizing
    structure of network?
    Or at least our discussion of
    networks?

    Delay, loss, layered architectures

    OrganizaKon of air travel


    ticket (purchase)

    ticket (complain)

    baggage (check)

    baggage (claim)

    gates (load)

    gates (unload)

    runway takeoff

    runway landing

    airplane routing

    airplane routing
    airplane routing

    a series of steps
    Delay, loss, layered architectures

    Layering of airline funcKonality


    ticket (purchase)

    ticket (complain)

    ticket

    baggage (check)

    baggage (claim

    baggage

    gates (load)

    gates (unload)

    gate

    runway (land)

    takeoff/landing

    airplane routing

    airplane routing

    runway (takeoff)
    airplane routing
    departure
    airport

    airplane routing

    airplane routing

    intermediate air-traffic
    control centers

    arrival
    airport

    Layers: each layer implements a service

    via its own internal-layer acKons


    relying on services provided by layer below
    Delay, loss, layered architectures

    Why layering?
    Dealing with complex systems:
    explicit structure allows idenKcaKon, relaKonship of
    complex systems pieces

    layered reference model for discussion


    modularizaKon eases maintenance, updaKng of system

    change of implementaKon of layers service


    transparent to rest of system
    e.g., change in gate procedure doesnt aect
    rest of system

    layering considered harmful?

    Delay, loss, layered architectures

    Internet protocol stack


    applicaKon: supporKng network applicaKons
    FTP, SMTP, HTTP
    Transfer unit: message

    transport: process-process data transfer


    TCP, UDP
    Transfer unit: segment

    network: rouKng of datagrams from source to


    desKnaKon
    IP, rouKng protocols
    Transfer unit: datagram

    link: data transfer between neighboring


    network elements
    PPP, Ethernet
    Transfer unit: frame

    application
    transport
    network
    link
    physical

    physical: bits on the wire


    Transfer unit: none (signal)

    Delay, loss, layered architectures

    ISO/OSI reference model


    presentaKon: allow applicaKons to
    interpret meaning of data, e.g.,
    encrypKon, compression, machine-
    specic convenKons
    session: synchronizaKon, checkpoinKng,
    recovery of data exchange
    Internet stack missing these layers!
    these services, if needed, must be
    implemented in applicaKon
    needed?

    application
    presentation
    session
    transport
    network
    link
    physical

    Delay, loss, layered architectures

    source
    message
    segment Ht

    datagram Hn Ht
    frame Hl Hn Ht

    M
    M

    EncapsulaKon

    application
    transport
    network
    link
    physical

    link
    physical
    switch

    destination
    M
    Ht

    Hn Ht

    Hl Hn Ht

    application
    transport
    network
    link
    physical

    Hn Ht

    Hl Hn Ht

    network
    link
    physical

    Hn Ht

    router

    Delay, loss, layered architectures

    10

    You might also like