Documente Academic
Documente Profesional
Documente Cultură
CPU
NIC
NIC
NIC
NIC
Route Lookup
Problem No. 3
The figure below shows a data structure for IP address lookup using a trie. In the figure, the nodes containing numbers correspond to valid address prefixes and the numbers are the output ports that should be used by packets for which a given prefix is the best match. If a packet with destination address a3b2ff75 is received, what output port should it be forwarded on (the address is given in hexadecimal notation)?
Next-hop Routing
Network-Specific Routing
Host-Specific Routing
Default routing
Block diagram of a Complete Router showing the Interfaces Interfaces to the network
More advanced routers may separate "forwarding" (the tasks of moving packets from one interface to another) from "routing" (the task of determining the best path through the network) and include a number of processors capable of performing these tasks.
It then uses a local Forwarding Table (known as the "Forwarding Information Base (FIB)") to identify where in the network the packet should be routed to (i.e. which output interface should be used).
IP Datagram Format
IP Datagram Fields
The size of the fragment is determined by the MTU of the outgoing network. The FLAGS and Fragment Offset field together identify a datagram as a fragment; if both contain zero the datagram is not a fragment.
IP Fragmentation Algorithm
IP Datagram Fragmentation
(a) Identification is selected by sender host, and is unique for each packet sent by that host in recent past. Ident = x
M bit: shows whether there are more fragments for that packet following (b) Offset: deals with possibly reordered fragments (counts 8-byte words; why not count bytes?)
A packet can be fragmented at multiple routers Reassembly is only performed at the receiving host When should receiver give up on the reassembly of a packet?
Ident = x
Start of header
IP Fragmentation Example
Problem No. 1
Problem No. 2
Suppose that host A is connected to a router R1, R1 is connected to another router R2 and R2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at host A for delivery to B. Show the Total Length, Identification, DF, MF and Fragment Offset fields of the IP header in each packet transmitted over the three links. Assume that link A-R1 can support a maximum frame size of 1024 bytes including 14 byte frame header, link R1-R2 can support a maximum frame size of 512 bytes including an 8 byte frame header and link R2-B can support a maximum frame size of 512 bytes including a 12 byte frame header.
Fragmenting a Fragment
IP Reassembly
IP Reassembly Algorithm
Problem No. 3
Problem No. 3
Look at the 40byte dump of an IP packet containing a TCP segment below. 4500 9b62 5010 0028 246c faf0 7a5e 0991 8512 4000 0016 0000 6c06 505a cc68 8239 180a a61c f030 e570
Identify all the fields of the IP and TCP header. What would the above packet look like, if the source and destination ports are swapped? Will the checksum field change?
Identify all the fields of the IP and TCP header. What would the above packet look like, if the source and destination ports are swapped? Will the checksum field change?
Packet Classification
Rule Sets
Hybrid Classification
Flow Identificaiton
Queueing Priorities
Traffic Shaping
Timer Management