Deploying PolKA Source Routing in P4 Switches : (Invited Paper)

2021 International Conference on Optical Network Design and Modeling (ONDM)(2021)

引用 3|浏览6
暂无评分
摘要
One great challenge of modern networks is how to select paths and react to highly variable and demanding traffic patterns. In recent years, emerging networking languages and architectures, such as P4/PISA, have created unprecedented opportunities for rapidly prototyping disruptive solutions in programmable data planes. In this direction, source routing (SR) is a prominent alternative to conventional table-based routing, since it reduces the convergence time of building distributed routing tables. In particular, PolKA explores the polynomial residue number system (RNS) for a fully stateless SR, i.e., no state update on packet headers needs to be conveyed along the route. This paper reports the deployment of PolKA in a continental testbed composed of P4 programmable switches. Results for end-to-end throughput and forwarding latency show that PolKA matches the data plane performance of traditional approaches, while paving the way for further innovative applications by exploring RNS properties in dynamic scenarios.
更多
查看译文
关键词
P4-PISA networking languages,PolKA source routing,distributed routing tables,programmable data planes,data plane performance,P4 programmable switches,packet headers,polynomial residue number system,convergence time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要