20-3 UNICAST ROUTING PROTOCOLS

20-3 UNICAST ROUTING PROTOCOLS. Major Functions: Define the domain of operation (Internal/External to the ISPs), and interaction with other protocols if needed (e.g., External protocols EGP). Specify how routers exchange messages to share information & report changes.

Share Presentation

Embed Code

Link

• part
• routing protocol
• forwarding tables
• rip part
• intradomain routing protocol
• 2 routing information protocol

jacob + Follow

20-3 UNICAST ROUTING PROTOCOLS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

Presentation Transcript

1. 20-3 UNICAST ROUTING PROTOCOLS • Major Functions: • Define the domain of operation (Internal/External to the ISPs), and interaction with other protocols if needed (e.g., External protocols EGP). • Specify how routers exchange messages to share information & report changes. • Enables a network to make dynamic adjustments to its conditions. • Unicast routing in the Internet, challenge? Yes! • Large number of routers and a huge number of hosts; hence immense number of alternative routes for each packet, one is only the optimal (search routing tables for Which one?)! • Huge routing tables space longer search time. • HierarchicalRouting (HR) is the solution! • In addition, each ISP administrator can have own control running different suiting routing algorithm for their optimal choice of domain equipment.
2. 20.3.1 Internet Structure • Before discussing unicastrouting protocols, we need to understand the structure of today’s Internet. • The Internet has changed from a tree-like structure, with a single backbone, to a multi-backbone structure run by different private corporations today.
3. Figure 20.14: Internet structure Except for the Peering points, every component is considered an ISP Autonomous System AS.
4. 20.3.1 Internet Structure • Hierarchical Routing (HR) is when we consider each component in Fig 20.14 (Internet Structure), except peering points, as an ISP Autonomous System (AS). • Each AS runs its own routing protocol, that fits its need based on its optimal architectural design, called Interior Gateway Protocol(IGP)– Intra-domain(AS) Routing Protocol. • Two major IGProuting protocols: • Routing Information Protocol (RIP)– • Most widely used based on DV routing algorithm. • Open Shortest Path First Protocol (OSPF)– • Based on LS routing algorithm. • In order to glue the Ass together, an Exterior Gateway Protocol(EGP)– • also called Interdomain Routing Protocol. • One major EGProuting protocol: • Border Gateway Protocol V4 (BGP4) – • Complex, based on PV(Path Vector) routing algorithm, with reachability information of networks in the Internet.
5. 20.3.2 Routing Information Protocol The Routing Information Protocol (RIP) is one of the most widely used intradomain routing protocols based on the distance-vector routing algorithm we described earlier. RIP was started as part of the Xerox Network System (XNS), but it was the Berkeley Software Distribution (BSD) version of UNIX that helped make the use of RIP widespread.
6. Figure 20.15: Hop counts in RIP
7. Figure 20.16: Forwarding tables
8. Figure 20.17: RIP message format
9. Example 20.1 Figure 20.18 shows a more realistic example of the operation of RIP in an autonomous system. First, the figure shows all forwarding tables after all routers have been booted. Then we show changes in some tables when some update messages have been exchanged. Finally, we show the stabilized forwarding tables when there is no more change. 20.9
10. Figure 20.18: Example of an autonomous system using RIP (Part I)
11. Figure 20.18: Example of an autonomous system using RIP (Part II)
12. 20.3.3 Open Shortest Path First Open Shortest Path First (OSPF) is also an intradomain routing protocol like RIP, but it is based on the link-state routing protocol we described earlier in the chapter. OSPF is an open protocol, which means that the specification is a public document.
13. Figure 4.73: Example of an autonomous system using RIP (Part III)
14. Figure 20.19: Metric in OSPF
15. Figure 20.20: Forwarding tables in OSPF
16. Figure 20.21: Areas in an autonomous system
17. Figure 20.22: Five different LSPs (Part I)
18. Figure 20.22: Five different LSPs (Part II)
19. Figure 20.23: OSPF message formats (Part I) Attention
20. Figure 20.23: OSPF message formats (Part II) Attention
21. 20.3.4 Border Gateway Protocol The Border Gateway Protocol version 4 (BGP4) is the only interdomain routing protocol used in the Internet today. BGP4 is based on the path-vector algorithm we described before, but it is tailored to provide information about the reachability of networks in the Internet.
22. Figure 20.24: A sample internet with four ASs
23. Figure20.25: eBGP operation
24. Figure 20.26: Combination of eBGP and iBGP sessions in our internet
25. Figure 20.27: Finalized BGP path tables (Part I)
26. Figure 20.27: Finalized BGP path tables (Part II)
27. Figure 20.27: Finalized BGP path tables (Part III)
28. Figure 20.28: Forwarding tables after injection from BGP (Part I)
29. Figure 20.28: Forwarding tables after injection from BGP (Part II)
30. Figure 20.29: Format of path attribute
31. Figure 20.30: Flow diagram for route selection
32. Figure 20.30: BGP messages

• Related
• More by User

Routing Protocols

Routing Protocols. Chapter 25. Static Routing. Typically used in hosts Enter subnet mask, router (gateway), IP address Perfect for cases with few connections, doesn’t change much E.g. host with a single router connecting to the rest of the Internet. Internet. R1. IP: 128.1.1.100. H1. H2.

758 views • 41 slides

Chapter 3 Dynamic Routing Protocols

