Escolar Documentos
Profissional Documentos
Cultura Documentos
fig 5-1
5-4
Routing Algorithms
5-8 top
5-8
bottom
(a)(1) A is down initially and all the other routers have the delay to A
as infinity; (2) When A comes up, assuming that there is a gigantic
gong, all routers exchange simultaneously. See the figure (a);
(b) (1) All routers are initially up. B, C, D and E have the delay to A
of 1,2,3 and 4. (2) Suddenly, A goes down. See the figure (b);
(1) Suppose that most of traffic is using CF; (2) EI is more attractive
for shortest path; (3) EI has most of traffic; (4) CF is now more
attractive; routing tables may oscillate wildly; not consider load,
just BW or load balancing
(a) A subnet. (b) The link state packets for this subnet.
The packet buffer for router B in the previous slide (Fig. 5-13).
B has three lines A,C,F;
Send flags: pkt must be forwarded on the indicated line;
ACK flags; B must send ACK to the line;
E arrives twice, once via EAB and once via EFB; D is similar to E;
Hierarchical Routing
Hierarchical routing.
Broadcast Routing
Multicast Routing
Route Discovery
2.
3.
Route Maintenance
(a) D's routing table before G goes down. (b) The graph after G has gone
down.
Each node broadcasts Hello msg periodically; If no response, the route may
have problem.
For each possible dest., each node keeps track of its neighbors that have fed
it a pkt for that dest. during the last observing period active neighbors for
that dest.
If G is down, D finds E,G,I the union of active neighbors for E,G,I is
{A,B}. D purges the entries of E,G,I from the routing table and tells A and B
e)
f)
g)
h)
i)
j)
k)
If some user wants to look up name, he hashes it to get key (this step
is easy) and then uses successor(key) to find the IP address of the
node storing its index tuples (the second step is not easy).
To do this, each not must maintain certain administrative data
structures. One of these is the IP address of its successor node, e.g.,
in the next graph, node 4s successor is 7, node 7s successor is 12;
Lookup requesting node sends a pkt to its successor containing
its IP address and the key it is looking for go on and on; may use
bi-direction search, however, still need avg. n/2 per search;
finger table is proposed;
Finger table has m entries, indexed by 0 ~ m 1, each one pointing
to a different actual node. Each entry has two fields: start and the IP
address of successor(start); For entry i at node k
start[i] = k + 2i(modulo 2m); IP address of succesor(start[i])
avg. # of lookups = log2n
p)
q)
Congestion
5-26
Hop-by-Hop
Choke Packets
Jitter Control
Quality of Service
Requirements
Techniques for Achieving Good Quality of Service
Integrated Services
Differentiated Services
Label Switching and MPLS
Requirements
5-30
Buffering
(a) A leaky bucket with water. (b) a leaky bucket with packets.
5-34
(a) Before.
(b) After.
Admission Control
5-34
Expedited Forwarding
Assured Forwarding
Internetworking
Connecting Networks
5-43
Connectionless Internetworking
A connectionless internet.
Tunneling
Tunneling (2)
Internetwork Routing
Fragmentation
Fragmentation (2)
The IP Protocol
IP Addresses
Internet Control Protocols
OSPF The Interior Gateway Routing Protocol
BGP The Exterior Gateway Routing Protocol
Internet Multicasting
Mobile IP
IPv6
Collection of Subnetworks
The IP Protocol
5-54
IP Addresses
IP address formats.
IP Addresses (2)
Special IP addresses.
Subnets
Subnets (2)
5-59
5-61
Operation of DHCP.
OSPF (2)
OSPF (3)
5-66
IPv6 Header
a)
b)
c)
d)
e)
f)
g)
h)
Extension Headers
5-69
Homeworks
a)
15, 16, 27, 35, 37, 38, 40, 41, 43, 51,