End-host Driven Troubleshooting Architecture for Software-Defined Networking

被引:0
作者
Csikor, Levente [1 ]
Pezaros, Dimitrios P. [1 ]
机构
[1] Univ Glasgow, Sch Comp Sci, Networked Syst Res Lab Netlab, Glasgow, Lanark, Scotland
来源
GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE | 2017年
基金
英国工程与自然科学研究理事会;
关键词
Network measurement; SDN; NFV; troubleshoot;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The high variability in traffic demands, the advanced networking services at various layers (e.g., load-balancers), and the steady penetration of SDN technology and virtualization make the crucial network troubleshooting tasks ever more challenging over multi-tenant environments. Service degradation is first realized by the users and, as being the only one having visibility to many relevant information (e.g., connection details) required for accurate and timely problem resolution, the infrastructure layer is often forced upon continuous monitoring resulting in wasteful resource management, not to mention the long time frames. In this paper, we propose an End-host-Driven Troubleshooting architecture (EDT), where users are able to share the application-specific connection details with the infrastructure to accelerate the identification of root causes of performance degradation, and to avoid the need for always-on, resource-intensive, and network-wide monitoring. Utilizing EDT, we provide some essential tools for real end-to-end trace routing (PTR), identifying packet losses, and carry out hop-by-hop latency measurements (HEL). In contrast to existing proposals, PTR traces the practical production traffic without the need of crafted probe packets by means of careful tagging mechanisms and additional ephemeral capturing flow rules. Besides involving negligible data plane deterioration, in certain cases PTR can drastically reduce the time needed to find a traversed path compared to existing solutions. Finally, by means of individual network functions, HEL measures the latency of each link along the found path without involving the controller into the calculation, hence resulting in significant reduction of control plane overhead.
引用
收藏
页数:7
相关论文
共 21 条
[1]  
Agarwal Kanak., 2014, P 3 WORKSHOP HOT TOP, P145, DOI DOI 10.1145/2620728.2620756
[2]  
[Anonymous], P IEEE NFV SDN NOV
[3]  
Benson A., 2010, P 10 ACM SIGCOMM C I, P267, DOI [10.1145/1879141.1879175.5, DOI 10.1145/1879141.1879175, 10.1145/1879141.1879175]
[4]   A Provider-side View of Web Search Response Time [J].
Chen, Yingying ;
Mahajan, Ratul ;
Sridharan, Baskar ;
Zhang, Zhi-Li .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :243-254
[5]  
Claise B., 2004, 3954 IETF RFC
[6]  
Continuity Central, 2015, DEGR CUST CONF LOST
[7]  
Duffield N, 2003, ACM SIGCOMM COMP COM, V33, P325
[8]  
Erickson A., 2015, CORR
[9]   Reducing Web Latency: the Virtue of Gentle Aggression [J].
Flach, Tobias ;
Dukkipati, Nandita ;
Terzis, Andreas ;
Raghavan, Barath ;
Cardwell, Neal ;
Cheng, Yuchung ;
Jain, Ankur ;
Hao, Shuai ;
Katz-Bassett, Ethan ;
Govindan, Ramesh .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :159-170
[10]  
Handigol N., 2014, PROC USENIX NSDI, P71