Luca GRECO | Computer Networks

cod. 0612700042

COMPUTER NETWORKS

	0612700042
	DIPARTIMENTO DI INGEGNERIA DELL'INFORMAZIONE ED ELETTRICA E MATEMATICA APPLICATA
	EQF6
	COMPUTER ENGINEERING
	2016/2017

PERCORSO COMUNE Cohort 2014/2015

	OBBLIGATORIO
	YEAR OF COURSE 3
	YEAR OF DIDACTIC SYSTEM 2012
	PRIMO SEMESTRE

TEACHING UNITS

	SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
	INF/01	9	90	LESSONS	SUPPLEMENTARY COMPULSORY SUBJECTS

PROFESSORS

	VINCENZO AULETTA T Curriculum
	LUCA GRECO Curriculum

	Objectives
	The course provides the methodology and tools for a clear understanding of computer networks. Special attention is paid to architectural design of networks and their basic services. Knowledge and understanding Students will learn models used for representing computer networks, the most relevant network architectures (both local and geographic) and network design methodologies. Applying knowledge and understanding Students will learn how to describe and to design the architecture of a LAN network and its connection to the internet, and basic services that it will provide, accounting for both technical and normative aspects; how to analyze and understand the main network protocols; how to choose and dimension active network devices.

The course provides the methodology and tools for a clear understanding of computer networks. Special attention is paid to architectural design of networks and their basic services.

Knowledge and understanding
Students will learn models used for representing computer networks, the most relevant network architectures (both local and geographic) and network design methodologies.

Applying knowledge and understanding
Students will learn how to describe and to design the architecture of a LAN network and its connection to the internet, and basic services that it will provide, accounting for both technical and normative aspects; how to analyze and understand the main network protocols; how to choose and dimension active network devices.

	Prerequisites
	PREREQUISITES: TO SIT FOR THE EXAMINATION IT IS REQUIRED TO HAVE PREVIOUSLY PASSED THE EXAM OF COMPUTER ORGANIZATION. MOREOVER, BASIC MATHEMATICAL COMPETENCE IS REQUIRED FOR THE SUCCESSFUL ACHIEVEMENT OF COURSE OBJECTIVES.

	Contents
	INTRODUCTION COMPUTER NETWORKS HARDWARE AND SOFTWARE. LOCAL (LAN), METROPOLITAN (MAN) AND WIDE (WAN) AREA NETWORKS. INTERNETWORKING. INTERNET ARCHITECTURE. NETWORK PROTOCOLS AND THEIR HIERARCHY. INTERFACES AND SERVICES. OSI REFERENCE MODEL AND TCP / IP. LECTURE HOURS 6 APPLICATION LEVEL MAIN APPLICATION PROTOCOLS. NETWORK OPERATING SYSTEMS. WORLD WIDE WEB HTTP AND HTML; EMAIL: SMTP, MIME, POP AND IMAP; FILE TRANSFER: FTP; TELNET; DNS. THE SOCKET PROGRAMMING INTERFACE. LECTURE HOURS 9 - EXERCISE HOURS 6 TRANSPORT LEVEL TRANSPORT LEVEL SERVICES. MULTIPLEXING AND DEMULTIPLEXING. RELIABLE AND UNRELIABLE TRANSPORT SERVICES. CONNECTIONLESS TRANSPORT: UDP. CONNECTION-ORIENTED TRANSPORT: TCP. CONGESTION CONTROL. LECTURES HOURS 8 - EXERCISE HOURS 7 NETWORK LEVEL FORWARDING AND ROUTING. VIRTUAL CIRCUIT AND DATAGRAM NETWORKS. INTERNETWORKING. NETWORK LEVEL OF THE INTERNET. IP PROTOCOL AND ITS EVOLUTION (IPV6). IP ADDRESSING. ACTIVE NETWORK DEVICES: ROUTER. ROUTING ALGORITHMS. ROUTING IN AUTONOMOUS SYSTEMS AND BETWEEN AUTONOMOUS SYSTEMS. LECTURE HOURS 12 - EXERCISE HOURS 11 DATALINK LEVEL ERROR DETECTION AND CORRECTION TECHNIQUES. MULTIPLE ACCESS CONTROL. ADDRESSING AT LINK LEVEL. IEEE 802 STANDARD. ETHERNET AND ITS EVOLUTION. ACTIVE NETWORK DEVICES: HUB, BRIDGE, REPEATER. LINK VIRTUALIZATION. WIRELESS NETWORKS: INTRODUCTION. LECTURE HOURS 12 - EXERCISE HOURS 10 LOCAL NETWORKS DESIGN STRUCTURED CABLING SYSTEMS AND THEIR STANDARDS. METHODOLOGY AND TOOLS FOR THE DESIGN AND CERTIFICATION OF STRUCTURED CABLING SYSTEMS. LECTURE HOURS 5 - EXERCISE HOURS 4 TOTAL LECTURE HOURS 52 - EXERCISE HOURS 38

