DOC PREVIEW
UT Dallas CS 6390 - 5. AddressingForwarding

This preview shows page 1-2-17-18-19-35-36 out of 36 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CS 6390 Advanced Computer NetworksInternet structure: network of networksInternet Protocol (IP)OutlineForwarding Alternatives for IPForwarding based on Global IP AddressesGranularity of forwarding table infoSlide 8Source routingVirtual Circuit/Tag switchingSlide 11IP AddressesIP AddressingSubnettingIP Address Assignment ProblemSolution 1 - CIDRHierarchical addressingHierarchical addressing: route aggregationHierarchical addressing: more specific routesSolution 2 - NAT (Network Address Translation)NATSlide 22Slide 23Slide 24IPv6IP Fragmentation & ReassemblyIP Fragmentation and ReassemblyICMP: Internet Control Message ProtocolEfficient use of available IP addresses DHCP: Dynamic Host Configuration ProtocolDHCP client-server scenarioSlide 35Slide 36Address prefix matchingPowerPoint PresentationLongest prefix match with TrieSlide 40CS 6390Advanced Computer NetworksAddressing & ForwardingInternet structure: network of networksTier 1 ISPTier 1 ISPTier 1 ISPNAPTier-2 ISPTier-2 ISPTier-2 ISPTier-2 ISPTier-2 ISPlocalISPlocalISPlocalISPlocalISPlocalISPTier 3ISPlocalISPlocalISPlocalISPLocal and tier- 3 ISPs are customers ofhigher tier ISPsconnecting them to rest of InternetDomain = Autonomous system (AS): each AS has an AS number, different from its network addressInternet Protocol (IP)Implements an IP virtual network on top of different types of hardwareHW is hidden by the network layer (except for link MTU)Service Model – (what IP promises to provide)An addressing scheme to uniquely identify each nodeConnectionless (datagram-based) serviceBest-effort delivery No reliability guaranteesPackets may be lost, delayed for long timePackets may be duplicated, delivered out of orderNo bandwidth or delay guaranteesOutlinePacket forwarding IP AddressingPrefix match algorithmsForwarding Alternatives for IPIP forwarding based on global IP addressesPackets carry destination IP addressRouters forward based on destination IP addressSource routingSource node includes the path into the packetVirtual circuit based IP forwarding (i.e. MPLS forwarding – this is below IP)Build virtual circuits to route packets over Can be pre-computed or in run timePackets will carry tags to be forwarded over the circuitsForwarding based on Global IP AddressesEach packet includes a full destination addressRemember that IP addresses are globally uniqueSwitches/routers include a “forwarding” table as destination -> next hopWhat is the granularity of the information in the “forwarding” tablesOne entry per host on the Internet?How many such entries are there globally?One entry per LAN?How big the resulting forwarding table would be?One entry per domain (i.e. organizational network)?How useful is this?Granularity of forwarding table info206.0.64.0/18204.188.0.0/15209.88.232.0/21Internet BackboneISP X owns:Company X : 206.0.68.0/22ISP y : 209.88.237.0/24Organization z1 : 209.88.237.192/26Organization z2 : 209.88.237.0/26Forwarding based on Global IP AddressesAdvantagesStateless Packet size efficiency – better than some others (i.e. source routing)DisadvantagesSwitches/routers need to know how to reach each destinationNeed to have a careful address assignment to avoid large tablesPackets are independently routedWhat would be the problem with that?Source routingSource host puts the entire (or partial) path in the packet headerStrict source routing: the entire path is defined and usedWhat is the main disadvantage of this?Loose source routing: include landmark routers to visit on the pathWhat would be the utility of this?Router processing (in strict source routing)No need for address lookup – why?The first entry in the address list is the next hop routerTake it off from the list and forward the packet to that routerAdvantagesForwarding is fast – no need for address lookupDisadvantagesVariable and long header sizeSource need to keep track of an accurate picture of the topologyVirtual Circuit/Tag switchingConnection setup/teardown for each call before/after data flowEach packet carries VC identifier (not destination host ID)Every router on source-dest path Maintains “state” for each passing connectionRouter processingLookup flow ID – simple table lookupFaster than IP lookup – why?Replace flow ID with outgoing flow IDForward to output portAdvantagesMore efficient lookupMore flexible – can have different paths for each flowCan do resource reservationEasier to implement in hardwareDisadvantagesStill need to route connection setup requestMore complex failure recovery – need to re-establishWill see more when we discuss MPLSOutlinePacket forwarding IP AddressingPrefix match algorithmsIP Addresses0networkhost10networkhost110network host1110multicast addressABCDclass1.0.0.0 to127.255.255.255128.0.0.0 to191.255.255.255192.0.0.0 to223.255.255.255224.0.0.0 to239.255.255.25532 bitsIP addresses are structured/hierarchical: (network, (subnet,) host) parts The initial addressing scheme:  Classful addressing:IP AddressingIP addresses are hierarchical 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 router128.10.1.1128.10.1.2128.10.1.3128.10.1.4128.10.2.9128.10.2.2128.10.2.1128.10.3.22128.10.3.31128.10.3.1network consisting of 3 IP networks(For IP addresses starting with 128.10. In each, first 24 bits are network address)LAN or subnetSubnettingAdd another level to address/routing hierarchy: subnetSubnet masks define variable partition of host partSubnets visible only within the siteNetwork number Host numberClass B addressSubnet mask (255.255.255.0)Subnetted address111111111111111111111111 00000000Network number Host IDSubnet IDIP Address Assignment ProblemClassful addressing is bad!In class A & B, address blocks are not utilized wellRunning out of IP addresses (class A & B addresses)In class C, so few addresses (only 256) per networkNot enough for most organizationHaving multiple class C addresses increase the routing table sizesSolution 1 - CIDRAssign multiple class C addresses to a networkAssign them from a consecutive blocks as to enable aggregationNetwork portion of the


View Full Document

UT Dallas CS 6390 - 5. AddressingForwarding

Documents in this Course
VoIP

VoIP

44 pages

TE-MPLS

TE-MPLS

38 pages

TCP

TCP

28 pages

QoS

QoS

27 pages

P2P

P2P

50 pages

IPv6

IPv6

81 pages

IPv6

IPv6

64 pages

AODV-v2

AODV-v2

19 pages

aodv

aodv

32 pages

19. P2P

19. P2P

50 pages

18. VoIP

18. VoIP

44 pages

17. QoS

17. QoS

27 pages

13. TCP

13. TCP

28 pages

6. IPv6

6. IPv6

81 pages

19. P2P

19. P2P

50 pages

18. VoIP

18. VoIP

44 pages

17. QoS

17. QoS

27 pages

6. IPv6

6. IPv6

81 pages

6. IPv6

6. IPv6

81 pages

19. P2P

19. P2P

50 pages

18. VoIP

18. VoIP

44 pages

17. QoS

17. QoS

27 pages

13. TCP

13. TCP

28 pages

CC

CC

74 pages

19. P2P

19. P2P

50 pages

18. VoIP

18. VoIP

44 pages

17. QoS

17. QoS

27 pages

13. TCP

13. TCP

28 pages

6. IPv6

6. IPv6

81 pages

CC

CC

74 pages

Load more
Download 5. AddressingForwarding
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view 5. AddressingForwarding and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view 5. AddressingForwarding 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?