Scribd
Upload
60 views

Routing in Circuit Switched NT K Network

This document discusses routing in circuit switched and packet switched networks. It covers topics such as fixed and dynamic routing, flooding, random routing, and adaptive routing. It also describes the Dijkstra's and Bellman-Ford algorithms for calculating least cost paths between nodes in a network.

Uploaded by

chilledkarthik
Copyright
© Attribution Non-Commercial (BY-NC)
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
60 views

Routing in Circuit Switched NT K Network

This document discusses routing in circuit switched and packet switched networks. It covers topics such as fixed and dynamic routing, flooding, random routing, and adaptive routing. It also describes the Dijkstra's and Bellman-Ford algorithms for calculating least cost paths between nodes in a network.

Uploaded by

chilledkarthik
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 34

Routing in Circuit Switched N t Network k

Many connections will need paths through more than one switch Need to find a route
Efficiency Resilience Resilience

Public telephone switches are a tree structure


Static routing uses the same approach all the time

Dynamic routing allows for changes in routing depending on traffic


Uses a peer structure for nodes

Alt Alternate t Routing R ti


Possible routes between end offices predefined Originating switch selects appropriate route R t li Routes listed t d in i preference f order d Different sets of routes may be used at different times

Alternate Routing Diagram

Routing in Packet Switched N t Network k


Complex Complex, crucial aspect of packet switched networks Characteristics required
Correctness Simplicity Simplicit Robustness Stability St bilit Fairness Optimality O ti lit Efficiency

P f Performance C Criteria it i
Used for selection of route Minimum hop Least L t cost t
See Stallings appendix 10A for routing algorithms

Example Packet Switched N t Network k

D i i Decision Time Ti and d Pl Place


Time
Packet or virtual circuit basis

Place
Distributed
Made by each node

Centralized Source Source

Network Information Source and d Update U d t Timing Ti i


Routing g decisions usually y based on knowledge g of network (not always) Distributed routing
Nodes d use local l l knowledge k l d May collect info from adjacent nodes May collect info from all nodes on a potential route

Central routing
Collect info from all nodes

Update timing
When is network info held by nodes updated Fixed - never updated Adaptive - regular updates

R ti Routing St Strategies t i
Fixed Flooding R d Random Adaptive

Fi d Routing Fixed R ti
Single permanent route for each source to destination pair Determine routes using a least cost algorithm (appendix 10A) Route R t fi fixed, d at tl least t until til a change h in i network t k topology

Fixed Routing T bl Tables

Fl di Flooding
No network info required Packet sent by node to every neighbor Incoming packets retransmitted on every link except incoming link Eventually y a number of copies p will arrive at destination Each packet is uniquely numbered so duplicates can be discarded Nodes can remember packets already forwarded to keep network load in bounds Can include a hop count in packets

Flooding E Example l

P Properties ti of f Fl Flooding di
All possible routes are tried
Very robust

At least one packet will have taken minimum hop count route
Can Can be used sed to set up p virtual i t al circuit ci c it

All nodes are visited


Useful to distribute information (e.g. routing)

R d Random Routing R ti
Node selects one outgoing path for retransmission of incoming packet Selection can be random or round robin Can select outgoing path based on probability calculation l l ti No network info needed Route is typically not least cost nor minimum hop p

Ad ti Adaptive R Routing ti
Used by almost all packet switching networks Routing decisions change as conditions on the network change g
Failure Congestion

Requires info about network Decisions more complex Tradeoff between quality of network info and overhead Reacting too quickly can cause oscillation Too slowly to be relevant

Ad ti Adaptive R Routing ti - Advantages Ad t


Improved performance Aid congestion control (See chapter 13) Complex C l system t
May not realize theoretical benefits

Cl Classification ifi ti
Based on information sources
Local (isolated)
Route to outgoing link with shortest queue Can include bias for each destination
Rarely used - do not make use of easily available info

Adjacent nodes All nodes

I l t d Ad Isolated Adaptive ti R Routing ti

ARPANET R Routing ti St Strategies(1) t i (1)


First Generation 1969
Distributed Distributed adaptive Estimated delay as performance criterion Bellman-Ford B ll F d algorithm l ith (appendix ( di 10a) 10 ) Node exchanges delay vector with neighbors Update U d t routing ti table t bl based b d on incoming i i info i f Doesn't consider line speed, just queue length Queue Q length l h not a good d measurement of f delay d l Responds slowly to congestion

ARPANET R Routing ti St Strategies(2) t i (2)


Second Generation 1979
Uses delay y as p performance criterion Delay measured directly Uses Dijkstras algorithm (appendix 10a) Good under light and medium loads Under heavy loads, little correlation between reported delays and those experienced

Third Generation
1987 Link cost calculations changed Measure average delay over last 10 seconds Normalize based on current value and previous results

L Least t Cost C t Al Algorithms ith


Basis for routing decisions
Can minimize hop with each link cost 1 Can have link value inversely proportional to capacity

