Proceedings of the 7th Asia-Pacific Workshop on Networking最新文献_第2页

Toward Fair and Efficient Congestion Control: Machine Learning Aided Congestion Control (MLACC)

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603275

Ahmed Elbery, Yi Lian, Geng Li

{"title":"Toward Fair and Efficient Congestion Control: Machine Learning Aided Congestion Control (MLACC)","authors":"Ahmed Elbery, Yi Lian, Geng Li","doi":"10.1145/3600061.3603275","DOIUrl":"https://doi.org/10.1145/3600061.3603275","url":null,"abstract":"Emerging inter-datacenter applications require massive loads of data transfer which makes them sensitive to packet drops, high latency, and fair resource sharing. However, current congestion control (CC) protocols do not guarantee the optimal outcome of these metrics. In this paper, we introduce a new CC technique, Machine Learning Aided Congestion Control (MLACC), that combines heuristics and machine learning (ML) to improve these three network metrics. The proposed technique achieves a high level of fairness, minimum latency, and minimum drop rate. ML is utilized to estimate the ratio of the available bandwidth of the bottleneck link while the heuristic uses this ratio to enable end-points to cooperatively limit the shared bottleneck link utilization under a predefined threshold in order to minimize latency and drop rate. The key to achieving the desired fairness is using the gradient of the link utilization to control the sending rate. We compared MLACC to BBR (which is at least on par with the state-of-the-art ML-based techniques) as a base case in different network settings. The results show that MLACC can achieve lower and more stable end-to-end latency (25% to 52% latency saving). It also significantly reduces packet drop rates while attaining a higher fairness level. The only cost for these advantages is a small throughput reduction of less than 3.5%.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126847792","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

SlimeMold: Hardware Load Balancer at Scale in Datacenter SlimeMold:数据中心的大规模硬件负载均衡器

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600067

Ziyuan Liu, Zhixiong Niu, Ran Shu, Liang Gao, Guohong Lai, Na Wang, Zongying He, Jacob Nelson, Dan R. K. Ports, Lihua Yuan, Peng Cheng, Y. Xiong

{"title":"SlimeMold: Hardware Load Balancer at Scale in Datacenter","authors":"Ziyuan Liu, Zhixiong Niu, Ran Shu, Liang Gao, Guohong Lai, Na Wang, Zongying He, Jacob Nelson, Dan R. K. Ports, Lihua Yuan, Peng Cheng, Y. Xiong","doi":"10.1145/3600061.3600067","DOIUrl":"https://doi.org/10.1145/3600061.3600067","url":null,"abstract":"Stateful load balancers (LB) are essential services in cloud data centers, playing a crucial role in enhancing the availability and capacity of applications. Numerous studies have proposed methods to improve the throughput, connections per second, and concurrent flows of single LBs. For instance, with the advancement of programmable switches, hardware-based load balancers (HLB) have become mainstream due to their high efficiency. However, programmable switches still face the issue of limited registers and table entries, preventing them from fully meeting the performance requirements of data centers. In this paper, rather than solely focusing on enhancing individual HLBs, we introduce SlimeMold, which enables HLBs to work collaboratively at scale as an integrated LB system in data centers. First, we design a novel HLB building block capable of achieving load balancing and exchanging states with other building blocks in the data plane. Next, we decouple forwarding and state operations, organizing the states using our proposed 2-level mapping mechanism. Finally, we optimize the system with flow caching and table entry balancing. We implement a real HLB building block using the Broadcom 56788 SmartToR chip, which attains line rate for state read and >1M OPS for flow write operations. Our simulation demonstrates full scalability in large-scale experiments, supporting 454 million concurrent flows with 512 state-hosting building blocks.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884548","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

Toward Privacy-Preserving Interdomain Configuration Verification via Multi-Party Computation 基于多方计算的保护隐私域间配置验证研究

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600064

Huisan Xu, Qiuyue Qin, Xing Fang, Qiao Xiang, J. Shu

{"title":"Toward Privacy-Preserving Interdomain Configuration Verification via Multi-Party Computation","authors":"Huisan Xu, Qiuyue Qin, Xing Fang, Qiao Xiang, J. Shu","doi":"10.1145/3600061.3600064","DOIUrl":"https://doi.org/10.1145/3600061.3600064","url":null,"abstract":"Interdomain network configuration errors can lead to disastrous financial and social consequences. Although substantial progress has been made in using formal methods to verify whether network configurations conform to certain properties, current tools focus on a single network. The fundamental challenge of configuration verification in an interdomain network is privacy, because each autonomous system (AS) treats its network configuration files as private information and is not willing to share it with others. In this paper, we take a first step toward interdomain network configuration verification and propose InCV, a privacy-preserving interdomain configuration verification system based on data-oblivious computation. Given an interdomain network, InCV allows ASes to collaboratively simulate the running of the network and verify the resulting interdomain routing information base (RIB) without revealing their network configurations to any party. Preliminary evaluation using real-world topologies and synthetic network configurations shows that InCV can verify an interdomain network of 32 ASes within ∼ 52 minutes with reasonable overhead.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060397","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

Gleaning the Consensus for Linearizable and Conflict-Free Per-Replica Local Reads 为线性化和无冲突的每个副本本地读取收集共识

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603175

Qing Li, Binjie Zhang, Yong Jiang, Dan Zhao, Yuan Yang, Zhenhui Yuan

{"title":"Gleaning the Consensus for Linearizable and Conflict-Free Per-Replica Local Reads","authors":"Qing Li, Binjie Zhang, Yong Jiang, Dan Zhao, Yuan Yang, Zhenhui Yuan","doi":"10.1145/3600061.3603175","DOIUrl":"https://doi.org/10.1145/3600061.3603175","url":null,"abstract":"The optimal read strategy for strong consistent key-value applications is to enable the per-replica local reads that each replica has the ability to serve reads locally. Unfortunately, current schemes for the per-replica local reads are perplexed by two issues. First, some schemes have to violate the per-replica local reads when the workload is skewed, degrading the throughput. Second, most of current schemes rely on leases or a specialized hardware to guarantee the linearizability, bringing difficulties to the deployment. In this paper, we proposes Glean, a linearizable read protocol that solves the issues of current schemes. In Glean, replica nodes always serve reads locally and we ask clients to validate the linearizability. To achieve the validation, Glean designs a novel read algorithm that allows the client to glean a consensus hint from replicas and enables replicas to contribute to the validation lightweight and fast. We implement Glean with a widely-used software stack. Our 3-replica evaluation shows that the throughput of Glean is at most 2.1 × to the throughput of an unreplicated application under heavy-read workloads.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132504447","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

A Hierarchical Routing Mechanism for Service in CPN CPN中服务的分层路由机制

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603120

Jiacong Li, Hang Lv, Bo Lei, Yunpeng Xie

引用次数: 0

Time Synchronization based on Time Difference of Arrival with Propagation Delay Estimation in 5G-TSN Integrated Networks 5G-TSN综合网络中基于到达时间差和传播延迟估计的时间同步

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603139

Xiaocong Wei, Yueping Cai, Xiaowen Zhang

引用次数: 0

Bamboo: Boosting Training Efficiency for Real-Time Video Streaming via Online Grouped Federated Transfer Learning Bamboo:通过在线分组联邦迁移学习提高实时视频流的训练效率

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600069

Qian-Zhen Zheng, Hao Chen, Zhanghui Ma

引用次数: 0

Deadline Enables In-Order Flowlet Switching for Load Balancing Deadline启用按顺序流切换以实现负载平衡

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603126

Xinglong Diao, Wenting Wei, Huaxi Gu

引用次数: 0

MRP: An Energy Efficient Network Protocol That Avoids Multiple Encryption in Cloud Computing Environment MRP:云计算环境下避免多重加密的高能效网络协议

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603131

Fenglai Jiang, Yongyang Cheng, Boqin Qin, T. Zhang

引用次数: 0

The core nodes identification method through adjustable network topology information 通过可调整的网络拓扑信息识别核心节点的方法

Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603127

Xuemei Wang, Seung-Hyun Seo, Changda Wang

引用次数: 0