On Reducing Measurement Load on Control-Plane in Locating High Packet-Delay Variance Links for OpenFlow Networks

On Reducing Measurement Load on Control-Plane in Locating High Packet-Delay Variance Links for OpenFlow Networks
复制标题

DOI:
10.1007/978-3-030-70639-5_22
复制
发表时间:
2021
期刊:
--
影响因子:
--
通讯作者:
Nguyen Minh Tri;Nguyen Viet Ha;M. Shibata;M. Tsuru;Akira Kawaguchi
Nguyen Minh Tri;Nguyen Viet Ha;M. Shibata;M. Tsuru;Akira Kawaguchi
中科院分区:
其他
文献类型:
--
作者:
Nguyen Minh Tri;Nguyen Viet Ha;M. Shibata;M. Tsuru;Akira Kawaguchi

文献摘要

相似文献

我们之前提出了一种方法,通过沿着设计的路由探测多播测量数据包,并通过从选定的OpenFlow交换机(ofs)收集探测数据包的流状态来定位OpenFlow网络的高分组延迟方差链路。值得注意的是,链路的包延迟方差是根据探测包的到达时间间隔来估计的,而不是测量链路上的延迟时间。但是,以前使用的基于最短路径树的路由方案可能会在大型网络中产生具有许多分支的探测路由,导致需要多次访问ofs来定位所有高时延方差的链路。因此,在本文中,我们采用一种基于欧拉循环的方案来控制组播探测路由中的分支数。我们的建议可以减少控制平面上的负载(即对ofs的访问次数),同时在数据平面上的轻负载下保持可接受的测量精度。此外,包丢失和相关延迟在这些不同类型的负载上的链路的影响进行了研究。通过数值仿真,将该方案与基于最短路径树和通用路由方案进行比较,评价了该方案的优越性。
We previously proposed a method to locate high packet-delay variance links for OpenFlow networks by probing multicast measurement packets along a designed route and by collecting flow-stats of the probe packets from selected OpenFlow switches (OFSs). It is worth noting that the packet-delay variance of a link is estimated based on arrival time intervals of probe packets without measuring delay times over the link. However, the previously used route scheme based on the shortest path tree may generate a probing route with many branches in a large network, resulting in many accesses to OFSs to locate all high delay variance links. In this paper, therefore, we apply an Eulerian cycle-based scheme which we previously developed, to control the number of branches in a multicast probing route. Our proposal can reduce the load on the control-plane (i.e., the number of accesses to OFSs) while maintaining an acceptable measurement accuracy with a light load on the data-plane. Additionally, the impacts of packet losses and correlated delays over links on those different types of loads are investigated. By comparing our proposal with the shortest path tree-based and the unicursal route schemes through numerical simulations, we evaluate the advantage of our proposal.