Given network of nodes connected by bi-directional links Each link has a cost in each direction Define cost of path between two nodes as sum of costs of links traversed For each pair of nodes, find a path with the least cost Link costs in different directions may be different
E.g. length of packet queue

Dijk t Algorithm Dijkstras Al ith D Definitions fi iti


Find shortest p paths from given g source node to all other nodes, by developing paths in order of increasing path length N = set t of f nodes d i in th the network t k s = source node T = set of nodes so far incorporated by the algorithm w(i, j) = link cost from node i to node j
w(i, i) = 0 w(i, j) = if the two nodes are not directly connected w(i, j) 0 if the two nodes are directly connected

L( L(n) ) = cost of fl least-cost path h from f node d s to node d n currently known


At termination, L(n) is cost of least-cost least cost path from s to n

Dijk t Algorithm Dijkstras Al ith M Method th d


Step p1[ [Initialization] ]
T = {s} Set of nodes so far incorporated consists of only source node L(n) = w(s, n) for n s Initial path costs to neighboring nodes are simply link costs

Step 2 [Get Next Node]


Find neighboring node not in T with least-cost path from s Incorporate node into T Also incorporate the edge that is incident on that node and a node in T that contributes to the path

Step 3 [Update Least-Cost Paths]


L(n) = min[L(n), L(x) + w(x, n)] for all n T If f latter l term is minimum, path h from f s to n is path h from f s to x concatenated with edge from x to n

Algorithm g terminates when all nodes have been added to T

Dijk t Algorithm Dijkstras Al ith N Notes t


At termination termination, value L(x) associated with each node x is cost (length) of least-cost path from s to x x. In addition, T defines least-cost path from s to each other node One iteration of steps 2 and 3 adds one new node d to t T
Defines least cost path from s tothat node

E Example l of f Dijk Dijkstras t Al Algorithm ith

Results of Example Dijk t Al Dijkstras Algorithm ith


Ite rat ion 1 2 3 4 T L(2) Path L(3) Path L(4) Path L(5) Path L(6 ) 4 Path {1} {1,4} {1, 2, 4} {1, 2, 4, 5} {1, 2, 3, 4, 5} {1, 2, 3, 4, 5, 6} 2 2 2 2 12 12 12 12 5 4 4 3 1-3 1-4-3 1-4-3 1-4-53 1 1 1 1 14 14 14 14 2 2 2 1-45 1-45 1-45 1-4-56

12

1-4-53

14

1-45

1-4-56

1-2

1-4-5-3

1-4

1-45

1-4-5-6

Bellman-Ford Algorithm D fi iti Definitions


Find shortest p paths from given g node subject j to constraint that paths contain at most one link Find the shortest paths with a constraint of paths of at most tt two li links k And so on s = source node w(i, j) = link cost from node i to node j
w(i, i) = 0 w(i, j) = if the two nodes are not directly connected w(i, j) 0 if the two nodes are directly connected

h = maximum i number b of f links li k in i path h at current stage of the algorithm Lh(n) = cost of least-cost path from s to n under constraint of no more than h links

B ll Bellman-Ford F d Algorithm Al ith Method M th d


Step p1[ [Initialization] ] Step St 2 [Update] [U d t ] For each successive h 0 Connect n with p predecessor node j that achieves minimum Eliminate any connection of n with different predecessor node formed during an earlier iteration Path from s to n terminates with link from j to n
For each n s s, compute Lh+1(n)=minj[Lh(j)+w(j,n)] L0(n) = , for all n s Lh(s) = 0, for all h

B ll Bellman-Ford F d Algorithm Al ith Notes N t


For each iteration of step 2 with h h=K K and for each destination node n, algorithm compares paths from s to n of length K K=1 1 with path from previous iteration If previous path shorter it is retained Otherwise new path is defined

Example of Bellman-Ford Al Algorithm ith

Results of Bellman-Ford E Example l


h Lh ( (2) ) Path Lh( (3) ) Path L h( (4) ) Path Lh( (5) ) Path L h( (6) ) Path

0 1 2 2 2 3 2 4 2

1-2 1-2 1-2 1-2

5 4 3 3

1-3 1-4-3

1 1

1-4 1-4 1-4 1-4

2 2 2

1-3-6 1-4-5-6 1-4-5-6

1-4-5 10 1-4-5 4 1-4-5 4

1-4-5-3 1 1-4-5-3 1

C Comparison i
Results from two algorithms agree Information gathered
Bellman-Ford
Calculation for node n involves knowledge of link cost to all neighboring nodes plus total cost to each neighbor from s Each node can maintain set of costs and paths for every other node Can exchange information with direct neighbors Can update costs and paths based on information from neighbors and knowledge of link costs

Dijkstra
Each node needs complete p topology p gy Must know link costs of all links in network Must exchange information with all other nodes

E l ti Evaluation
Dependent on processing time of algorithms Dependent on amount of information required from other nodes Implementation specific Both converge under static topology and costs Converge to same solution If link costs change change, algorithms will attempt to catch up If link costs depend on traffic traffic, which depends on routes chosen, then feedback
May May result in instability

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy