Advanced network techniques WM-I-ZTS-EN
Advanced Network Techniques:
1. Principles of network interconnection (LAN/WAN, LAN switches, VLANs, IP routing).
2. Routing at layer 2
a. Transparent bridges
b. Spanning Tree Protocol (STP)
c. Rapid Spanning Tree Protocol (RSTP)
d. VLANs
3. Internal routing at layer 3
a. Distance vector (Bellman-Ford)
i. count to infinity
ii. split horizon
b. Protocols: RIP, IGRP
c. Link state
i. flooding topology information
ii. finding the shortest paths (Dijkstra)
iii. areas - hierarchical routing
d. OSPF
i. neighbor discovery - Hello protocol
ii. database synchronization
iii. link state updates
iv. examples
4. External routing - BGP
a. Principles of Inter-Domain Routing
i. Autonomous systems
ii. Path vector routing
iii. Policy Routing
iv. Route Aggregation
v. Anycast
b. How BGP works?
i. Attributes of routes, route selection
ii. Interaction BGP-IGP-Packet forwarding
iii. Other mechanisms
iv. Filtering
v. Security: ROV-RPKI
c. Examples
d. Illustrations and statistics
5. Principles of congestion control
a. Objectives of Congestion Control
i. efficiency
ii. fairness
b. Max-min fairness
c. Proportional fairness
d. AIMD algorithm
e. Different forms of congestion control
6. Congestion control algorithms in TCP
a. TCP Tahoe congestion control states
i. Slow Start
ii. Congestion Avoidance
b. TCP Reno congestion control states
i. Slow Start
ii. Congestion Avoidance
iii. Fast Recovery
c. TCP RENO fairness
d. TCP Cubic
e. TCP BBR
f. ECN
7. QoS in IP networks
a. QoS principles
b. Traffic shaping
i. leaky bucket
ii. token bucket
c. Scheduling
i. FIFO
ii. Fair queueing
d. AQM: RED, CoDel
e. IntServ
f. DiffServ
8. MPLS technology
a. Label swapping
b. Elements of MPLS
c. Label switching
d. Label distribution
e. Interaction with IGP
f. Traffic engineering
9. Network administration: SNMP
a. Principles of network management
b. Information model
i. ASN.1
ii. BER
c. Management Information Base (MIB)
i. Type definitions
ii. Object identifiers
iii. Object instances
iv. Index
d. SNMP v1, v2, v3
10. Case studies: data center interconnection networks
a. Infrastructure architecture, Fat Trees topology
b. Valient Load Balancing
(in Polish) Dyscyplina naukowa, do której odnoszą się efekty uczenia się
(in Polish) E-Learning
(in Polish) Grupa przedmiotów ogólnouczenianych
Subject level
Learning outcome code/codes
Type of subject
Preliminary Requirements
Course coordinators
Term 2023/24_Z: | Term 2024/25_Z: |
Learning outcomes
W1 The student has basic knowledge of advanced networking techniques.
W2 The student has an understanding of level 2 and level 3 routing protocols (STP, RIP, OSPF, BGP), MPLS technology, network administration protocols and communication problems in computing centers and the cloud.
W3 The student has a structured and theoretically supported knowledge of congestion control algorithms, quality of service, traffic shaping, packet scheduling methods.
U1 The student is able to understand the operation of modern computer networks.
U2 The student is able to use the learned protocols and algorithms to implement network technology projects.
U3 The student is able to configure STP, RIP, OSPF, and BGP routing protocols.
K1 The student understands the basic principles of modern computer networks and is able to adapt to the latest technologies in this field.
K2 The student is able to cooperate with specialists in the field of computer networks.
Assessment criteria
W1 W2 W3:
- For a very good grade - the student defines independently all concepts and
terms in the field of level 2 and 3 routing protocols (STP, RIP, OSPF, BGP), MPLS technology, network administration protocols and communication problems in computing centers and in the cloud, as well as congestion control algorithms, quality of service, traffic shaping, packet scheduling methods.
- For a good grade - the student defines most of the concepts and
terms in terms of level 2 and 3 routing protocols (STP, RIP, OSPF, BGP), MPLS technology, network administration protocols and communication problems in computing centers and in the cloud, and congestion control algorithms, quality of service, traffic shaping, packet scheduling methods.
- At the grade of sufficient - the student defines some concepts and
terms in the field of level 2 and 3 routing protocols (STP, RIP, OSPF, BGP), MPLS technology, network administration protocols and communication problems in computing centers and cloud, and congestion control algorithms, quality of service, traffic shaping, packet scheduling methods.
U1 U2 U3:
- At the grade of very good - the student is able to understand the operation of modern computer networks very well, use the learned protocols and algorithms to implement projects in the field of network technologies and configure STP, RIP, OSPF and BGP routing protocols.
- At the grade of good - the student is able to have a good understanding of the operation of modern computer networks, use the learned protocols and algorithms to implement projects in the field of network technologies and configure STP, RIP, OSPF and BGP routing protocols.
- At the grade of sufficient - the student can satisfactorily understand the operation of modern computer networks, use the learned protocols and algorithms to implement projects in the field of network technologies and configure STP, RIP, OSPF and BGP routing protocols.
K1 K2:
- At the grade of very good - the student has achieved a very good awareness of the basic principles of modern computer networks, as well as the ability to adapt to the latest technologies in this field and cooperate with specialists in the field of computer networks.
- At the grade of good - the student has achieved a good awareness of the basic principles of modern computer networks, as well as is able to adapt to the latest technologies in this area and cooperate with specialists in the field of computer networks.
- At the grade of sufficient - the student has achieved a satisfactory awareness of the basic principles of modern computer networks, as well as is able to adapt to the latest technologies in this area and cooperate with specialists in the field of computer networks.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: