Distributed Traffic Engineering for Multi-Domain SDN Without Trust
Yangyang Liu, Laiping Zhao, Jingyu Hua, Wenyu Qu, Suohao Zhang, Sheng Zhong
Abstract
In software defined networking, the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">flat</i> design of distributed control plane enables the management of multi-domain networks that are incapable of deploying a root controller. However, it is very difficult to avoid policy conflicts between independent local controllers due to the lack of centralized arbitration. Moreover, domains without trust may not be always cooperative and could even cheat to maximize their own interests. In this article, we first consider the cooperative scenario and address the problem of traffic engineering in a flat distributed control plane. We propose a fully distributed algorithm, called <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DisTE</monospace> , which can provide max-min fair bandwidth allocation for flows and maximize resource utilization. <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DisTE</monospace> also preserves the local topology of each domain and achieves policy consistency by multiple rounds of synchronization. We then consider the non-cooperative scenario, where selfish domains may discriminate bandwidth requests from other domains or overstate theirs owns to squeeze more bandwidths.