Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing最新文献

Optimization of relay placement for scalable virtual private LAN services 可扩展虚拟专用局域网服务的中继放置优化

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545719

Mohammad Borhani, Ioannis Avgouleas, A. Gurtov

{"title":"Optimization of relay placement for scalable virtual private LAN services","authors":"Mohammad Borhani, Ioannis Avgouleas, A. Gurtov","doi":"10.1145/3527974.3545719","DOIUrl":"https://doi.org/10.1145/3527974.3545719","url":null,"abstract":"Virtual Private LAN Services are becoming popular for securely connecting geographically dispersed devices to a common protected LAN network isolated from the rest of the Internet. Traditional IP routing protocols cannot provide such connectivity; thus an overlay network of encrypted HIP/IPsec tunnels can be used instead. However, the number of full-mesh tunnels between communicating devices grows exponentially to the number of devices thereby suggesting the investigation of alternatives. The introduction of relaying, which entails selecting a subset of hub routers to retain full-mesh connectivity, allows non-hub routers, the so-called spokes, to maintain connectivity via a hub. In this work, we study the effect of relay-based routing that minimizes the number of hubs, the connection cost between spokes and hubs, the cost of connecting hubs, and the hubs deployment cost. Additionally, we prove that this minimization problem is NP-hard and, thus, intractable for large scale networks. Therefore, we propose an algorithm with provable guarantees that provides an approximate but efficient solution. Initial simulation results indicate a reduction by more than 90% in the memory required for routing tables at the expense of a minor increase in the tunnel path length.","PeriodicalId":294749,"journal":{"name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126831274","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}

引用次数: 0

Attaining stable and loop-free inter-domain routing without path vectors 实现稳定、无环路的域间路由，不需要路径向量

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545718

J. Garcia-Luna-Aceves

引用次数: 2

Enabling granularity-customizable geocast in network layer using P4-based software defined network 使用基于p4的软件定义网络，在网络层启用可定制粒度的地理广播

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545720

Xindi Hou, Shuai Gao, Ningchun Liu, Gaofeng Hong

{"title":"Enabling granularity-customizable geocast in network layer using P4-based software defined network","authors":"Xindi Hou, Shuai Gao, Ningchun Liu, Gaofeng Hong","doi":"10.1145/3527974.3545720","DOIUrl":"https://doi.org/10.1145/3527974.3545720","url":null,"abstract":"Geocast is a one-to-many communication paradigm for sending the data packets to a designated area rather than an IP address. However, the traditional IP-based solutions cannot cope with the challenges in flexibility, mobility, and implementation overhead in situations where users are requiring a granularity-customizable geocast. Therefore, we propose to implement the granularity-customizable geocast at the edge of the network by embedding a novel network-layer addressing scheme using P4-based Software Defined Network (SDN). In this paper, a geographic subdivision and coding method named EMD is used to subdivide the global region. Then, we introduce the GeoIP as the network address and propose a GeoIP packet processing scheme by utilizing P4. The proposed GeoIP-based addressing scheme is deployed at the edge of the network. To make our design compatible with the current Internet, a Geolocation Name Service (GNS) system is designed to support the Internet-wide geocast. In addition, a prototype system is built to implement and evaluate our design. Experiment results show that the proposed design is feasible to provide granularity-customizable geocast at a relatively low cost.","PeriodicalId":294749,"journal":{"name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661354","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}

引用次数: 0

Providing more than 'just' reachability through semantic networking 通过语义网络提供的不仅仅是可达性

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3546974

D. Trossen, A. Farrel, Daniel King, M. Boucadair, L. M. C. Murillo

引用次数: 1

Supporting future internet services with extensible in-band processing (EIP) 通过可扩展带内处理(EIP)支持未来的互联网服务

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545727

S. Salsano, Giulio Sidoretti, Carmine Scarpitta, Hesham El Backoury, D. López, L. Bracciale, P. Loreti

{"title":"Supporting future internet services with extensible in-band processing (EIP)","authors":"S. Salsano, Giulio Sidoretti, Carmine Scarpitta, Hesham El Backoury, D. López, L. Bracciale, P. Loreti","doi":"10.1145/3527974.3545727","DOIUrl":"https://doi.org/10.1145/3527974.3545727","url":null,"abstract":"Networking architectures need to evolve to support the requirements of future Internet services and 6G networks. In this paper we propose an evolutionary solution that extends the IPv6 networking architecture fully supporting the needs of future services, called Extensible In-band Processing (EIP). The EIP solution considers a feature-rich networking layer, in which hosts and routers can cooperate by reading and writing the EIP information in the IPv6 packet headers, to support a number of use cases. Example use case are: advanced monitoring, semantic routing, deterministic networking, slicing and so on. This list of use cases is not exhaustive, as a key feature of EIP is to be extensible for the support of new use cases. In the paper we describe the initial design of the EIP header and protocol mechanisms. We have released an open source prototype implementation of EIP for Linux OS, based on the eBPF packet processing framework. The implementation includes tools for the generation of test EIP packets and for the protocol dissection of packets. A replicable testbed provides an early demonstration of the advanced monitoring and semantic routing use cases.","PeriodicalId":294749,"journal":{"name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125411356","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}

引用次数: 4

Topological addressing enabling energy efficient IoT communication 拓扑寻址实现高能效物联网通信

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545722

Guangpeng Li, D. Lou, L. Iannone

引用次数: 0

A first step towards checking BGP routes in the dataplane 检查数据平面中的BGP路由的第一步

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545723

Thomas Wirtgen, O. Bonaventure

引用次数: 0

On-path vs off-path traffic steering, that is the question 道路上与非道路交通转向，这是一个问题

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545721

K. Khandaker, D. Trossen, Jinze Yang, Z. Despotovic, G. Carle

引用次数: 0

Fast and efficient lookups via data-driven FIB designs 通过数据驱动的FIB设计快速高效的查找

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545728

S. Ashok, Aditi Partap, Ammar Tahir

{"title":"Fast and efficient lookups via data-driven FIB designs","authors":"S. Ashok, Aditi Partap, Ammar Tahir","doi":"10.1145/3527974.3545728","DOIUrl":"https://doi.org/10.1145/3527974.3545728","url":null,"abstract":"With the rapidly growing number of hosts connected to the internet, there is an ever-increasing demand for fast and inexpensive switch memory. At the same time, the number of network functions handled at the switch, especially in the case of a programmable switch, is increasing steadily (e.g., for the purposes of routing, telemetry, load balancing), which require dedicated memory. Various compact and efficient data structures (e.g., Bloom filters [15], ludo hashes [10], cuckoo filters [3]) have been proposed in the past to address these needs. However, these data structures can provide varying performance depending on the distribution of the actual key-value pairs they store. In addition, several of these data structures are probabilistic in nature and hence also trade-off on accuracy to achieve a lower memory usage. In our work, we propose using data-driven approaches to analyze these key-value pairs (i.e., FIB lookup data) for patterns which can aid in building more informed FIB designs. Primarily, we argue that using an ensemble model comprising of hash tables and Bloom filters (the composition as dictated by the data) can better meet the specific requirements (processing speed, available memory, accuracy level) of the given switch. In this paper, we present a spectrum of designs that are possible within this space and implement one specific prototype. Finally, we present preliminary evaluation of this prototype using enterprise network data to support our proposal.","PeriodicalId":294749,"journal":{"name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124048107","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}

引用次数: 0

Meshed tree routing in folded-clos topologies 折叠闭合拓扑中的网状树路由

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI: 10.1145/3527974.3545717

P. Willis, N. Shenoy

引用次数: 0