Contents

INTRODUCTION
COMPUTER NETWORKS HARDWARE AND SOFTWARE. LOCAL (LAN), METROPOLITAN (MAN) AND WIDE (WAN) AREA NETWORKS. INTERNETWORKING. INTERNET ARCHITECTURE. NETWORK PROTOCOLS AND THEIR HIERARCHY. INTERFACES AND SERVICES. OSI REFERENCE MODEL AND TCP / IP.
LECTURE HOURS 6

APPLICATION LEVEL
MAIN APPLICATION PROTOCOLS. NETWORK OPERATING SYSTEMS. WORLD WIDE WEB HTTP AND HTML; EMAIL: SMTP, MIME, POP AND IMAP; FILE TRANSFER: FTP; TELNET; DNS. THE SOCKET PROGRAMMING INTERFACE.
LECTURE HOURS 9 - EXERCISE HOURS 6

TRANSPORT LEVEL
TRANSPORT LEVEL SERVICES. MULTIPLEXING AND DEMULTIPLEXING. RELIABLE AND UNRELIABLE TRANSPORT SERVICES. CONNECTIONLESS TRANSPORT: UDP. CONNECTION-ORIENTED TRANSPORT: TCP. CONGESTION CONTROL.
LECTURES HOURS 8 - EXERCISE HOURS 7

NETWORK LEVEL
FORWARDING AND ROUTING. VIRTUAL CIRCUIT AND DATAGRAM NETWORKS. INTERNETWORKING. NETWORK LEVEL OF THE INTERNET. IP PROTOCOL AND ITS EVOLUTION (IPV6). IP ADDRESSING. ACTIVE NETWORK DEVICES: ROUTER. ROUTING ALGORITHMS. ROUTING IN AUTONOMOUS SYSTEMS AND BETWEEN AUTONOMOUS SYSTEMS.
LECTURE HOURS 12 - EXERCISE HOURS 11

DATALINK LEVEL
ERROR DETECTION AND CORRECTION TECHNIQUES. MULTIPLE ACCESS CONTROL. ADDRESSING AT LINK LEVEL. IEEE 802 STANDARD. ETHERNET AND ITS EVOLUTION. ACTIVE NETWORK DEVICES: HUB, BRIDGE, REPEATER. LINK VIRTUALIZATION. WIRELESS NETWORKS: INTRODUCTION.
LECTURE HOURS 12 - EXERCISE HOURS 10

LOCAL NETWORKS DESIGN
STRUCTURED CABLING SYSTEMS AND THEIR STANDARDS. METHODOLOGY AND TOOLS FOR THE DESIGN AND CERTIFICATION OF STRUCTURED CABLING SYSTEMS.
LECTURE HOURS 5 - EXERCISE HOURS 4

