QUESTION 1

(1)
Distance Vector routing protocols
- All the routers periodically send their routing tables (or a portion of their
tables) to only their neighboring routers.
- Routers use the received information to determine whether any changes need to
be made to their own routing table.

In Distance Vector routing, routers update their record based on these events:

When routers are started

When routers have changes to their routing tables
On a periodic basis

ROUTING PROTOCOL USING DISTANCE VECTOR

1- Enhanced Interior Gateway Routing Protocol (EIGRP)- classless
routing protocol
- Fast convergenceEIGRP uses DUAL to achieve rapid convergence
- Multiple network layer supportEIGRP supports IP version 4 (IPv4),
IP version 6 (IPv6), AppleTalk
- Use of multicast and unicastEIGRP uses multicast and unicast for
communication between routers, rather than broadcast
- VLSM and route summarization EIGRP supports variable-length
subnet masks and route summarization.
2 - Interior Gateway Routing Protocol (IGRP) classful routing protocol
-

IGRP was created in part to overcome the limitations of RIP when used within
large networks
- Increased scalability Improved for routing in larger .IGRP has a default
maximum hop count of 100 hops, which can be configured to a maximum of
255 hops.

- Sophisticated metric IGRP uses a composite metric that provides significant

flexibility in route selection.
- Multiple path support IGRP can maintain up to six unequal-cost paths
between a network source and destination, but only the route with the lowest
metric is placed in the routing table.
3 - Routing Information Protocol (RIP)- classful routing protocol
-

RIP prevents routing loops by implementing a limit on the number of hops

allowed in a path from the source to a destination
- (RIP) is a distance-vector routing protocol, which employs the hop count as a
routing metric
- Most RIP networks are flat. There is no concept of areas or boundaries in RIP
networks.

Characteristics RIPv1
Distance
vector

RIPv2

EIGRP

IS-IS

OSPF

BGP

(2)
ADVANTAGES

Do not require a large amount of

CPU resources or memory to
store the routing data.
Simpler. Distance vectorbased
routing protocols are simple
router
advertisement processes that are
easy to understand
Easy to configure. In its simplest
incarnation, configuring a
distance vectorbased routing
protocol is as easy as enabling it
on the router interfaces.
Usually Distance vector routing
protocols dont required costly
and hardware with high
performance.

DISADVANTAGES

Large routing tables.

Multiple routes to a given
network ID can be reflected as
multiple entries in the routing
table. In a large internetwork with
multiple paths, the routing table
can have hundreds or thousands
of entries.
High network traffic overhead.
Route advertising is done
periodically even after the
internetwork has converged.
Does not scale.
Between the size of the routing
table and the high overhead,
distance vectorbased routing
protocols do not scale well to
large and very large
internetworks.
High convergence time.
Due to the unsynchronized and
unacknowledged way that
distance vector information is
exchanged, convergence of the
internetwork can take several
minutes.
Most distance vector routing
protocols take the very simple
approach of telling their
neighbors everything they know
by broadcasting their entire route
table.

QUESTION 2
Name

Cidr

Headquarters

/21
/21
/21
/21
/21
/21
/21
/21
/22
/22
/22
/22
/22
/22
/22
/22
/22
/22
/22
/22
/24

Branch A

Branch B

Branch C

Warehouse

Network
Address
10.10.0.0
10.10.1.0
10.10.2.0
10.10.3.0
10.10.4.0
10.10.5.0
10.10.6.0
10.10.7.0
10.10.8.0
10.10.9.0
10.10.10.0
10.10.11.0
10.10.12.0
10.10.13.0
10.10.14.0
10.10.15.0
10.10.16.0
10.10.17.0
10.10.18.0
10.10.19.0
10.10.20.0

Start

End

10.10.0.1
10.10.1.1
10.10.2.1
10.10.3.1
10.10.4.1
10.10.5.1
10.10.6.1
10.10.7.1
10.10.8.1
10.10.9.1
10.10.10.1
10.10.11.1
10.10.12.1
10.10.13.1
10.10.14.1
10.10.15.1
10.10.16.1
10.10.17.1
10.10.18.1
10.10.19.1
10.10.20.1

10.10.0.254
10.10.1.254
10.10.2.254
10.10.3.254
10.10.4.254
10.10.5.254
10.10.6.254
10.10.7.254
10.10.8.254
10.10.9.254
10.10.10.254
10.10.11.254
10.10.12.254
10.10.13.254
10.10.14.254
10.10.15.254
10.10.16.254
10.10.17.254
10.10.18.254
10.10.19.254
10.10.20.254

Headquarters 1000 = 1000x15/100 = 150+1000 = 1150 users

Branch A 800 = 800x15/100 = 120+800 = 920 users
Branch B 800 = 800x10/100 = 80+800 = 880 users
Branch C 600 = 600x5/100 = 630 users
Warehouse 150 = 150x5/100 = 8+150 = 158 users

Broadcast
Address
10.10.0.255
10.10.1.255
10.10.2.255
10.10.3.255
10.10.4.255
10.10.5.255
10.10.6.255
10.10.7.255
10.10.8.255
10.10.9.255
10.10.10.255
10.10.11.255
10.10.12.255
10.10.13.255
10.10.14.255
10.10.15.255
10.10.16.255
10.10.17.255
10.10.18.255
10.10.19.255
10.10.20.255