Assuming We “Know” The Distribution
How do we incorporate our knowledge of the available bandwidth distribution?
Safety S(k) of link k
- Probability that the currently available bandwidth is more than the requested amount b
- S(k)=((1+?)* b0,k -b)/(2*?*b0,k) for b?[b0,k(1- ?); b0,k(1+ ?)]
- S(k)=0 if b> (1+?)*b0,k ; S(k)=1 if b< (1-?)*b0,k
Safety of a path
- Product of safeties of all the links in the path
- (independence assumption for lack of a better model)
Incorporate safety in the routing algorithm
- Shortest-safest (safest path(s) - ties broken by hop count (shortest))
- Safest-shortest (shortest path(s) - ties broken by safety (safest))