NetView: Towards On-Demand Network-Wide Telemetry in the Data Center

Lin, Yuanhua; Zhou, Yu; Liu, Zhengzheng; Liu, Ke; Wang, Yangyang; Xu, Mingwei; Bi, Jun; Liu, Ying; Wu, Jianping

doi:10.1109/icc40277.2020.9148651

Cited by 10 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NetView uses switch-level telemetry to estimate linklevel states and converts the goal of covering the entire network into covering all the nodes [22]. Different algorithms are designed to generate as few probes as possible.…”

Section: Related Workmentioning

confidence: 99%

“…Specifically, different users may choose the same devices to transmit their data or some devices may never handle any user packets, which leads to duplication of telemetry or coverage incompleteness of the entire network. Recently, many works attempt to extend the framework of original INT to support network-wide telemetry [20][21][22]. In these works, crafted probes are sent to travel specific paths and collect the network states.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast and On-demand Network-wide Telemetry via Cluster Based Path Planning

Du Chen,

Deyun Gao

et al. 2023

Journal of Internet Technology

View full text Add to dashboard Cite

<p>In-band Network Telemetry (INT) has profoundly promoted the network visibility. However, the existing solutions either face Maximum Transmission Unit (MTU) limitation or latency issue due to continuous insertion of INT metadata along long forwarding paths. In addition, conducting telemetry using user packets is prone to result in duplicate telemetry and fall short to achieve network-wide telemetry. In this work, we propose NetworkSight to comprehensively resolve these problems through cluster based path planning and source routing based on-demand forwarding. Specifically, a cluster based path planning algorithm is designed to generate several balanced short forwarding paths that cover the entire network. As a consequence, the MTU limitation is overcome and the telemetry latency can be reduced. Instead of operating on user packets, NetworkSight sends crafted probes built on source routing to travel synchronously over the generated forwarding paths. With these improvements, network-wide telemetry is achieved. Besides, we define a suite of telemetry primitives and develop corresponding APIs for users to flexibly express their telemetry requirements. Extensive experimental results show that NetworkSight can generate more balanced forwarding paths. The results show that it outperforms state-of-the-art mechanisms, where it reduces the telemetry latency by tens of milliseconds.</p> <p> </p>

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Fast and On-demand Network-wide Telemetry via Cluster Based Path Planning

Du Chen,

Deyun Gao

et al. 2023

Journal of Internet Technology

View full text Add to dashboard Cite

show abstract

“…• Reconfigurability: the parser and the processing logic can be redefined in the field. Variations [54][55][56][57][58][59][60][61][62] Collectors and Solutions [63][64][65][66][67] Congestion Control [68][69][70][71][72][73][74][75][76] Measurements AQM [99][100][101][102][103][104][105][106][107][108][109] QoS and TM [110][111][112][113][114] Multicast [115][116][117] Load Balancing [118][119][120][121][122][123][124][125]…”

Section: P4 Languagementioning

confidence: 99%

“…The idea is to transform network troubleshooting into pattern recognition problems after encoding the traffic status into a series of bitmap images. A subsequent work by Lin et al [62] that extends NetVision, referred to as NetView [62], was proposed. The objective of NetView is to achieve on-demand network-wide telemetry.…”

Section: ) Active Network Telemetrymentioning

confidence: 99%

An Exhaustive Survey on P4 Programmable Data Plane Switches: Taxonomy, Applications, Challenges, and Future Trends

2021

View full text Add to dashboard Cite

Traditionally, the data plane has been designed with fixed functions to forward packets using a small set of protocols. This closed-design paradigm has limited the capability of the switches to proprietary implementations which are hard-coded by vendors, inducing a lengthy, costly, and inflexible process. Recently, data plane programmability has attracted significant attention from both the research community and the industry, permitting operators and programmers in general to run customized packet processing functions. This open-design paradigm is paving the way for an unprecedented wave of innovation and experimentation by reducing the time of designing, testing, and adopting new protocols; enabling a customized, top-down approach to develop network applications; providing granular visibility of packet events defined by the programmer; reducing complexity and enhancing resource utilization of the programmable switches; and drastically improving the performance of applications that are offloaded to the data plane. Despite the impressive advantages of programmable data plane switches and their importance in modern networks, the literature has been missing a comprehensive survey. To this end, this paper provides a background encompassing an overview of the evolution of networks from legacy to programmable, describing the essentials of programmable switches, and summarizing their advantages over Softwaredefined Networking (SDN) and legacy devices. The paper then presents a unique, comprehensive taxonomy of applications developed with P4 language; surveying, classifying, and analyzing more than 200 articles; discussing challenges and considerations; and presenting future perspectives and open research issues.

show abstract

“…Recent systems relying on network query refinement [54], such as Turboflow [73] and *Flow [74], allow the data plane to offload simple packet features to servers for aggregation and processing. However, differently from FlowLens, such a strategy may increase the risks of network congestion and introduce scalability bottlenecks in large networks [41,87].…”

Section: Related Workmentioning

confidence: 99%