WiNN: An Efficient Method for Routing Short-Lived Flows

摘要

Delivering real-time streaming content requires finding paths with a minimum required bandwidth. Finding such paths when requested should be fast (low start-up latency) and efficient (high call acceptance rates). However, current algorithms for finding such QoS paths, are ineffective when the bulk of the flows are short-lived. First, these algorithms are computationally expensive to justify invoking them on a per-request basis, and they add substantial latency to the signaling process. Moreover, they rely on frequent advertisement of residual link bandwidth, which is prohibitively expensive to perform on a short time-scale. Considering these drawbacks, we propose a simple heuristic WiNN (Widest Next-hop Neighbor) that has low start-up latency and provides good call acceptance rates. The heuristic uses neither link state updates nor complex path selection algorithms.