Full Text:   <3139>

Summary:  <1536>

CLC number: TP393

On-line Access: 2017-02-10

Received: 2016-05-23

Revision Accepted: 2016-09-14

Crosschecked: 2016-11-08

Cited: 0

Clicked: 4132

Citations:  Bibtex RefMan EndNote GB/T7714

 ORCID:

Shuo Wang

http://orcid.org/0000-0002-6350-6362

-   Go to

Article info.
Open peer comments

Frontiers of Information Technology & Electronic Engineering  2017 Vol.18 No.2 P.206-219

http://doi.org/10.1631/FITEE.1601280


FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead


Author(s):  Shuo Wang, Jiao Zhang, Tao Huang, Jiang Liu, Yun-jie Liu, F. Richard Yu

Affiliation(s):  State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; more

Corresponding email(s):   shuowang@bupt.edu.cn, jiaozhang@bupt.edu.cn

Key Words:  Software-defined networking, Network monitoring, Traceroute


Shuo Wang, Jiao Zhang, Tao Huang, Jiang Liu, Yun-jie Liu, F. Richard Yu. FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead[J]. Frontiers of Information Technology & Electronic Engineering, 2017, 18(2): 206-219.

@article{title="FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead",
author="Shuo Wang, Jiao Zhang, Tao Huang, Jiang Liu, Yun-jie Liu, F. Richard Yu",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="18",
number="2",
pages="206-219",
year="2017",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1601280"
}

%0 Journal Article
%T FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead
%A Shuo Wang
%A Jiao Zhang
%A Tao Huang
%A Jiang Liu
%A Yun-jie Liu
%A F. Richard Yu
%J Frontiers of Information Technology & Electronic Engineering
%V 18
%N 2
%P 206-219
%@ 2095-9184
%D 2017
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.1601280

TY - JOUR
T1 - FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead
A1 - Shuo Wang
A1 - Jiao Zhang
A1 - Tao Huang
A1 - Jiang Liu
A1 - Yun-jie Liu
A1 - F. Richard Yu
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 18
IS - 2
SP - 206
EP - 219
%@ 2095-9184
Y1 - 2017
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.1601280


Abstract: 
In today’s networks, load balancing and priority queues in switches are used to support various quality-of-service (QoS) features and provide preferential treatment to certain types of traffic. Traditionally, network operators use ’traceroute’ and ‘ping’ to troubleshoot load balancing and QoS problems. However, these tools are not supported by the common OpenFlow-based switches in software-defined networking (SDN). In addition, traceroute and ping have potential problems. Because load balancing mechanisms balance flows to different paths, it is impossible for these tools to send a single type of probe packet to find the forwarding paths of flows and measure latencies. Therefore, tracing flows’ real forwarding paths is needed before measuring their latencies, and path tracing and latency measurement should be jointly considered. To this end, FlowTrace is proposed to find arbitrary flow paths and measure flow latencies in OpenFlow networks. FlowTrace collects all flow entries and calculates flow paths according to the collected flow entries. However, polling flow entries from switches will induce high overhead in the control plane of SDN. Therefore, a passive flow table collecting method with zero control plane overhead is proposed to address this problem. After finding flows’ real forwarding paths, FlowTrace uses a new measurement method to measure the latencies of different flows. Results of experiments conducted in Mininet indicate that FlowTrace can correctly find flow paths and accurately measure the latencies of flows in different priority classes.

流追踪:一种软件定义网络中低开销的时延测量和路径追踪方法

概要:为了针对不同的应用和流量提供服务质量保障和差异化服务,负载均衡和多优先级队列技术被广泛地应用于网络中。在传统网络中,网络管理员经常使用”traceroute”和”ping”工具来检测负载均衡机制或者服务质量策略是否正常工作。然而,由于这些工具并不被现有的OpenFlow交换机所支持,所以还不能够应用于软件定义网络中。此外,traceroute和ping依靠主动发送探测包来探测路径。然而,当负载均衡机制把探测包和所需追踪流的数据包均衡到不同路径时,这些工具将无法探测出流的真实转发路径,更无法测量出真实的路径时延。因此,为了准确的测量链路时延,测量工具必须能够提前找出数据包的真实转发路径。基于此发现,我们提出了一套新的软件定义网络中的流追踪机制”FlowTrace”,利用它来追踪任意流量的转发路径以及测量数据流所经历的链路时延。该工具通过收集交换机的流表来计算流的转发路径。然而,如果直接从交换机中查询流表会产生很大的数据平面流量,从而带来巨大的开销。因此,我们提出了一种被动的零开销的流表收集方法来解决该问题。在获得流的真实转发路径后,我们提出了一种新的测量方法来测量不同流的网络时延。最后,实验结果显示我们设计的方法可以准确的找出流的真实转发路径并测量出不同种类流所经历的时延。

关键词:软件定义网络;网络检测;路径追踪

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1]Agarwal, K., Rozner, E., Dixon, C., et al., 2014. {SDN traceroute: tracing SDN forwarding without changing network behavior}. Proc. 3rd Workshop on Hot Topics in Software Defined Networking, p.145-150.

[2]Al-Fares, M., Loukissas, A., Vahdat, A., 2008. A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev., 38(4):63-74.

[3]Al-Fares, M., Radhakrishnan, S., Raghavan, B., et al., 2010. Hedera: dynamic flow scheduling for data center networks. Proc. 7th USENIX Conf. on Networked Systems Design and Implementation, p.19.

