Network layer functions. Chapter 4 Network Layer. Connection setup. Interplay between routing and forwarding
|
|
- Branden Underwood
- 8 years ago
- Views:
Transcription
1 Network laer functions Chapter 4 Network Laer transport packet from sending to receiving hosts laer entit in ever host, router functions: path determination: route taken b packets from source to dest. Routing algorithms forwarding: move packets from router s input to appropriate router output Call setup (VC s): Set-up routes state before sending packet application transport data link data link data link data link data link data link data link data link data link application transport data link Network Laer 4- Network Laer 4- Interpla between routing and forwarding Connection setup value in arriving packet s header routing algorithm local forwarding table header value output link rd important function in some architectures: ATM, frame rela, X.5 before datagrams flow, two end hosts and intervening routers establish virtual connection routers get involved vs transport laer connection service: : between two hosts (ma also involve intervening routers in case of VCs) transport: between two processes Network Laer 4-3 Network Laer 4-4
2 Network service model Network laer service models: Q: What service model for channel transporting datagrams from sender to receiver? Network Architecture Service Model Bandwidth Guarantees? Loss Order Timing Congestion feedback Eample services for individual datagrams: guaranteed deliver guaranteed deliver with less than 40 msec dela Eample services for a flow of datagrams: in-order datagram deliver guaranteed minimum bandwidth to flow restrictions on changes in interpacket spacing Internet ATM ATM ATM ATM best effort CBR VBR ABR UBR none no constant es rate guaranteed es rate guaranteed no minimum none no no es es es es no es es no no no (inferred via loss) no congestion no congestion es no Network Laer 4-5 Network Laer 4-6 Network laer connection and connection-less service datagram provides -laer connectionless service VC provides -laer connection service analogous to the transport-laer services, but: service: host-to-host no choice: provides one or the other implementation: in core Virtual circuits source-to-dest path behaves much like telephone circuit performance-wise actions along source-to-dest path call setup, teardown for each call before data can flow each packet carries VC identifier (not destination host address) ever router on source-dest path maintains state for each passing connection link, router resources (bandwidth, buffers) ma be allocated to VC (dedicated resources = predictable service) Network Laer 4-7 Network Laer 4-8
3 VC implementation Forwarding table VC number a VC consists of:. path from source to destination. VC numbers, one number for each link along path 3. entries in forwarding tables in routers along path packet belonging to VC carries VC number (rather than dest address) VC number can be changed on each link. New VC number comes from forwarding table Network Laer 4-9 Forwarding table in northwest router: interface number 3 3 Incoming interface Incoming VC # Outgoing interface Outgoing VC # Routers maintain connection state information! Network Laer 4-0 Virtual circuits: signaling protocols used to setup, maintain teardown VC used in ATM, frame-rela, X.5 not used in toda s Internet Datagram s no call setup at laer routers: no state about end-to-end connections no -level concept of connection packets forwarded using destination host address packets between same source-dest pair ma take different paths application transport data link 5. Data flow begins 6. Receive data 4. Call connected 3. Accept call. Initiate call. incoming call application transport data link application transport data link. Send data. Receive data application transport data link Network Laer 4- Network Laer 4-
4 Forwarding table 4 billion possible entries Longest prefi matching Destination Address Range through Link Interface Prefi Match Link Interface otherwise through through otherwise 3 Network Laer 4-3 Eamples DA: DA: Which interface? Which interface? Network Laer 4-4 Datagram or VC : wh? Router Architecture Overview Internet (datagram) data echange among computers elastic service, no strict timing req. smart end sstems (computers) can adapt, perform control, error recover simple inside, compleit at edge man link tpes different characteristics uniform service difficult ATM (VC) evolved from telephon human conversation: strict timing, reliabilit requirements need for guaranteed service dumb end sstems telephones compleit inside Network Laer 4-5 Two ke router functions: run routing algorithms/protocol (RIP, OSPF, BGP) forwarding datagrams from incoming to outgoing link Network Laer 4-6
5 Input Port Functions Three tpes of switching fabrics Phsical laer: bit-level reception Data link laer: e.g., Ethernet see chapter 5 Decentralied switching: given datagram dest., lookup output port using forwarding table in input port memor goal: complete input port processing at line speed queuing: if datagrams arrive faster than forwarding rate into switch fabric Network Laer 4-7 Network Laer 4-8 Switching Via Memor First generation routers: traditional computers with switching under direct control of CPU packet copied to sstem s memor speed limited b memor bandwidth ( bus crossings per datagram) Input Port Memor Output Port Sstem Bus Switching Via a Bus datagram from input port memor to output port memor via a shared bus bus contention: switching speed limited b bus bandwidth 3 Gbps bus, Cisco 5600: sufficient speed for access and enterprise routers Network Laer 4-9 Network Laer 4-0
6 Switching Via An Interconnection Network Output Ports overcome bus bandwidth limitations Banan s, other interconnection nets initiall developed to connect processors in multiprocessor advanced design: fragmenting datagram into fied length cells, switch cells through the fabric. Cisco 000: switches 60 Gbps through the interconnection Buffering required when datagrams arrive from fabric faster than the transmission rate Scheduling discipline chooses among queued datagrams for transmission Network Laer 4- Network Laer 4- Output port queueing buffering when arrival rate via switch eceeds output line speed queueing (dela) and loss due to output port buffer overflow! Network Laer 4-3 How much buffering? RFC 3439 rule of thumb: average buffering equal to tpical RTT (sa 50 msec) times link capacit C e.g., C = 0 Gps link:.5 Gbit buffer Recent recommendation: with N flows, buffering equal to RTT. C N Network Laer 4-4
7 Input Port Queuing Fabric slower than input ports combined -> queueing ma occur at input queues Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forward queueing dela and loss due to input buffer overflow! The Internet Network laer Host, router laer functions: Network laer Routing protocols path selection RIP, OSPF, BGP Transport laer: TCP, UDP forwarding table IP protocol addressing conventions datagram format packet handling conventions ICMP protocol error reporting router signaling Link laer laer Network Laer 4-5 Network Laer 4-6 IP datagram format IP protocol version number header length (btes) tpe of data ma number remaining hops (decremented at each router) upper laer protocol to deliver paload to how much overhead with TCP? 0 btes of TCP 0 btes of IP = 40 btes + app laer overhead 3 bits head. tpe of ver length len service fragment 6-bit identifier flgs offset time to upper header live laer checksum 3 bit source IP address 3 bit destination IP address Options (if an) data (variable length, tpicall a TCP or UDP segment) total datagram length (btes) for fragmentation/ reassembl E.g. timestamp, record route taken, specif list of routers to visit. Network Laer 4-7 IP Fragmentation & Reassembl links have MTU (ma.transfer sie) - largest possible link-level frame. different link tpes, different MTUs large IP datagram divided ( fragmented ) within net one datagram becomes several datagrams reassembled onl at final destination IP header bits used to identif, order related fragments reassembl fragmentation: in: one large datagram out: 3 smaller datagrams Network Laer 4-8
8 IP Fragmentation and Reassembl IP Addressing: introduction Eample 4000 bte datagram MTU = 500 btes 480 btes in data field offset = 480/8 length =4000 ID = fragflag =0 offset =0 One large datagram becomes several smaller datagrams length ID fragflag offset =500 = = =0 length =500 length =040 ID = ID = fragflag = fragflag =0 offset =85 offset =370 IP address: 3-bit identifier for host, router interface interface: connection between host/router and link router s tpicall have multiple interfaces host tpicall has one interface IP addresses associated with each interface = Network Laer 4-9 Network Laer 4-30 IP Addressing Address can be divided in two parts NetID HostID NetID identifies the HostID identifies the host within the Network Host Hosts within the same have the same NetId Subnets IP address: subnet part (high order bits) host part (low order bits) What s a subnet? device interfaces with same subnet part of IP address can l reach each other without intervening router subnet consisting of 3 subnets Network Laer 4-3 Network Laer 4-3
9 Subnets 3...0/ /4 Subnets 3... Recipe To determine the subnets, detach each interface from its host or router, creating islands of isolated s. Each isolated is called a subnet /4 Subnet mask: /4 How man? Network Laer 4-33 Network Laer 4-34 IP Addresses given notion of, let s re-eamine IP addresses: class-full addressing: class A B C D 0 host 0 host 0 host 0 multicast address 3 bits to to to to Counting up 3 bit IP address: 3 = theoretical IP addresses class A: The IP 7 - =6 s [ and reserved] address 4 - = maimum hosts Pie! addressable hosts (49,% of ma) class B 4 =6.384 s Class B 6 - = maimum hosts Class A addressable hosts (4,99% of ma) C class C D = s E 8 - = 54 maimum hosts addressable hosts (,40% of ma) Network Laer 4-35 Network Laer 4-36
10 Special Addresses Network Address: An address with the HostID bits set to 0 identifies the with the given NetID (used in routing tables) eamples: class B : class C : Special Addresses Direct Broadcast Address: Address with HostID bit set to is the broadcast address of the identified b NetID. eample: Network Laer 4-37 Network Laer 4-38 IP addressing: CIDR CIDR: Classless InterDomain Routing subnet portion of address of arbitrar length address format: a.b.c.d/, where is # bits in subnet portion of address subnet part host part IP addresses: how to get one? Q: How does a host get IP address? hard-coded b sstem admin in a file Windows: control-panel->->configuration- >tcp/ip->properties UNIX: /etc/rc.config DHCP: Dnamic Host Configuration Protocol: dnamicall get address from as server plug-and-pla /3 Network Laer 4-39 Network Laer 4-40
11 DHCP: Dnamic Host Configuration Protocol DHCP client-server scenario Goal: allow host to dnamicall obtain its IP address from server when it joins Can renew its lease on address in use Allows reuse of addresses (onl hold address while connected an on ) Support for mobile users who want to join (more shortl) DHCP overview: host broadcasts DHCP discover msg DHCP server responds with DHCP offer msg host requests IP address: DHCP request msg DHCP server sends address: DHCP ack msg A B 3... DHCP server E arriving DHCP client needs address in this Network Laer 4-4 Network Laer 4-4 DHCP client-server scenario DHCP server: time DHCP request DHCP discover src : , 68 dest.: ,67 iaddr: transaction ID: 654 DHCP offer src: , 68 dest:: , 67 iaddrr: transaction ID: 655 Lifetime: 3600 secs src: 3...5, 67 dest: , 68 iaddrr: transaction ID: 654 Lifetime: 3600 secs DHCP ACK src: 3...5, 67 dest: , 68 iaddrr: transaction ID: 655 Lifetime: 3600 secs arriving client Network Laer 4-43 IP addresses: how to get one? Q: How does get subnet part of IP addr? A: gets allocated portion of its provider ISP s address space ISP's block /0 Organiation /3 Organiation /3 Organiation / Organiation /3 Network Laer 4-44
12 Hierarchical addressing: route aggregation Hierarchical addressing allows efficient advertisement of routing information: Hierarchical addressing: more specific routes ISPs-R-Us has a more specific route to Organiation Organiation 0 Organiation /3 Organiation /3 Organiation /3 Organiation /3.... Fl-B-Night-ISP ISPs-R-Us Send me anthing with addresses beginning /0 Send me anthing with addresses beginning /6 Internet /3 Organiation /3 Organiation /3.... Organiation /3 Fl-B-Night-ISP ISPs-R-Us Send me anthing with addresses beginning /0 Send me anthing with addresses beginning /6 or /3 Internet Network Laer 4-45 Network Laer 4-46 IP addressing: the last word... Q: How does an ISP get block of addresses? A: ICANN: Internet Corporation for Assigned Names and Numbers allocates addresses manages DNS assigns domain names, resolves disputes NAT: Network Address Translation rest of Internet All datagrams leaving local have same single source NAT IP address: , different source port numbers local (e.g., home ) 0.0.0/4 Datagrams with source or destination in this have 0.0.0/4 address for source, destination (as usual) Network Laer 4-47 Network Laer 4-48
13 NAT: Network Address Translation Motivation: local uses just one IP address as far as outside world is concerned: range of addresses not needed from ISP: just one IP address for all devices can change addresses of devices in local without notifing outside world can change ISP without changing addresses of devices in local devices inside local net not eplicitl addressable, visible b outside world (a securit plus). Network Laer 4-49 NAT: Network Address Translation Implementation: NAT router must: outgoing datagrams: replace (source IP address, port #) of ever 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) ever (source IP address, port #) to (NAT IP address, new port #) translation pair incoming datagrams: replace (NAT IP address, new port #) in dest fields of ever incoming datagram with corresponding (source IP address, port #) stored in NAT table Network Laer 4-50 NAT: Network Address Translation NAT: Network Address Translation : NAT router changes datagram source addr from , 3345 to , 500, updates table NAT translation table WAN side addr LAN side addr , , 3345 S: , 500 D: , 80 S: , 80 D: , : Repl arrives dest. address: , S: , 3345 D: , S: , 80 4 D: , 3345 : host sends datagram to , : NAT router changes datagram dest addr from , 500 to , 3345 Network Laer bit port-number field: 60,000 simultaneous connections with a single LAN-side address! NAT is controversial: routers should onl process up to laer 3 violates end-to-end argument NAT possibilit must be taken into account b app designers, eg, PP applications address shortage should instead be solved b IPv6 Network Laer 4-5
14 NAT traversal problem NAT traversal problem client wants to connect to server with address server address local to LAN (client can t use it as destination addr) onl one eternall visible NATted address: solution : staticall configure NAT to forward incoming connection requests at given port to server e.g., ( , port 500) alwas forwarded to port 5000 Client? NAT router solution : Universal Plug and Pla (UPnP) Internet Gatewa Device (IGD) Protocol. Allows NATted host to: learn public IP address ( ) add/remove port mappings (with lease times) i.e., automate static NAT port map configuration NAT router IGD Network Laer 4-53 Network Laer 4-54 NAT traversal problem solution 3: relaing (used in Skpe) Client NATed client establishes connection to rela Eternal client connects to rela rela bridges packets between to connections. connection to rela initiated b client 3. relaing established. connection to rela initiated b NATted host NAT router Getting a datagram from source to dest. IP datagram: misc source dest fields IP addr IP addr data datagram remains unchanged, as it travels source to destination addr fields of interest here A B forwarding table in A Dest. Net. net router Nhops E Network Laer 4-55 Network Laer 4-56
15 Getting a datagram from source to dest. misc fields data Starting at A, send IP datagram addressed to B: look up net. address of B in forwarding table find B is on same net. as A link laer will send datagram directl to B inside link-laer frame B and A are directl connected A B forwarding table in A Dest. Net. net router Nhops E Network Laer 4-57 Getting a datagram from source to dest. misc fields data Starting at A, dest. E: look up address of E in forwarding table E on different A, E not directl attached routing table: net hop router to E is link laer sends datagram to router inside linklaer frame datagram arrives at continued.. A B forwarding table in A Dest. Net. net router Nhops E Network Laer 4-58 Getting a datagram from source to dest. misc fields data Dest. Arriving at 3..4, destined for 3... look up address of E in router s forwarding table E on same as router s interface router, E directl attached link laer sends datagram to 3... inside link-laer frame via interface datagram arrives at 3...!!! (hoora!) forwarding table in router Net router Nhops interface A B E Network Laer 4-59 Graph abstraction Graph: G = (N,E) 5 v 3 u 3 w 5 N = set of routers = { u, v, w,,, } E = set of links ={ (u,v), (u,), (v,), (v,w), (,w), (,), (w,), (w,), (,) } Remark: Graph abstraction is useful in other contets Eample: PP, where N is set of peers and E is set of TCP connections Network Laer 4-60
16 Graph abstraction: costs Routing Algorithm classification 5 c(, ) = cost of link (, ) v 3 w 5 u 3 - e.g., c(w,) = 5 cost could alwas be, or inversel related to bandwidth, or inversel related to congestion Cost of path (,, 3,, p ) = c(, ) + c(, 3 ) + + c( p-, p ) Question: What s the least-cost path between u and? Routing algorithm: algorithm that finds least-cost path Network Laer 4-6 Global or decentralied information? Global: all routers have complete topolog, link cost info link state algorithms Decentralied: router knows lconnected neighbors, link costs to neighbors iterative process of computation, echange of info with neighbors distance vector algorithms Static or dnamic? Static: routes change slowl over time Dnamic: routes change more quickl periodic update in response to link cost changes Network Laer 4-6 A Link-State Routing Algorithm Dijsktra s Algorithm Dijkstra s algorithm net topolog, 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(,): link cost from node to ; = if not direct neighbors D(v): current value of cost of path from source to dest. v p(v): predecessor node along path from source to v N': set of nodes whose least cost path definitivel known Network Laer 4-63 Initialiation: 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 Loop 9 find w not in N' such that D(w) is a minimum 0 add w to N' update D(v) for all v adjacent to w and not in N' : D(v) = min( D(v), D(w) + c(w,v) ) 3 /* new cost to v is either old cost to v or known 4 shortest path cost to w plus cost from w to v */ 5 until all nodes in N' Network Laer 4-64
17 Dijkstra s algorithm: eample Dijkstra s algorithm: eample () Step N' u u u uv uvw uvw 5 uvw D(v),p(v),u,u,u D(w),p(w) 5,u 4, 3, 3, D(),p(),u D(),p(), D(),p() 4, 4, 4, Resulting shortest-path tree from u: u v w Resulting forwarding table in u: u 5 v 3 3 w 5 Network Laer 4-65 destination v w link (u,v) (u,) (u,) (u,) (u,) Network Laer 4-66 Dijkstra s algorithm, discussion Algorithm compleit: n nodes each iteration: need to check all nodes, w, not in N n(n+)/ comparisons: O(n ) more efficient implementations possible: O(nlogn) Oscillations possible: e.g., link cost = amount of carried traffic A +e D B C e e initiall A +e 0 D B +e 0 C 0 recompute routing A 0 +e D B 0 0 C +e recompute A +e 0 D B +e 0 C e recompute Network Laer 4-67 Distance Vector Algorithm Bellman-Ford Equation (dnamic programming) Define d () := cost of least-cost path from to Then d () = min {c(,v) + d v () } v where min is taken over all neighbors v of Network Laer 4-68
18 Bellman-Ford eample Distance Vector Algorithm u 5 v 3 3 w 5 Clearl, d v () = 5, d () = 3, d w () = 3 B-F equation sas: d u () = min { c(u,v) + d v (), c(u,) + d (), c(u,w) + d w () } = min { + 5, + 3, 5 + 3} = 4 Node that achieves minimum is net hop in shortest path forwarding table Network Laer 4-69 D () = estimate of least cost from to Node knows cost to each neighbor v: c(,v) Node maintains distance vector D = [D (): є N ] Node also maintains its neighbors distance vectors For each neighbor v, maintains D v = [D v (): є N ] Network Laer 4-70 Distance vector algorithm (4) Distance Vector Algorithm (5) Basic idea: From time-to-time, each node sends its own distance vector estimate to neighbors Asnchronous When a node receives new DV estimate from neighbor, it updates its own DV using B-F equation: D () min v {c(,v) + D v ()} for each node N Under minor, natural conditions, the estimate D () converge to the actual least cost d () Iterative, asnchronous: each local iteration caused b: local link cost change DV update message from neighbor Distributed: each node notifies neighbors onl when its DV changes neighbors then notif their neighbors if necessar Each node: wait for (change in local link cost or msg from neighbor) recompute estimates if DV to an dest has changed, notif neighbors Network Laer 4-7 Network Laer 4-7
19 D () = min{c(,) + D (), c(,) + D ()} = min{+0, 7+} = node table cost to cost to 0 7 node table cost to from from from 0 node table cost to 7 0 from time D () = min{c(,) + D (), c(,) + D ()} = min{+, 7+0} = 3 7 Network Laer 4-73 D () = min{c(,) + D (), c(,) + D ()} = min{+0, 7+} = node table cost to cost to cost to node table cost to cost to cost to from from node table cost to from 7 0 from from from cost to from from from cost to time D () = min{c(,) + D (), c(,) + D ()} = min{+, 7+0} = 3 7 Network Laer 4-74 Distance Vector: link cost changes Distance Vector: link cost changes Link cost changes: node detects local link cost change updates routing info, recalculates distance vector if DV changes, notif neighbors good news travels fast 4 At time t 0, detects the link-cost change, updates its DV, and informs its neighbors. At time t, receives the update from and updates its table. It computes a new least cost to and sends its neighbors its DV. At time t, receives s update and updates its distance table. s least costs do not change and hence does not send an message to. 50 Network Laer 4-75 Link cost changes: good news travels fast bad news travels slow - count to infinit problem! 44 iterations before algorithm stabilies: see tet Poisoned 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 completel solve count to infinit problem? Network Laer 4-76
20 Comparison of LS and DV algorithms Message compleit LS: with n nodes, E links, O(nE) msgs sent DV: echange between neighbors onl convergence time varies Speed of Convergence LS: O(n ) algorithm requires O(nE) msgs ma have oscillations DV: convergence time varies ma be routing loops count-to-infinit problem Robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes onl its own table DV: DV node can advertise incorrect path cost each node s table used b others error propagate thru Hierarchical Routing Network Laer 4-77 Network Laer 4-78 Hierarchical Routing Hierarchical Routing Our routing stud thus far - idealiation all routers identical flat not true in practice scale: with 00 million destinations: can t store all dest s in routing tables! routing table echange would swamp links! administrative autonom internet = of s each admin ma want to control routing in its own aggregate routers into regions, autonomous sstems (AS) routers in same AS run same routing protocol intra-as routing protocol routers in different AS can run different intra- AS routing protocol gatewa routers special routers in AS run intra-as routing protocol with all other routers in AS also responsible for routing to destinations outside AS run inter-as routing protocol with other gatewa routers Network Laer 4-79 Network Laer 4-80
21 Intra-AS and Inter-AS routing Intra-AS and Inter-AS routing a C C.b b d A A.a a b inter-as, intra-as routing in gatewa A.c A.c c B.a a B c Gatewas: perform inter-as routing amongst themselves b perform intra-as routers with other routers in their AS laer link laer laer a Host h C C.b b A.a Inter-AS routing between A and B A.c a d A b c Intra-AS routing within AS A B.a a B c b Host h Intra-AS routing within AS B We ll eamine specific inter-as and intra-as Internet routing protocols shortl Network Laer 4-8 Network Laer 4-8 Interconnected ASes 3c 3a 3b AS3 a c d b Intra-AS Routing algorithm AS Forwarding table Inter-AS Routing algorithm a c b AS forwarding table configured b both intra- and inter-as routing algorithm intra-as sets entries for internal dests inter-as & intra-as sets entries for eternal dests Inter-AS tasks suppose router in AS receives datagram destined outside of AS: router should forward packet to gatewa router, but which one? 3c 3a 3b AS3 a c d b AS must:. learn which dests are reachable through AS, which through AS3. propagate this reachabilit info to all routers in AS Job of inter-as routing! AS a c b AS Network Laer 4-83 Network Laer 4-84
22 Eample: Setting forwarding table in router d suppose AS learns (via inter-as protocol) that subnet reachable via AS3 (gatewa c) but not via AS. inter-as protocol propagates reachabilit info to all internal routers. router d determines from intra-as routing info that its interface I is on the least cost path to c. installs forwarding table entr (,I) 3c 3a 3b AS3 a c d b AS a c b AS Network Laer 4-85 Eample: Choosing among multiple ASes now suppose AS learns from inter-as protocol that subnet is reachable from AS3 and from AS. to configure forwarding table, router d must determine towards which gatewa it should forward packets for dest. this is also job of inter-as routing protocol! 3c 3a 3b AS3 a c d b AS a c b AS Network Laer 4-86 Eample: Choosing among multiple ASes now suppose AS learns from inter-as protocol that subnet is reachable from AS3 and from AS. to configure forwarding table, router d must determine towards which gatewa it should forward packets for dest. this is also job of inter-as routing protocol! hot potato routing: send packet towards closest of two routers. Learn from inter-as protocol that subnet is reachable via multiple gatewas Use routing info from intra-as protocol to determine costs of least-cost paths to each of the gatewas Hot potato routing: Choose the gatewa that has the smallest least cost Determine from forwarding table the interface I that leads to least-cost gatewa. Enter (,I) in forwarding table Routing in the Internet The Global Internet consists of Autonomous Sstems (AS) interconnected with each other: Stub AS: small corporation: one connection to other AS s Multihomed AS: large corporation (no transit): multiple connections to other AS s Transit AS: provider, hooking man AS s together Two-level routing: Intra-AS: administrator responsible for choice of routing algorithm within Inter-AS: unique standard for inter-as routing: BGP Network Laer 4-87 Network Laer 4-88
23 Internet AS Hierarch Inter-AS border (eterior gatewa) routers Intra-AS Routing also known as Interior Gatewa Protocols (IGP) most common Intra-AS routing protocols: RIP: Routing Information Protocol OSPF: Open Shortest Path First IGRP: Interior Gatewa Routing Protocol (Cisco proprietar) Intra-AS interior (gatewa) routers Network Laer 4-89 Network Laer 4-90 RIP ( Routing Information Protocol) distance vector algorithm included in BSD-UNIX Distribution in 98 distance metric: # of hops (ma = 5 hops) u A C B D v w From router A to subnets: destination hops u v w 3 3 RIP advertisements distance vectors: echanged among neighbors ever 30 sec via Response Message (also called advertisement) each advertisement: list of up to 5 destination subnets within AS Network Laer 4-9 Network Laer 4-9
24 RIP: Eample w A D B C Destination Network Net Router Num. of hops to dest. w A B B Routing/Forwarding table in D Network Laer 4-93 RIP: Eample Dest Net hops w - - C Advertisement from A to D w A D B C Destination Network Net Router Num. of hops to dest. w A B B A Routing/Forwarding table in D Network Laer 4-94 RIP: Link Failure and Recover If no advertisement heard after 80 sec --> neighbor/link declared dead routes via neighbor invalidated new advertisements sent to neighbors neighbors in turn send out new advertisements (if tables changed) link failure info quickl (?) propagates to entire net poison reverse used to prevent ping-pong loops (infinite distance = 6 hops) RIP Table processing RIP routing tables managed b application-level process called route-d (daemon) advertisements sent in UDP packets, periodicall repeated Transprt (UDP) link routed forwarding (IP) table forwarding table routed Transprt (UDP) (IP) link Network Laer 4-95 Network Laer 4-96
25 RIP message Command (-6)Version () 0 Address famil () IP address 0 0 Metric 0 0 btes Up to 4 more routes with same 0 btes format Command: =request to send all or part of the routing table; =repl (3-6 obsolete or non documented) Address famil: =IP addresses metric: distance of emitting router from the specified IP address in number of hops (valid from to 5; 6=infinite) Network Laer 4-97 Message sie 8 UDP header 4 btes RIP header 0 btes up to 5 entries total: maimum of 5 btes UDP datagram 5 entries: too little to transfer an entire routing table more than UDP datagram generall needed Network Laer 4-98 Initialiation When routing daemon started, send special RIP request on ever interface command = (request) metric set to 6 (infinite) This asks for complete routing table from all connected routers allows to discover adjacent routers! OSPF (Open Shortest Path First) open : publicl available uses Link State algorithm LS packet dissemination topolog map at each node route computation using Dijkstra s algorithm OSPF advertisement carries one entr per neighbor router advertisements disseminated to entire AS (via flooding) carried in OSPF messages directl over IP (rather than TCP or UDP Network Laer 4-99 Network Laer 4-00
26 OSPF advanced features (not in RIP) Hierarchical OSPF securit: all OSPF messages authenticated (to prevent malicious intrusion) multiple same-cost paths allowed (onl 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 topolog data base as OSPF hierarchical OSPF in large domains. Network Laer 4-0 Network Laer 4-0 Hierarchical OSPF two-level hierarch: local area, backbone. Link-state advertisements onl in area each nodes has detailed area topolog; onl know direction (shortest path) to nets in other areas. area border routers: summarie distances to nets in own area, advertise to other Area Border routers. backbone routers: run OSPF routing limited to backbone. boundar routers: connect to other AS s. Internet inter-as routing: BGP BGP (Border Gatewa Protocol): the de facto standard BGP provides each AS a means to:. Obtain subnet reachabilit information from neighboring ASs.. Propagate reachabilit information to all ASinternal routers. 3. Determine good routes to subnets based on reachabilit information and polic. allows subnet to advertise its eistence to rest of Internet: I am here Network Laer 4-03 Network Laer 4-04
27 BGP basics pairs of routers (BGP peers) echange routing info over semi-permanent TCP connections: BGP sessions BGP sessions need not correspond to links. when AS advertises a prefi to AS: AS promises it will forward datagrams towards that prefi. AS can aggregate prefies in its advertisement Distributing reachabilit info using ebgp session between 3a and c, AS3 sends prefi reachabilit info to AS. c can then use ibgp do distribute new prefi info to all routers in AS b can then re-advertise new reachabilit info to AS over b-to-a ebgp session when router learns of new prefi, it creates entr for prefi in its forwarding table. 3c 3a 3b AS3 a AS c d ebgp session ibgp session b a c b AS Network Laer c 3a 3b AS3 a AS c d ebgp session ibgp session b a c b AS Network Laer 4-06 Path attributes & BGP routes BGP route selection advertised prefi includes BGP attributes. prefi + attributes = route two important attributes: AS-PATH: contains ASs through which prefi advertisement has passed: e.g, AS 67, AS 7 NEXT-HOP: indicates specific internal-as router to net-hop AS. (ma be multiple links from current AS to net-hop-as) when gatewa router receives route advertisement, uses import polic to accept/decline. router ma learn about more than route to some prefi. Router must select route. elimination rules:. local preference value attribute: polic decision. shortest AS-PATH 3. closest NEXT-HOP router: hot potato routing 4. additional criteria Network Laer 4-07 Network Laer 4-08
28 BGP messages BGP messages echanged using TCP. BGP messages: OPEN: opens TCP connection to peer and authenticates sender UPDATE: advertises new path (or withdraws old) KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN request NOTIFICATION: reports errors in previous msg; also used to close connection BGP routing polic W A A,B,C are provider s B C X Y legend: X,W,Y are customer (of provider s) X is dual-homed: attached to two s X does not want to route from B via X to C.. so X will not advertise to B a route to C provider customer : Network Laer 4-09 Network Laer 4-0 BGP routing polic () W A A advertises path AW to B B advertises path BAW to X B C X Y legend: Should B advertise path BAW to C? provider customer : No wa! 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 A B wants to route onl to/from its customers! Network Laer 4- Wh different Intra- and Inter-AS routing? Polic: Inter-AS: admin wants control over how its traffic routed, who routes through its net. Intra-AS: single admin, so no polic decisions needed Scale: hierarchical routing saves table sie, reduced update traffic Performance: Intra-AS: can focus on performance Inter-AS: polic ma dominate over performance Network Laer 4-
CS 3251- Computer Networks 1: Routing Algorithms
CS 35- Computer Networks : Routing Algorithms Professor Patrick Tranor 0//3 Lecture 3 Reminders The due date for Homework was moved to Thursda. Reason: Allow ou to attend toda s lecture. Project is still
More informationBased on Computer Networking, 4 th Edition by Kurose and Ross
Computer Networks Internet Routing Based on Computer Networking, 4 th Edition by Kurose and Ross Intra-AS Routing Also known as Interior Gateway Protocols (IGP) Most common Intra-AS routing protocols:
More informationCS 78 Computer Networks. Internet Protocol (IP) our focus. The Network Layer. Interplay between routing and forwarding
CS 78 Computer Networks Internet Protocol (IP) Andrew T. Campbell campbell@cs.dartmouth.edu our focus What we will lean What s inside a router IP forwarding Internet Control Message Protocol (ICMP) IP
More informationRouting Protocols. Interconnected ASes. Hierarchical Routing. Hierarchical Routing
Routing Protocols scale: with 200 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! Hierarchical Routing Our routing study thus far - idealization
More informationIP addressing and forwarding Network layer
The Internet Network layer Host, router network layer functions: IP addressing and forwarding Network layer Routing protocols path selection RIP, OSPF, BGP Transport layer: TCP, UDP forwarding table IP
More informationNetwork layer" 1DT066! Distributed Information Systems!! Chapter 4" Network Layer!! goals: "
1DT066! Distributed Information Systems!! Chapter 4" Network Layer!! Network layer" goals: "! understand principles behind layer services:" " layer service models" " forwarding versus routing" " how a
More informationChapter 4 Network Layer
Chapter 4 Network Layer Reti degli Elaboratori Canale AL Prof.ssa Chiara Petrioli a.a. 2013/2014 We thank for the support material Prof. Kurose-Ross All material copyright 1996-2012 J.F Kurose and K.W.
More informationChapter 4 Network Layer
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
More informationIP addressing. Interface: Connection between host, router and physical link. IP address: 32-bit identifier for host, router interface
IP addressing IP address: 32-bit identifier for host, router interface Interface: Connection between host, router and physical link routers typically have multiple interfaces host may have multiple interfaces
More informationCS 457 Lecture 19 Global Internet - BGP. Fall 2011
CS 457 Lecture 19 Global Internet - BGP Fall 2011 Decision Process Calculate degree of preference for each route in Adj-RIB-In as follows (apply following steps until one route is left): select route with
More informationvalue in arriving packet s header routing algorithm local forwarding table header value output link
Compter Netorks Roting Algorithms Based on Compter Netorking, 4 th Edition b Krose and Ross Interpla beteen roting, forarding roting algorithm local forarding table header ale otpt link 000 00 0 00 ale
More informationCS 43: Computer Networks IP. Kevin Webb Swarthmore College November 5, 2013
CS 43: Computer Networks IP Kevin Webb Swarthmore College November 5, 2013 Reading Quiz IP datagram format IP protocol version number header length (bytes) type of data max number remaining hops (decremented
More informationDatagram-based network layer: forwarding; routing. Additional function of VCbased network layer: call setup.
CEN 007C Computer Networks Fundamentals Instructor: Prof. A. Helmy Homework : Network Layer Assigned: Nov. 28 th, 2011. Due Date: Dec 8 th, 2011 (to the TA) 1. ( points) What are the 2 most important network-layer
More informationAdvanced Networking Routing: RIP, OSPF, Hierarchical routing, BGP
Advanced Networking Routing: RIP, OSPF, Hierarchical routing, BGP Renato Lo Cigno Routing Algorithms: One or Many? Is there a single routing protocol in the Internet? How can different protocols and algorithms
More informationNetwork layer: Overview. Network layer functions IP Routing and forwarding
Network layer: Overview Network layer functions IP Routing and forwarding 1 Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every host, router application
More informationBased on Computer Networking, 4 th Edition by Kurose and Ross
Computer Networks Network Layer, Virtual Circuits and Datagram Networks Based on Computer Networking, 4 th Edition by Kurose and Ross Network layer segment from sending to receiving host on sending side
More informationRoute Discovery Protocols
Route Discovery Protocols Columbus, OH 43210 Jain@cse.ohio-State.Edu http://www.cse.ohio-state.edu/~jain/ 1 Overview Building Routing Tables Routing Information Protocol Version 1 (RIP V1) RIP V2 OSPF
More informationInternet inter-as routing: BGP
Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard BGP provides each AS a means to: 1. Obtain subnet reachability information from neighboring ASs. 2. Propagate the reachability
More informationClassful IP Addressing. Classless Addressing: CIDR. Routing & Forwarding: Logical View of a Router. IP Addressing: Basics
Switching and Forwarding Switching and Forwarding Generic Router rchitecture Forwarding Tables: ridges/layer Switches; VLN Routers and Layer 3 Switches Forwarding in Layer 3 (Network Layer) Network Layer
More informationModule 7. Routing and Congestion Control. Version 2 CSE IIT, Kharagpur
Module 7 Routing and Congestion Control Lesson 4 Border Gateway Protocol (BGP) Specific Instructional Objectives On completion of this lesson, the students will be able to: Explain the operation of the
More informationBorder Gateway Protocol (BGP)
Border Gateway Protocol (BGP) Petr Grygárek rek 1 Role of Autonomous Systems on the Internet 2 Autonomous systems Not possible to maintain complete Internet topology information on all routers big database,
More informationInternet Protocol: IP packet headers. vendredi 18 octobre 13
Internet Protocol: IP packet headers 1 IPv4 header V L TOS Total Length Identification F Frag TTL Proto Checksum Options Source address Destination address Data (payload) Padding V: Version (IPv4 ; IPv6)
More informationКомпјутерски Мрежи NAT & ICMP
Компјутерски Мрежи NAT & ICMP Riste Stojanov, M.Sc., Aleksandra Bogojeska, M.Sc., Vladimir Zdraveski, B.Sc Internet AS Hierarchy Inter-AS border (exterior gateway) routers Intra-AS interior (gateway) routers
More informationDynamic Routing Protocols II OSPF. Distance Vector vs. Link State Routing
Dynamic Routing Protocols II OSPF Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. 1 Distance Vector vs. Link State Routing With distance
More informationInternet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering
Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls
More informationIntroduction to LAN/WAN. Network Layer (part II)
Introduction to LAN/WAN Network Layer (part II) Topics The Network Layer Introduction Routing (5.2) The Internet (5.5) IP, IP addresses ARP (5.5.4) OSPF (5.5.5) BGP (5.5.6) Congestion Control (5.3) Internetworking
More informationThe Network Layer. Raj Jain. Washington University in St. Louis
The Network Layer Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@wustl.edu Audio/Video recordings of this lecture are available on-line at: http://www.cse.wustl.edu/~jain/cse473-11/
More informationInternet Protocols Fall 2005. Lectures 7-8 Andreas Terzis
Internet Protocols Fall 2005 Lectures 7-8 Andreas Terzis Outline Internet Protocol Service Model Fragmentation Addressing Original addressing scheme Subnetting CIDR Forwarding ICMP ARP Address Shortage
More informationThe Network Layer. Raj Jain. Washington University in St. Louis
The Network Layer Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@wustl.edu Audio/Video recordings of this lecture are available on-line at: http://www.cse.wustl.edu/~jain/cse473-09/
More informationInternet inter-as routing: BGP
Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard BGP provides each AS a means to: 1. Obtain subnet reachability information from neighboring ASs. 2. Propagate the reachability
More informationAnswers to Sample Questions on Network Layer
Answers to Sample Questions on Network Layer ) IP Packets on a certain network can carry a maximum of only 500 bytes in the data portion. An application using TCP/IP on a node on this network generates
More informationInter-domain Routing Basics. Border Gateway Protocol. Inter-domain Routing Basics. Inter-domain Routing Basics. Exterior routing protocols created to:
Border Gateway Protocol Exterior routing protocols created to: control the expansion of routing tables provide a structured view of the Internet by segregating routing domains into separate administrations
More informationIntroduction to TCP/IP
Introduction to TCP/IP Raj Jain The Ohio State University Columbus, OH 43210 Nayna Networks Milpitas, CA 95035 Email: Jain@ACM.Org http://www.cis.ohio-state.edu/~jain/ 1 Overview! Internetworking Protocol
More informationComputer Networks. Main Functions
Computer Networks The Network Layer 1 Routing. Forwarding. Main Functions 2 Design Issues Services provided to transport layer. How to design network-layer protocols. 3 Store-and-Forward Packet Switching
More informationLecture 8: Routing I Distance-vector Algorithms. CSE 123: Computer Networks Stefan Savage
Lecture 8: Routing I Distance-vector Algorithms CSE 3: Computer Networks Stefan Savage This class New topic: routing How do I get there from here? Overview Routing overview Intra vs. Inter-domain routing
More informationOutline. Internet Routing. Alleviating the Problem. DV Algorithm. Routing Information Protocol (RIP) Link State Routing. Routing algorithms
Outline Internet Routing Venkat Padmanabhan Microsoft Research 9 pril 2001 Routing algorithms distance-vector (DV) link-state (LS) Internet Routing border gateway protocol (BGP) BGP convergence paper Venkat
More informationInter-domain Routing. Outline. Border Gateway Protocol
Inter-domain Routing Outline Border Gateway Protocol Internet Structure Original idea Backbone service provider Consumer ISP Large corporation Consumer ISP Small corporation Consumer ISP Consumer ISP Small
More informationNetwork Layer: Network Layer and IP Protocol
1 Network Layer: Network Layer and IP Protocol Required reading: Garcia 7.3.3, 8.1, 8.2.1 CSE 3213, Winter 2010 Instructor: N. Vlajic 2 1. Introduction 2. Router Architecture 3. Network Layer Protocols
More information8.2 The Internet Protocol
TCP/IP Protocol Suite HTTP SMTP DNS RTP Distributed applications Reliable stream service TCP UDP User datagram service Best-effort connectionless packet transfer Network Interface 1 IP Network Interface
More informationCSC458 Lecture 6. Homework #1 Grades. Inter-domain Routing IP Addressing. Administrivia. Midterm will Cover Following Topics
CSC458 Lecture 6 Inter-domain Routing IP Addressing Stefan Saroiu http://www.cs.toronto.edu/syslab/courses/csc458 University of Toronto at Mississauga Homework #1 Grades Fraction of Students 100 80 60
More informationChapter 3. TCP/IP Networks. 3.1 Internet Protocol version 4 (IPv4)
Chapter 3 TCP/IP Networks 3.1 Internet Protocol version 4 (IPv4) Internet Protocol version 4 is the fourth iteration of the Internet Protocol (IP) and it is the first version of the protocol to be widely
More informationBorder Gateway Protocol (BGP-4)
Vanguard Applications Ware IP and LAN Feature Protocols Border Gateway Protocol (BGP-4) Notice 2008 Vanguard Networks 25 Forbes Blvd Foxboro, MA 02035 Phone: (508) 964 6200 Fax: (508) 543 0237 All rights
More informationIntroduction to LAN/WAN. Network Layer
Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services
More information6.263 Data Communication Networks
6.6 Data Communication Networks Lecture : Internet Routing (some slides are taken from I. Stoica and N. Mckewon & T. Griffin) Dina Katabi dk@mit.edu www.nms.csail.mit.edu/~dina Books Text Book Data Communication
More informationTransport and Network Layer
Transport and Network Layer 1 Introduction Responsible for moving messages from end-to-end in a network Closely tied together TCP/IP: most commonly used protocol o Used in Internet o Compatible with a
More informationExterior Gateway Protocols (BGP)
Exterior Gateway Protocols (BGP) Internet Structure Large ISP Large ISP Stub Dial-Up ISP Small ISP Stub Stub Stub Autonomous Systems (AS) Internet is not a single network! The Internet is a collection
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ 1 Lecture 7: Network Layer in the Internet Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall,
More informationCourse Overview: Learn the essential skills needed to set up, configure, support, and troubleshoot your TCP/IP-based network.
Course Name: TCP/IP Networking Course Overview: Learn the essential skills needed to set up, configure, support, and troubleshoot your TCP/IP-based network. TCP/IP is the globally accepted group of protocols
More informationFuture Internet Technologies
Future Internet Technologies Traditional Internet Dr. Dennis Pfisterer Institut für Telematik, Universität zu Lübeck http://www.itm.uni-luebeck.de/people/pfisterer Internet Protocol v4 (IPv4) IPv4 Model
More informationITRI CCL. IP Routing Primer. Paul C. Huang, Ph.D. ITRI / CCL / N300. CCL/N300; Paul Huang 1999/6/2 1
IP Routing Primer Paul C. Huang, Ph.D. ITRI / / N300 /N300; Paul Huang 1999/6/2 1 Basic Addressing / Subnetting Class A 0 Network Host Host Host 127 networks / 16,777,216 hosts Class A natural mask 255.0.0.0
More informationCSE331: Introduction to Networks and Security. Lecture 8 Fall 2006
CSE331: Introduction to Networks and Security Lecture 8 Fall 2006 Announcements Reminders: Project I is due on Monday, Sept. 25th. Homework 1 is due on Friday, Sept. 29th. CSE331 Fall 2004 2 Internet Protocol
More informationGregSowell.com. Mikrotik Routing
Mikrotik Routing Static Dynamic Routing To Be Discussed RIP Quick Discussion OSPF BGP What is Routing Wikipedia has a very lengthy explanation http://en.wikipedia.org/wiki/routing In the context of this
More informationHow To Understand Bg
Table of Contents BGP Case Studies...1 BGP4 Case Studies Section 1...3 Contents...3 Introduction...3 How Does BGP Work?...3 ebgp and ibgp...3 Enabling BGP Routing...4 Forming BGP Neighbors...4 BGP and
More informationThe Internet. Internet Technologies and Applications
The Internet Internet Technologies and Applications Aim and Contents Aim: Review the main concepts and technologies used in the Internet Describe the real structure of the Internet today Contents: Internetworking
More informationRouting in Small Networks. Internet Routing Overview. Agenda. Routing in Large Networks
Routing in Small Networks Internet Routing Overview AS, IGP,, BGP in small networks distance vector or link state protocols like RIP or OSPF can be used for dynamic routing it is possible that every router
More informationCollege 5, Routing, Internet. Host A. Host B. The Network Layer: functions
CSN-s 5/1 College 5, Routing, Internet College stof 1 Inleiding: geschiedenis, OSI model, standaarden, ISOC/IETF/IRTF structuur Secties: 1.2, 1.3, 1.4, 1.5 2 Fysieke laag: Bandbreedte/bitrate Secties:
More informationBGP overview BGP operations BGP messages BGP decision algorithm BGP states
BGP overview BGP operations BGP messages BGP decision algorithm BGP states 1 BGP overview Currently in version 4. InterAS (or Interdomain) routing protocol for exchanging network reachability information
More informationData Center Networks and Basic Switching Technologies
Data Center Networks and Basic Switching Technologies Hakim Weatherspoon Assistant Professor, Dept of Computer Science CS 5413: High Performance Systems and Networking September 15, 2014 Slides used and
More informationFaculty of Engineering Computer Engineering Department Islamic University of Gaza 2012. Network Chapter# 19 INTERNETWORK OPERATION
Faculty of Engineering Computer Engineering Department Islamic University of Gaza 2012 Network Chapter# 19 INTERNETWORK OPERATION Review Questions ٢ Network Chapter# 19 INTERNETWORK OPERATION 19.1 List
More informationInternet Protocols. Addressing & Services. Updated: 9-29-2012
Internet Protocols Addressing & Services Updated: 9-29-2012 Virtual vs. Physical Networks MAC is the part of the underlying network MAC is used on the LAN What is the addressing mechanism in WAN? WAN is
More informationClassful IP Addressing (cont.)
Classful IP Addressing (cont.) 1 Address Prefix aka Net ID defines the network Address Suffix aka Host ID defines the node In Classful addressing, prefix is of fixed length (1, 2, or 3 bytes)! Classful
More informationOutline. EE 122: Interdomain Routing Protocol (BGP) BGP Routing. Internet is more complicated... Ion Stoica TAs: Junda Liu, DK Moon, David Zats
Outline EE 22: Interdomain Routing Protocol (BGP) Ion Stoica TAs: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee22/fa9 (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues
More informationRouter and Routing Basics
Router and Routing Basics Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Routing Protocols and Concepts CCNA2 Routing and packet forwarding Static routing Dynamic
More informationUsing the Border Gateway Protocol for Interdomain Routing
CHAPTER 12 Using the Border Gateway Protocol for Interdomain Routing The Border Gateway Protocol (BGP), defined in RFC 1771, provides loop-free interdomain routing between autonomous systems. (An autonomous
More informationCS 5480/6480: Computer Networks Spring 2012 Homework 3 Due by 1:25 PM MT, Monday March 5 th 2012
CS 5480/6480: Computer Networks Spring 2012 Homework 3 Due by 1:25 PM MT, Monday March 5 th 2012 Important: No cheating will be tolerated. No Late Submission will be allowed. Total points for 5480 = 37
More informationCS335 Sample Questions for Exam #2
CS335 Sample Questions for Exam #2.) Compare connection-oriented with connectionless protocols. What type of protocol is IP? How about TCP and UDP? Connection-oriented protocols Require a setup time to
More information10CS64: COMPUTER NETWORKS - II
QUESTION BANK 10CS64: COMPUTER NETWORKS - II Part A Unit 1 & 2: Packet-Switching Networks 1 and Packet-Switching Networks 2 1. Mention different types of network services? Explain the same. 2. Difference
More informationTCP/IP Fundamentals. OSI Seven Layer Model & Seminar Outline
OSI Seven Layer Model & Seminar Outline TCP/IP Fundamentals This seminar will present TCP/IP communications starting from Layer 2 up to Layer 4 (TCP/IP applications cover Layers 5-7) IP Addresses Data
More informationModule 2 Overview of Computer Networks
Module 2 Overview of Computer Networks Networks and Communication Give me names of all employees Who earn more than $100,000 % ISP intranet % % % backbone satellite link desktop computer: server: network
More informationIP address format: Dotted decimal notation: 10000000 00001011 00000011 00011111 128.11.3.31
IP address format: 7 24 Class A 0 Network ID Host ID 14 16 Class B 1 0 Network ID Host ID 21 8 Class C 1 1 0 Network ID Host ID 28 Class D 1 1 1 0 Multicast Address Dotted decimal notation: 10000000 00001011
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationOSPF Routing Protocol
OSPF Routing Protocol Contents Introduction Network Architecture Campus Design Architecture Building Block Design Server Farm Design Core Block Design WAN Design Architecture Protocol Design Campus Design
More informationInternetworking and Internet-1. Global Addresses
Internetworking and Internet Global Addresses IP servcie model has two parts Datagram (connectionless) packet delivery model Global addressing scheme awaytoidentifyall H in the internetwork Properties
More informationOverview. 15-441 Computer Networking. IP Address Classes (Some are Obsolete) Outline. Lecture 9 IP Packets. CIDR IP addressing. Forwarding examples
Overview 15-441 Computer Networking Lecture 9 Packets Last lecture How does choice of address impact network architecture and scalability? What do addresses look like? This lecture Modern addresses How
More informationNETWORK LAYER/INTERNET PROTOCOLS
CHAPTER 3 NETWORK LAYER/INTERNET PROTOCOLS You will learn about the following in this chapter: IP operation, fields and functions ICMP messages and meanings Fragmentation and reassembly of datagrams IP
More informationLecture 8. IP Fundamentals
Lecture 8. Internet Network Layer: IP Fundamentals Outline Layer 3 functionalities Internet Protocol (IP) characteristics IP packet (first look) IP addresses Routing tables: how to use ARP Layer 3 functionalities
More informationNetwork Level Multihoming and BGP Challenges
Network Level Multihoming and BGP Challenges Li Jia Helsinki University of Technology jili@cc.hut.fi Abstract Multihoming has been traditionally employed by enterprises and ISPs to improve network connectivity.
More informationIP - The Internet Protocol
Orientation IP - The Internet Protocol IP (Internet Protocol) is a Network Layer Protocol. IP s current version is Version 4 (IPv4). It is specified in RFC 891. TCP UDP Transport Layer ICMP IP IGMP Network
More informationNames & Addresses. Names & Addresses. Hop-by-Hop Packet Forwarding. Longest-Prefix-Match Forwarding. Longest-Prefix-Match Forwarding
Names & Addresses EE 122: IP Forwarding and Transport Protocols Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues at UC Berkeley)
More informationAsynchronous Transfer Mode: ATM. ATM architecture. ATM: network or link layer? ATM Adaptation Layer (AAL)
Asynchrous Transfer Mode: architecture 1980s/1990 s standard for high-speed (155Mbps to 622 Mbps and higher) Broadband Integrated Service Digital Network architecture Goal: integrated, end-end transport
More informationIP Address Classes (Some are Obsolete) 15-441 Computer Networking. Important Concepts. Subnetting 15-441 15-641. Lecture 8 IP Addressing & Packets
Address Classes (Some are Obsolete) 15-441 15-441 Computer Networking 15-641 Class A 0 Network ID Network ID 8 16 Host ID Host ID 24 32 Lecture 8 Addressing & Packets Peter Steenkiste Fall 2013 www.cs.cmu.edu/~prs/15-441-f13
More informationSavera Tanwir. Internet Protocol
Savera Tanwir Internet Protocol The IP Protocol The IPv4 (Internet Protocol) header. IP Packet Details Header and payload Header itself has a fixed part and variable part Version IPv4, IPv5 or IPv6 IHL,
More informationLesson 13: MPLS Networks
Slide supporting material Lesson 13: MPLS Networks Giovanni Giambene Queuing Theor and Telecommunications: Networks and Applications 2nd edition, Springer All rights reserved IP Over ATM Once defined IP
More informationInternet Protocols Fall 2004. Outline
Internet Protocols Fall 2004 Lecture 7 Andreas Terzis 9/29/04 Outline Internet Protocol CIDR Forwarding CS 449/Fall 04 2 1 Classless Interdomain Routing (CIDR) Addressing The IP address space is broken
More informationInternet Infrastructure Measurement: Challenges and Tools
Internet Infrastructure Measurement: Challenges and Tools Internet Infrastructure Measurement: Challenges and Tools Outline Motivation Challenges Tools Conclusion Why Measure? Why Measure? Internet, with
More informationIP Routing Configuring RIP, OSPF, BGP, and PBR
13 IP Routing Configuring RIP, OSPF, BGP, and PBR Contents Overview..................................................... 13-6 Routing Protocols.......................................... 13-6 Dynamic Routing
More informationDistance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh
Distance Vector Routing Protocols Routing Protocols and Concepts Ola Lundh Objectives The characteristics of distance vector routing protocols. The network discovery process of distance vector routing
More informationTechnical Support Information Belkin internal use only
The fundamentals of TCP/IP networking TCP/IP (Transmission Control Protocol / Internet Protocols) is a set of networking protocols that is used for communication on the Internet and on many other networks.
More informationChapter 5: Sample Questions, Problems and Solutions Bölüm 5: Örnek Sorular, Problemler ve Çözümleri Örnek Sorular (Sample Questions):
Chapter 5: Sample Questions, Problems and Solutions Bölüm 5: Örnek Sorular, Problemler ve Çözümleri Örnek Sorular (Sample Questions): What is Store-and-Forward packet switching? What is a connectionless
More informationVLAN und MPLS, Firewall und NAT,
Internet-Technologien (CS262) VLAN und MPLS, Firewall und NAT, 15.4.2015 Christian Tschudin Departement Mathematik und Informatik, Universität Basel 6-1 Wiederholung Unterschied CSMA/CD und CSMA/CA? Was
More informationRARP: Reverse Address Resolution Protocol
SFWR 4C03: Computer Networks and Computer Security January 19-22 2004 Lecturer: Kartik Krishnan Lectures 7-9 RARP: Reverse Address Resolution Protocol When a system with a local disk is bootstrapped it
More informationPRASAD ATHUKURI Sreekavitha engineering info technology,kammam
Multiprotocol Label Switching Layer 3 Virtual Private Networks with Open ShortestPath First protocol PRASAD ATHUKURI Sreekavitha engineering info technology,kammam Abstract This paper aims at implementing
More informationSubnetting,Supernetting, VLSM & CIDR
Subnetting,Supernetting, VLSM & CIDR WHAT - IP Address Unique 32 or 128 bit Binary, used to identify a system on a Network or Internet. Network Portion Host Portion CLASSFULL ADDRESSING IP address space
More informationInternet Packets. Forwarding Datagrams
Internet Packets Packets at the network layer level are called datagrams They are encapsulated in frames for delivery across physical networks Frames are packets at the data link layer Datagrams are formed
More informationRouting Protocols (RIP, OSPF, BGP)
Chapter 13 Routing Protocols (RIP, OSPF, BGP) INTERIOR AND EXTERIOR ROUTING RIP OSPF BGP 1 The McGraw-Hill Companies, Inc., 2000 1 Introduction Packets may pass through several networks on their way to
More informationGuide to TCP/IP, Third Edition. Chapter 3: Data Link and Network Layer TCP/IP Protocols
Guide to TCP/IP, Third Edition Chapter 3: Data Link and Network Layer TCP/IP Protocols Objectives Understand the role that data link protocols, such as SLIP and PPP, play for TCP/IP Distinguish among various
More informationInternet and IP addressing
Internet and IP addressing Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Communication Network Taxonomy Telephony Network parses number dialed
More informationRouting with OSPF. Introduction
Routing with OSPF Introduction The capabilities of an internet are largely determined by its routing protocol. An internet's scalability, its ability to quickly route around failures, and the consumption
More informationAusgewählte Kapitel der Rechnernetze
Ausgewählte Kapitel der Rechnernetze Komplexe, große Internetze bauen Routing Routing-Protokolle Distance-Vector Link-State Goal: Build Large Networks How to implement a Very Large Network? Flooding clearly
More information