CENG 362 Computer Networks

CENG 362 is a one-semester introduction to computer networking theory, applications, and programming with a focus on large heterogeneous computer networks. It covers networking topics from the application-layer down (top-down), allowing computer science students to quickly write distributed applications while learning the theory and practice of computer networking. This broad top-down introduction to computer networking concepts includes distributed applications, socket programming, operating system and router support, routing algorithms, and sending bits over congested, noisy, and unreliable communication links. This course is both a theory course and a programming course. Theoretical solutions are analyzed (models and algorithms) and turned into practical programs. Programming in JAVA is an important component of the course. Some educational multimedia materials, network programs and simulators will be be also used to teach the networking fundamentals.

This is an advanced undergraduate course for mainly computer engineering students. It is the introductory computer networks course and serves as a pre-requisite for more advanced computer networking topics. It may also be taken by interested non-CENG students who have taken the pre-requisite course (and its pre-requisites).

Course Content

Application areas for computer networks and examples of commercial network services. Basic terminology within networks such as protocols, services, circuit switching and packet switching, datagram and virtual circuits, with focus on solutions for packet-switched networks. Network architectures, division of network functionality with reference to the OSI model; Internet and standardization. Application protocols. Techniques for flow control. Different types of protocols. Specification and verification of protocols. Local area networks with focus on Ethernet CSMA/CD; high-speed networks, wide are networks, wireless networks et al. network types. Internetworking; naming, addressing and routing protocols. The TCP/IP protocol family. Techniques for congestion control and resource allocation; managing quality of service and real-time applications.

Prerequisites

Knowledge in operating systems and thread/process programming (notions of process, thread, queue, semaphore, and socket). (CENG 341 Operating Systems).

Basic knowledge in programming and compiling Java and C. ( CENG 102 Computer Programming I and II ).

Basic knowledge in data structures and algorithms (CENG 201/202 Data Structures and Algorithms).

Lecture Schedule

This is the tentative schedule. Please check it once before the lecture.

Week	Topics Covered
1	Course Overview, Introduction to Computer Networks and the Internet (chp 1)
2	Application Layer (1): Principles of App. Layer Protocols, TCP/UDP Socket Programming. (chp 2)
3	Application Layer (2): TCP/UDP Socket Programming (continued) and HTTP (chp 2)
4	Application Layer (3): FTP, SMTP, DNS, Web Servers, Peer-to-Peer Networking (chp 2)
5	Transport Layer (1): Transport-Layer services, Multiplexing and Demultiplexing, Connectionless Transport: UDP, Principles of Reliable Data Transfer (chp 3)
6	Transport Layer (2): Connection-Oriented Transport: TCP, Principles of Congestion Control (chp 3)
7	Transport Layer (3): Congestion Control; TCP Congestion Control in TCP (chp 3) and Review for Midterm Exam I
8	Midterm Exam I
9	Network Layer (1): Network Service Models, Routing Principles, Link State and Distance Vector Routing, Hierarchical Routing (chp 4)
10	Network Layer (2): IP Protocol: IPv4 Addressing, Moving a Datagram, Datagram Format, IP Fragmentation, ICMP, DHCP, NAT, Routing in the Internet (chp 4)
11	Network Layer (3): What’s Inside a Router, IPv6, Multicast Routing, Mobility (chp 4)
12	Link Layer and LANs (1): Introduction and Services, Error Detection and Correction, Multiple Access Protocols (chp 5)
13	Midterm Exam I
14	Link Layer and LANs (2): LAN addresses and ARP, Ethernet, Hubs, Bridges, and Switches, Wireless Links and LANs, PPP, ATM, Frame Relay (chp 5)

Textbooks

Required

Computer Networking: A Top-Down Approach Featuring the Internet, J. F. Kurose, K. W. Ross, Addison Wesley, 2003.

Recommended

	Computer Networks (4th Edition), Andrew S. Tanenbaum, Prentice Hall, 2003.
	Data and Computer Communication (7th Edition), William Stallings, Prentice Hall.
	Computer Networking with Internet Protocols, William Stallings, Prentice Hall, 2003.
	Computer Networks: A Systems Approach (3rd Edition), L. Peterson and B. Davie, Morgan Kaufmann, 2003.

Tools

.......

Grading
25 % : Midterm I
25 % : Midterm II
20 % : Homework Assignments
30 % : Final Exam (a comprehensive exam at the end of the course)

Homework: There will be homework in every 2 or 3 weeks. The purpose of the homework is to give you a chance to exercise the knowledge gained from the recent class material.

Midterm Exam: There will be one midterm exam that will be given around the mid of the semester.

Final Exam: There will be one final exam that will be given during final exams period of the semester.

Academic Integrity

We will be very careful in grading the projects, homeworks, exams so that everybody gets the grade that he/she deserves. Copying will not be tolerated and will be checked and punished rigorously.

The Fatih University has a very strict policy on academic dishonesty. All work on homeworks and examinations must be strictly individual. Violations of this policy will result in an F grade for the class and may result in suspension/expulsion from the university.

You must do all of the homework assignments for grading individually (and the exams, of course). In preparing the solutions for assignments, you may consult with other students, the teaching assistants and myself regarding the general method of solutions. However, the final submission handed in for grading must be your own work. Copying the solutions of others is expressly forbidden. Allowing others to copy your solutions is expressly forbidden. Penalties for violation of this will range from a grade of zero on the assignment, a reduced grade for the semester, to a grade of F for the course, and a letter to the Office of the Dean.

Home

This site was last updated 01/29/08