Routing and Forwarding Simulation on Paper

5/8/02


Click here to start


Table of Contents

Routing and Forwarding Simulation on Paper

We will simulate:

Topology

Hop by hop forwarding

Distance Vector (RIP) Simulation

DV Simulation - Create a routing table

DV Simulation - Your routing table

DV Simulation - Send copies to neighbours

DV Simulation - What you send to your neighbours

DV Simulation - What your neighbour (W) sends to you

DV Simulation - What your neighbour (X) sends to you

DV Simulation - Update table

DV Simulation - What you learn from what your neighbour (W) sent

DV Simulation - Your new routing table after update from W

DV Simulation - What you learn from what your neighbour (X) sent

DV Simulation - Your new routing table after update from X

DV Simulation - Repeat

Link State Simulation

LS Simulation - Create a link state table

LS Simulation - Your link state table

LS Simulation - Your shortest-path table

LS Simulation - Send copies to neighbours

LS Simulation - What you send to your neighbours

LS Simulation - What your neighbour sends to you

LS Simulation - Update link-state table

LS Simulation - Your new link-state table after update

LS Simulation - Use link-state table to make shortest-path table

LS Simulation - Your new shortest-path table after update

LS Simulation - Repeat

LS Simulation - What you send to your neighbours (update)

NOTE TO INSTRUCTORS

Message From ______ to ______ Type: DV routing update

Message From ______ to ______ Type: LS routing update

Message From ______ to ______ Type: Echo Request

Message From ______ to ______ Type: Echo Reply

Message From ______ to ______ Type: Unreachable

Message From ______ to ______ Type: _____________

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

Author: Afnog 2002 T2

Home Page: http://www.ws.afnog.org

Download presentation source