arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.10312cs.NI
收藏

大规模软件网络中的多约束路由算法

Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks

Chenyang Xu, Liangde Tao, Huajingling Wu, Deshi Ye, Guochuan Zhang

摘要:

本文研究了大规模软件定义网络中的带宽-时延-跳数约束路由问题。在给定的网络中,路由需要多个需求,每个需求指定一个源顶点和一个汇聚点。我们被要求选择一个子集的需求,并分配路由路径为每个选定的需求,而不违反跳数和延迟的限制,同时确保在每个边缘占用的带宽不超过其容量。目标是最大化所选需求的吞吐量(总带宽)。我们开发了一个有效的启发式算法的问题,它包括三个主要步骤,即,计算可行的路径为每个需求,排序的需求与一些优先级规则,选择路径为每个需求。该算法在华为技术公司的实际网络规模和拓扑结构上进行了测试。实验结果表明,该方法在吞吐量和运行时间上都优于现有算法。在实验中,我们的算法在10秒内达到了给定需求的总带宽的90%以上。此外,我们的算法的很大一部分可以并行运行,这在很大程度上加快了使用多核处理器时的过程。

英文摘要:

In this paper, we consider the bandwidth-delay-hop constrained routing problem in large-scaled software defined networks. A number of demands, each of which specifies a source vertex and a sink vertex, are required to route in a given network. We are asked to select a subset of demands, and assign a routing path for each selected demand without violating the hop and delay constraints, while assuring that the bandwidth occupied in each edge is not beyond its capacity. The goal is to maximize the throughput (the total bandwidth) of the selected demands. We develop an efficient heuristic algorithm for the problem, which consists of three main steps, namely, computing feasible paths for each demand, sorting the demands with some priority rules, selecting a path for each demand. The algorithm is tested with networks of actual sizes and topologies, generated by Huawei Technologies Company. The experiments show that the proposed approach outperforms existing algorithms both in throughput and in running time. In the experiments, our algorithm achieves more than 90\% of the total bandwidth of the given demands within 10 seconds. Moreover, a large part of our algorithm can run in parallel which largely speeds up the process when using multi-core processors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