Path Computation/Selection
Paths are computed using a widest-shortest path heuristic
- Minimum hop path with maximum bandwidth
Paths are computed
- On-demand, i.e., anew for each request
- Periodically and stored in a QoS Route Table
- Pre-computation based on modified Bellman-Ford alg.
- QoS route table structure
- One row per destination (route table entry)
- One column for each hop count with greater bandwidth
- Path selection searches row for first column with sufficient bandwidth
- Randomization when multiple choices are available