Minimizing Network Resources Consumed for Link Latency Measurements in SDNs
Yang Tian, Weiwei Chen, Chin‐Tau Lea · 2019
Accurate link latency information is required for solving many traffic engineering problems, such as congestion avoidance routing and load balancing. Many link latency measurement schemes have been proposed for Software-Defined Networks (SDNs), and many of these require the SDN controllers to inject and remove entries into and from flow tables dynamically. If done frequently, this process can generate a large amount of traffic overhead and consume a lot of processing and computation resources. In this paper, we present a link latency measurement scheme, where entries for latency measurement are already embedded inside flow tables. The main challenge in designing such a scheme lies in how to select measurement paths that can minimize the number of entries added to the expensive TCAM-based flow tables and the amount of traffic generated for latency measurement. We present solutions that can minimize both in this paper.