department of computer science southern illinois ...cs441/lectures/overviewofnetworking-3.pdf ·...
TRANSCRIPT
Mobile & Wireless Computing 1Kemal Akkaya
Department of Computer ScienceSouthern Illinois University Carbondale
CS441 – Mobile & Wireless ComputingOverview of Computer Networking
Network Layer of TCP/IP Model
Computer Networking: A Top Down Approach Featuring the
Internet, 3rd edition.
Jim Kurose, Keith RossAddison-Wesley, July 2004
Thanks to:Computer Networks
4th edition. Andrew S. Tanenbaum
Prentice-Hall PTR
Data andComputer
Communications7th edition.
William StallingsPrentice-Hall PTR
Mobile & Wireless Computing 2Kemal Akkaya
Network LayerChapter goals:
Understand principles behind network layer services:Routing (path selection)Dealing with scaleHow a router worksAdvanced topics: IPv6
Instantiation and implementation in the InternetTopics to be covered:
Virtual circuit and datagram networksWhat’s inside a routerIP: Internet ProtocolRouting algorithmsRouting in the InternetBroadcast and multicast routing
Mobile & Wireless Computing 3Kemal Akkaya
Network layerTransport segment from sending to receiving host On sending side encapsulates segments into datagramsOn rcving side, delivers segments to transport layerNetwork layer protocols in everyhost, routerRouter examines header fields in all IP datagrams passing through itKey Network layer functions
forwarding: move packets from router’s input to appropriate router outputrouting: determine route taken by packets from source to destination
Routing algorithms
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
networkdata linkphysical
applicationtransportnetworkdata linkphysical
applicationtransportnetworkdata linkphysical
Analogy:routing: process of planning trip from source to destinationforwarding: process of getting through single interchange
Mobile & Wireless Computing 4Kemal Akkaya
1
23
0111
value in arrivingpacket’s header
routing algorithm
local forwarding tableheader value output link
0100010101111001
3221
Interplay between routing and forwarding
Another function: Connection setup
3rd important function in some network architectures:
ATM, frame relay, X.25Not on Internet
Before datagrams flow, two hosts and intervening routers establish virtual connection
Routers get involvedNetwork and transport layer cnctn service:
Network: between two hostsTransport: between two processes
Mobile & Wireless Computing 5Kemal Akkaya
Network layer connection and connection-less service
Network connection utilizes Packet Switching:Packet Switching Technique
Packets sent one at a time to the networkTypically 1000 octets
Longer messages split into series of packetsEach packet contains a portion of user data plus some control infoControl info
Routing (addressing) infoPackets are received, stored briefly (buffered) and passed on to the next node
Store and forward
How about Circuit Switching?Pre-dedicated lineFixed data rate
Mobile & Wireless Computing 6Kemal Akkaya
Packet Switching TechniquesAdvantages of Packet switching:
Line efficiencySingle node to node link can be shared by many packets over timePackets queued and transmitted as fast as possible
Data rate conversionEach station connects to the local node at its own speedNodes buffer data if required to equalize rates
Packets are accepted even when network is busyDelivery may slow down
Priorities can be usedPackets handled in two ways
DatagramVirtual circuit (VC)
Datagram network provides network-layer connectionless serviceVC network provides network-layer connection service
Mobile & Wireless Computing 7Kemal Akkaya
Virtual circuitsPreplanned route established before any packets sentCall request and call accept packets establish connection (handshake)
Signaling Protocols are usedEach packet contains a virtual circuit identifier instead of destination addressNo routing decisions required for each packetClear request to drop circuitNot a dedicated pathA VC consists of:1. Path from source to destination2. VC numbers, one number for each
link along path3. Entries in forwarding tables in
routers along path
Mobile & Wireless Computing 8Kemal Akkaya
Datagram networksNo call setup at network layerRouters: no state about end-to-end connections
no network-level concept of “connection”
Packets forwarded using destination host address
packets between same source-dest pair may take different paths
Each packet treated independentlyPackets can take any practical routePackets may arrive out of orderPackets may go missingUp to receiver to re-order packets and recover from missing packets
Mobile & Wireless Computing 9Kemal Akkaya
Forwarding tableDestination Address Range Link Interface
11001000 00010111 00010000 00000000through 0
11001000 00010111 00010111 1111111111001000 00010111 00011000 00000000
through 111001000 00010111 00011000 11111111 11001000 00010111 00011001 00000000
through 211001000 00010111 00011111 11111111
otherwise 3
Prefix Match Link Interface11001000 00010111 00010 0 11001000 00010111 00011000 111001000 00010111 00011 2
otherwise 3
DA: 11001000 00010111 00011000 10101010 DA: 11001000 00010111 00010110 10100001
Which interface?
Example:
Mobile & Wireless Computing 10Kemal Akkaya
Datagram vs VC networkVirtual circuits
Network can provide sequencing and error controlPackets are forwarded more quickly
No routing decisions to makeLess reliable
Loss of a node looses all circuits through that node
Example: ATM
DatagramNo call setup phase
Better if few packetsMore flexible
Routing can be used to avoid congested parts of the network
Example: Internet
Mobile & Wireless Computing 11Kemal Akkaya
Router Architecture OverviewTwo key router functions:
Run routing algorithms/protocol (RIP, OSPF, BGP)Forwarding datagrams from incoming to outgoing link
Mobile & Wireless Computing 12Kemal Akkaya
Input Port Functions
Decentralized switching:given datagram dest., lookup output port using forwarding table in input port memorygoal: complete input port processing at ‘line speed’queuing: if datagrams arrive faster than forwarding rate into switch fabric
Physical layer:bit-level reception
Data link layer:e.g., Ethernet
Mobile & Wireless Computing 13Kemal Akkaya
Three types of switching fabrics
Mobile & Wireless Computing 14Kemal Akkaya
Switching Via MemoryTraditional computers withswitching under direct control of CPUPacket copied to system’s memorySpeed limited by memorybandwidth (2 bus crossings perdatagram)
Datagram from input port memory to output port memory via a shared busBus contention: switching speed limited by bus bandwidth1 Gbps bus, Cisco 1900: sufficient speed for access and enterprise routers (not regional or backbone)
Switching Via Bus
Switching Via an Interconnection Network
Overcome bus bandwidth limitationsBanyan networks, other interconnection nets initially developed to connect processors in multiprocessorAdvanced design: fragmenting datagram into fixed length cells, switch cells through the fabric. Cisco 12000: switches Gbps through the interconnection network
Mobile & Wireless Computing 15Kemal Akkaya
Output Ports
Output Port QueuingBuffering when arrival rate via switch exceeds output line speedScheduling disciplinechooses among queued datagrams for transmissionQueuing (delay) and loss due to output port buffer overflow!
Mobile & Wireless Computing 16Kemal Akkaya
Input Port QueuingFabric slower than input ports combined -> queueing may occur at input queues Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forwardqueueing delay and loss due to input buffer overflow!
Mobile & Wireless Computing 17Kemal Akkaya
The Internet Network layer (IP)Host, router network layer functions:
forwardingtable
Routing protocols•path selection•RIP, OSPF, BGP
IP protocol•addressing conventions•datagram format•packet handling conventions
ICMP protocol•error reporting•router “signaling”
Transport layer: TCP, UDP
Link layer
physical layer
Networklayer
Mobile & Wireless Computing 18Kemal Akkaya
IP datagram format
ver length
32 bits
data (variable length,typically a TCP
or UDP segment)
16-bit identifierInternetchecksum
time tolive
32 bit source IP address
IP protocol versionnumber
header length(bytes)
max numberremaining hops
(decremented at each router)
forfragmentation/reassembly
total datagramlength (bytes)
upper layer protocolto deliver payload to
head.len
type ofservice
“type” of data flgs fragmentoffset
upperlayer
32 bit destination IP address
Options (if any) E.g. timestamp,record routetaken, specifylist of routers to visit.
How much overhead with TCP?20 bytes of TCP20 bytes of IP= 40 bytes + app layer overhead
Mobile & Wireless Computing 19Kemal Akkaya
IP Fragmentation & ReassemblyNetwork links have MTU (max.transfer size) -largest possible link-level frame
Different link types, different MTUs
Large IP datagram divided (“fragmented”) within net
One datagram becomes several datagrams“Reassembled” only at final destinationIP header bits used to identify, order related fragments
fragmentation: in: one large datagramout: 3 smaller datagrams
reassembly
Mobile & Wireless Computing 20Kemal Akkaya
IP Fragmentation and Reassembly
ID=x
offset=0
fragflag=0
length=4000
ID=x
offset=0
fragflag=1
length=1500
ID=x
offset=185
fragflag=1
length=1500
ID=x
offset=370
fragflag=0
length=1040
One large datagram becomesseveral smaller datagrams
Example:4000 byte datagramMTU = 1500 bytes
1480 bytes in data field
offset =1480/8
Mobile & Wireless Computing 21Kemal Akkaya
IP Addressing: introduction
IP address: 32-bit identifier for host, router interfaceinterface: connection between host/router and physical link
router’s typically have multiple interfaceshost may have multiple interfacesIP addresses associated with each interface
223.1.1.1
223.1.1.2
223.1.1.3
223.1.1.4 223.1.2.9
223.1.2.2
223.1.2.1
223.1.3.2223.1.3.1
223.1.3.27
223.1.1.1 = 11011111 00000001 00000001 00000001
223 1 11
Mobile & Wireless Computing 22Kemal Akkaya
SubnetsIP address:
Subnet part (high order bits)Host part (low order bits)
What’s a subnet ?Device interfaces with same subnet part of IP addressCan physically reach each other without intervening routerTo determine the subnets, detach each interface from its host or router, creating islands of isolated networks. Each isolated network is called a subnet
223.1.1.1
223.1.1.2
223.1.1.3
223.1.1.4 223.1.2.9
223.1.2.2
223.1.2.1
223.1.3.2223.1.3.1
223.1.3.27
LAN
Network consisting of 3 subnets
Subnet mask: /24
223.1.1.0/24223.1.2.0/24
223.1.3.0/24
Mobile & Wireless Computing 23Kemal Akkaya
Subnets
How many subnets?
223.1.1.1
223.1.1.3
223.1.1.4
223.1.2.2223.1.2.1
223.1.2.6
223.1.3.2223.1.3.1
223.1.3.27
223.1.1.2
223.1.7.0
223.1.7.1223.1.8.0223.1.8.1
223.1.9.1
223.1.9.2
Mobile & Wireless Computing 24Kemal Akkaya
IP addressing: CIDR
CIDR: Classless InterDomain Routingsubnet portion of address of arbitrary lengthaddress format: a.b.c.d/x, where x is # bits in subnet portion of address
11001000 00010111 00010000 00000000subnetpart
hostpart
200.23.16.0/23
Mobile & Wireless Computing 25Kemal Akkaya
IP addresses: how to get one?Q: How does host get IP address?
Hard-coded by system admin in a fileWintel: control-panel->network->configuration->tcp/ip->propertiesUNIX: /etc/rc.config
DHCP: Dynamic Host Configuration Protocol: dynamically get address from as server
“plug-and-play”How does network get subnet part of IP addr?
Gets allocated portion of its provider ISP’s address spaceISP gets block of addresses from :
ICANN: Internet Corporation for Assigned Names and Numbersallocates addressesmanages DNSassigns domain names, resolves disputes
ISP's block 11001000 00010111 00010000 00000000 200.23.16.0/20
Organization 0 11001000 00010111 00010000 00000000 200.23.16.0/23 Organization 1 11001000 00010111 00010010 00000000 200.23.18.0/23 Organization 2 11001000 00010111 00010100 00000000 200.23.20.0/23
... ….. …. ….Organization 7 11001000 00010111 00011110 00000000 200.23.30.0/23
Mobile & Wireless Computing 26Kemal Akkaya
NAT: Network Address Translation
Datagrams with source or destination in this networkhave 10.0.0/24 address for
source, destination (as usual)
10.0.0.1
10.0.0.2
10.0.0.3
10.0.0.4
138.76.29.7
local network(e.g., home network)
10.0.0/24
rest ofInternet
All datagrams leaving localnetwork have same single source
NAT IP address: 138.76.29.7,different source port numbers
Mobile & Wireless Computing 27Kemal Akkaya
NAT: Network Address TranslationMotivation: local network uses just one IP address as far as outside word is concerned:
no need to be allocated range of addresses from ISP: - just one IP address is used for all devicescan change addresses of devices in local network without notifying outside worldcan change ISP without changing addresses of devices in local networkdevices inside local net not explicitly addressable, visible by outside world (a security plus).
Implementation: NAT router must:outgoing datagrams: replace (source IP address, port #) of every outgoing datagram to (NAT IP address, new port #)
. . . remote clients/servers will respond using (NAT IP address, new port #) as destination addr.
remember (in NAT translation table) every (source IP address, port #) to (NAT IP address, new port #) translation pairincoming datagrams: replace (NAT IP address, new port #) in dest fields of every incoming datagram with corresponding (source IP address, port #) stored in NAT table
Mobile & Wireless Computing 28Kemal Akkaya
NAT: Network Address Translation
10.0.0.1
10.0.0.2
10.0.0.3
S: 10.0.0.1, 3345D: 128.119.40.186, 80
110.0.0.4
138.76.29.7
1: host 10.0.0.1 sends datagram to 128.119.40, 80
NAT translation tableWAN side addr LAN side addr138.76.29.7, 5001 10.0.0.1, 3345…… ……
S: 128.119.40.186, 80 D: 10.0.0.1, 3345 4
S: 138.76.29.7, 5001D: 128.119.40.186, 802
2: NAT routerchanges datagramsource addr from10.0.0.1, 3345 to138.76.29.7, 5001,updates table
S: 128.119.40.186, 80 D: 138.76.29.7, 5001 3
3: Reply arrivesdest. address:138.76.29.7, 5001
4: NAT routerchanges datagramdest addr from138.76.29.7, 5001 to 10.0.0.1, 3345
Mobile & Wireless Computing 29Kemal Akkaya
NAT: Network Address Translation
16-bit port-number field: 60,000 simultaneous connections with a single LAN-side address!
NAT is controversial:routers should only process up to layer 3violates end-to-end argument
NAT possibility must be taken into account by app designers, eg, P2P applications
address shortage should instead be solved by IPv6
Mobile & Wireless Computing 30Kemal Akkaya
ICMP: Internet Control Message Protocol
Used by hosts & routers to communicate network-level information
Error reporting: unreachable host, network, port, protocolEcho request/reply (used by ping)
Network-layer “above”IP:
ICMP msgs carried in IP datagrams
ICMP message: type, code plus first 8 bytes of IP datagram causing error
The principal ICMP message types.
Mobile & Wireless Computing 31Kemal Akkaya
Traceroute uses ICMPFinds routers on the path via ICMPSource sends series of UDP segments to dest
First has TTL =1Second has TTL=2, etc.Unlikely port number
When nth datagram arrives to nth router:
Router discards datagramTTL is exceededAnd sends to source an ICMP message (type 11, code 0)Message includes name of router& IP address
Stopping criterionUDP segment eventually arrives at destination host with an unlikely port numberDestination returns ICMP “host unreachable” packet (type 3, code 3)When source gets this ICMP, stops.
Timeline:
Router 1
Source
Router 2 DestinationTTL=1
Router 1 knownTTL=2
Router 2 knownTTL=3
Destination knownCourtesy Prof. Rick Han, Univ. of Colorado
Mobile & Wireless Computing 32Kemal Akkaya
IPv6Initial motivation: 32-bit address space soon to be completely allocated Additional motivation:
Header format helps speed processing/forwardingHeader changes to facilitate QoS IPv6 datagram format:
fixed-length 40 byte headerno fragmentation allowed
Priority: identify priority among datagrams in flowFlow Label: identify datagrams in same “flow.”Next header: identify upper layer protocol for data
Other Changes from IPv4:Checksum: removed entirely to reduce processing time at each hopOptions: allowed, but outside of header, indicated by “Next Header” fieldICMPv6: new version of ICMP
Additional message types, e.g. “Packet Too Big”Multicast group management functions
Transition from IPv4 to IPv6:Not all routers can be upgraded simultaneous
no “flag days”How will the network operate with mixed IPv4 and IPv6 routers?
Tunneling: IPv6 carried as payload in IPv4 datagram among IPv4 routers
Mobile & Wireless Computing 33Kemal Akkaya
1
23
0111
value in arrivingpacket’s header
routing algorithm
local forwarding tableheader value output link
0100010101111001
3221
Routing Algorithms
Finds the path betweenany given hostsMain duty of the network layerInterplay between routingand forwarding
Mobile & Wireless Computing 34Kemal Akkaya
u
yx
wv
z2
21
3
1
1
2
53
5
Graph: G = (N,E)
N = set of routers = { u, v, w, x, y, z }
E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) }
Graph Abstraction for Routing
Remark: Graph abstraction is useful in other network contexts
Example: P2P, where N is set of peers and E is set of TCP connections
Mobile & Wireless Computing 35Kemal Akkaya
Graph abstraction: costs
u
yx
wv
z2
21
3
1
1
2
53
5
• c(x,x’) = cost of link (x,x’)
- e.g., c(w,z) = 5
• cost could always be 1, or inversely related to bandwidth,or inversely related to Congestion, delay etc.
Cost of path (x1, x2, x3,…, xp) = c(x1,x2) + c(x2,x3) + … + c(xp-1,xp)
Question: What’s the least-cost path between u and z ?
Routing algorithm: algorithm that finds least-cost path
Mobile & Wireless Computing 36Kemal Akkaya
Routing Algorithm classification
Global or decentralized
Global:All routers have complete topology, link cost info“Link state” algorithms
Decentralized:Router knows physically-connected neighbors, link costs to neighborsiterative process of computation, exchange of info with neighbors“Distance vector” algorithms
Static or dynamic?
Static:Routes change slowly over time
Dynamic:Routes change more quickly
Periodic updateIn response to link cost changes
Mobile & Wireless Computing 37Kemal Akkaya
A Link-State Routing AlgorithmDijkstra’s algorithm
net topology, link costs known to all nodes
accomplished via “link state broadcast”all nodes have same info
computes least cost paths from one node (‘source”) to all other nodes
gives forwarding table for that node
iterative: after k iterations, know least cost path to k dest.’s
Notation:c(x,y): link cost from node x to y; = ∞ if not direct neighborsD(v): current value of cost of path from source to dest. vp(v): predecessor node along path from source to vN': set of nodes whose least cost path definitively known
Mobile & Wireless Computing 38Kemal Akkaya
Dijsktra’s Algorithm1 Initialization:2 N' = {u} 3 for all nodes v 4 if v adjacent to u 5 then D(v) = c(u,v) 6 else D(v) = ∞7 8 Loop9 find w not in N' such that D(w) is a minimum 10 add w to N'11 update D(v) for all v adjacent to w and not in N' : 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v */ 15 until all nodes in N'
Mobile & Wireless Computing 39Kemal Akkaya
Dijkstra’s algorithm: Example
Step012345
N'u
uxuxy
uxyvuxyvw
uxyvwz
D(v),p(v)2,u2,u2,u
D(w),p(w)5,u4,x3,y3,y
D(x),p(x)1,u
D(y),p(y)∞
2,x
D(z),p(z)∞∞
4,y4,y4,y
u
yx
wv
z2
21
3
1
1
2
53
5
Mobile & Wireless Computing 40Kemal Akkaya
Dijkstra’s algorithm, discussion
Algorithm complexity: n nodeseach iteration: need to check all nodes, w, not in Nn(n+1)/2 comparisons: O(n2)more efficient implementations possible: O(nlogn)
Oscillations possible:e.g., link cost = amount of carried traffic
AD
CB
1 1+e
e0
e1 1
0 0
AD
CB
2+e 0
001+e 1
AD
CB
0 2+e
1+e10 0
AD
CB
2+e 0
e01+e 1
initially … recomputerouting
… recompute … recompute
Mobile & Wireless Computing 41Kemal Akkaya
Distance Vector Algorithm
u
yx
wv
z2
21
3
1
1
2
53
5Clearly, dv(z) = 5, dx(z) = 3, dw(z) = 3
du(z) = min { c(u,v) + dv(z),c(u,x) + dx(z),c(u,w) + dw(z) }
= min {2 + 5,1 + 3,5 + 3} = 4
Node that achieves minimum is nexthop in shortest path ➜ forwarding table
B-F equation says:
Bellman-Ford Equation (dynamic programming)Define dx(y) := cost of least-cost path from x to y
Then dx(y) = min {c(x,v) + dv(y) } where min is taken over all neighbors of x
Mobile & Wireless Computing 42Kemal Akkaya
Distance Vector Algorithm (2)Dx(y) = estimate of least cost from x to yDistance vector: Dx = [Dx(y): y є N ]Node x knows cost to each neighbor v: c(x,v)Node x maintains Dx = [Dx(y): y є N ]Node x also maintains its neighbors’ distance vectors
For each neighbor v, x maintains Dv = [Dv(y): y є N ]
Basic idea:Each node periodically sends its own distance vector estimate toneighborsWhen node a node x receives new DV estimate from neighbor, it updates its own DV using B-F equation:
Dx(y) ← minv{c(x,v) + Dv(y)} for each node y ∊ N
Under minor, natural conditions, the estimate Dx(y) converge the actual least cost dx(y)
Mobile & Wireless Computing 43Kemal Akkaya
Distance Vector Algorithm (3)
Iterative, asynchronous:Each local iteration caused by:
Local link cost change DV update message from neighbor
Distributed:Each node notifies neighbors only when its DV changes
Neighbors then notify their neighbors if necessary
wait for (change in local link cost of msg from neighbor)
recompute estimates
if DV to any dest has changed, notify neighbors
Each node:
Mobile & Wireless Computing 44Kemal Akkaya
x y zxyz
0 2 7∞∞ ∞∞∞ ∞
from
cost to
from
from
x y zxyz
0 2 3
from
cost tox y z0 2 3
from
cost to
xyz
x y zxyz
∞ ∞
∞∞ ∞
cost tox y z0 2 7
from
cost to
xyz
x y zxyzfr
om
0 2 3
cost to
x y zxyz
0 2 3
from
cost tox y z
z
0 2 7
from
cost to
xy
x y z
∞∞ ∞7 1 0
cost to
∞2 0 1
∞ ∞ ∞
2 0 17 1 0
2 0 17 1 0
2 0 13 1 0
2 0 13 1 0
2 0 1
3 1 02 0 1
3 1 0
xyz
time
x z12
7
y
node x table
node y table
node z table
Dx(y) = min{c(x,y) + Dy(y), c(x,z) + Dz(y)} = min{2+0 , 7+1} = 2
Dx(z) = min{c(x,y) + Dy(z), c(x,z) + Dz(z)}
= min{2+1 , 7+0} = 3
Mobile & Wireless Computing 45Kemal Akkaya
Distance Vector: Link cost changesLink cost changes:
Node detects local link cost change Updates routing info, recalculates distance vectorIf DV changes, notify neighbors Good news travels fast Bad news travels slow - “count to infinity” problem!
“goodnews travelsfast”
x z14
50
y1
At time t0, y detects the link-cost change, updates its DV, and informs its neighbors.At time t1, z receives the update from y and updates its table. It computes a new least cost to x and sends its neighbors its DV.At time t2, y receives z’s update and updates its distance table. y’s least costs do not change and hence y does not send any message to z.
Poissoned reverse:If Z routes through Y to get to X :
Z tells Y its (Z’s) distance to X is infinite (so Y won’t route to X via Z)Will this completely solve count to infinity problem?
Mobile & Wireless Computing 46Kemal Akkaya
Comparison of LS and DV algorithms
Message complexityLS: with n nodes, E links, O(nE) msgs sent DV: exchange between neighbors only
Convergence time varies
Speed of ConvergenceLS: O(n2) algorithm requires O(nE) msgs
May have oscillationsDV: convergence time varies
May be routing loopsCount-to-infinity problem
Robustness: what happens if router malfunctions?
LS:Node can advertise incorrect link costEach node computes only its own table
DV:DV node can advertise incorrect path costEach node’s table used by others
Error propagate thru network
Mobile & Wireless Computing 47Kemal Akkaya
Hierarchical Routing
Scale: with 200 million destinations:can’t store all dest’s in routing tables!routing table exchange would swamp links!
Administrative autonomyinternet = network of networkseach network admin may want to control routing in its own network
Our routing study thus far - idealization All routers identicalNetwork “flat”
… not true in practice
Aggregate routers into regions, “autonomous systems” (AS)Routers in same AS run same routing protocol
“Intra-AS” routing protocolrouters in different AS can run different intra-AS routing protocol
Gateway routerDirect link to router in another AS
Mobile & Wireless Computing 48Kemal Akkaya
Intra-AS Routing
Also known as Interior Gateway Protocols (IGP)Used in Internet for RoutingMost common Intra-AS routing protocols:
RIP: Routing Information Protocol
OSPF: Open Shortest Path First
IGRP: Interior Gateway Routing Protocol (Cisco proprietary)
Mobile & Wireless Computing 49Kemal Akkaya
RIP ( Routing Information Protocol)Distance vector algorithmIncluded in BSD-UNIX Distribution in 1982Distance metric: # of hops (max = 15 hopsDistance vectors: Exchanged among neighbors every 30 sec via Response Message (also called advertisement)Each advertisement: List of up to 25 destination nets within AS
DC
BA
u vw
x
yz
destination hopsu 1v 2w 2x 3y 3z 2
Mobile & Wireless Computing 50Kemal Akkaya
RIP: Example
Destination Network Next Router Num. of hops to dest.w A 2y B 2z B 7x -- 1…. …. ....
Routing table in D
w x y
z
A
C
D B
Mobile & Wireless Computing 51Kemal Akkaya
RIP: Example
Destination Network Next Router Num. of hops to dest.w A 2y B 2z B A 7 5x -- 1…. …. ....
Routing table in D
w x y
z
A
C
D B
Dest Next hopsw - -x - -z C 4…. … ...
Advertisementfrom A to D
Mobile & Wireless Computing 52Kemal Akkaya
RIP Table processingLink Failure and Recovery:
If no advertisement heard after 180 sec --> neighbor/link declared deadroutes via neighbor invalidatednew advertisements sent to neighborsneighbors in turn send out new advertisements (if tables changed)link failure info quickly propagates to entire netpoison reverse used to prevent ping-pong loops (infinite distance = 16 hops)
RIP routing tables managed by application-level process called route-d (daemon)Advertisements sent in UDP packets, periodically repeated
physicallink
network forwarding(IP) table
Transprt(UDP)
routed
physicallink
network(IP)
Transprt(UDP)
routed
forwardingtable
Mobile & Wireless Computing 53Kemal Akkaya
OSPF (Open Shortest Path First)“open”: publicly availableUses Link State algorithm
LS packet disseminationTopology map at each nodeRoute computation using Dijkstra’s algorithm
OSPF advertisement carries one entry per neighbor routerAdvertisements disseminated to entire AS (via flooding)
Carried in OSPF messages directly over IP (rather than TCP or UDP Security: all OSPF messages authenticated (to prevent malicious intrusion)
Features not in RIPMultiple same-cost paths allowed (only one path in RIP)For each link, multiple cost metrics for different TOS (e.g., satellite link cost set “low” for best effort; high for real time)Integrated uni- and multicast support:
Multicast OSPF (MOSPF) uses same topology data base as OSPFHierarchical OSPF in large domains.
Mobile & Wireless Computing 54Kemal Akkaya
Hierarchical OSPFTwo-level hierarchy: local area, backbone
Link-state advertisements only in area Each nodes has detailed area topology; only know direction (shortest path) to nets in other areas.
Area border routers:“summarize” distances to nets in own area, advertise to other Area Border routers.Backbone routers: run OSPF routing limited to backboneBoundary routers: connect to other AS’s
Mobile & Wireless Computing 55Kemal Akkaya
Internet inter-AS routing: BGP
BGP (Border Gateway Protocol): the de facto standardBGP provides each AS a means to:1. Obtain subnet reachability information from neighboring ASs.2. Propagate the reachability information to all routers internal to the
AS.3. Determine “good” routes to subnets based on reachability
information and policy.Allows a subnet to advertise its existence to rest of the Internet: “I am here”
Mobile & Wireless Computing 56Kemal Akkaya
BGP basicsPairs of routers (BGP peers) exchange routing info over semi-permanent TCP conctns: BGP sessionsNote that BGP sessions do not correspond to physical links.When AS2 advertises a prefix to AS1, AS2 is promising it will forward any datagrams destined to that prefix towards the prefix.
AS2 can aggregate prefixes in its advertisement
3b
1d
3a
1c2aAS3
AS1
AS21a
2c
2b
1b
3c
eBGP session
iBGP session
Mobile & Wireless Computing 57Kemal Akkaya
Distributing reachability infoWith eBGP session between 3a and 1c, AS3 sends prefix reachability info to AS1.1c can then use iBGP do distribute this new prefix reach info to all routers in AS11b can then re-advertise the new reach info to AS2 over the 1b-to-2a eBGPsessionWhen router learns about a new prefix, it creates an entry for the prefix in its forwarding table.
3b
1d
3a
1c2aAS3
AS1
AS21a
2c
2b
1b
3c
eBGP session
iBGP session
Mobile & Wireless Computing 58Kemal Akkaya
Path attributes & BGP routesWhen advertising a prefix, advert includes BGP attributes.
prefix + attributes = “route”Two important attributes:
AS-PATH: contains the ASs through which the advert for the prefix passed: AS 67 AS 17 NEXT-HOP: Indicates the specific internal-AS router to next-hop AS. (There may be multiple links from current AS to next-hop-AS.)
When gateway router receives route advert, uses import policy to accept/decline.
Route Selection:Router may learn about more than 1 route to some prefix. Router must select route.Elimination rules:1. Local preference value attribute: policy decision2. Shortest AS-PATH 3. Closest NEXT-HOP router: hot potato routing4. Additional criteria
Mobile & Wireless Computing 59Kemal Akkaya
BGP routing policyA,B,C are provider networksX,W,Y are customer (of provider networks)X is dual-homed: attached to two networks
X does not want to route from B via X to C.. so X will not advertise to B a route to C
BGP messages exchanged using TCP.BGP messages:
OPEN: opens TCP connection to peer and authenticates senderUPDATE: advertises new path (or withdraws old)KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN requestNOTIFICATION: reports errors in previous msg; also used to close connection
Figure 4.5-BGPnew: a simple BGP scenario
A
B
C
W X
Y
legend:
customer network:
provider network
Mobile & Wireless Computing 60Kemal Akkaya
BGP routing policy (2)
Figure 4.5-BGPnew: a simple BGP scenario
A
B
C
W X
Y
legend:
customer network:
provider network
A advertises to B the path AW B advertises to X the path BAW Should B advertise to C the path BAW?
No way! B gets no “revenue” for routing CBAW since neither W nor C are B’s customers B wants to force C to route to w via AB wants to route only to/from its customers!
Mobile & Wireless Computing 61Kemal Akkaya
Why different Intra- and Inter-AS routing ?
Policy:Inter-AS: admin wants control over how its traffic routed, who routes through its net. Intra-AS: single admin, so no policy decisions needed
Scale:Hierarchical routing saves table size, reduced update traffic
Performance: Intra-AS: can focus on performanceInter-AS: policy may dominate over performance
Mobile & Wireless Computing 62Kemal Akkaya
Network Layer: Summary
What we’ve covered:Network layer servicesIP What’s inside a router?IPv6Routing principles: link state and distance vectorHierarchical routingInternet routing protocols RIP, OSPF, BGP