Computer science | COMPUTER NETWORKS

cod. 0512100011

COMPUTER NETWORKS

	0512100011
	DIPARTIMENTO DI INFORMATICA

	COMPUTER SCIENCE
	2013/2014

CURRICULUM METODOLOGICO

	OBBLIGATORIO
	YEAR OF COURSE 2
	YEAR OF DIDACTIC SYSTEM 2008
	SECONDO SEMESTRE

TEACHING UNITS

SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
INF/01	6	48	LESSONS	COMPULSORY SUBJECTS, CHARACTERISTIC OF THE CLASS
INF/01	3	36	LAB	COMPULSORY SUBJECTS, CHARACTERISTIC OF THE CLASS
INF/01	0	12	OTHER	COMPULSORY SUBJECTS, CHARACTERISTIC OF THE CLASS

PROFESSORS

	FILOMENA DE SANTIS T Curriculum
	PAOLO D'ARCO Curriculum

	Objectives
	KNOWLEDGE AND UNDERSTANDING: THE COURSE AIMS AT DELIVERING TO THE STUDENTS THE PRINCIPLES AND FOUNDATIONS OF COMPUTER NETWORKS, THEIR TYPICAL STRUCTURES AND THE MAIN TECHNIQUES OF NETWORK PROGRAMMING. THE COURSE STRUCTURE IS DIVIDED INTO TWO PARTS RESPECTIVELY DEALING WITH THEORETICAL AND APPLICATIVE ASPECTS. THE THEORETICAL PART FOCUSES ON THE CONSTRUCTION OF A COMPUTER NETWORK; THE NETWORK ARCHITECTURES , THE ISSUES OF ENCODING AND RELIABLE TRANSMISSION; PACKET SWITCHING, NETWORK INTERCONNECTION, TRANSPORT PROTOCOLS, NETWORK CONTROL, AND APPLICATIONS. THE APPLICATIVE PART OF THE COURSE FOCUSES ON THE DEVELOPMENT OF SIMPLE CLIENT-SERVER APPLICATIONS, USING C PROGRAMMING LANGUAGE AND SOCKETS. APPLYING KNOWLEDGE AND UNDERSTANDING: STUDENTS SHOULD DEVELOP THE NECESSARY SKILLS TO DEVELOP SIMPLE CLIENT-SERVER APPLICATIONS, TO CONFIGURE AND MANAGE SMALL LOCAL NETWORKS AND TO MAKE PROPER USE OF THE NETWORK FACILITIES. COMMUNICATION SKILLS: N/A MAKING JUDGEMENTS: STUDENTS WILL BE EXPECTED TO ACTIVELY PARTICIPATING IN THE LEARNING PROCESS. THE TEACHING PROCESS IS AIMED AT PROVIDING THE STUDENTS WITH THE SKILLS NECESSARY TO FORM THEIR OWN WELL-INFORMED OPINION AND DECISIONS.

KNOWLEDGE AND UNDERSTANDING:
THE COURSE AIMS AT DELIVERING TO THE STUDENTS THE PRINCIPLES AND FOUNDATIONS OF COMPUTER NETWORKS, THEIR TYPICAL STRUCTURES AND THE MAIN TECHNIQUES OF NETWORK PROGRAMMING.
THE COURSE STRUCTURE IS DIVIDED INTO TWO PARTS RESPECTIVELY DEALING WITH THEORETICAL AND APPLICATIVE ASPECTS.
THE THEORETICAL PART FOCUSES ON THE CONSTRUCTION OF A COMPUTER NETWORK; THE NETWORK ARCHITECTURES , THE ISSUES OF ENCODING AND RELIABLE TRANSMISSION; PACKET SWITCHING, NETWORK INTERCONNECTION, TRANSPORT PROTOCOLS, NETWORK CONTROL, AND APPLICATIONS.
THE APPLICATIVE PART OF THE COURSE FOCUSES ON THE DEVELOPMENT OF SIMPLE CLIENT-SERVER APPLICATIONS, USING C PROGRAMMING LANGUAGE AND SOCKETS.

APPLYING KNOWLEDGE AND UNDERSTANDING:
STUDENTS SHOULD DEVELOP THE NECESSARY SKILLS TO DEVELOP SIMPLE CLIENT-SERVER APPLICATIONS, TO CONFIGURE AND MANAGE SMALL LOCAL NETWORKS AND TO MAKE PROPER USE OF THE NETWORK FACILITIES.

COMMUNICATION SKILLS: N/A

MAKING JUDGEMENTS:
STUDENTS WILL BE EXPECTED TO ACTIVELY PARTICIPATING IN THE LEARNING PROCESS. THE TEACHING PROCESS IS AIMED AT PROVIDING THE STUDENTS WITH THE SKILLS NECESSARY TO FORM THEIR OWN WELL-INFORMED OPINION AND DECISIONS.

	Prerequisites
	BASIC KNOWLEDGE OF OPERATING SYSTEMS AND OF THE C PROGRAMMING LANGUAGE. PREFERABLE IS ALSO KNOWLEDGE OF COMPUTER ARCHITECTURE.

	Contents
	LECTURESI: 48 HOURS LAB-PROGRAMMING TEACHING: 36 HOURS INTRODUCTION TO COMPUTER NETWORKS: THE STRUCTURE OF A NETWORK; NETWORK ARCHITECTURES; LAYERS AND PROTOCOLS; INTERNETWORKING; OSI; TCP/IP; PERFORMANCE MEASURES. BASICS OF TRANSMISSION: DATA AND SIGNALS; DATA TRANSMISSION TECHNIQUES; MULTIPLEXING; MEDIA (WIRED AND WIRELESS). LINE CONTROL: DATA ENCODING; FRAMING; ERROR DETECTION; ARQ PROTOCOLS FOR RELIABLE TRANSMISSION: STOP-AND-WAIT, GO-BACK-N, SELECTIVE RETRANSMISSION; ACCESS PROTOCOLS (ETHERNET, TOKEN RING, HDDI, 802.11); CONNECTION DEVICES; DATAGRAM SWITCH; VIRTUAL CIRCUITS; NOTIONS OF ATM NETWORKS. INTERNETWORKING: IP SERVICE DATAGRAM IP; IP ADDRESSES WITH AND W/O CLASSES; ARP PROTOCOLS, DHCP, ICMP, ROUTING PROTOCOLS IGP AND EGP, MOBILE IP. TRANSPORT PROTOCOLS: UDP, TCP; RELIABLE SERVICE FOR BIT FLOW; TCP SEGMENT FORMAT; OPENING AND CLOSING TCP CONNECTION, FLOW CONTROL, ADAPTIVE RETRANSMISSION, OVERFLOW CONTROL AND RESOURCE ALLOCATION, QUALITY OF SERVICE (DIFFSERV AND INTSERV). APPLICATIONS: DNS, E-MAIL: SMTP, MIME, POP; WEB: HTTP, NOTIONS OF OVERLAY NETWORKS (P2P AND CONTENT DISTRIBUTION NETWORKS) LAB-ACTIVITIES 1. INTRODUCTION TO SOCKETS 2. SOCKET TCP 3. SOCKET UDP 4. I/O MULTIPLEXING 5. SOCKET OPTIONS AND I/O FUNCTIONS

Contents

LECTURESI: 48 HOURS
LAB-PROGRAMMING TEACHING: 36 HOURS

INTRODUCTION TO COMPUTER NETWORKS: THE STRUCTURE OF A NETWORK; NETWORK ARCHITECTURES; LAYERS AND PROTOCOLS; INTERNETWORKING; OSI; TCP/IP; PERFORMANCE MEASURES.
BASICS OF TRANSMISSION: DATA AND SIGNALS; DATA TRANSMISSION TECHNIQUES; MULTIPLEXING; MEDIA (WIRED AND WIRELESS).

LINE CONTROL: DATA ENCODING; FRAMING; ERROR DETECTION; ARQ PROTOCOLS FOR RELIABLE TRANSMISSION: STOP-AND-WAIT, GO-BACK-N, SELECTIVE RETRANSMISSION; ACCESS PROTOCOLS (ETHERNET, TOKEN RING, HDDI, 802.11); CONNECTION DEVICES; DATAGRAM SWITCH; VIRTUAL CIRCUITS; NOTIONS OF ATM NETWORKS.

