Routing algorithms that use a weighted decision based on queue occupancy and hop count (e.g., UGAL) estimate the expected remaining delay by multiplying the hop count and queue occupancy. They choose the route that yields the lowest weight which approximates the lowest delay. This algorithm assumes all channel lengths are equal, which is very untrue in large scale networks. This invention integrates the propagation delay into the equation to yield a realistic expected delay value to be compared with other options.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.