TOTAL
LECTURE HOURS 52 - EXERCISE HOURS 38

	Teaching Methods
	TEACHING METHODS: LECTURES, GUIDED EXERCISES AND LABS. COMPULSORY ATTENDANCE: IN ORDER TO PARTICIPATE TO THE FINAL ASSESSMENT AND TO GAIN THE CREDITS CORRESPONDING TO THE COURSE, THE STUDENT MUST HAVE ATTENDED AT LEAST 70% OF THE HOURS OF ASSISTED TEACHING ACTIVITIES.

	Verification of learning
	THE FINAL EXAM IS DESIGNED TO EVALUATE AS A WHOLE: THE KNOWLEDGE AND UNDERSTANDING OF THE CONCEPTS PRESENTED IN THE COURSE, AND THE ABILITY TO APPLY SUCH KNOWLEDGE IN DESIGNING, CONFIGURING AND ADMINISTERING SIMPLE LOCAL NETWORKS. THE EXAM CONSISTS OF A WRITTEN TEST, WHOSE AIM IS TO ASSESS THE ABILITY OF APPLYING KNOWLEDGE AND THE CAPACITY OF WRITING A TECHNICAL REPORT, AND AN ORAL INTERVIEW., WHOSE AIM IS TO ASSESS THE ACQUIRED KNOWLEDGE AND ABILITY TO UNDERSTANDING AND THE PRESENTATION SKILLS. THE WRITTEN TEST CONSISTS IN SOLVING TYPICAL PROBLEMS PRESENTED IN THE COURSE AND ANSWERING QUESTIONS RELATED TO ARGUMENTS OF THE COURSE. THE ORAL EXAMINATION WILL COVER ALL THE TOPICS OF THE COURSE AND ASSESSMENT WILL TAKE INTO ACCOUNT THE KNOWLEDGE DEMONSTRATED BY THE STUDENT AND THE DEGREE OF ITS DEPTH, PROVEN ABILITY TO LEARN, THE QUALITY OF THE PRESENTATION. IN THE FINAL EVALUATION, EXPRESSED IN THIRTIES, THE EVALUATION OF THE WRITTEN TEST WILL ACCOUNTS FOR 45% WHILE THE ORAL INTERVIEW FOR THE REMAINING 55%. THE CUM LAUDE MAY BE GIVEN TO STUDENTS WHO DEMONSTRATE THAT THEY CAN APPLY THE KNOWLEDGE AUTONOMOUSLY EVEN IN CONTEXTS OTHER THAN THOSE PROPOSED IN THE COURSE.

Verification of learning

THE FINAL EXAM IS DESIGNED TO EVALUATE AS A WHOLE: THE KNOWLEDGE AND UNDERSTANDING OF THE CONCEPTS PRESENTED IN THE COURSE, AND THE ABILITY TO APPLY SUCH KNOWLEDGE IN DESIGNING, CONFIGURING AND ADMINISTERING SIMPLE LOCAL NETWORKS.

THE EXAM CONSISTS OF A WRITTEN TEST, WHOSE AIM IS TO ASSESS THE ABILITY OF APPLYING KNOWLEDGE AND THE CAPACITY OF WRITING A TECHNICAL REPORT, AND AN ORAL INTERVIEW., WHOSE AIM IS TO ASSESS THE ACQUIRED KNOWLEDGE AND ABILITY TO UNDERSTANDING AND THE PRESENTATION SKILLS.

THE WRITTEN TEST CONSISTS IN SOLVING TYPICAL PROBLEMS PRESENTED IN THE COURSE AND ANSWERING QUESTIONS RELATED TO ARGUMENTS OF THE COURSE. THE ORAL EXAMINATION WILL COVER ALL THE TOPICS OF THE COURSE AND ASSESSMENT WILL TAKE INTO ACCOUNT THE KNOWLEDGE DEMONSTRATED BY THE STUDENT AND THE DEGREE OF ITS DEPTH, PROVEN ABILITY TO LEARN, THE QUALITY OF THE PRESENTATION. IN THE FINAL EVALUATION, EXPRESSED IN THIRTIES, THE EVALUATION OF THE WRITTEN TEST WILL ACCOUNTS FOR 45% WHILE THE ORAL INTERVIEW FOR THE REMAINING 55%. THE CUM LAUDE MAY BE GIVEN TO STUDENTS WHO DEMONSTRATE THAT THEY CAN APPLY THE KNOWLEDGE AUTONOMOUSLY EVEN IN CONTEXTS OTHER THAN THOSE PROPOSED IN THE COURSE.

	Texts
	J. KUROSE, K. ROSS, INTERNET E RETI DI CALCOLATORI, VI ED. PEARSON, PARAVIA ITALIA, 2013 ADDITIONAL LEARNING MATERIALS WILL BE MADE AVAILABLE ON THE WEB SITE OF THE COURSE. SUGGESTED READINGS A. TANENBAUM, D. WHETERALL, RETI DI CALCOLATORI, V ED., 2011, PEARSON B. FOROUZAN, RETI DI CALCOLATORI E INTERNET, MCGRAW-HILL 2008

	More Information
	The course language is Italian.

BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-03-11]

Luca GRECO | Computer Networks