MSc: Inter Networking and Routing
Inter-Networking and Routing
- Course name: Inter-Networking and Routing
- Course number:
Course characteristics
Key concepts of the class
- Inter-networking and routing
- BGP, OSPF, and AODV
What is the purpose of this course?
Inter-Networking and Routing is the course for SNE program that provides the students with fundamental knowledge about inter-networking and routing. The course starts with some basic material about routing, such as the definition of path cost and the classification of routing algorithms. A networking infras- tructure deploys a variety of algorithms for routing packets, classified as those using optimal routes and those using non-optimal routes. This course includes hands-on exercise and the students will practice their skills on the real hardware and software. This course includes various interesting topics in the networking domain which are also related to real world applications. This course will par- ticularly focus on topics such as addressing in detail, routing, detailed BGP, OSPF, and AODV. Students will have the opportunity to apply the knowledge learn in class, on real hardware. Furthermore, this course also includes invited talks by experts from industry which will help students to have knowledge of the current state of the art.
Course Objectives Based on Bloom’s Taxonomy
- What should a student remember at the end of the course?
By the end of the course, the students should be able to recognize and define
- IP version 6 and Layer 2 Basics
- Spanning Tree and Routing Basics
- Link-state routing protocol (OSPF)
- Path vector routing protocol (BGP)
- Ad hoc On-Demand Distance Vector Routing (AODV)
- What should a student be able to understand at the end of the course?
By the end of the course, the students should be able to describe and explain (with examples)
- Routing Basics
- BGP
- OSPF
- AODV
- What should a student be able to apply at the end of the course?
By the end of the course, the students should be able to apply
- Install, Configure, update, and manage services over a network
- Configure, maintain, and update the routing tables
- Assign network address and maintain forwarding tables
- Operate applications using BGP routing
- Operate applications using AODV routing
- Represent performance analysis of AODV, OSPF, and BGP
Course evaluation
Proposed points | ||
---|---|---|
Labs/seminar classes | 20 | 50 |
Interim performance assessment | 30 | 0 |
Exams | 50 | 50 |
If necessary, please indicate freely your course’s features in terms of students’ performance assessment: None
Grades range
Proposed range | ||
---|---|---|
A. Excellent | 90-100 | |
B. Good | 75-89 | |
C. Satisfactory | 60-74 | |
D. Poor | 0-59 |
If necessary, please indicate freely your course’s grading features: The semester starts with the default range as proposed in the Table [tab:MLCourseGradingRange], but it may change slightly (usually reduced) depending on how the semester progresses.
Resources and reference material
- Radia Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, 2nd Edition, Sun Microsystems, Inc.
Course Sections
The main sections of the course and approximate hour distribution between them is as follows:
Section | Section Title | Teaching Hours |
---|---|---|
1 | Networking overview | 12 |
2 | IP version 6 and Layer 2 Basics | 12 |
3 | Spanning Tree and Routing Basics | 12 |
4 | Link-state routing protocol (OSPF) | 12 |
5 | Path vector routing protocol (BGP) | 12 |
Section 1
Section title:
Networking overview
Topics covered in this section:
- Present an overview of the main concepts of networking
- Routing Algorithms
- Shortest Path
- Real-Time Network Routing
What forms of evaluation were used to test students’ performance in this section?
|a|c| & Yes/No
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
Typical questions for ongoing performance evaluation within this section
- Explain an overview of the main concepts of networking
- What is the difference between a packet switching and circuit switching?
- List and briefly define types of routing.
- Briefly define the RTNR.
- What is the internetworking?
Typical questions for seminar classes (labs) within this section
- How can a network can be simulated in a virtual environment?
- How to create a simple switched network? What is a subnet?
- How to connect a subnet to the Internet using single IP address with basic routing and NAT?
Test questions for final assessment in this section
- What is the difference between static and dynamic routing?
- What is tunneling?
- How to connect a subnet to the Internet using single IP address with basic routing and NAT?
Section 2
Section title:
IP version 6 and Layer 2 Basics
Topics covered in this section:
- Data link layer - introduction
- Present an overview of the IPv6
- Present the difference between the IPv4 and IPv6
- Error Control Mechanisms
- Reed-Solomon (RS) Codes
- Flow control
What forms of evaluation were used to test students’ performance in this section?
|a|c| & Yes/No
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
Typical questions for ongoing performance evaluation within this section
- What is the difference between the IPv4 and IPv6?
- Types of ARQ Protocols?
- Briefly describe Selective Repeat.
- What is Stop and Wait algorithm?
Typical questions for seminar classes (labs) within this section
- What are the TCP and UDP protocols? How can you discover a remote machine and detect its running services?
- How can you capture and analize a network traffic?
- How can you set-up basic IPv6 network?
- How to separate a network using VLAN technology.
- How can multiple switches be used together to provide fault tolerance.
- How to set-up a link aggregation (bond interface) to provide connection with load balancing and fault tolerance.
Test questions for final assessment in this section
- How can you set-up basic IPv6 network?
- What is the Sliding Window algorithm?
- How are networks connected?
- How can multiple switches be used together to provide fault tolerance?
Section 3
Section title:
Spanning Tree and Routing Basics
Topics covered in this section:
- An overview of the spanning tree.
- An overview of the routing algorithm.
What forms of evaluation were used to test students’ performance in this section?
|a|c| & Yes/No
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
Typical questions for ongoing performance evaluation within this section
- What is spanning tree protocol?
- Explain how spanning tree protocol works?
- Hot to configure STP?
Typical questions for seminar classes (labs) within this section
- How to set-up a link aggregation (bond interface) to provide connection with load balancing and fault tolerance.
- How can you capture and analyze a network traffic?
Test questions for final assessment in this section
- How to elect one root bridge?
- Define designated port!
- How to configure loopguard?
Section 4
Section title:
Link state routing protocol (OSPF)
Topics covered in this section:
- Shortest path first (SPF) forwarding
- Dijkstra’s algorithm
- Low Bandwidth Requirements
- Broadcast Networks
What forms of evaluation were used to test students’ performance in this section?
|a|c| & Yes/No
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
Typical questions for ongoing performance evaluation within this section
- How to reduce convergence delay?
- Dijkstra’s LSR algorithm explain on example!
- Give an example of topology change
- Explain Broadcast Networks
Typical questions for seminar classes (labs) within this section
- Which interface you will select as the OSPF router ID and why?
- What is the difference between advertising all the networks VS manual advertising (per interface or per subnet)?
- Who can you check if you have a full adjacency with your router neighbor?
Test questions for final assessment in this section
- Explain Dijkstra algorithm.
- Which interface you will select as the OSPF router ID and why?
- Why every area has to be connected to area 0?
Section 5
Section title:
Path vector routing protocol(BGP)
Topics covered in this section:
- BGP4: Inter-Domain Routing in the Internet
- BGP Messages, Attributes and Features
- Inter-domain vs Intra-domain routing
- Autonomous Systems and Gateways
What forms of evaluation were used to test students’ performance in this section?
|a|c| & Yes/No
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
Typical questions for ongoing performance evaluation within this section
- How to reduce assign IP address and AS numbers?
- I-BGP and E-BGP explain!
- Intra-domain vs Inter-domain
- Explain RIP, OSPF?
Typical questions for seminar classes (labs) within this section
- Can your BGP peers reach your internal subnets? And can you reach their internal subnets?
- How can the OSPF Internal router know about your peer’s OSPF Internal router?
- Is it a good idea to redistribute BGP routes into the OSPF routing table?
Test questions for final assessment in this section
- Path-vector protocol, explain!
- Multi-Exit Discriminator, explain.
- Is it a good idea to redistribute BGP routes into the OSPF routing table?