{'fraction_non_alphanumeric': 0.027867095391211148, 'fraction_numerical': 0.0, 'mean_word_length': 5.35374149659864, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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 startup 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, a simple heuristic WiNN (Widest Next-hop Neighbor) is proposed that has low startup latency and provides good call acceptance rates. The heuristic uses neither link state updates nor complex path selection algorithms.