Lee Chankyun, Cao Xiaoyuan, Yoshikane Noboru, Tsuritani Takehiro, Rhee June-Koo Kevin
Opt Express. 2015 Oct 19;23(21):27354-60. doi: 10.1364/OE.23.027354.
The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.
软件定义光网络（SDON）在实际应用中的可行性关键取决于集中控制性能的可扩展性。本文基于OpenFlow的SDON测试平台，对高度可扩展的路由和波长分配（RWA）算法进行了研究，以进行概念验证演示。提出了高效的RWA算法，以在降低计算成本的情况下实现高性能的网络容量，这是可扩展集中控制SDON的一个重要属性。所提出的启发式RWA算法在请求处理顺序和路由表更新过程上有所不同。结合基于最短路径的路由算法，一种考虑需求强度和端到端距离信息的最热请求优先处理策略，既能提供最高的网络吞吐量，又能提供可接受的计算可扩展性。我们通过仿真研究进一步探讨了路由表更新过程中网络吞吐量与计算复杂度之间的权衡关系。
