Research On The Scheduling Mechanism Of In-band Network Telemetry Tasks

In recent years,the increasing scale of Internet networks,constantly updated network technologies,proliferating traffic,and widely used network devices have brought new challenges to the supervision of networks.Network measurement is a key technology to achieve network awareness and network connectivity,and the implementation of efficient network measurement techniques is an important guarantee that networks can operate stably and is of great significance for network operation and maintenance,fault location,and so on.With the development of Programmable Data Plane(PDP),In-Band Network Telemetry(INT)has been proposed as an advanced and fine-grained monitoring method.INT allows packets to query the internal state of a device as they pass through the data plane pipe without additional impact,and at the last hop,information containing monitoring data is extracted and further analyzed.Although INT has been noticed by academia and industry,INT is essentially an underlying primitive language,and network operators usually have access to real-time traffic status of individual devices or along the path.In other words,purely passive INT solutions are susceptible to traffic characteristics and usually do not have access to network-wide link status information,while network-wide network status information is essential for operators to understand network performance quality and diagnose persistent faults.Therefore,in order to improve network management,some advanced mechanisms of scheduling schemes need to be further designed.For the existing research schemes and telemetry requirements,network-wide link coverage and low-cost telemetry tasking mechanism objectives are necessary.In order to achieve the above objectives,this paper designs two INT task mechanism scheduling schemes with the help of source routing(SR)and INT technology,namely,the hybrid INT scheduling scheme and the active INT scheduling scheme,which are based on the perspective of different task scheduling mechanisms,and address the passive INT coverage performance and proactive INT coverage performance from the hybrid proactive-passive INT mechanism and the cluster INT mechanism,respectively.The hybrid INT scheme aims to combine the advantages and disadvantages of proactive INT and passive INT telemetry to make the mechanism scheduling design,while the proactive INT scheme is based on improving the mechanism of proactive INT based on the probability of link failure characteristics to make optimization adjustments.Based on this,two path planning algorithms are proposed,and the algorithms accomplish the coverage task under the specified path endpoint restrictions of both task mechanisms.In addition,the article evaluates the two scheduling schemes by simulation experiments in real Google backbone network and different sizes of network topology scale,and the simulation experimental results show that both schemes achieve the coverage of the whole network links,compared with the pure The simulation results show that both schemes achieve full network link coverage,and the hybrid scheduling scheme can save about 55.2% of bandwidth cost on average compared to the pure active INT scheme,and the improved active scheduling scheme makes different percentage of bandwidth cost savings according to the different requirements of operators,and both designed algorithms can complete the path scheme acquisition within 50 ms in the real Google backbone network topology.