Profile Picture

Dr. George N. Rouskas

Professor and Director of Graduate Programs
IEEE Fellow

Dr. George N. Rouskas

Professor and Director of Graduate Programs
IEEE Fellow

CSC/ECE 573 — Internet Protocols

Class portal

Fall 2017 Schedule of Lectures

Date Lecture # Topic Assignment Due
Aug 16 1 Overview, goals, logistics (pdf)
Aug 21 2 Introduction (pdf)
Chapter 1
Lab assignment (pdf)
Reservation calendar
Additional VCL instructions (pdf)
HW 1 (pdf)
Aug 23 3 Introduction (cont'd)
Aug 28 4 Application layer (AL): principles, web and HTTP (pdf)
Chapter 2.1, 2.2
Aug 30 5 PageRank (pdf) HW 2 (pdf)
Wireshark Intro (pdf)
Wireshark HTTP (pdf)
HW 1 (pdf)
Sep 4 No class (Labor Day)
Sep 6 6 AL (cont'd): email (SMTP), directory service (DNS), P2P apps
Chapter 2.3, 2.4, 2.5
Sep 11 7 AL (cont'd): P2P, CDN, socket programming
Chapter 2.6, 2.7
Sep 13 8 Transport Layer (TL): overview, multiplexing/demultiplexing, UDP (pdf)
Chapter 3.1, 3.2, 3.3
Sep 18 9 TL (cont'd): reliable data transfer
Chapter 3.4
HW 3 (pdf)
Wireshark TCP (pdf)
HW 2 (pdf)
Sep 20 10 TL (cont'd): TCP functionality
Chapter 3.5.1-3.5.4
Sep 25 11 TL (cont'd): TCP functionality, principles of congestion control
Chapter 3.5.5, 3.5.6, 3.6
Project 1 (pdf)
Lab assignment
Sep 27 12 Discussion of Project 1
TL (cont'd): TCP congestion control
Chapter 3.7
Oct 2 13 Congestion control for high speed networks (pdf) HW 3 (pdf)
Oct 4 14 Congestion control for high speed networks (cont'd)
Oct 9 Midterm exam
Oct 11 15 Network Layer-Data Plane (NL-DP): overview, router architecture (pdf)
Chapter 4.1, 4.2
Oct 16 16 Discussion of midterm exam
NL-DP (cont'd): Internet Protocol (IPv4, addressing, DHCP)
Chapter 4.3.1-4.3.3
HW 4 (pdf)
Wireshark IP (pdf)
Oct 18 17 NL-DP (cont'd): Internet Protocol (NAT, IPv6), SDN
Chapter 4.3.4,4.3.5, 4.4
Oct 23 18 Network Layer-Control Plane (NL-CP): link state and distance vector routing algorithms (pdf)
Chapter 5.1, 5.2
Oct 25 19 NL-CP (cont'd): OSPF, BGP
Chapter 5.3, 5.4
Project 2 (pdf)
Project 1
Oct 30 20 Discussion of Project 2
NL-CP (cont'd): Broadcast and multicast routing
Nov 1 21 NL-CP (cont'd): SDN control plane, ICMP, SNMP
Chapter 5.5, 5.6, 5.7
HW 5 (pdf)
Wireshark Ethernet (pdf)
HW 4 (pdf)
Nov 6 22 Data Link Layer (DLL): services, error detection/correction, multiple access protocols (pdf)
Chapter 6.1, 6.2, 6.3
Nov 8 23 DLL (cont'd): LANs, MPLS
Chapter 6.4, 6.5
Nov 13 24 DLL (cont'd): data center networking, "big picture" view
Chapter 6.6, 6.7
Passive optical networks (pdf)
Nov 15 25 PONs (cont'd) HW 5 (pdf)
Nov 20 26 Network virtualization (pdf)
Nov 22 No class (Thanksgiving Holiday)
Nov 27 27 Network virtualization (cont'd) Project 2
Nov 29 28
Dec 11
Final exam




Students who wish to take this course must have completed a graduate level course in Computer Networks (CSC/ECE 570 or equivalent).

Students must also have good working knowledge of a high-level programming language such as C, C++, or JAVA. The programming projects can be challenging, hence good programming experience is required.


This course deals with the principles and issues underlying the provision of wide area connectivity through the interconnection of autonomous networks. Emphasis will be placed on Internet architecture and protocols as they are today and as they are likely to evolve in the future. Case studies of particular protocols will demonstrate how fundamental principles are applied in practice. They will also provide the opportunity to practice a critical skill: shifting through details for the key idea. The functional requirements of internetworking will be motivated by selected examples of networked client/server applications. The projects are designed to give you first hand experience in building networked applications and/or in analyzing and evaluating the performance of protocols and applications.

At the conclusion of the course you should be able to:

  • demonstrate understanding of the fundamental problems, tradeoffs, and design issues that arise in internetworking, as well as identify and critically evaluate internet technologies, solution approaches, and design methodologies for future network architectures;
  • understand the details of several particular protocols, as example implementations of fundamental principles, and digest descriptions of specific protocols, extracting the fundamental concepts;
  • design and implement complex networked applications, protocols, and algorithms, and use the socket interface;
  • apply basic concepts to new networking environments; and
  • engage in original research in the area of computer networks.

I encourage and expect you to participate actively in the learning process. In particular, I welcome your comments and questions as we cover material in class. One-way lectures quickly become boring, both for you and for me. By asking lots of questions your understanding of the material will be deepened significantly, and the course will be much more fun!


The course will cover the application, transport, network, and data link layers of the Internet protocol stack (layers 5 through 2, in ISO parlance):
  • application layer (web and HTTP, ftp, mail, DNS, P2P file sharing) and socket programming
  • transport layer (UDP and TCP), congestion control
  • network layer (virtual circuits vs. datagrams, router operation and design, Internet Protocol), routing algorithms, routing protocols in the Internet, broadcast and multicast routing
  • data link layer (error detection and correction, multiple access protocols, addressing, technologies), Ethernet, PPP, hubs and switches, link virtualization


Students are required to purchase the following textbook:

  • J. F. Kurose and K. W. Ross, Computer Networking, 7th ed., Pearson. ISBN: 0-13-359414-9

I also suggest the following two books as reference:

  • W. R. Stevens, TCP/IP Illustrated, Vol. 1: The Protocols, Addison-Wesley.
  • W. R. Stevens, UNIX Network Programming, Prentice Hall
  • D. E. Comer, Internetworking with TCP/IP, Vol. 1: Principles, Protocols, and Architectures, Prentice Hall

I will also make available an extensive set of lecture slides.


Students are required to complete all assignments and show all work in order to receive full credit. The final grade will be determined using the following weights:

  • 30% — Two programming projects (15% each)
  • 10% — Lab assignment
  • 15% — Homework assignments (of equal weight)
  • 20% — Midterm exam (closed book)
  • 25% — Final exam (comprehensive, closed book)


Attendance: Attendance is not mandatory but strongly encouraged. Students are responsible for making up any course material they miss.

Assignments: No hard copies of assignments or solutions will be handed out. New assignments and solutions will be announced in class and/or the course mailing list, and will be available on the course web page.

Submission: Students must submit their assignments as PDF or Word files using the submit facility. The deadline for submission is midnight (Eastern time) on the day due. Any deadline extensions are up to the discretion of the instructor, and will be announced to the whole class. Extensions may be provided to individual students only in advance of the submission deadline and only under extenuating circumstances.

Late Submission: No late assignments will be accepted and no partial credit will be given for late assignments without a valid excuse.

Cheating: Homework and projects are individual assignments and students are required to submit their own solutions. All students are bound by the University's academic integrity policies (refer to the relevant section below).

Teaching Assistant

Yuepeng Qi and Malayaz Sachdeva are the TAs for this course. Their office hours are:

  • Yuepeng ( M/W 10:30-11:30am in Room 3045 of the EB2 building.
  • Malayaz ( Th 12-1pm and F 11am-12noon, in Room 1229B of the EB2 building.

Alternatively, you may contact them to arrange for a meeting or online chat at a mutually convenient time.

Feel free to contact the TAs for any questions about the course.

Office Hours

My office is in Room 2306 of the EB II building.

My office hours are 4:15-5:00pm on Mondays and Wednesdays. Distance students may either call me during those times, or may arrange to stop by or call at a different mutually convenient time.

Academic Integrity

Students are required to respect the NC State academic integrity policies.