INTERNETWORKING: IP SERVICE DATAGRAM IP; IP ADDRESSES WITH AND W/O CLASSES; ARP PROTOCOLS, DHCP, ICMP, ROUTING PROTOCOLS IGP AND EGP, MOBILE IP.

TRANSPORT PROTOCOLS: UDP, TCP; RELIABLE SERVICE FOR BIT FLOW; TCP SEGMENT FORMAT; OPENING AND CLOSING TCP CONNECTION, FLOW CONTROL, ADAPTIVE RETRANSMISSION, OVERFLOW CONTROL AND RESOURCE ALLOCATION, QUALITY OF SERVICE (DIFFSERV AND INTSERV).

APPLICATIONS: DNS, E-MAIL: SMTP, MIME, POP; WEB: HTTP, NOTIONS OF OVERLAY NETWORKS (P2P AND CONTENT DISTRIBUTION NETWORKS)

LAB-ACTIVITIES

1. INTRODUCTION TO SOCKETS
2. SOCKET TCP
3. SOCKET UDP
4. I/O MULTIPLEXING
5. SOCKET OPTIONS AND I/O FUNCTIONS

	Teaching Methods
	THE COURSE STRUCTURE INCLUDES A THEORY PART AND A LAB PART. THE THEORY LECTURES FOCUS ON FOUNDATIONS AND PRINCIPLE OF NETWORKS. THE LAB PART FOCUSES ON THE DEVELOPMENT OF CLIENT SERVER APPLICATIONS USING THE C PROGRAMMING LANGUAGE.

	Verification of learning
	THERE WILL BE 6 SESSIONS OF EXAM DURING THE ACADEMIC YEAR. THE EXAM IS DIVIDED INTO THREE PARTS: A WRITTEN TEST , A COMPUTER/PRACTICAL TEST AND AN INTERVIEW. THE FINAL MARK WILL BE COMPUTED AS A WEIGHTED AVERAGE OF THE RESULT TO THE THREE INDIVIDUAL TESTS.

	Texts
	FOR THE THEORETICAL PART OF THE COURSE: RETI DI CALCOLATORI E INTERNET B.A. FOROUZAN, MCGRAW HILL ISBN 978-88-386-6411. OTTOBRE 2007 FOR THE LAB PART OF THE COURSE: UNIX NETWORK PROGRAMMING W.R. STEVENS, FENNER, RUDOFF PRENTICE HALL TERZA EDIZIONE, 2003 ISBN 0-13-141155-1

	More Information
	PARTICIPATION IN THE EXERCISE SESSIONS AND ATTENDANCE TO ALL LECTURES ARE STRONGLY ADVISED. MOREOVER, IT IS EXPECTED THAT STUDENTS DEVOTE A SUFFICIENT ADDITIONAL TIME TO INDIVIDUALLY STUDY THE MATERIAL INDICATED BY THE TEACHER. IT IS BELIEVED THAT IN ORDER TO REACH A SUFFICIENT LEVEL TWO HOURS OF EXTRA-LECTURE STUDY ARE NECESSARY PER EACH HOUR OF LECTURE. MOREOVER, THE STUDENT SHOULD DEVOTE AT LEAST 3 HOURS PER WEEK TO THE PRACTICAL ACTIVITY (C- PROGRAMMING) ON TOP OF THE COURSE LAB SESSIONS.

More Information

PARTICIPATION IN THE EXERCISE SESSIONS AND ATTENDANCE TO ALL LECTURES ARE STRONGLY ADVISED. MOREOVER, IT IS EXPECTED THAT STUDENTS DEVOTE A SUFFICIENT ADDITIONAL TIME TO INDIVIDUALLY STUDY THE MATERIAL INDICATED BY THE TEACHER. IT IS BELIEVED THAT IN ORDER TO REACH A SUFFICIENT LEVEL TWO HOURS OF EXTRA-LECTURE STUDY ARE NECESSARY PER EACH HOUR OF LECTURE. MOREOVER, THE STUDENT SHOULD DEVOTE AT LEAST 3 HOURS PER WEEK TO THE PRACTICAL ACTIVITY (C- PROGRAMMING) ON TOP OF THE COURSE LAB SESSIONS.

BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]