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
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.