Scribd
Upload
2 views3 pages

Routing and Congestion Control Notes

The document discusses congestion control techniques, including the Leaky Bucket and Token Bucket algorithms, which manage data flow in networks. It also covers routing algorithms such as Link State and Distance Vector, highlighting their differences in complexity and efficiency. Additionally, it mentions routing protocols like RIP, OSPF, and BGP, which implement these algorithms for effective data routing.

Uploaded by

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

Routing and Congestion Control Notes

The document discusses congestion control techniques, including the Leaky Bucket and Token Bucket algorithms, which manage data flow in networks. It also covers routing algorithms such as Link State and Distance Vector, highlighting their differences in complexity and efficiency. Additionally, it mentions routing protocols like RIP, OSPF, and BGP, which implement these algorithms for effective data routing.

Uploaded by

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

Computer Networks - Routing & Congestion Control

1. Congestion Control

Congestion control refers to techniques and mechanisms to control congestion and ensure smooth data flow

in networks.

Techniques:

- Leaky Bucket Algorithm:

* A fixed-size bucket (buffer) is used.

* Packets arrive at varying rates but are transmitted at a constant rate.

* If the bucket overflows, excess packets are discarded.

* Ensures a smooth output rate but may drop packets during bursts.

- Token Bucket Algorithm:

* Tokens are added to a bucket at a fixed rate.

* To send a packet, a token must be removed from the bucket.

* Allows for bursty traffic while still controlling average rate.

* More flexible than leaky bucket.

2. Routing Algorithms

Routing algorithms determine the best path for data to travel from source to destination.

Types:

- Link State Routing:

* Every router has a complete map of the network.


Computer Networks - Routing & Congestion Control

* Routers exchange link state information.

* Uses Dijkstra's algorithm to calculate the shortest path.

* More accurate but complex and resource-intensive.

- Distance Vector Routing:

* Each router knows distance (hops) to its neighbors.

* Periodically shares its routing table with neighbors.

* Slower convergence and susceptible to routing loops.

* Uses Bellman-Ford algorithm.

Link State vs Distance Vector:

- Link State: Faster convergence, uses flooding, more resource-demanding.

- Distance Vector: Simpler, slower convergence, less overhead.

3. Flooding / Routed Path

- Flooding:

* Every incoming packet is sent out on all outgoing lines (except the one it came in on).

* High reliability but can cause congestion.

- Routed Path:

* Packets are forwarded based on a pre-determined route.

* Efficient and avoids unnecessary duplication.

4. Routing Protocols
Computer Networks - Routing & Congestion Control

These are implementations of routing algorithms.

Examples:

- RIP (Routing Information Protocol):

* Distance vector protocol.

* Uses hop count as a metric.

* Max hop count: 15 (16 = unreachable).

- OSPF (Open Shortest Path First):

* Link state protocol.

* Uses Dijkstra's algorithm.

* Supports large and complex networks with areas.

- BGP (Border Gateway Protocol):

* Path vector protocol.

* Used for routing between autonomous systems (AS) on the internet.

* Uses policies and path attributes instead of simple metrics.

You might also like