Critical Reroute: A Practical Approach to Network Flow Prioritization using Segment Routing

Critical Reroute: A Practical Approach to Network Flow Prioritization using Segment Routing
复制标题

DOI:
10.1109/lanman.2019.8846997
复制
发表时间:
2019-07
期刊:
2019 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)
影响因子:
--
通讯作者:
Simon Redman;David Johnson;J. V. D. Merwe
Simon Redman;David Johnson;J. V. D. Merwe
中科院分区:
其他
文献类型:
--
作者:
Simon Redman;David Johnson;J. V. D. Merwe

文献摘要

相似文献

人们普遍认识到,可靠的通信是成功应对灾害局势的一个关键因素。为了满足这一需求,世界各地的地方和地区政府已经为第一反应者部署了专用通信网络。这些系统通常非常昂贵,只有语音,并且只有在很少的情况下才需要。使用现有网络或部署网络供共享使用将更具成本效益。但是,由于需求的突然增加或灾难造成的物理故障,共享网络可能会过载。在这种情况下,将期望将属于公共安全应用的业务流优先于其他业务流。诸如优先级排队和差异化服务等解决方案为这一目标提供了部分答案,但留下了其他未解决的问题。这项工作提出了一种新的解决方案,使用分段路由和遗传算法优化器,以尽量减少网络过载对关键流量的影响。结果表明,这些方法可以重新路由流使用一个单一的中点,使总的网络过载减少相比,传统的最短路径路由,同时避免不必要的长路径,并考虑流的优先级。
It is widely recognized that reliable communications are a key element of a successful response to a disaster situation. To address this need, local and regional governments in all parts of the world have deployed dedicated communications networks for first responders. These systems are often prohibitively expensive, voice-only, and are needed only on rare occasions. It would be more cost-effective to use already-existing networks or to deploy networks for shared use. However, due to the sudden increase in demand or physical failure caused by the disaster, shared networks may become overloaded. In such situations, it would be desirable to prioritize traffic flows belonging to public safety applications over others. Solutions such as priority queuing and differentiated services provide partial answers to that goal but leave other problems unsolved. This work presents a novel solution using Segment Routing and a Genetic Algorithm optimizer to minimize the impact of network overload on critical traffic flows. The results show that these methods can reroute flows using a single midpoint such that the total network overload is reduced compared to traditional shortest-path routing while avoiding unnecessarily long paths and taking priority of flows into account.