Carleton University

Department of Systems and Computer Engineering

94.521 Computer Communication Networks (Tu, Thu 19:30-21:00)

Winter 2002- Course Handout
 


LAST UPDATE:  March 20 2002

Homework 3 is out and due on March 29th


***************************************************************************
TA Hours: Tu and Thur: 6:30 to 7:30pm. ROOM ME4290 BBN Laboratory

****************************************************************************************************************

HOMEWORKS AND SUPPLEMENTARY MATERIAL

PROJECT:
I am interested in simulating the SRP protocol. I would like to suggest the following project. This project can give up to 5 additive
points to your final grade. Also I would like to have groups of 3-4 people for each final report.

Goals and Deliverables:
a) Simulate the SRP protocol under different loads. You may use OPNET or plain C. However all code should be documended and
delivered with the final report.
b) Examine how accurate are the formulas we derived in class and compare them to the formulas given in one of our textbooks (Saadawi).
Results should be always compared with simulations
c) See how and if you can relax the roundtrip and low probability of error assumptions we made in the class! Again compare with simulations.

The project is open for experimentation and intuition. Therefore, your motivation and intuition/ingeniouity (sp?) will be appreciated and
appropriately graded. Please go through the material on ARQ's  I added in the section of "supplementary material"
 


Lectures are given in ME 3269, on Tuedays andThursdays 7:30-9:00pm


Students with a disability who require academic accommodations, please feel free to come and discuss this
with me. Students must also contact the Paul Menton Centre to complete the required forms at least two
weeks prior to the first in-class or itv test, and no later than  March 10 for April exams.


Preliminary exam solution


Supplementary Material


Instructor: Ioannis Lambadaris, room 4442 ME, Tel: 520 -2600 ext. 1974

Email: ioannis@sce.carleton.ca

Goal of the course and Prerequisites:

The course will focus on performance issues of traditional and broadband networks therefore it requires mathematical maturity and in particular knowledge of elementary stochastic processes and queueing theory.
Students who do not fulfill the prerequisites are advised NOT to take the course

If you wish to refresh your background in probability and statistics here is a couple of links:

Course on Statistics
Virtual Laboratories in Probability and Statistics

The course will not put emphasis on practical/implementation issues of networks although motivation for theoretical studies may come from such issues. The course will not discuss details of standards or RFC?s however substantial motivation may come from such areas.

Office Hours: Tuesdays and Thursdays at 19:00-19:30pm (i.e. just before lectures) and 21:00-22:00 pm (i.e. immediately after lectures)

Textbooks:

  1. Fundamentals of Telecommunication Networks, T.N. Saadawi, M.H. Ammar with A. El Hakeem, John Wiley, 1994
  2. High Performance Communication Networks, Jean Walrand and Pravin Varaya, Morgan Kaufmann, 1996


Additional references:
 

  1. Computer Networking: A Top-Down Approach Featuring the Internet, Addison Wesley 2001
  2. Communication Networks: A First Course, J. Walrand, Irwin, 1991, TK5105.5.W35.
  3. Data Networks, D. Bertsekas and R. Gallager, 2nd edition, Prentice-Hall, 1992, K5105.B478 1992.
  4. Data and Computer Communications, W. Stallings, 5th edition, Prentice-Hall, 1997, TK5105.S73 1996.
  5. Computer Networks, A. S. Tanenbaum, 3rd edition, Prentice-Hall, 1996, TK5105.5.T36 1996.
  6. High-Speed Networks: TCP/IP and ATM Design Principles, W. Stallings, Prentice-Hall, 1998, TK5105.585.S73.
  7. An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network, S. Keshav, Addison-Wesley, 1997, ISBN #0-201-63442-2.
  8. Broadband Integrated Networks, M. Schwartz, Prentice-Hall, 1996, TK5103.75.S38.
  9. Computer Networks and Internets, D. E. Comer, Prentice-Hall, 1997, TK5105.5.C5897.
  10. Networking Standards, W. Stallings, Addison Wesley, 1993, TK5105.5.S788.
  11. Probability and Random Processes for Electrical Engineering, A. Leon-Garcia, Addison Wesley, 1989, TK153.L425 1989 (or any text on random processes and queuing theory).
  12. Queueing Systems, L. Kleinrock, vol. 1, John Wiley, 1975, T57.9.K6.


Web Site:

All course-related material and announcements will be appearing on this course web site. A pointer will be available at my web page http://www.sce.carleton.ca/faculty/lambadaris. Students are expected to visit that site regularly for updates on the course, deadlines etc.

