Finding Feasible and Efficient Paths
Assume a link-state, bandwidth-based QoS model
Calculate widest-shortest paths [QOSPF]
- Stores multiple unicast paths to a destination
- A longer path is stored only if it is wider (and possibly if it has the same available bandwidth) than shorter ones
Path computation on demand
- Large processing requirements
Pre-computed paths (must still adapt to topological changes)
- Large storage requirements
- Pre-compute paths periodically or on each received update