Francesco ORCIUOLI | COMPUTER NETWORKS
Francesco ORCIUOLI COMPUTER NETWORKS
cod. 0512100011
COMPUTER NETWORKS
0512100011 | |
DIPARTIMENTO DI INFORMATICA | |
COMPUTER SCIENCE | |
2014/2015 |
OBBLIGATORIO | |
YEAR OF COURSE 2 | |
YEAR OF DIDACTIC SYSTEM 2008 | |
SECONDO SEMESTRE |
SSD | CFU | HOURS | ACTIVITY | |
---|---|---|---|---|
INF/01 | 6 | 48 | LESSONS | |
INF/01 | 3 | 30 | LAB |
Objectives | |
---|---|
KNOWLEDGE AND UNDERSTANDING: THE AIM OF THE COMPUTER NETWORKS COURSE IS TO TEACH THE BASIC PRINCIPLES OF COMPUTER NETWORKS, AND TO STUDY THE MORE WIDESPREAD NETWORK TECHNOLOGIES AND THEIR PERTINENT PROGRAMMING TECHNIQUES. THE COURSE CONSISTS OF A THEORETICAL AND A PRACTICAL PART. IN THE THEORETICAL PART THE BASIC PRINCIPLES FOR THE DESIGN OF A COMPUTER NETWORK ARE STUDIED: NETWORK ARCHITECTURE, ENCODING AND RELIABLE TRANSMISSION, PACKET SWITCHING, NETWORK INTERCONNECTIONS, TRANSPORT PROTOCOLS, NETWORK CONTROL, AND APPLICATIONS. THE PRACTICAL PART IS CARRIED OUT IN LABORATORY AND AIMS TO THE DEVELOPMENT OF SIMPLE CLIENT-SERVER APPLICATIONS USING THE C PROGRAMMING LANGUAGE AND THE BERKLEY API SOCKET. APPLYING KNOWLEDGE AND UNDERSTANDING: THE COURSE AIMS TO MAKE STUDENTS ABLE TO CONFIGURE AND MANAGE SMALL LOCAL NETWORKS , DEVELOP SIMPLE CLIENT-SERVER APPLICATIONS, AND USE NETWORK SERVICES IN A CONSCIOUS WAY. COMMUNICATION SKILLS: STUDENTS WILL ACQUIRE THE ABILITY TO DESCRIBE THE COMPUTER NETWORK HARDWARE AND SOFTWARE COMPONENTS WITH PROPERTY OF LANGUAGE MAKING JUDGMENTS: STUDENTS WILL BE GUIDED TOWARD THE CRITICAL AND RESPONSIBLE LEARNING OF CLASSROOM ACTIVITIES AS WELL AS THE ENRICHMENT OF THEIR ANALYSIS AND SYNTHESIS ABILITIES BY MEANS OF SUITABLE STUDYING MATERIALS THAT THE TEACHER WILL PROPOSE IN ORDER TO GET THEM ACQUIRE ADEQUATE JUDGMENT CAPABILITIES. |
Prerequisites | |
---|---|
BASIC KNOWLEDGE OF OPERATING SYSTEMS AND C PROGRAMMING. IT WOULD ALSO BE APPROPRIATE TO HAVE KNOWLEDGE OF COMPUTER ARCHITECTURE |
Contents | |
---|---|
INTRODUCTION TO NETWORKING • NETWORK STRUCTURE • NETWORK ARCHITECTURES • LAYERING AND PROTOCOLS • INTERNETWORKING • OSI MODEL • MODEL TCP / IP • PERFORMANCE EVALUATION FUNDAMENTALS OF TRANSMISSION • DATA AND SIGNALS • TECHNIQUES ON BROADCAST DATA • MULTIPLEXING • TRANSMISSION MEDIA (WIRED AND WIRELESS) LINE CONTROL • ENCRYPTION OF DATA • FRAMING • DETECTION OF ERRORS (PARITY, CHECKSUMS, CRC) • PROTOCOLS STOP-AND-WAIT, GO-BACK-N, SELECTIVE RETRANSMISSION • MEDIUM ACCESS PROTOCOLS (ETHERNET, TOKEN RING, FDDI, 802.11) • CONNECTING DEVICES • SWITCHING DATAGRAM • COMMUTAZIONEDI VIRTUAL CIRCUITS INTERNETWORKING • IP SERVICE MODEL • IP DATAGRAM FORMAT • IP ADDRESSES WITH CLASSES AND CLASSLESS • FORWARDING OF IP DATAGRAMS • ARP, DHCP, ICMP • ROUTING PROTOCOLS • MOBILE IP TRANSPORT PROTOCOLS • UDP • TCP: SERVING RELIABLE TRANSPORT BIT STREAMS • FORMAT TCP SEGMENTS • OPENING AND CLOSING TCP CONNECTION • FLOW CONTROL • ADAPTIVE RETRANSMISSION • CONGESTION CONTROL AND RESOURCE ALLOCATION • QUALITY OF SERVICE (OUTLINE) APPLICATIONS • DNS • E-MAIL AND WEB IN THE PRACTICAL PART THE FOLLOWING TOPICS ARE COVERED: 1. INTRODUCTION TO SOCKET 2. TCP SOCKET 3. UDP SOCKET 4. I / O MULTIPLEXING 5. SOCKET OPTIONS AND FUNCTIONS OF I / O |
Teaching Methods | |
---|---|
THE COMPUTER NETWORKS COURSE IS MADE UP BY A THEORETICAL PART, THAT IS TAUGHT WITH HEAD-ON LECTURES, DEALING WITH THE PRINCIPLES OF NETWORK OPERATIONS, , AND A PRACTICAL PART, THAT IS TAUGHT IN LABORATORY, DEALING WITH THE DEVELOPMENT OF CLIENT-SERVER APPLICATIONS IN C. |
Verification of learning | |
---|---|
SIX EXAM SESSIONS DURING THE WHOLE ACADEMIC YEAR, IN ADDITION TO A SPECIAL ONE RESERVED TO STUDENTS WHO NEED ONLY FEW EXAMS TO REACH THE CREDIT THRESHOLD FOR THEIR DEGREE. EACH SESSION IS PROVIDED WITH A WRITTEN TEST, A PRACTICAL TEST AND AN ORAL TEST. THE RESULTING MARK IS CALCULATED USING A WEIGHTED AVERAGE OF THE THREE TEST MARKS. |
Texts | |
---|---|
FOR THE THEORY LECTURES: DATA COMMUNICATION AND NETWORKING B.A. FOROUZAN, MCGRAW HILL ISBN 978-88-386-6411. OCTOBER 2007 FOR THE LAB LECTURES: UNIX NETWORK PROGRAMMING W.R. STEVENS, FENNER, RUDOFF PRENTICE HALL THIRD EDITION, 2003 ISBN 0-13-141155-1 |
More Information | |
---|---|
HTTP://WWW.DIA.UNISA.IT/~CICALESE/RETI |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]