Download Chapter 5

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Asynchronous Transfer Mode wikipedia , lookup

Network tap wikipedia , lookup

Internet protocol suite wikipedia , lookup

Distributed firewall wikipedia , lookup

RapidIO wikipedia , lookup

Net bias wikipedia , lookup

Deep packet inspection wikipedia , lookup

Backpressure routing wikipedia , lookup

Peering wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Wake-on-LAN wikipedia , lookup

Computer network wikipedia , lookup

Multiprotocol Label Switching wikipedia , lookup

IEEE 1355 wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Airborne Networking wikipedia , lookup

TCP congestion control wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Routing in delay-tolerant networking wikipedia , lookup

Routing wikipedia , lookup

Transcript
Chapter 5
The Network Layer
Implementation of Connectionless Service
Routing within a diagram subnet.
Implementation of Connection-Oriented Service
Routing within a virtual-circuit subnet.
Comparison of Virtual-Circuit and
Datagram Subnets
5-4
Routing Algorithms
a)
b)
c)
d)
e)
f)
g)
h)
i)
Shortest Path Routing
Flooding
Distance Vector Routing
Link State Routing
Hierarchical Routing
Broadcast Routing
Multicast Routing
Routing for Mobile Hosts
Routing in Ad Hoc Networks
Shortest Path Routing
The first 5 steps used in computing the shortest path from A to D.
The arrows indicate the working node.
Distance Vector Routing
(a) A subnet. (b) Input from A, I, H, K, and the new
routing table for J.
Distance Vector Routing (2)
The count-to-infinity problem.
Link State Routing
Each router must do the following:
A. Discover its neighbors, learn their network address.
B. Measure the delay or cost to each of its neighbors.
C. Construct a packet telling all it has just learned.
D. Send this packet to all other routers.
E. Compute the shortest path to every other router.
Hierarchical Routing
Hierarchical routing.
Broadcast Routing
Reverse path forwarding. (a) A subnet. (b) a Sink tree. (c) The
tree built by reverse path forwarding.
Multicast Routing
(a) A network. (b) A spanning tree for the leftmost router.
(c) A multicast tree for group 1. (d) A multicast tree for group 2.
Distinction
• Broadcast Routing –
– Delivering a packet sent from a source node to
all other nodes in the network.
• Multicast Routing –
– Delivering a packet sent from a source node to a
subset of the other nodes in the network.
Congestion Control Algorithms
a)
b)
c)
d)
e)
f)
General Principles of Congestion Control
Congestion Prevention Policies
Congestion Control in Virtual-Circuit Subnets
Congestion Control in Datagram Subnets
Load Shedding
Jitter Control
Congestion
When too much traffic is offered, congestion sets in and
performance degrades sharply.
General Principles of Congestion Control
A. Monitor the system .
– detect when and where congestion occurs.
B. Pass information to where action can be taken.
C. Adjust system operation to correct the problem.
Congestion Prevention Policies
5-26
Policies that affect congestion.
Techniques for Achieving Good Quality
of Service
Buffering
Smoothing the output stream by buffering packets.
The Leaky Bucket Algorithm
(a) A leaky bucket with water. (b) a leaky bucket with packets.
The IP Protocol
The IPv4 (Internet Protocol) header.
The IP Protocol (2)
5-54
Some of the IP options.
IP Addresses
IP address formats.
IP Addresses (2)
Special IP addresses.
Subnets
A campus network consisting of LANs for various departments.
The Main IPv6 Header
The IPv6 fixed header (required).
Extension Headers
5-69
IPv6 extension headers.