Chapter 3 Dynamic Routing Protocols. CIS 82 Routing Protocols and Concepts Rick Graziani Cabrillo College graziani@cabrillo.edu Last Updated: 3/3/2009. Note. This presentation will be updated prior to March. 25, 2008

960 views • 52 slides

Unicast Routing Protocols for Ad Hoc Networks

Unicast Routing Protocols for Ad Hoc Networks. Kumar Viswanath CMPE 293. Introduction. Characteristics No fixed infrastructure ( a set of nodes ) Multiple Hops to reach destinations Route changes because of node movements Radio used for communication Variable transmission range

817 views • 57 slides

Routing Protocols

11/5/2012. 2. Network Layer Basics . Routers can be used to connect two or more networks.Routers examine incoming data packets and make path selections based on information stored in their routing tables.Routers can have more than one internet protocol (IP) address because it is attached to more t

547 views • 42 slides

Unicast Routing Protocols

Unicast Routing Protocols. Outline. Routing basic RIP OSPF BGP. Routing Basic. IP Routing Autonomous System (AS) IGP/EGP Distance-vector(DV)/Link-state(LS) How routing protocol works?. IP Routing. Route entry Destination/netmask Nexthop Longest-match Default-route

1.03k views • 58 slides

Routing Protocols

Routing Protocols. Heng Sovannarith heng_sovannarith@yahoo.com. Introduction. Routing protocols were created for routers. These protocols have been designed to allow the exchange of routing tables, or known networks, between routers.

318 views • 7 slides

Routing Protocols

Routing Protocols. Distributed Routing Protocols. Rtrs exchange control info Use it to calculate forwarding table Two basic types distance vector ( DECnet, “ old ” ARPANET, RIP ) link state (“ n ew ” ARPANET 1980, DECnet Phase V 1985 , IS-IS 1988 , OSPF version 2 1998 ). cost 2. j. m.

408 views • 26 slides

Routing Protocols

Routing Protocols. There are 2 classes of routing protocols:. . Finds the best path to a remote network by judging distance. The route with the least number of hops to the network is determined to be the best route. .

472 views • 27 slides

Routing Protocols

Routing Protocols. RIP and OSPF. Introduction - IP Protocol. Classful IP Addresses. IP address IPv4: 32-bit address dotted-quad or dotted decimal ex. 130.221.203.154 decimal = 82.DD.CB.9A hex = 1000 0010 . 1101 1101 . 1100 1011 . 1001 1010 binary

510 views • 26 slides

Routing Protocols

Routing Protocols. A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols share this information among immediate neighbors first, and then throughout the network

889 views • 36 slides

CS551: Unicast Routing

CS551: Unicast Routing. Christos Papadopoulos ( http://netweb.usc.edu/cs551/). Forwarding V.S. Routing. Forwarding : the process of moving packets from input to output based on: the forwarding table information in the packet

771 views • 55 slides

Routing Protocols

Routing Protocols. RIP, OSPF, BGP. A Routing Protocol’s Job Is to Find a “Best” Path between Any Pair of Nodes. Routers in a network exchange their routing information using a routing protocol. A routing table is set up in every router.

582 views • 33 slides

ROUTING PROTOCOLS

ROUTING PROTOCOLS. Rizwan Rehman. Static routing. each router manually configured with a list of destinations and the next hop to reach those destinations ideal for small number of destinations or “stub” networks stub network - network with only one or two paths to the rest of the network.

231 views • 11 slides

Chapter 21 . Unicast and Multicast Routing: Routing Protocols

Chapter 21 . Unicast and Multicast Routing: Routing Protocols. 21.1 Unicast Routing 21.2 Unicast Routing Protocols 21.3 Multicast Routing 21.4 Multicast Routing Protocols. Routing Protocols. A router consults a routing table when a packet is ready to be forwarded

2.47k views • 49 slides

Overview of Unicast Routing Protocols for Multihop Wireless Networks

Overview of Unicast Routing Protocols for Multihop Wireless Networks. Prof. Alhussein Abouzeid Rensselaer Polytechnic Institute Acknowledgment: Slides are based in part on Nitin Vaidya’s tutorial in MobiCom’99. Controlling Flooding Using Location Information. 2. Flooding of Control Packets.

375 views • 21 slides

Routing Protocols

Routing Protocols. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. Introduction. Mobile Wireless Networks Infrastructured Fixed and Wired Gateways Connecting to the nearest Base Station Ad hoc No Fixed Routers Moving Nodes Dynamic Connections Routing Protocols

1.06k views • 84 slides

Routing Protocols

Chapter 14. Routing Protocols. RIP, OSPF, BGP. Figure 14-1. Autonomous systems. Figure 14-2. Popular routing protocols. Link State. Distance Vector. Path Vector. Distance Vector Routing. Forouzan + CCNA: Slow convergence. Routing loops. Counting to infinity. Split horizon

1.32k views • 82 slides

Routing protocols

Routing protocols. 1. Introduction. A routing protocol is the communication used between routers. A routing protocol allows routers to share information about networks and their proximity to each other. R outing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP)

303 views • 11 slides

Unicast Routing in IPv6

Unicast Routing in IPv6. Babu Ram Dawadi. Unicast Routing Protocol. Unicast routing is a process that enable sender to send an unicast IP packets to the destination node. 1 router or more intermediate routers may be used, depending to the destination of the node. (Figure 1)

583 views • 56 slides