4.1.12 Rechnernetze I
Vorlesung im Sommersemester 2006
- Zeit
- Montags, 14 Uhr c.t., D028
Mittwochs, 10 Uhr c.t., D028
Vorlesungsbeginn: Montag, 24. April 2006
- Dozent
Prof. Dr. Christoph Steigner
Vorlesungsmaterialien
Links
- Offizielle VNUML Homepage
- VNUML Homepage der Uni Koblenz
incl. Download eines Offline Installers.
Scheinerwerb und Klausur
- Die Nachklausur hat stattgefunden am Donnerstag, 12. Oktober 2006, 10:00-12:00 Uhr, D028
- Musterlösung zur Nachklausur
- Ergebnisse der Nachklausur
- Der Schein zur Vorlesung kann durch die erfolgreiche Teilnahme an der Klausur erworben werden.
- Die Klausur hat stattgefunden am Mittwoch, den 2. August 2006 von 10:00-12:00 Uhr im Hörsaal D028.
- Musterlösung zur Klausur
- Ergebnisse der Klausur
- Zulassungsvoraussetzung zur (Nach)klausur ist die erfolgreiche Teilnahme an den Übungen und die rechtzeitige Klausuranmeldung über MeToo.
Vorlesungsgliederung
- Internet a network of networks - Terms and Essentials
- Example: WEB-Service
- IP Addressing
- Packet transport Example: Mail System
- Why packet transport?
- Packet miss-deliveries
- Stop and Wait protocol
- Sliding window protocol
- Link layer protocol
- Network Architecture
- Networks
- Local Network
- Local Area Network (LAN)
- Switched local network
- Global networks
- Network Layer Protocol
- Socket - API
- Sockets
- Socket- API
- Socket- Addresses
- Client / Server Interaction
- Berkeley Sockets API
- Berkeley Sockets Address Specification
- Example Echo-Service
- Concurrent Server
- Web and HTTP
- Non-persistent Connection
- Persistent Connection without pipelining
- Persistent Connection with pipelining
- Method types
- HTTP request message
- HTTP response message
- HTTP session
- HTTP Persistent State on Clients: Cookies
- HTTP Web caches (proxy server)
- HTTP Conditional GET
- Transmission Theorems
- Limitation of Bandwidth (Fourier-Analysis)
- Sample and Hold Theorem (Nyquist)
- Maximal Date Rate per Channel (Shannon)
- Links
- Twisted Pair
- Coax Cable
- Fibre Optics
- Communication Satellites
- Bandwidth, Latency, Jitter and Dispersion
- Transfer Media
- Last mile Transmission methods
- Integrated Digital Services Network ISDN
- Asymmetric Digital Subscriber Line (ADSL)
- Interdomain Transmission methods
- Synchronous Digital Hierarchies (SDH, SONET)
- Plesio-Synchronous Digital Hierarchies, (PSDL)
- Dense Wavelength Distribution Multiplexing (DWDM)
- Asynchronous Transfer Mode (ATM)
- Last mile Transmission methods
- Encoding
- Receiver Synchronization
- Non Return Zero (NRZ),NRZ-Inverted (NRZI)
- Manchester-Code
- 4B/5B,8B/10B-Code
- Framing
- Bit Stuffing (HDLC)
- Character Stuffing
- Clock-Based Framing (SONET)
- Cryptography
- Symmetric Keys
- Asymmetric Keys
- Error Detection and Correction
- Parity Checks
- Hamming Codes
- Cyclic Redundancy Check (CRC)
- Checksums
- Data Compression
- Run Length Encoding
- Differential Pulse Code Modulation
- Dictionary-Based Methods
- Huffman Coding
- Image Compression (JPEG)
- Receiver Synchronization
- Link Layer Transmission Protocols
- Reliable Transmission
- Stop-and-Wait
- Sliding Window
- Selective Repeat (SR)
- Go-Back-N (GBN)
- Making transmissions more reliable
- Flow control and frame order
- Reliable Transmission
- Protocol Design
- Syntax, Semantic, Time Constraints
- Interaction Diagram
- Protocol Specification Graph
- Interacting Automatons
- Timeouts
- Unexpected Primitives and Authentication
- Object -Based Protocol Design (x-kernel)
- ACTIVE OPEN, PASSIVE OPEN
- PARTICIPANT SET
- OSI Architecture
- The TCP-IP Architecture
- Local Area Networks (Link Layer)
- Ethernet
- Random Access Protocols
- Network Adaptors
- Hubs
- Bridges and LAN Switches
- Learning Bridges
- Spanning Tree Algorithm (STP)
- Broadcast and Multicast
- Limitations of Bridges
- VLAN
- Layer-2 Switches
- VLAN-Association-Rules
- Implicit tagging
- Explicit Tagging
- VLAN-Aware End Stations
- VLAN-Switch Generations
- Overview of the 802.1Q Standard
- Spanning forests
- Layer 3 Switch
- Ethernet
- Network Layer
- Packet Switching
- Forwarding Decisions
- Routing Algorithms for intra domains
- Distance Vector Routing Algorithm (RIP)
- Link State Routing Algorithm (OSPF)
- Simple Internetworking (IPv4)
- IPv4 Service Model
- Datagram Forwarding in IP
- Global Addresses
- Subnetting-Supernetting (CIDR)
- Address Translation (ARP)
- Host Configuration (DHCP)
- Internet Control Management Protocol
- Packet Switching
- Transport Layer - Protocols between End-Nodes
- User Datagram Protocol (UDP)
- Datagram Format
- Connectionless Service
- Transport Control Protocol (TCP)
- Connection Oriented Service
- Segment Format
- Measuring the Roundtrip Time
- Connection Establishment and Termination
- TCP Flow Control
- Advertised Window
- Triggering Transmission
- Adaptive Retransmission
- Marking of Data Record Boundaries
- TCP Improvements
- User Datagram Protocol (UDP)
- TCP Congestion Control
- Additive Increase/Multiplicative Decrease
- Slow Start
- Fast Retransmit and Fast Recovery
- Congestion-Avoidance Mechanisms - Source-Based Congestion Avoidance
- Congestion Avoidance Schemes
- DEC bit
- Random Early Detection (RED)
- NETWORK Address Translation (NAT)
- Inside Local Outside Global Addresses
- Port Address Translation (PAT)
- Application layer
- Principles of network applications
- Web and HTTP
- FTP
- Electronic Mail SMTP, POP3, IMAP
- DNS
- P2P file sharing
- Socket programming with TCP
- Socket programming with UDP
- Building a Web server
Books
- Computer Networks A System Approach
Larry L. Peterson, Bruce S. Davie
3.Edition, Morgan Kaufmann Publishing Comp. 2003
- Computer Networking
James F. Kurose, Keith W. Ross
3.Edition, Pearson Addison Wesley Publishing Comp. 2005
- Data and Computer Communications
William Stallings
7.Edition, Pearson Prentice Hall 2004
- The Internet and its Protocols A Comparative Approach
Adrian Farrel
Morgan Kaufmann Publishing Comp. 2004
- An Introduction to Management of TCP/IP-based Internets
Marshall T.Rose
Prentice Hall
- Network management- A Practical Perspective
Karen Fang
Addison-Wesley
- How To Manage Your Network Using SNMP
Marshall Rose, Keith McCloghrie
Prentice Hall
zuletzt verändert:
06.02.2009 22:07
Kontakt