Routing representation

• Large networks contain exponentially increasing number of routes.

• Only consider k possible paths for each Tij i.e. s = ceil (log2 k) bits

are required.

• For n nodes, sn(n-1) bits are required, e.g. n=20, k=8, 1140 bits

• are required.

Routing Table

Link

Bandwidths

Ring

Design

Previous slide

Next slide

Back to first slide

View graphic version