发布求助
文献互助 智能选刊 最新文献

Proceedings of the Symposium on Architectures for Networking and Communications Systems最新文献

筛选
英文 中文
Heavy Hitter Detection on Multi-Pipeline Switches 多管道交换机的重磅攻击检测
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502760
F. Verdi, Marco Chiesa
{"title":"Heavy Hitter Detection on Multi-Pipeline Switches","authors":"F. Verdi, Marco Chiesa","doi":"10.1145/3493425.3502760","DOIUrl":"https://doi.org/10.1145/3493425.3502760","url":null,"abstract":"Recently, several applications have been designed and implemented to run entirely in the dataplane. However, most if not all the applications assume that network traffic traverses the same pipe, from ingress to egress inside the switch. While this seems to be a natural assumption, it does not hold for current programmable hardware that supports two to four pipes and network traffic is spread among the different pipes. As a consequence, several applications may not work properly in a multi-pipe architecture and need to be redesigned to fit into such architectural constraint. In this paper, we call the attention to this challenge and elaborate on an initial solution for counting heavy hitters (HH) in a multi-pipe hardware (MPHH). Our solution keeps the HH counter only in the egress pipeline while temporarily caching the hashes at the ingress pipeline. We then carry the hashes from ingress to egress by using data packets so that the HH are counted only in the egress pipeline. We present our design around this issue, the challenges observed so far and some initial results.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114342259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Kubernetes Load-balancing and related network functions using P4 Kubernetes使用P4实现负载均衡和相关网络功能
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502768
Nupur Jain, Vinoth Mohan, Anjali Singhai, Debashis Chatterjee, Dan Daly
{"title":"Kubernetes Load-balancing and related network functions using P4","authors":"Nupur Jain, Vinoth Mohan, Anjali Singhai, Debashis Chatterjee, Dan Daly","doi":"10.1145/3493425.3502768","DOIUrl":"https://doi.org/10.1145/3493425.3502768","url":null,"abstract":"This paper highlights the use of the P4 language for the development of a Kubernetes load balancer and related network functions that address scale, security, and network performance requirements. Load balancers have multiple deployment scenarios from edge to data center clusters, including per-node application load distributions. A P4 data plane running on an Infrastructure Processing Unit (IPU) can serve as a highly performant, secure and flexible data plane for Container Network Interfaces (CNI) like Calico. Using P4, we can identify the packet headers and operator specific fields for load balancing with consistent service delivery across multi-cloud environments. Challenges like per flow monitoring, on-demand autoscaling and adding network policy ACLs (Access Control Lists) can be addressed with software and P4 data plane extensions on an IPU, eventually paving the path for modernized service mesh delivery.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117229355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Shortcutting Fast Failover Routes in the Data Plane 数据平面快速故障切换路由
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-11-29 DOI: 10.1145/3493425.3502751
Apoorv Shukla, Klaus-Tycho Foerster
{"title":"Shortcutting Fast Failover Routes in the Data Plane","authors":"Apoorv Shukla, Klaus-Tycho Foerster","doi":"10.1145/3493425.3502751","DOIUrl":"https://doi.org/10.1145/3493425.3502751","url":null,"abstract":"In networks, availability is of paramount importance. As link failures are disruptive, modern networks in turn provide Fast ReRoute (FRR) mechanisms to rapidly restore connectivity. However, existing FRR approaches heavily impact performance until the slower convergence protocols kick in. The fast failover routes commonly involve unnecessary loops and detours, disturbing other traffic while causing costly packet loss. In this paper, we make a case for augmenting FRR mechanisms to avoid such inefficiencies. We introduce ShortCut that routes the packets in a loop free fashion, avoiding costly detours and decreasing link load. ShortCut achieves this by leveraging data plane programmability: when a loop is locally observed, it can be removed by short-cutting the respective route parts. As such, ShortCut is topology-independent and agnostic to the type of FRR currently deployed. Our first experimental simulations show that ShortCut can outperform control plane convergence mechanisms; moreover avoiding loops and keeping packet loss minimal opposed to existing FRR mechanisms.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths) 提高快速故障转移路由的弹性:TREE(扩展边缘不相交路径的树路由)
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-11-28 DOI: 10.1145/3493425.3502747
O. Schweiger, Klaus-Tycho Foerster, S. Schmid
{"title":"Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)","authors":"O. Schweiger, Klaus-Tycho Foerster, S. Schmid","doi":"10.1145/3493425.3502747","DOIUrl":"https://doi.org/10.1145/3493425.3502747","url":null,"abstract":"Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms of fast reroute mechanisms in the data plane, to bridge the gap to slow global control plane convergence. State-of-the-art fast reroute commonly relies on disjoint route structures, to offer multiple independent paths to the destination. We propose to leverage the network's path diversity to extend edge disjoint path mechanisms to tree routing, in order to improve the performance of fast rerouting. We present two such tree-mechanisms in detail and show that they boost resilience by up to 12% and 25% respectively on real-world, synthetic, and data center topologies. Whereas the first method retains the stretch of edge disjoint path mechanisms, our second method increases it depending on the use case, just below 8% for networks from Topology Zoo on average, but by up to 56% for random graphs in the Erdős-Rényi model.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130367749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信