Scribd
Upload
7 views

Routing and Bandwidth Management

The document discusses routing and bandwidth management. It defines routing as sending data to a destination network using network addresses. It describes static, dynamic and default routing. It also explains different routing protocols like RIP, OSPF, EIGRP and BGP. The document then discusses bandwidth management and how techniques like traffic shaping and QoS can prioritize applications and control bandwidth usage.

Uploaded by

andreajade.cawaya10
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Routing and Bandwidth Management

The document discusses routing and bandwidth management. It defines routing as sending data to a destination network using network addresses. It describes static, dynamic and default routing. It also explains different routing protocols like RIP, OSPF, EIGRP and BGP. The document then discusses bandwidth management and how techniques like traffic shaping and QoS can prioritize applications and control bandwidth usage.

Uploaded by

andreajade.cawaya10
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

ROUTING AND BANDWIDTH MANAGEMENT Dynamic Routing Protocols

ROUTING

Routing and Its Types

• Works on Layer 3 of the OSI model


• Is performed by a router
• Is a method of sending data to a
destination
• network by using its network address Link State
• Uses routing tables to make a decision • Build an entire network map by
• Works in three different modes: collecting information from directly
o Static connected routers
o Dynamic • Uses it to select the best path to
o Default destination
• Forwards the updates on the network
Static Routing changes to the neighboring routers
• Is used in smaller networks that do not • Calculate the best path based on the
require any architectural changes least cost, speed, and link congestion
• Works best with one or two routers • Sends updates when there are triggered
• Requires routing tables to be manually updates
updated
• Can be error-prone Link-state Routing Protocol – OSPF
• Requires the use of –p parameter to • Uses the shortest-path algorithm to find
make the route persistent the shortest path to the destination
• Calculates the path based on the cost of
Dynamic Routing the route
• Uses the routing protocols that • Determines the network design by
communicate with the network devices publishing its list of neighbors
• Routers learn the routes from • Routers share a list of neighbors with
neighboring routers the other routers
• A routing table can contain multiple • This information is used to determine
routes to a single destination the shortest path
• Routes in the routing table are adjusted
automatically Distance Vector
• Requires no manual intervention in • Uses hop count for path calculation
updating the routing table • Each router on the way is a hop
• Requires the use of same routing • Router communicates only to the
protocol if two routers need to neighboring routers
• exchange the routing information • Does not require the router to know the
complete network path
Default Routing • Performs frequent updates
• Forwards all packets to all destinations • Examples:
through a single router • Enhanced Interior Gateway Routing
• Uses the single router as the default Protocol (EIGRP)
gateway • Routing Information Protocol (RIP and
• Uses the stub router, which is the single RIPv2)
router receiving packets for all
• destinations Distance Vector Protocol – RIP
• Is mainly used in smaller networks • Is a Distance-vector routing protocol
where a single router is the entry or exit • Was used for dynamic routing in smaller
point networks
• Sends the complete routing table to the
next router
• Every 30 seconds
• Has a maximum hop count of 15 • Is also known as the default gateway
• Anything beyond 15 hops is • Is used when no route to the destination
unreachable is found and the destination address is
• Has three versions: unknown
• RIP version 1: Uses broadcast • Is designated as:
• RIP version 2: Uses multicast • IPv4: 0.0.0.0/0
• RIP Next Generation: Works with IPv6 • IPv6: ::/0

Distance Vector – EIGRP Administrative Distance


• Is an advanced Distance-vector routing • Can be assigned manually or
protocol dynamically
• Performs efficient routing information • Is used to select the routing protocol if
exchange two of them
• Keeps a copy of the neighbor’s routing • are used to get to the same destination
table to find the best route • Uses a range from 0 to 255 – lower the
• Performs unequal path load-balancing number, better
• Stores the following information on each • the route is
participating router: • 0 = Best
• Neighbor table – stores the neighbor’s • 255 = Worst (discard)
information • Does not add the route that has the
• Topology table – stores the neighbor’s source with
routing information • administrative distance of 255
• Routing table – stores the best routes to
the destination networks

Hybrid
• Is a combination of distance vector and
link-state protocols
• Uses TCP for communication between
the routers on the Internet
• Provides support for Autonomous
System Numbers (ASNs)
• Uses routing table to:
• Know the list of routers and their
reachable destinations
• Their cost metrics for each path Exterior vs. Interior
• Interior Routing
Hybrid – BGP • Takes place within a single network
• Is an inter-autonomous domain known as autonomous
communication protocol • system
• Is an application-layer protocol that • Can use one or more protocols for
works on TCP port 179 routing
• Uses the following for communication: • Examples:
• Internal BGP (iBGP): Within a single • RIP
autonomous domain • OSPF
• External BGP: Between multiple • EIGRP
autonomous domains • Exterior Routing
• Can work with: • Takes place between different
o Single-homed autonomous systems
o Dual-homed sites • Can use only one routing protocol for
o Multi-homing routing
o Dual multi-homing • Examples:
• BGP
Default Route
• Is a static route that is defined in the Time to Live
routing table • Is an 8-bit fields in the IP header
• Is assigned by the source system before • Predict the use of bandwidth
sending the packet to the destination • Monitor and control the use of
• Requires a value greater than 0 to be bandwidth
sent forward to the next router • Divert the bandwidth to time and
• Has the following ranges: latency-sensitive
• 0 is restricted to the same host • applications
• 1 is restricted to the same subnet • Ensures efficient usage of the network
• 32 is restricted to the same site bandwidth
• 64 is restricted to the same region • Prioritize the applications like Voice over
• 128 is restricted to the same continent IP
• 255 is unrestricted • Assign low priority to the latency-
insensitive
• applications like File Transfer Protocol
(FTP)

BANDWIDTH MANAGEMENT

Bandwidth Management
• Is a process of controlling the use of
bandwidth
• on a network or Internet link
• Is performed to avoid bandwidth
overutilization
• by a particular application or protocol
• Is performed to avoid network
congestion
• Helps to restrict the application to use a
specific
• amount of bandwidth

Traffic Shaping
• Is applied only for the outbound traffic
• Queues up the excess traffic and
• schedules its delivery
• Queues only within the defined limit
• Buffers the excess packet that can
• cause delay
• Prioritizes the traffic for time-sensitive
• applications
• Helps to enhance traffic as it can
• categorize and queue up traffic

Quality of Service (QoS)


• Is a method of prioritizing different types
of network
• traffic
• Identify and mark the traffic
• Segregate it
• Enables the administrator to:

You might also like