Office: Room 517 (Bechtel) Office Hours: MWF 10 : :00 and by appointment (send ) Extension: 3538

Transcription

1 American University of Beirut Department of Electrical and Computer Engineering EECE 450 Computer Networks Spring 2004 Course Syllabus Catalog Description Data communications. Network architectures. Error and flow control. Local area networks. Packet switching. Wide area networks. Internetworking. Routing. Congestion control. Security. Network programming. Applications. Prerequisites By topic: Programming language, preferably C or C++ Basic understanding of probability theory Basic understanding of the internal operation of computers By course: ASST 311 Probability and Statistics, E ECE 330 Data Structures and Algorithms, and EECE 321 Microprocessor Systems Class MWF 09:00-10:00 in the Engineering Lecture Hall Instructor Ayman Kayssi Office: Room 517 (Bechtel) Office Hours: MWF 10 : :00 and by appointment (send ) Extension: ayman@aub.edu.lb SMS: T e x t b o o k C o mputer Networks A Systems Approach (3 r d edition), Peterson and Davie, Elsevier The following chapters from the textbook are covered: 1, 2, 3, 4, 5, 6, 9 Books on reserve in the engineering library 1. Comp uter Networking: a top down approach featuring t he Internet, 2 n d ed., Kurose and Ross, Addison Wesley, Computer Networks, 4 th ed., Tanenbaum, Prentice Hall, Computer Networks and Internets, 3 r d ed., Comer, Prentice Hall, Data Communications and Networking, 2 n d ed., Forouzan, McGraw Hill, Data and Computer Communications, 7 th ed., Stallings, Internetworking with TCP/IP, vol. 3, 2 n d ed., Comer, Prentice Hall, 1999.

2 Topics Covered 1. Introductory concepts 4 50 min lectures 2. Data Link issues 5 50 min lectures 3. Local area networks 5 50 min lectures 4. Packet switching 4 50 min lectures 5. Internetworking 7 50 min lectures 6. Routing 5 50 min lectures 7. Transport layer issues 5 50 min lectures 8. Network applications a n d se c u r i t y 6 50 min lectures 9. Linux, client- serv e r 2 50 min lectures Class/Laboratory Schedule Lecture: 3 hours/week Course Objectives The objectives of this course are to give students: 1. An u nderstanding of the basic principles of computer networking. 2. An overview of the main technologies used in computer networks. 3. An overview of internetworking principles and how the Internet protocols, routing, and applications operate. 4. The basic background in computer networks that will allow them to practice in this field, and that will form the foundation for more advanced courses in networking. 5. The basic skills needed to write network applications. Learning Outcomes At the end of the course, students: Understand of the basic principles of computer networking: Network performance, architecture, and requirements Error, flow, congestion control, framing, encapsulation Are aware of the main technologies used in computer networks: Direct link networks (such as HDLC and PPP) Local area networks (such as Ethernet, Token ring, Wireless Ethernet) Packet Switching (Datagram -based and VC -based, Frame Relay, ATM) Understand internetworking principles and how the Internet protocols, routing, and applications operate: IP, ICMP, IPv 6 Routing (Distance Vector RIP, Link State OSPF, Interdomain BGP) UDP, TCP DNS, , and o ther applications Have the basic skills needed to write network applications: Client - Server programming in C under Linux

3 Assessment Final exam 35% Midterm 35% Assignments 15% Projects 10% Class attendance 5% Policy The midterm and final exam are closed book, objective-type exams (multiple choice.) o The midterm is scheduled on Friday April 16, There will be u p to ten homework assignments. o Homework is due at the start of the class (9 AM). o Late homewor k will not be accepted. o Homework should be done individually. Projects will be done in groups of three students and will involve programming under Linux or a similar operating system. The course attendance grade will be computed as follows: Class attendance w i l l b e taken N times during the semester. Students who are in class will get (5/N) points, for a maximum of 5 points at the end of the term. Students who miss more than one fifth of the lectures in the first ten weeks of the semester will be dropped fro m the course.

4 Tentative Course Schedule W e e k0 Fri Feb 13 Lecture 1 Course intro Week1 Mon Feb 16 Lecture 2 Ne t w o r k requirements Wed Feb 18 Lecture 3 N e t w o r k architecture OSI Fri Feb 20 Lecture 4 T C P / I P Architecture. Network p e r f o r m a n c e Week 2 Mon Feb 23 Lecture 5 Homework 1 L i n u x network programming Wed Feb 25 Lecture 6 Physical layer Fri Feb 27 Lecture 7 P h y s i c a l l a y e r c o n t d - E n c o d i n g Week 3 Mon M a r 1 Lecture 8 Homework 2 Homework 1 due F r a m i n g - Example data link protoco l s Wed Mar 3 Lecture 9 HDLC Error control Fri Mar 5 Lecture 1 0 R e l i a b l e t r a n s m i s s i o n Project 0 (no due date) Week 4 Mon M a r 8 Lecture 1 1 Homework 3 Homework 2 due A R Q c o n t d Intro to LANs Wed Mar 1 0 Lecture 1 2 E t h e r n e t ( ) Fri Mar 1 2 Lecture 1 3 T o k e n R i n g s ( , F D D I ) W i r e l e s s ( ) Week 5 Mon M a r 1 5 Lecture 1 4 Bridges and VLANs Homework 4 Homework 3 due Wed Mar 17 Lecture 1 5 S p a n n i n g T r e e P r o t o c o l Fri Mar 1 9 Lecture 1 6 P a c k e t s witching: d atagram and vi r t u a l ci r c u i t Project 1 Week 6 Mon M a r 2 2 Lecture 1 7 Homework 5 Homework 4 due P S T N, I S D N, X. 2 5 Wed Mar 2 4 Lecture 1 8 Frame Relay Fri Mar 26 Lecture 1 9 A T M

