Information
Networking II
CPEN441
JOSEPH DOUMIT, PhD
SPRING 2026
Course Information
Prerequisites
◦ CPEN241
Communication:
◦ Announcements on Moodle
◦ Emails: [Link]@[Link]
Office Hours
◦ TTh 15:30 – 17:00 (EC 249)
◦ Or by appointment
Work and Grading
◦ Exam (30%), Project (30%), and Final (40%)
CPEN441 – INFORMATION NETWORKING II Joseph Doumit, PhD 2
Course Overview
o4. Advanced Internetworking
CPEN441 – INFORMATION NETWORKING II
Chapter 4: Advanced
Internetworking
We will cover these skills
o Understanding the scalability of routing in the
Internet
o Discussing IPv6
o Understanding the concept of multicasting
Chapter Outline
o1. Interdomain routing
o2. IPv6
o3. Multicast
o4. MPLS
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING
Chapter Outline
o1. Interdomain routing
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING
Interdomain Routing
The global Internet
The tree structure of the Internet in 1990
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 7
Interdomain Routing
The global Internet
A simple multi-provider Internet
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 8
Interdomain Routing
Internet is organized as autonomous systems (AS) each of
which is under the control of a single administrative entity
Autonomous System (AS)
◦ corresponds to an administrative domain
◦ examples: University, company, backbone network
A corporation’s internal network might be a single AS, as
may the network of a single Internet service provider
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 9
Interdomain Routing
A network with two autonomous system
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 10
Interdomain Routing
Route propagation
Idea: Provide an additional way to hierarchically aggregate routing
information is a large internet.
◦ Improves scalability
Divide the routing problem in two parts:
◦ Routing within a single autonomous system
◦ Routing between autonomous systems
Another name for autonomous systems in the Internet is routing
domains
◦ Two-level route propagation hierarchy
◦ Inter-domain routing protocol (Internet-wide standard)
◦ Intra-domain routing protocol (each AS selects its own)
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 11
Interdomain Routing
EGP and BGP
Inter-domain Routing Protocols
◦ Exterior Gateway Protocol (EGP)
◦ Forced a tree-like topology onto the Internet
◦ Did not allow for the topology to become general
◦ Tree like structure: there is a single backbone and autonomous systems are connected only as
parents and children and not as peers
◦ Border Gateway Protocol (BGP)
◦ Assumes that the Internet is an arbitrarily interconnected set of ASs.
◦ Today’s Internet consists of an interconnection of multiple backbone networks (they are
usually called service provider networks, and they are operated by private companies
rather than the government)
◦ Sites are connected to each other in arbitrary ways
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 12
Interdomain Routing
BGP
Some large corporations connect directly to one or more of
the backbone, while others connect to smaller, non-
backbone service providers.
Many service providers exist mainly to provide service to
“consumers” (individuals with PCs in their homes), and these
providers must connect to the backbone providers
Often many providers arrange to interconnect with each
other at a single “peering point”
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 13
Interdomain Routing
BGP-4: Border Gateway Protocol
Assumes the Internet is an arbitrarily interconnected set of AS's.
Define local traffic as traffic that originates at or terminates on nodes
within an AS, and transit traffic as traffic that passes through an AS.
We can classify AS's into three types:
◦ Stub AS: an AS that has only a single connection to one other AS; such an AS will only carry local traffic (small
corporation in the figure of the previous page).
◦ Multihomed AS: an AS that has connections to more than one other AS, but refuses to carry transit traffic (large
corporation at the top in the figure of the previous page).
◦ Transit AS: an AS that has connections to more than one other AS, and is designed to carry both transit and local traffic
(backbone providers in the figure of the previous page).
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 14
Interdomain Routing
BGP
The goal of Inter-domain routing is to find any path to the intended destination that is loop free
◦ We are concerned with reachability than optimality
◦ Finding path anywhere close to optimal is considered to be a great achievement
Why?
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 15
Interdomain Routing
BGP
Scalability: An Internet backbone router must be able to forward any
packet destined anywhere in the Internet
◦ Having a routing table that will provide a match for any valid IP address
Autonomous nature of the domains
◦ It is impossible to calculate meaningful path costs for a path that crosses multiple
ASs
◦ A cost of 1000 across one provider might imply a great path but it might mean an
unacceptable bad one from another provid
Issues of trust
◦ Provider A might be unwilling to believe certain advertisements from provider B
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 16
Interdomain Routing
BGP
Each AS has:
One BGP speaker that advertises:
◦ local networks
◦ other reachable networks (transit AS only)
◦ gives path information
In addition to the BGP speakers, the AS has one or more border
“gateways” which need not be the same as the speakers
The border gateways are the routers through which packets enter and
leave the AS
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 17
Interdomain Routing
BGP
BGP does not belong to either of the two main classes of routing protocols (distance vectors and link-state protocols)
BGP advertises complete paths as an enumerated lists of ASs to reach a particular network
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 18
Interdomain Routing
BGP Example
Example of a network running BGP
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 19
Interdomain Routing
BGP Example
Speaker for AS 2 advertises reachability to P and Q
◦ Network 128.96, 192.4.153, 192.4.32, and 192.4.3, can be reached directly from AS 2.
Speaker for backbone network then advertises
◦ Networks 128.96, 192.4.153, 192.4.32, and 192.4.3 can be reached along the path <AS 1, AS 2>.
Speaker can also cancel previously advertised paths
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 20
Interdomain Routing
BGP Issues
It should be apparent that the AS numbers carried in BGP need to be unique
For example, AS 2 can only recognize itself in the AS path in the example if no other AS identifies itself in the same way
AS numbers are originally 16-bit numbers assigned by a central authority
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 21
Interdomain Routing
Integrating Interdomain and Intradomain Routing
All routers run iBGP and an intradomain routing protocol. Border routers (A, D, E) also run eBGP to other ASs
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 22
Interdomain Routing
Integrating Interdomain and Intradomain Routing
BGP routing table, IGP routing table, and combined table at router B
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 23
Interdomain Routing
Routing Areas
Backbone area
Area border router
(ABR)
A domain divided into area
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 24
Chapter Outline
o2. IPv6
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING
IPv6
Major Features
128-bit addresses
Multicast
Real-time service
Authentication and security
Auto-configuration
End-to-end fragmentation
Enhanced routing functionality, including support for mobile hosts
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 26
IPv6
Addresses
Classless addressing/routing (similar to CIDR)
Notation: x:x:x:x:x:x:x:x (x = 16-bit hex number)
◦ contiguous 0s are compressed: 47CD::A456:0124
◦ IPv6 compatible IPv4 address: ::[Link] used during transition
Address assignment
◦ provider-based
◦ geographic
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 27
IPv6
Header
40-byte “base” header
Extension headers (fixed order, mostly fixed length)
◦ fragmentation
◦ source routing
◦ authentication and
security
◦ other options
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 28
Chapter Outline
o3. Multicast
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING
Multicast
Overview
IPv4
◦ class D addresses
◦ demonstrated with MBone
◦ uses tunneling
Integral part of IPv6
◦ problem is making it scale
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 30
Multicast
Overview
One-to-many
◦ Radio station broadcast
◦ Transmitting news, stock-price
◦ Software updates to multiple hosts
Many-to-many
◦ Multimedia teleconferencing
◦ Online multi-player games
◦ Distributed simulations
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 31
Multicast
Overview
Without support for multicast
◦ A source needs to send a separate packet with the identical data to
each member of the group
◦ This redundancy consumes more bandwidth
◦ Redundant traffic is not evenly distributed, concentrated near the sending host
◦ Source needs to keep track of the IP address of each member in the
group
◦ Group may be dynamic
To support many-to-many and one-to-many IP provides an
IP-level multicast
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 32
Multicast
Overview
Basic IP multicast model is many-to-many based on multicast groups
◦ Each group has its own IP multicast address
◦ Hosts that are members of a group receive copies of any packets sent to that group’s multicast address
◦ A host can be in multiple groups
◦ A host can join and leave groups
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 33
Multicast
Overview
Using IP multicast to send the identical packet to each member of the group
◦ A host sends a single copy of the packet addressed to the group’s multicast address
◦ The sending host does not need to know the individual unicast IP address of each member
◦ Sending host does not send multiple copies of the packet
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 34
Multicast
Overview
IP’s original many-to-many multicast has been supplemented with support for a form of one-to-many multicast
One-to-many multicast
◦ Source specific multicast (SSM)
◦ A receiving host specifies both a multicast group and a specific sending host
Many-to-many model
◦ Any source multicast (ASM)
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 35
Multicast
Overview
A host signals its desire to join or leave a multicast group by
communicating with its local router using a special protocol
◦ In IPv4, the protocol is Internet Group Management Protocol (IGMP)
◦ In IPv6, the protocol is Multicast Listener Discovery (MLD)
The router has the responsibility for making multicast behave
correctly with regard to the host
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 36
Multicast
Multicast Routing
A router’s unicast forwarding tables indicate for any IP
address, which link to use to forward the unicast packet
To support multicast, a router must additionally have
multicast forwarding tables that indicate, based on multicast
address, which links to use to forward the multicast packet
Unicast forwarding tables collectively specify a set of paths
Multicast forwarding tables collectively specify a set of trees
◦ Multicast distribution trees
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 37
Multicast
Multicast Routing
To support source specific multicast, the multicast forwarding tables must indicate which links to use based on the
combination of multicast address and the unicast IP address of the source
Multicast routing is the process by which multicast distribution trees are determined
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 38
Multicast
Distance-Vector Multicast
Each router already knows that shortest path to source S
goes through router N.
When receive multicast packet from S, forward on all
outgoing links (except the one on which the packet arrived),
iff packet arrived from N.
Eliminate duplicate broadcast packets by only letting
◦ “ parent” for LAN (relative to S) forward
◦ shortest path to S (learn via distance vector)
◦ smallest address to break ties
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 39
Multicast
Distance-Vector Multicast
Reverse Path Broadcast (RPB)
Goal: Prune networks that have no hosts in group G
Step 1: Determine of LAN is a leaf with no members in G
◦ leaf if parent is only router on the LAN
◦ determine if any hosts are members of G using IGMP
Step 2: Propagate “no members of G here” information
◦ augment <Destination, Cost> update sent to neighbors with set of groups for
which this network is interested in receiving multicast packets.
◦ only happens when multicast address becomes active.
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 40
Multicast
Protocol Independent Multicast (PIM)
Shared Tree
Source
specific tree
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 41
Multicast
Protocol Independent Multicast (PIM)
Delivery of a packet along a shared tree. R1 tunnels the packet to the RP,
which forwards it along the shared tree to R4 and R5.
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 42
Inter-domain Multicast
Inter-domain Multicast
Multicast Source Discovery Protocol (MSDP)
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 43
Chapter Outline
o4. MPLS
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING
Multi-Protocol Label Switching (MPLS)
Drawbacks of Traditional IP Routing
Traditional IP forwarding is based on the following:
◦ Routing protocols are used to distribute Layer 3 routing information
◦ Forwarding is based on the destination address only
◦ Routing lookups are performed on every hop
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 45
Multi-Protocol Label Switching (MPLS)
Concept
MPLS is a new forwarding mechanism in which packets are forwarded based on
labels
Labels may correspond to IP destination networks (= traditional IP forwarding)
Labels can also correspond to other parameters, such as quality of service or source
address
MPLS was designed to support forwarding of other protocols as well
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 46
Multi-Protocol Label Switching (MPLS)
Concept
Only edge routers perform a routing protocol
Core routers switch packets based on simple label lookups and swap labels
Routing
Label Lookup &
Removal Label
and routing Assignment
lookup Label Swapping L=25
L=25 → L=23
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 47
Multi-Protocol Label Switching (MPLS)
Mode of operation
MPLS technology can be used anywhere regardless of Layer 1 media and Layer 2
protocol
MPLS uses a 32-bit label field that is inserted between layer 2 and layer 3 headers
(20 bits for label, 3 bit experimental field, 1 bit bottom-of-stack indicator and 8 bits TTL)
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 48
Multi-Protocol Label Switching (MPLS)
Label Switch Router (LSR)
Label switch router (LSR) primarily forwards labeled packets
Edge LSR primarily labels IP packets and forwards them into MPLS domain, or removes labels and forwards IP packets out
of the MPLS domain
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 49
Multi-Protocol Label Switching (MPLS)
Label Switch Router (LSR)
ATM LSR can only forward cells
ATM edge LSR segments packets into cells and forwards them into an MPLS ATM domain, or reassembles cells into packets
and forwards them out of an MPLS ATM domain
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 50
Multi-Protocol Label Switching (MPLS)
Architecture of LSRs
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 51
Multi-Protocol Label Switching (MPLS)
Architecture of Edge LSRs
CPEN441 - CHAPTER 4: ADVANCED INTERNETWORKING Joseph Doumit, PhD 52