Stnf

EE384M: Network Algorithms

Schedule, Handouts and Readings


  • Guidelines on how to read a paper can be found here.

  • #
    Topic
    Lecturer
    Date
    Handouts
    Reading Before Class
    1
    Principles and Models
    George
    March 28
    #1 ppt, pdf

    2
    Tom
    March 30
    #2 ppt, pdf

    3
    Forwarding:
    Exact match, IP lookups, Classification
    George
    April 4
    #3 ppt, pdf

    4
    George
    April 6
    #4 ppt, pdf

    5
    George
    April 11


    6
    George
    April 13
    #5 ppt, pdf

    7
    Switching:
    IQ, CIOQ, DSM, Building a switch
    Balaji
    April 18
    #6 ppt, pdf
    #7 ppt, pdf

    8
    Balaji
    April 20
    #8 pdf
    #9 ppt, pdf

    9
    Balaji
    April 25
    #10 pdf
    #11 ppt, pdf
  • Nick McKeown, Venkat Anantharam and Jean Walrandm,"Achieving 100% Throughput in an Input-Queued Switch," Proceedings of IEEE Infocom, 1996.
  • P. Giaccone, B. Prabhakar and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE JSAC on high-performance electronic switches/routers for high-speed internet, 2003.
  • 10
    Tom
    April 27
    #12 ppt, pdf

    11
    Quality of Service:
    Tocket bucket, WFQ, DRR,
    Choke, AFD
    George
    May 2
    #13 pdf

    12
    Balaji
    May 4
    #14 ppt, pdf

    13
    Balaji
    May 9


    14
    Congestion Control:
    TCP-RED, QCN, DCTCP
    Balaji
    May 11
    #15 pdf

    15
    Balaji & Mohammad
    May 16
    #16 pdf

    16
    Measurement and Security:
    Statistics counters,
    Sample and hold, ElephantTrap, Worm detection
    George
    May 18
    #17 ppt


    17
    George
    May 23
    #18 ppt


    18
    Balaji
    May 25
    #19 ppt





    EE384M / Spring 2011