5 Week 7 Mon M a r 2 9 Lecture 2 0 Homework 6 Homework 5 due Internetworking, IP Wed Mar 31 Lecture 2 1 IP cont d; IP addresses Fri Apr 2 Lecture 2 2 I P f o r w a r d i n g ; ARP Week 8 Mon Apr 5 Lecture 2 3 Homework 6 due D H C P, ICMP Wed A p r 7 Lecture 2 4 R o u t i n g - D i s t a n c e V e c t o r Fri A p r 9 >> easter << Week 9 Mon A p r 12 > > easter << Wed A p r 14 Lecture 25 Routing (cont d): RIP - Li n k S t a t e Fri A p r 1 6 Lecture 2 6 O S P F. S u b n e t t i n g. MIDTERM IS ON FRI DAY APRIL 16, 2004 ( check WebCT for updates) Week 10 Mon Apr 19 Lecture 2 7 Classless Routing (CIDR). I n t e r d o m a i n R o u t i n g ( B G P ) Wed A p r 21 Lecture 2 8 B G P c o n t d Fri A p r 2 3 Lecture 2 9 I P v e r s i o n 6 ( I P v 6 ) Week 11 Mon A p r 26 Lecture 3 0 Homework 7 Project 1 due N e t w o r k a d d r e s s t r a n s l a t i o n Wed A p r 28 Lecture 3 1 Multicast Fri A p r 3 0 Lecture 3 2 UD P Project 2 Week 12 Mon M a y 3 Lecture 3 3 Homework 8 Homework 7 d u e TCP Wed M a y 5 Lecture 3 4 T C P ( c o n t d ) Fri M a y 7 Lecture 3 5 Q u e u i n g. TCP Congestion Control. C o n g e s t i o n -A v o i d a n c e. Week 13 Mon May 10 Lecture 3 6 Homework 9 Homework 8 d u e Concurrency in Linux Wed Ma y 12 Lecture 3 7 N e t w o r k s e c u r i t y

6 Fri May 14 Lecture 3 8 F i r e w a l l s a n d I P S e c Week 14 Mon M a y 17 Lecture 3 9 Homework 1 0 Homework 9 d u e D o m a i n n a m e s y s t e m Wed May 19 Lecture 4 0 Electronic mail Fri M a y 21 Lecture 4 1 W e b p r o t o c o l s Week 15 Mon M a y 24 Lecture 4 2 Homework 1 0 due M u l t i m e d i a a n d Q o S Wed May 26 Lecture 4 3 P2P networks Project 2 due

7 EECE 450 Computer Networks l e c t u r e 24 1 ATM Technology (slide from an ATM Forum presentation) One International Standard Standards Based Carries Multiple Traffic Types QoS Both LAN and WAN Technology Scalable in Distance Scalable in Speed Voice/Data/Video Mb Gb QoS = Quality of Service ATM Service Categories Real time Constant bit rate (CBR) Real time variable bit rate (rt-vbr) Non-real time Non-real time variable bit rate (nrt-vbr) Available bit rate (ABR) Unspecified bit rate (UBR) 3

8 Real Time Services Amount of delay Variation of delay (jitter) 4 CBR Fixed data rate continuously available Tight upper bound on delay Uncompressed audio and video Video conferencing Interactive audio A/V distribution and retrieval 5 rt-vbr Time sensitive application Tightly constrained delay and delay variation rt-vbr applications transmit at a rate that varies with time e.g. compressed video Produces varying sized image frames Original (uncompressed) frame rate constant Compressed data rate varies 6

9 nrt-vbr May be able to characterize expected traffic flow Improve QoS in loss and delay End system specifies: Peak cell rate Sustainable or average rate Measure of how bursty traffic is e.g. transactions, multimedia 7 UBR Additional capacity over and above that used by CBR and VBR traffic Not all resources dedicated Bursty nature of VBR For applications that can tolerate some cell loss or variable delays e.g. TCP based traffic Cells forwarded on FIFO basis Best effort service 8 ABR Application specifies peak cell rate (PCR) and minimum cell rate (MCR) Resources allocated to give at least MCR Spare capacity shared among all ABR sources Feedback from network in case of congestion e.g. LAN interconnection 9

10 ATM Bit Rate Services 10 ATM Adaptation Layer Support for information transfer protocol not based on ATM PCM (pulse code modulation voice) Assemble bits into cells Re-assemble into constant flow IP (internet protocol) Map IP packets onto ATM cells Fragment IP packets 11 Adaptation Layer Services Handle transmission errors Segmentation and re-assembly Handle lost and mis-inserted cells Flow control and timing 12

11 Supported Application types Circuit emulation VBR voice and video General data service IP over ATM Multiprotocol encapsulation over ATM (MPOA) IPX, AppleTalk, DECNET LAN emulation (LANE) 13 AAL Protocols Convergence sublayer (CS) Support for specific applications Segmentation and re-assembly sublayer (SAR) Packages and unpacks info received from CS into cells Four types Type 1 Type 2 Type 3/4 Type 5 14 AAL Protocols 15

12 AAL Type 1 CBR source SAR packs and unpacks bits Block accompanied by sequence number 16 AAL Type 5 Streamlined transport for connection oriented higher layer protocols 17 Example AAL 5 Transmission 18