July 2004
Intermediate to advanced
448 pages
10h 7m
English
While the BGP best path algorithm described in Chapter 1 can be very complex, it doesn't address every possible route choice a network designer might want. One example is illustrated in Figure 7.1.

Autonomous system 65500's system administrator has a simple plan he'd like to implement for traffic being forwarded out of his network:
Route through the shortest path, in terms of AS Path, to reach the destination.
If both paths are equal length, route out the closest exit point.
If both exit points are equally distant, use the cheaper path (administratively defined, based on the cost of using the ...
Read now
Unlock full access