[4]Alizadeh, M., Yang, S., Sharif, M., et al., 2013. pFabric: minimal near-optimal datacenter transport. ACM SIGCOMM Comput. Commun. Rev., 43(4):435-446.

[5]Bai, W., Chen, L., Chen, K., et al., 2015. Information-agnostic flow scheduling for commodity data centers. Proc. 12th USENIX Conf. on Networked Systems Design and Implementation, p.455-468.

[6]Chowdhury, S.R., Bari, M.F., Ahmed, R., et al., 2014. PayLess: a low cost network monitoring framework for software defined networks. Proc. Network Operations and Management Symp., p.1-9.

[7]Clos, C., 1953. A study of non-blocking switching networks. Bell Syst. Tech. J., 32(2):406-424.

[8]Curtis, A.R., Kim, W., Yalagandula, P., 2011. Mahout: low-overhead datacenter traffic management using end-host-based elephant detection. Proc. IEEE INFOCOM, p.1629-1637.

[9]Ding, J., Huang, T., Liu, J., et al., 2015. Virtual network embedding based on real-time topological attributes. Front. Inform. Technol. Electron. Eng., 16(2):109-118.

[10]Greenberg, A., Hamilton, J.R., Jain, N., et al., 2009. VL2: a scalable and flexible data center network. ACM SIGCOMM Comput. Commun. Rev., 39(4):51-62.

[11]Guo, C., Yuan, L., Xiang, D., et al., 2015. Pingmesh: a large-scale system for data center network latency measurement and analysis. ACM SIGCOMM Comput. Commun. Rev., 45(4):139-152.

[12]Handigol, N., Heller, B., Jeyakumar, V., et al., 2012. Where is the debugger for my software-defined network? Proc. 1st Workshop on Hot Topics in Software Defined Networks, p.55-60.

[13]et al.}2013]jarschel2013accuracy Jarschel, M., Zinner, T., Hohn, T., et al., 2013. On the accuracy of leveraging SDN for passive network measurements. Proc. Telecommunication Networks and Applications Conf., p.41-46.

[14]Katta, N.P., Rexford, J., Walker, D., 2013. Incremental consistent updates. Proc. 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, p.49-54.

[15]Kazemian, P., Chang, M., Zeng, H., et al., 2013. Real time network policy checking using header space analysis. Proc. 10th USENIX Conf. on Networked Systems Design and Implementation, p.99-112.

[16]Khurshid, A., Zhou, W., Caesar, M., et al., 2012. VeriFlow: verifying network-wide invariants in real time. Proc. 1st Workshop on Hot Topics in Software Defined Networks, p.49-54.

[17]Liu, J., Huang, T., Chen, J., et al., 2011. A new algorithm based on the proximity principle for the virtual network embedding problem. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 12(11):910-918.

[18]McKeown, N., Anderson, T., Balakrishnan, H., et al., 2008. OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev., 38(2):69-74.

[19]Perevšíni, P., Kuzniar, M., Vasić, N., et al., 2013. OF.CPP: consistent packet processing for OpenFlow. Proc. 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, p.97-102.

[20]Phemius, K., Bouet, M., 2013. Monitoring latency with OpenFlow. Proc. 9th Int. Conf. on Network and Service Management, p.122-125.

[21]Phemius, K., Thales, B.M., 2013. OpenFlow: why latency does matter. Proc. IFIP/IEEE Int. Symp. on Integrated Network Management, p.680-683.

[22]Qi, H., Shiraz, M., Liu, J., et al., 2014. Data center network architecture in cloud computing: review, taxonomy, and open research issues. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 15(9):776-793.

[23]et al.}2012]reitblatt2012abstractions Reitblatt, M., Foster, N., Rexford, J., et al., 2012. Abstractions for network update. ACM SIGCOMM Comput. Commun. Rev., 42(4):323-334.

[24]Scott, C., Wundsam, A., Raghavan, B., et al., 2014. Troubleshooting blackbox SDN control software with minimal causal sequences. Proc. ACM SIGCOMM Conf., p.1-12.

[25]Su, Z., Wang, T., Xia, Y., et al., 2014. FlowCover: low-cost flow monitoring scheme in software defined networks. Proc. IEEE Global Communications Conf., p.1956-1961.

[26]Tavakoli, A., Casado, M., Koponen, T., et al., 2009. Applying NOX to the datacenter. Proc. 8th ACM Workshop on Hot Topics in Networks, p.1-6.

[27]Wundsam, A., Levin, D., Seetharaman, S., et al., 2011. OFRewind: enabling record and replay troubleshooting for networks. Proc. USENIX Annual Technical Conf., p.29.

[28]Yu, C., Lumezanu, C., Zhang, Y., et al., 2013. FlowSense: monitoring network utilization with zero measurement cost. Proc. 14th Int. Conf. on Passive and Active Measurement, p.31-41.

[29]Yu, C., Lumezanu, C., Sharma, A., et al., 2015. Software-defined latency monitoring in data center networks. Proc. 16th Int. Conf. on Passive and Active Measurement, p.360-372.

[30]Yu, M., Jose, L., Miao, R., 2013. Software defined traffic measurement with OpenSketch. Proc. 10th USENIX Conf. on Networked Systems Design and Implementation, p.29-42.

[31]Zhang, H., Lumezanu, C., Rhee, J., et al., 2014. Enabling layer 2 pathlet tracing through context encoding in software-defined networking. Proc. 3rd Workshop on Hot Topics in Software Defined Networking, p.169-174.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2022 Journal of Zhejiang University-SCIENCE