Kandahar University
Computer Science Faculty
Network department
Network Routing and Switching
Lecture 1- Chapter 4
Network Layer - The Data Plane
Lecturer: TA. Shams Rashidy
Google Classroom: ( ufq25cqf )
What is Routing and Switching?
4-2
Your Expectation From the Course?
4-3
Course Organization
■ Network II (Routing and Switching)
■ Class: Manday and Thursday 08:30 AM to 10:20
■ CP / week: 4CP - 2 Practical
■ 75% Attendance required to enroll in the exam.
■ Course is Lecture, Project, Assignment base.
■ We will have mid term(Paper and Practical lab) and final exam.
■ Meeting time and location:
Time: - when
Location: Software Department, Faculty of Computer Science
4-4
Course Description
▪ --
4-5
Aim
1. To understand the use and implementation of routing and switching technologies.
2. To understand about IPv4 & IPv6 addressing
3. To design and implement sub-netting practically.
4. To understand and work on configuration of switch and router devices
5. To understand the functionality of switching protocols such as STP, ARP and VLAN, Trank
6. To implement IPv4, IPv6, DHCP and NAT protocols.
7. To discuss the concepts of routing algorithms and protocols.
8. To implement practically the routing protocols in routers (RIP, OSPF, EIGRP)
9. To know the application of IP routing environment practically.
10. To discuss and comparing both proprietary and open-source routing.
4-6
Key Learning Outcomes
At the end of this course students will be able to:
1. To define routing and switching technologies.
2. To describe and design IPv4 addressing and subnets.
3. To design a LAN network for small and enterprise organizations.
4. To compare static and dynamic routing.
5. To setup switch and router devices.
6. To explain internet routing protocols.
7. To apply internet routing protocols.
8. To setup a LAN and WAN design practically.
9. To design and implement routing and switching technologies in group projects.
4-7
Syllabus
The course will be structured into the following units:
1. Network Addressing Overview 7. Network Address Translation
2. IPv4 addressing and Sub-netting 8. Router Architecture and Basic Configurations
3. LAN Technologies 9. Routing Protocols Concept (Static & Dynamic Routing)
4. Layer 2 Protocols Overview 10. Link state, Distance vector & Hierarchal Routing
Algorithms
5. Switch Services & Configurations
11. Routing protocols concept and implementation: OSPF
6. DHCP & ICMP Protocols
12. Routing protocols concept: BGP
13. IPv6 addressing concepts and application
4-8
Teaching and Learning methods
Course Policy
4-9
Reference Text Books
Text Books:
• Kurose, J. F., & Ross, K. W. Computer Networking Top-down approach 6th edition
Reference:
1. Tanenbaum, A. S., & D. J., Wetherall, Computer Networks 5th edition
2. Medhi, D., Ramasamy, K. (2007) Network Routing: Algorithms, Protocols and Architecture.
3. Wallace, K. (2015). CCNP routing and switching ROUTE 300-101 official cert guide.
4. Cisco [Link], W. (2013). CCNA Routing and Switching 200-120 Official Cert Guide Library.
5. Todd Lammle-CCNA Routing and Switching Complete Study Guide
4-10
Evaluation Method(s)
Final Project Homework Practical Exam Midterm Exam Final Exam
10% 10% 10% 10% 60%
*Homework(Attendance, Quizzes, Labs, Homework)
*Midterm Exam(Foundations, Lab Exam(Practica Exam and Midterm Exam))
4-11
Chapter 4: outline
4.1 Overview of Network 4.4 Generalized Forward and SDN
layer • match
• data plane • action
• control plane • OpenFlow examples of match-
4.2 What’s inside a router plus-action in action
4.3 IP: Internet Protocol
• datagram format
• fragmentation
• IPv4 addressing
• network address
translation
• IPv6
4-12
Chapter 4: network layer
chapter goals:
▪ understand principles behind network layer
services, focusing on data plane:
• network layer service models
• forwarding versus routing
• how a router works
• generalized forwarding
▪ instantiation, implementation in the Internet
4-13
Network layer
application
▪ transport segment from transport
network
sending to receiving host data link
physical
network network
▪ on sending side network
data link
data link
physical
data link
physical
encapsulates segments physical network
data link
network
data link
into datagrams physical physical
▪ on receiving side, delivers network
data link
network
data link
segments to transport
physical physical
network
data link
layer network
physical
application
transport
▪ network layer protocols network
data link
physical
network
data link
network
data link
in every host, router data link
physical
physical physical
▪ router examines header
fields in all IP datagrams
passing through it
4-14
Two key network-layer functions
network-layer functions: analogy: taking a trip
▪forwarding: move packets ▪ forwarding: process of
from router’s input to getting through single
appropriate router output interchange
▪routing: determine route
taken by packets from ▪ routing: process of
source to destination planning trip from source
• routing algorithms to destination
4-15
Network layer: data plane, control plane
Data plane Control plane
▪ local, per-router function ▪ network-wide logic
▪ determines how datagram ▪ determines how datagram is
arriving on router input routed among routers along
port is forwarded to end-end path from source host
router output port to destination host
▪ forwarding function ▪ two control-plane approaches:
• traditional routing algorithms:
values in arriving
packet header implemented in routers
• software-defined networking
0111 1
2
(SDN): implemented in
3 (remote) servers
4-16
Per-router control plane
Individual routing algorithm components in each and every
router interact in the control plane
Routing
Algorithm
control
plane
data
plane
values in arriving
packet header
0111 1
2
3
4-17
Logically centralized control plane
A distinct (typically remote) controller interacts with local
control agents (CAs)
Remote Controller
control
plane
data
plane
CA
CA CA CA CA
values in arriving
packet header
0111 1
2
3
4-18
Network service model
Q: What service model for “channel” transporting
datagrams from sender to receiver?
example services for example services for a flow
individual datagrams: of datagrams:
▪ guaranteed delivery ▪ in-order datagram
▪ guaranteed delivery with delivery
less than 40 msec delay ▪ guaranteed minimum
bandwidth to flow
▪ restrictions on changes in
inter-packet spacing
4-19
Network layer service models:
Guarantees ?
Network Service Congestion
Architecture Model Bandwidth Loss Order Timing feedback
Internet best effort none no no no no (inferred
via loss)
ATM CBR constant yes yes yes no
rate congestion
ATM VBR guaranteed yes yes yes no
rate congestion
ATM ABR guaranteed no yes no yes
minimum
ATM UBR none no yes no no
4-20
4-21
4-22