Scribd
Upload
57 views22 pages

Internet Protocols: Technical University of Cluj-Napoca, Romania Virgil - Dobrota@com - Utcluj

Uploaded by

Momita Chowdhury

This tutorial for understanding basic Internet Protocol .

Copyright:

Attribution Non-Commercial (BY-NC)
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

Internet Protocols: Technical University of Cluj-Napoca, Romania Virgil - Dobrota@com - Utcluj

Uploaded by

Momita Chowdhury
57 views22 pages
This tutorial for understanding basic Internet Protocol .

Original Title

Internet Protocol

Copyright

© Attribution Non-Commercial (BY-NC)

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This tutorial for understanding basic Internet Protocol .

Copyright:

Attribution Non-Commercial (BY-NC)
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
57 views22 pages

Internet Protocols: Technical University of Cluj-Napoca, Romania Virgil - Dobrota@com - Utcluj

Uploaded by

Momita Chowdhury
This tutorial for understanding basic Internet Protocol .

Copyright:

Attribution Non-Commercial (BY-NC)
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 22

Internet Protocols

Virgil Dobrota

Technical University of Cluj-Napoca, Romania [email protected]

Copyright Virgil Dobrota 2009, All rights reserved

Course 10 - Outline
21. Routing Loops Prevention 22. Link State Based Routing Protocols: OSPFv2, OSPFv3

Copyright Virgil Dobrota 2009, All rights reserved

21. Routing Loops Prevention

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (I)

Source: Cisco Systems

Routing Loops Prevention (II)


Routing Loops Prevention Mechanisms:

Maximum number of hops = 15 Split horizon Route Poisoning Triggered updates Holddown Timer

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (III) Maximum number of hops = 15


When the packet is forwarded through a router, the number of hops counter is increased (usually by 1). If routing loops exist -> count-to-infinity problem Limit the maximum number of hops to 15 -> 16 is infinite, i.e. the packet is discarded and an ICMP packet is sent to the source (Destination unreachable)

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (IV) Split Horizon

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (V) Route Poisoning


Poison Reverse update is sent explicitly advertising that the (sub-)network is not reachable (distance = 16) Together with Triggered Updates will reduce the convergence time

Triggered Updates
updates are sent immediately to the neighbouring routers (at RIP does not have to wait 30 seconds)

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (VI) Holddown Timer -> whenever a router advertises an unreachable route a holddown timer is started (timeout 180 seconds by default at RIP)

Copyright Virgil Dobrota 2009, All rights reserved

Routing Loops Prevention (VII) Algorithm

Copyright Virgil Dobrota 2009, All rights reserved

10

Routing Loops Prevention (VIII) Timers for RIP


Updates Timer: every 30 seconds (by default)

broadcast updates (RIPv1) multicast updates (RIPv2) the route is not usable but is still stored in the memory directly connected neighbors are notified that the route has infinite metric (16) and a garbage-collection timer is started.

Invalid Route Timer: after 180 seconds of no updates


GarbageCollection (Flush) Timer: 240 seconds (by default)

If no updates are received, the routes advertised by the invalid router are finally erased from the routing table If new updates are received, the routes become valid.
Copyright Virgil Dobrota 2009, All rights reserved

11

22. Link State Based Routing Protocols: OSPFv2, OSPFv3

Copyright Virgil Dobrota 2009, All rights reserved

12

OSPF (I) OSPF (Open Shortest Path First) RFC 1247


Link-state Classless routing Hierarchical routing SPF algorithm, open -> not proprietary explicit support for CIDR (Classless InterDomain Routing)

Copyright Virgil Dobrota 2009, All rights reserved

13

OSPF (II) OSPFv2 (Open Shortest Path First) RFC 2328


Point-to-point links between 2 routers BMA (Broadcast Multi-Access) networks
examples: LANs

NBMA (Non-Broadcast Multi-Access)


examples: majority of packet-switched WANs

Copyright Virgil Dobrota 2009, All rights reserved

14

OSPF (III) OSPFv2 Packet Format

Version Type

=2 =1 Hello =2 Database description =3 Link State Request =4 Link State Update =5 Link State Acknowledgment
Copyright Virgil Dobrota 2009, All rights reserved

15

OSPF (IV)

Copyright Virgil Dobrota 2009, All rights reserved

16

OSPF (V) Layer 3 Multicast Addresses


224.0.0.1: all multicast-capable hosts on the segment 224.0.0.2: all multicast-capable routers on the segment 224.0.0.4: all DVMRP routers on the segment 224.0.0.5: all OSPF routers 224.0.0.6: all OSPF DR (Designated Routers) 224.0.0.9: all RIP-2 routers

Copyright Virgil Dobrota 2009, All rights reserved

17

OSPF (VI) Multicast MAC Address


01-00-5E + 0 + LS 23 bits of IP address <- OUI ->
Example:

IP = 224.1.10.10 MAC = 01-00-5E-01-0A-0A

Copyright Virgil Dobrota 2009, All rights reserved

18

OSPF (VII) Zebra/Quagga


Daemon (server) ripd ripngd ospfd ospf6d TCP Port 2602 2603 2604 2606 Routing Protocol RIPv1, RIPv2 RIPng OSPFv2 OSPFv3

Copyright Virgil Dobrota 2009, All rights reserved

19

OSPF (VIII) Experiments

Copyright Virgil Dobrota 2009, All rights reserved

20

OSPF (IX)

Zebra/Quagga config file for router R1:

Copyright Virgil Dobrota 2009, All rights reserved

21

OSPF (X)

ripngd (a), ospf6d (b) config files:

Copyright Virgil Dobrota 2009, All rights reserved

22

You might also like