Font Size: a A A

Research On IN-Band Network-Wide Telemetry Based Onint

Posted on:2021-03-13Degree:MasterType:Thesis
Country:ChinaCandidate:X C LinFull Text:PDF
GTID:2518306308968309Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
In recent years,with the development of Cloud Computing,global data center network traffic has grown rapidly.And the software-defined architecture and virtualization trends are gradually affecting the data center.Large-scale data center traffic,and the increasingly widely used virtual network equipment,pose new challenges to network monitoring and management.Among them,the research on network measurement is essential for operating and troubleshooting networks.In the SDN/NFV architecture,In-band Network Telemetry(INT)has been embedded in the latest merchant silicons to support the real-time network equipment and traffic state information collection.However,INT is just an underlying technique for monitoring a network device or a device chain along one path.Therefore,in order to achieve network-wide telemetry,it is necessary to design a high-level mechanism to configure multiple INT telemetry paths.An optimal path planning requires a minimum number of paths with a minimum number of overlapped links.The Eulerian trail has solved this problem.However,in real networks,the position that can be used as the start or end of the telemetry path is constrained.In view of the above problems,we first propose a deployable In-band Network-wide Telemetry mechanism.With the help of source routing and INT,the mechanism realizes the ability of specifying the telemetry paths by the controller.In order to detect the entire network links,and considering the feasibility of real deployment,we also propose an optimal path planning algorithm.The algorithm achieves the network-wide telemetry coverage under the constraint of fixed path endpoints.Through abstraction and analysis,the algorithm decomposes and reduces the problem to a solvable minimum weight perfect matching.Subsequently,we analyze the theoretical bound of the path number and the algorithm complexity.We conduct extensive comparative evaluations on both ordinary networks and data center networks with different scale and topology.The evaluations verify that the algorithm is efficient,high performance,and practical for real-world deployment.For a large-scale data center FatTree network with 1125 switches,if we only choose half of the ToR switches as the available telemetry path endpoints,the algorithm can generate 112 telemetry paths(reduced by 50.22%)by allowing only 1.79%increase of the total path length.Finally,based on the virtual network equipment provided by VPP,we develop the In-band Network-wide Telemetry function,and conduct simulation experiments with the help of virtual machines.The experimental results verify the effectiveness of the In-band Network-wide Telemetry mechanism.In the simulation experiment setup,due to the change in background traffic(no background traffic,90Mbps,200Mbps),the per-hop average processing latency of the INT packets at 1Mbps INT telemetry rate is 6.1us,10.4us,41.7us,respectively.
Keywords/Search Tags:in-band network telemetry, path planning, minimum weight perfect matching, vector packet processing
PDF Full Text Request
Related items