Tango: Simplifying SDN Control with Automatic Switch Property Inference, Abstraction, and Optimization

被引:42
|
作者
Lazaris, Aggelos [3 ]
Tahara, Daniel [5 ]
Huang, Xin [2 ]
Li, Li Erran [1 ]
Voellmy, Andreas [5 ]
Yang, Y. Richard [4 ,5 ]
Yu, Minlan [3 ]
机构
[1] Bell Labs, Alcatel Lucent, 600 Mt Ave, Murray Hill, NJ 07974 USA
[2] Cyan Inc, Mead, WA USA
[3] USC, Los Angeles, CA 90089 USA
[4] Tongji Univ, Shanghai, Peoples R China
[5] Yale Univ, New Haven, CT 06520 USA
关键词
Software-defined Networking; OpenFlow; Switch Diversity;
D O I
10.1145/2674005.2675011
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A major benefit of software-defined networking (SDN) over traditional networking is simpler and easier control of network devices. The diversity of SDN switch implementation properties, which include both diverse switch hardware capabilities and diverse control-plane software behaviors, however, can make it difficult to understand and/or to control the switches in an SDN network. In this paper, we present Tango, a novel framework to explore the issues of understanding and optimization of SDN control, in the presence of switch diversity. The basic idea of Tango is novel, simple, and yet quite powerful. In particular, different from all previous SDN control systems, which either ignore switch diversity or depend on that switches can and will report diverse switch implementation properties, Tango introduces a novel, proactive probing engine that infers key switch capabilities and behaviors, according to a well-structured set of Tango patterns, where a Tango pattern consists of a sequence of standard OpenFlow commands and a corresponding data traffic pattern. Utilizing the inference results from Tango patterns and additional application API hints, Tango conducts automatic switch control optimization, despite diverse switch capabilities and behaviors. Evaluating Tango on both hardware switches and emulated software switches, we show that Tango can infer flow table sizes, which are key switch implementation properties, within less than 5% of actual values, despite diverse switch caching algorithms, using a probing algorithm that is asymptotically optimal in terms of probing overhead. We demonstrate cases where routing and scheduling optimizations based on Tango improves the rule installation time by up to 70% in our hardware switch testbed.
引用
收藏
页码:199 / 211
页数:13
相关论文
empty
未找到相关数据