Exams:

We will have three exams for this course:
 

  • The first in-class exam will be in the area of elementary probability theory and stochastic processes. It will determine if your background fulfils the prerequisites for the course. It will last 30 minutes. It will be held on Thursday January 10.
  • The second in-class exam (midterm) will be held on Thursday February 14 during normal class hours. Please note that the Spring Break starts during the following weekend. Please make sure that you will be able to attend the midterm (i.e. make proper travel arrangements if any!)
  • The third in-class exam will take place on Thursday April 4 (last day of classes) between 7:30-9:30pm.

  •  

     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     

    Assignments:

    The purpose of assignments is to help you learn the material and prepare for examinations. It is essential that you fully understand all the assignments. If you perform badly on some questions, ensure that you find out afterwards what you should have done.

    Marking Scheme:

    Outline:

    Week

    1. Introduction to communication networks.
    2. Overview of traditional and broadband networks.
    3. Layered protocol architectures and related issues.
    4. Queuing theory primer and math review.
    5. Data Link protocols
    6. Data Link Protocols (cont.) / Multiple Access techniques
    7. Multiple access techniques and networks (IEEE 802.x standards).
    8. Network Layer: Routing and Routing Algorithms
    9. Network Layer: Naming and addressing techniques.
    10. Transport Layer: Scheduling/Congestion and flow control.
    11. Transport Layer: An Introduction to TCP
    12. Special topics: Quality of service for broadband networks
    13. Special topics: Introduction to optical networks
    Teaching Assistant

    Ashraf Matrawy, e-mail at amatrawy@sce.carleton.ca. Office hours: To be announced.



    Supplementary material

    Some slides showing the US Bell Digital TDM rate system
    The slides come from the book: "Understanding SONET/SDH and ATM: Communications for the next millenium" by
    Stamatios V. Kartalopoulos, IEEE Press (Book is highly recommended!!)

    Store and Forward Principle (Transparencies)

    Switching and Multiplexing
    (transparencies from the textbook by Varayia and Walrand on page 58)

    A good paper on Bits, Hertz and their relation to bandwidth!! (Highly Recommended)
    Thanks to student A. Abdelsayed who found it. (He will get 1% additive bonus to his final mark)

    Automatic repeat request protocols (ARQ)
    Some slides from Walrand's book (Supplementary reference 1)

    Window Protocols. Principles and Performance
    This material comes from the book  Communication Networks: A First Course, by J. Walrand

    Some Additional Material for ARQ's
    This material is influenced  from the book  Communication Networks: A First Course, by J. Walrand and come from notes of
    a TA (N. Vladjic) for 94.462 during Fall 1999.

    Two graphs for ARQ's
    The graphs show the efficiency of an ABP protocol and of a sliding window protocol as a function of the parameter a and the window size W.
    These can be found in the book High-Speed Networks: TCP/IP and ATM Design Principles,W. Stallings, Prentice-Hall, 1998 in page 231,232,233.
    I suggest that you consult this book!

    Here are all 4 cases for the study of the SRP protocol that we DID NOT fully presented in class.
    Due to time restrictions I was not able to cover all cases in the class. As promised here are the graphs explaining the operation of the protocol
    in detail.

    Slides for the lecture for TCP
    Slides were taken from the book
    Computer Networking: A top Down Approach Featuring the Internet
    by J.F. Kurose and K.W Ross
    Addison Wesley

    Notes on IEEE-802.3 (Ethernet) and LLC
    Figures come from the book by Walrand (Additional Reference 2)

    Notes on:     High Speed/Switched Ethernet     Voice Grade LANs      IEEE-802.11Wireless LANs

    Notes on Token Ring Networks
    From the book by Walrand (Additional Reference 2)

    Notes on FDDI
    With an explanation (by example) of the traffic prioritization and scheduling

    Example of Hierarchical Routing

    Addressing and Address Resolution Protocol (ARP)
     From the book by  Computer Networks, A. S. Tanenbaum, 3rd edition, Prentice-Hall, 1996
    Notes on Congestion Control    (Please bring with you in class)

    Notes on Quality of Service       (Please bring with you in class)
     

    Notes on Routing and Adressing in IP       (Please bring with you in class)
    material is from the bookComputer Networking: A top down approach featuring the Internet, by Kurose/Ross
     

     From the book by Tanenbaum (reference #5)
    Homeworks
    Homework #1 (Due Feb. 12)
    Homework #2, (Due March 19th)
    Homework #3, (Due March 29th)