Longest Prefix Matching with Pruning.


https://doi.org/10.1109/HPSR.2019.8808125
@inproceedings{DBLP:conf/hpsr/LiuHYG0L19, author = {Lingtong Liu and Jun Hu and Yibo Yan and Siang Gao and Tong Yang and Xiaoming Li}, title = {Longest Prefix Matching with Pruning}, booktitle = {20th {IEEE} International Conference on High Performance Switching and Routing, {HPSR} 2019, Xi'an, China, May 26-29, 2019}, pages = {1--6}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/HPSR.2019.8808125}, doi = {10.1109/HPSR.2019.8808125}, timestamp = {Wed, 16 Oct 2019 14:14:57 +0200}, biburl = {https://dblp.org/rec/conf/hpsr/LiuHYG0L19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21