CENG 362 Computer Networks

OSI reference model, Internet and TCP/IP. Application layer protocols: HTTP, FTP, SMTP, POP3, and DNS. Socket programming, transport layer services, flow and congestion control, network layer and IP protocol, addressing, routing, data link layer protocols, local area networks.

This course provides an introduction to fundamental concepts in the design and implementation of computer communication networks, their protocols, and applications. Topics to be covered include: Introduction to computer networks and the Internet, principles of application layer protocols, socket programming, HTTP, FTP, SMTP, DNS, transport layer services, congestion control, network layer and IP protocol, addressing, routing, data link layer protocols, local area networks, and multimedia networking. Examples will be drawn primarily from the Internet protocol suite (e.g. HTTP, SMTP, TCP, UDP, IP) using Ethereal, a network protocol analyzer program and the Java programming language.

CENG 362 is a one-semester introduction to computer networking theory, applications, and programming with a focus on the Internet and its applications. It covers networking topics beginning from the application-layer then going down the protocol stack (a top-down approach), allowing computer engineering students to quickly write networking applications while learning the theory and practice of computer networking.

This is an advanced undergraduate course for mainly computer engineering students. It is an 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 courses (and its pre-requisites).

Programming in Java is an important component of the course. Some educational multimedia materials, network programs and simulators will be also used to teach the networking fundamentals. There will be five written assignments, two programming assignments one midterm and a final exam.

Prerequisites

	A basic understanding of algorithms (CENG 201/202 Data Structures and Algorithms) and operating systems (CENG 341 Operating Systems) is required.
	A previous course in computer organization (e.g. CENG 252) is required.
	You must be able to program in a structured high-level programming language, especially Java.

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, TCP Congestion Control (chp 3)
7	Midterm Exam I
8	Network Layer (1): Network Service Models, Routing Principles, Link State and Distance Vector Routing, Hierarchical Routing (chp 4)
9	Network Layer (2): IP Protocol: IPv4 Addressing, Moving a Datagram, Datagram Format, IP Fragmentation, ICMP, DHCP, NAT, Routing in the Internet (chp 4)
10	Network Layer (3): What’s Inside a Router, IPv6, Multicast Routing, Mobility (chp 4)
11	Link Layer and LANs (1): Introduction and Services, Error Detection and Correction, Multiple Access Protocols (chp 5)
12	Midterm Exam II
13	Link Layer and LANs (2): LAN addresses and ARP, Ethernet, Hubs, Bridges, and Switches, Wireless Links and LANs, PPP, ATM, Frame Relay (chp 5)
14	Link Layer and LANs (3): Continued

Textbooks

Required

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

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 and Development Environments

Ethereal The popular network protocol analyzer having support for 530 protocols.

Ethereal Documentation

Etheral-Users, problems and solutions

Idiot's Guide to Network Analysis Capturing packets using Ethereal and information about ARP.

Java IDE: Eclipse or JBuilder

Grading (Tentative)
     5 % : Quizzes
   10 % : Homework Assignments
   10 % : Lab Assignments
   10 % : Programming Assignments
   15 % : Midterm I
   20 % : Midterm II
   30 % : Final Exam (a comprehensive exam at the end of the course)

Attendance: Attendance is important in order to learn the topics in a timely manner. Attendance will be forced by taking attendance.

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 two midterm exams.

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

Makeup Exam: Depending on the need (for officially reported or extraordinary cases) I may make a makeup exam. But I should warn you that makeup exam will be much more difficult than the other exams in order to provide fairness for students who work on time and take the exam on time, and discourage students from unnecessarily omitting the exams.

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 04/08/11