Computer Networks-II

Assignment

Problem Statement:
A discussion on Path Vector Routing Protocol (PVRP) and
Border Gateway Protocol (BGP) as a PVRP.

Submitted By:

Name: Sashank Sharma

Reg no: 201800021

Roll no: 05

Sec: A
Solution:
1.Path Vector Routing Protocol (PVRP):

A path-vector routing
protocol is a network routing protocol which maintains the path information that
gets updated dynamically. Updates that have looped through the network and
returned to the same node are easily detected and discarded. This algorithm is
sometimes used in Bellman–Ford routing algorithms to avoid "Count to
Infinity" problems.

It is different from the distance vector routing and link state routing. Each
entry in the routing table contains the destination network, the next router and
the path to reach the destination.

Distance vector routing protocols (e.g., RIP) have been widely used on
the Internet, and are being adapted to emerging wireless ad hoc networks.
However, it is well-known that existing distance vector routing protocols are in-
secure due to: 1) the lack of strong authentication and authorization
mechanisms;2) the difficulty, if not impossibility, of validating routing updates
which are aggregated results of other routers.

It is ordinarily conveyed in conditions where it is hard to ensure a steady

measurement (distance) across the steering area. The way is aggregated at every
switch, and conveyed in every commercial, with the goal that any switch
accepting it can approve the loop-free way prior to proliferating the data. BGP4
is the best illustration of a RP utilizing this innovation. The fundamental
disadvantage is the size of the ads, which develop with the number of bounces.
Taking everything into account, BGP4, upgraded with multiprotocol
expansions, stays the way vector RP of decision for trading IPv6 courses
between self-governing frameworks.
 Distance vector routing protocols (e.g., RIP) have been widely usedon the
Internet, and are being adapted to emerging wireless ad hoc networks.However,
it is well-known that existing distance vector routing protocols are in-secure
dueto: 1) the lack of strong authentication and authorization mechanisms;2) the
difficulty, if not impossibility, of validating routing updates which are ag-
gregated results of other routers.
2.Border Gateway Protocol (BGP):

Border Gateway Protocol (BGP) is a

standardized exterior gateway protocol designed to exchange routing and
reachability information between autonomous systems (AS) on the Internet. The
protocol is often classified as a path vector protocol but is sometimes also
classed as a distance-vector routing protocol. The BGP basic unit of routing
information is the BGP path, a route to a certain set of CIDR prefixes. Paths are
tagged with various path attributes, of which the most important are AS_PATH
and NEXT_HOP.

The AS_PATH attribute contains a list of autonomous systems a route

goes through to get to the destination. Loops are detected and avoided by
checking that the router's own ASN is not in the AS_PATHs received from
neighbouring autonomous systems.

BGP (a.k.a. Border Gateway Protocol) is the routing method that enables
the Internet to function. Without it, we would not be able to do a Google search
or send an email. That is why we thought it is high time to explain BGP in a
way that ordinary folks can understand.

The NEXT_HOP attribute is another important piece of the BGP route

advertisement. When the BGP update crosses autonomous system boundaries
(see the eBGP discussion below), the NEXT_HOP attribute is changed to be the
IP address of the boundary router, while, as long as updates remain within an
autonomous system, the next hop is left unchanged (see the iBGP discussion
below). That ensures that within the autonomous system, the next hop is always
the IP address of the external peer that announced the destination prefix, and
that internal BGP peers do not have to be on the path to the advertised
destination.

BGP can be deployed in two forms: exterior BGP (eBGP) and interior
BGP (iBGP). eBGP is used for inter-autonomous system peering, whereas iBGP
carries BGP path information inside the same autonomous system. Although
some of the information (route, metric) carried by iBGP might be redundant
with that advertised by IGPs, such as IS-IS, OSPF, and so on, no IGP is capable
of transporting BGP-specific path attributes such as the AS_PATH. Hence,
iBGP is necessary to ensure that BGP path attributes received on one edge of
the autonomous system, over the eBGP connection, are available on the other
edge of the same autonomous system

3.BGP as a Path Vector Routing Protocol:

Border Gateway Protocol (BGP) is

a standardized exterior gateway protocol designed to exchange routing and
reachability information between autonomous systems (AS) on the Internet. The
protocol is often classified as a path vector protocol but is sometimes also
classed as a distance-vector routing protocol.

One of the problems with EGP was that the metrics looked very much
like RIP hop counts. Simple distance vectors were not helpful at the AS level,
because hop counts did not distinguish the fast links that began appearing in
major ISP network backbones. Destinations that were “close” over two or three
56- or 64-kbps links actually took much longer to reach than through four or
five hops over 45-Mbps links, and distance vectors had no protection against
routing loops.

Link-state protocols could have dealt with the problem by implementing

some of the alternate TOS metrics described for OPSF and IS-IS. However,
these would rely not only on consistent implementation among all ISPs but the
proper setting of bits in IP packets. In the world of independent highly
competitive ISPs, this consistency was next to impossible. So, BGP was
developed as a path-vector protocol. This means that one of the most important
attributes BGP uses to choose the active route is the length of the AS path
reported in the NLRI.
To create this AS list, BGP routing updates carry a complete list of transit
networks (ASs) that must be traversed between the AS receiving the update and
the AS that can deliver the packet using its IGP. A loop occurs when an AS path
list contains the same AS that is receiving the update, so this update is rejected,
and loops are prevented. If the update is accepted, that AS will add its own AS
to the list when advertising the routing update to another ASs. This lets an AS
apply routing policies to the updates and avoid using routes that lead through an
AS that is not the preferred way to reach a destination.
 Path vectors do not mean that all ASs is created equal. Numerous small
ASs might get traffic through faster than one huge AS. But more aspects of a
route are described in BGP than just the length of the AS path to the destination.
The system allows each AS to represent the route with a different metric that
means something to the AS originating the route.
But more ASs generates more and longer path information. RFC 1774 in 1995
estimated that 100,000 routes generated by 3000 ASs would have paths about
20 ASs long. There was a concern about router memory and processor
requirements to store and maintain all of this information, especially in smaller
routers.
Several mechanisms are built into BGP to address this. ISPs would not
usually accept a BGP route advertisement with a mask more than 19 bits long
(/19). This was called the universally reachable address level. The price for
compact routing tables and maintenance was a loss of routing accuracy, and
many ISPs relaxed this policy. Most today accept /24 prefixes (although they
can accept more specific addresses from their own customers, of course). The
other BGP mechanisms to cut down on routing table size and maintenance
complexity are route reflectors, confederations (also called sub-confederations),
and route damping.