Adaptive Path Tracing with Programmable Bloom Filters in Software-Defined Networks

被引:0
作者
Xiong, Sisi [1 ]
Cao, Qing [1 ]
Si, Weisheng [2 ]
机构
[1] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37996 USA
[2] Western Sydney Univ, Sch Comp Engn & Math, Penrith, NSW, Australia
来源
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019) | 2019年
关键词
D O I
10.1109/infocom.2019.8737387
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One critical challenge of managing modern data center networks lies in that existing network protocols provide limited visibility on the internal routing and forwarding decisions made by the control plane, leading to difficulties on fast diagnosis and identification of root causes for performance bugs and anomalies. In this paper, we develop and evaluate a "debugging mode" for packet forwarding, where we demonstrate a possible design space by introducing a programmable header field into data packets used for diagnosis purposes. These headers can be manipulated by routers in intermediate hops to perform tracing and diagnosis operations, thereby providing much greater visibility on the control plane and data plane operations. To make this design scalable and feasible, we exploit the software APIs provided by the latest software-defined networking (SDN) technologies, where the network control plane is separated from the underlying data plane, so that we can reprogram the network forwarding functions dynamically. Compared to existing alternative approaches, our approach is adaptive and programmable, allowing dynamic and on-demand receiver-side decoding with extremely low overhead. We emphasize that as this "debugging mode" can he enabled and disabled by network managers as demanded, it introduces zero overhead to normal traffic if everything is operating as expected. Our evaluation results on a real SDN network testbed demonstrate the effectiveness of the proposed approaches.
引用
收藏
页码:496 / 504
页数:9
相关论文
共 25 条
[1]  
Agarwal Kanak., 2014, P 3 WORKSHOP HOT TOP, P145
[2]  
Benson T., 2010, Proceedings of the 10th annual conference on Internet measurement - IMC '10, P267, DOI [DOI 10.1145/1879141.1879175, 10.1145/1879141.1879175]
[3]   Beyond bloom filters: From approximate membership checks to approximate state machines [J].
Bonomi, Flavio ;
Mitzenmacher, Michael ;
Panigrahy, Rina ;
Singh, Sushil ;
Varghese, George .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :315-326
[4]  
Broder Andrei, 2004, Internet mathematics, V1, P485, DOI DOI 10.1080/15427951.2004.10129096
[5]   Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement [J].
Chen, Min ;
Chen, Shigang .
2015 IEEE 23RD INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP), 2015, :111-122
[6]   Trajectory sampling for direct traffic observation [J].
Duffield, NG ;
Grossglauser, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (03) :280-292
[7]  
Fayazbakhsh SeyedKaveh., 2013, Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN '13, P19, DOI 10.1145/2491185.2491203
[8]   The Road to SDN: An Intellectual History of Programmable Networks [J].
Feamster, Nick ;
Rexford, Jennifer ;
Zegura, Ellen .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (02) :87-98
[9]   Understanding Network Failures in Data Centers: Measurement, Analysis, and Implications [J].
Gill, Phillipa ;
Jain, Navendu ;
Nagappan, Nachiappan .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) :350-361
[10]   Machine-Verified Network Controllers [J].
Guha, Arjun ;
Reitblatt, Mark ;
Foster, Nate .
ACM SIGPLAN NOTICES, 2013, 48 (06) :483-494