Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat no true in practice. administrative autonomy

Transcription

1 Hierarchical Routing Our routing study thus far - idealization all routers identical network flat no true in practice scale: with 50 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! administrative autonomy internet = network of networks each network admin may want to control routing in its own network Winter 2002 Suprakash Datta 1

2 IP Addressing: introduction IP address: 32-bit identifier for host, router interface interface: connection between host, router and physical link router s typically have multiple interfaces host may have multiple interfaces IP addresses associated with interface, not host, router = Winter 2002 Suprakash Datta 2

3 IP Addressing IP address: network part (high order bits) host part (low order bits) What s a network? (from IP address perspective) device interfaces with same network part of IP address can physically reach each other without intervening router LAN network consisting of 3 IP networks (for IP addresses starting with 223, first 24 bits are network address) Winter 2002 Suprakash Datta 3

4 IP Addressing How to find the networks? Detach each interface from router, host create islands of isolated networks Interconnected system consisting of six networks Winter 2002 Suprakash Datta 4

5 IP Addresses given notion of network, let s re-examine IP addresses: class-full addressing: class A 0network host to B C D 10 network host 110 network host 1110 multicast address 32 bits to to to Winter 2002 Suprakash Datta 5

6 IP addressing: CIDR classful addressing: inefficient use of address space, address space exhaustion e.g., class B net allocated enough addresses for 65K hosts, even if only 2K hosts in that network CIDR: Classless InterDomain Routing network portion of address of arbitrary length address format: a.b.c.d/x, where x is # bits in network portion of address network part host part /23 Winter 2002 Suprakash Datta 6

7 IP addresses: how to get one? Hosts (host portion): hard-coded by system admin in a file DHCP: Dynamic Host Configuration Protocol: dynamically get address: plug-and-play 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 Winter 2002 Suprakash Datta 7

8 IP addresses: how to get one? Network (network portion): get allocated portion of ISP s address space: ISP's block /20 Organization /23 Organization /23 Organization / Organization /23 Winter 2002 Suprakash Datta 8

9 Hierarchical addressing: route aggregation Hierarchical addressing allows efficient advertisement of routing information: Organization /23 Organization /23 Organization /23 Organization Fly-By-Night-ISP Send me anything with addresses beginning /20 Internet /23 ISPs-R-Us Send me anything with addresses beginning /16 Winter 2002 Suprakash Datta 9

10 Hierarchical addressing: more specific routes ISPs-R-Us has a more specific route to Organization 1 Organization /23 Organization /23 Organization /23 Organization /23 Fly-By-Night-ISP ISPs-R-Us Send me anything with addresses beginning /20 Send me anything with addresses beginning /16 or /23 Internet Winter 2002 Suprakash Datta 10

11 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 Winter 2002 Suprakash Datta 11

12 Getting a datagram from source to dest. IP datagram: misc fields source IP addr dest IP addr data datagram remains unchanged, as it travels source to destination address fields of interest here routing table in A A B Dest. Net. next router Nhops E Winter 2002 Suprakash Datta 12

13 Getting a datagram from source to dest. misc fields data Starting at A, given IP datagram addressed to B: look up net. address of B find B is on same net. as A link layer will send datagram directly to B inside link-layer frame B and A are directly connected A B Dest. Net. next router Nhops E Winter 2002 Suprakash Datta 13

14 Getting a datagram from source to dest. misc fields data Starting at A, dest. E: look up network address of E E on different network A, E not directly attached routing table: next hop router to E is link layer sends datagram to router inside linklayer frame datagram arrives at continued.. A B Dest. Net. next router Nhops E Winter 2002 Suprakash Datta 14

15 Getting a datagram from source to dest. misc fields data Arriving at , destined for look up network address of E E on same network as router s interface router, E directly attached link layer sends datagram to inside link-layer frame via interface datagram arrives at !!! Dest. next network router Nhops interface A B E Winter 2002 Suprakash Datta 15

16 IP datagram format IP protocol version number header length type of data max number remaining hops (decremented at each router) upper layer protocol to deliver payload to ver head. len 16-bit identifier time to live type of service upper layer 32 bits flgs length fragment offset Internet checksum 32 bit source IP address 32 bit destination IP address Options (if any) data (variable length, typically a TCP or UDP segment) total datagram length (bytes) for fragmentation/ reassembly E.g. timestamp, record route taken, pecify list of routers to visit. Winter 2002 Suprakash Datta 16

17 IP Fragmentation & Reassembly network 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 destination IP header bits used to identify, order related fragments reassembly fragmentation: in: one large datagram out: 3 smaller datagrams Winter 2002 Suprakash Datta 17

18 IP Fragmentation and Reassembly length =4000 ID =x fragflag =0 offset =0 One large datagram becomes several smaller datagrams length =1500 ID =x fragflag =1 offset =0 length =1500 ID =x fragflag =1 offset =1480 length =1040 ID =x fragflag =0 offset =2960 Winter 2002 Suprakash Datta 18

19 IPv6 Initial motivation: 32-bit address space completely allocated by Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS new anycast address: route to best of several replicated servers IPv6 datagram format: fixed-length 40 byte header no fragmentation allowed Winter 2002 Suprakash Datta 19

20 IPv6 Header (Cont) Priority: identify priority among datagrams in flow Flow Label: identify datagrams in same flow. (concept of flow not well defined). Next header: identify upper layer protocol for data Winter 2002 Suprakash Datta 20

21 Other Changes from IPv4 Checksum: removed entirely to reduce processing time at each hop Options: allowed, but outside of header, indicated by Next Header field ICMPv6: new version of ICMP additional message types, e.g. Packet Too Big multicast group management functions Winter 2002 Suprakash Datta 21

22 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? Two proposed approaches: Dual Stack: some routers with dual stack (v6, v4) can translate between formats Tunneling: IPv6 carried as payload n IPv4 datagram among IPv4 routers Winter 2002 Suprakash Datta 22

23 Dual Stack Approach Winter 2002 Suprakash Datta 23

24 Tunneling IPv6 inside IPv4 where needed Winter 2002 Suprakash Datta 24