NET Fourth Chapter Network layer (II)

Key issues in the Network diagram:

What is the minimum cost path for source-to-purpose?

The cost can be expressed by the reciprocal of the bandwidth, the degree of congestion, etc. (the smaller the better)

Routing algorithm: An algorithm for finding the least cost path

Classification of routing algorithms:

Static Routes :

Manual configuration, slow routing updates

High-priority

Dynamic Routing :

Fast routing updates (periodic updates, timely response to link costs or network topology changes)

Global Information :

Decentralized information :

NET Fourth Chapter Network layer (II)