Course name: Communication Networks

Course Syllabus

Lecturer: Dr. Eliezer Dor, 09-7719823, eliezer.dor@gmail.com

Credit: 4 (3+1)

Prerequisites: Algorithms, Introduction to Probability, Software Project

Course Objectives:

The course provides an introduction to the principles, challenges and techniques used in designing network architectures and protocols. 

The focus of the course is: network architectures, the layering model, the protocol concept, performance modeling, the Internet. Some of the topics included in detail: network programming, STP, ARP, reliable data transfer, flow and congestion control, addressing, routing algorithms,

Course Syllabus:

·         Introduction to network, layers and protocols

·         Datalink layer protocols, LAN protocols

·         LAN connectivity: Hubs, bridges, routers

·         Network layer: types of networks, addressing, forwarding, IP

·         Routing protocols & algorithms

·         Reliable data transfer issues and design alternatives

·         TCP handshake, data transfer, flow control,

·         TCP congestion control

·         Application protocols, Network security

·         Advanced topics (e.g. switching networks, scheduling ,  mobile IP, multicast) as time permits

Course prerequisites:

Algorithms, Introduction to Probability, Software Project

Course requirements:

Homework Assignments submission (should be done in pairs) 

Required reading:

None

Recommended reading:

[1]   James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Addison-Wesley 3^rd Edition (2005), 2^nd ed. (2003)

[2]   S. Tanenbaum, “Computer Networks”,  Prentice-Hall, 4^th ed. (2003) / 3^rd ed (1996)

[3]   R. Perlman: Interconnections : Bridges, Routers, Switches and Interworking Protocols, Addisoin Wesley 2000

[4]   R. Stevens: TCP/IP Illustrated vol. I The Protocols, Addison Wesley 1994

[5]   R. Stevens, B. Fenner, A.M. Rudoff: UNIX Network Programming: The Socket Networking API , vol. 1, 3^rd Edition, Addison Wesley 2004

Grade: 60% final exam, 20% programming exercises, 20% theoretical
             exercises

Link to course site:

http://www.cs.tau.ac.il/~deliezer/