Scribd
Upload
75 views13 pages

Computer Communication (ECE 4008) (SLOT L19+L20) : Module 4 - Ip Addressing & Routing Algorithm

This document summarizes a lab experiment on IP addressing and routing algorithms. The experiment aims to study multiple access techniques, routing algorithms like distance vector, and assign IP addresses to networks using class C and class B addressing schemes. It also analyzes the routing table and hop count between nodes in different networks using the Routing Information Protocol.

Uploaded by

Abhishek Dishankit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
75 views13 pages

Computer Communication (ECE 4008) (SLOT L19+L20) : Module 4 - Ip Addressing & Routing Algorithm

This document summarizes a lab experiment on IP addressing and routing algorithms. The experiment aims to study multiple access techniques, routing algorithms like distance vector, and assign IP addresses to networks using class C and class B addressing schemes. It also analyzes the routing table and hop count between nodes in different networks using the Routing Information Protocol.

Uploaded by

Abhishek Dishankit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 13

COMPUTER COMMUNICATION

( ECE 4008)
(SLOT L19+L20)

MODULE 4 – IP ADDRESSING & ROUTING


ALGORITHM
ABHISHEK DISHANKIT 16BEC0453

LAB EXPERIMENT

AIM:

To study multiple , multilevel Access Techniques , routing algorithms & IP addressing

MULTIPLE ACCESS TECHNIQUES

Early token ring


Multilevel-multi access
ROUTING ALGORITHMS –DISTANCE VECTOR
INITIAL

INTERMEDIATE

FINAL
Shortest path algorithm
LAB TASK – 4

IP ADDRESSING

AIM: To assign IP address for the given network and to find hop count
using RIP protocol.

Tools Required: NetSim

Network Diagram:
NETWORK 5

NETWORK 2

NETWORK 3
NETWORK 4
NETWORK 6

NETWORK 1
SCENARIO 1: CLASS C IP ADDRESSING IP

ADDRESS: 192.168.5.15/24

IP distribution is done in the six networks as follows:-

NETWORK ID

NETWORK 1 192.168.5.0
NETWORK 2 192.168.6.0
NETWORK 3 192.168.7.0
NETWORK 4 192.168.8.0
NETWORK 5 192.168.9.0
NETWORK 6 192.168.10.0

ROUTING TABLE
SCENARIO 2: CLASS B IP ADDRESSING IP

ADDRESS: 178.100.9.10/16

IP distribution is done in the six networks as follows:-

NETWORK ID

NETWORK 1 178.100.0.0
NETWORK 2 178.101.0.0
NETWORK 3 178.102.0.0
NETWORK 4 178.103.0.0
NETWORK 5 178.104.0.0
NETWORK 6 178.105.0.0

ROUTING TABLE
RESULT

The packet from node R to node G follows the path:

Switch F -> Router A -> Router C -> Switch D -> Switch G

with hop count as 1


INFERENCE

 Routing Information Protocol (RIP) is a dynamic routing

protocol which uses hop count as a routing metric to find the

best path between the source and the destination network.

 The path with the lowest hop count is considered as the

best route to reach a network and therefore placed in the

routing table.

 RIP prevents routing loops by limiting the number of

hopes allowed in a path from source and destination.

 The maximum hop count allowed for RIP is 15

and hop count of 16 is considered as network

unreachable.

You might also like