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

Proceedings of the 7th Asia-Pacific Workshop on Networking最新文献

筛选
英文 中文
Scaling Switch-driven Flow Control with Aquarius 缩放开关驱动的流量控制水瓶座
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600066
Wenxue Li, Chaoliang Zeng, Jinbin Hu, Kai Chen
{"title":"Scaling Switch-driven Flow Control with Aquarius","authors":"Wenxue Li, Chaoliang Zeng, Jinbin Hu, Kai Chen","doi":"10.1145/3600061.3600066","DOIUrl":"https://doi.org/10.1145/3600061.3600066","url":null,"abstract":"As datacenter networks support more diverse applications and faster link speeds, effective end-to-end congestion control becomes increasingly challenging due to the inherent feedback delay. To address this issue, switch-driven per-hop flow control (FC) has gained popularity due to its natural flow isolation, timely control loop, and ability to handle transient congestion. However, the ideal FC requires impractical hardware resources, and the state-of-the-art approximation approach still demands a large number of queues that exceeds common switch capabilities, limiting scalability in practice. In this paper, we propose Aquarius, a scalable solution for per-hop FC that maintains satisfactory flow isolation with a practical number of queues. The key idea of Aquarius is to take independent control of different flows within the same queue, discarding the traditional practice of managing traffic collectively within the same queue. At its core, Aquarius applies a contribution-aware pausing mechanism on congested switches to enable individual control decisions for arriving flows, and uses an opportunistic re-assigning strategy on upstream switches to further isolate congested and victim flows. Experimental results demonstrate that Aquarius maintains comparable performance with 4 × fewer queues, and achieves 5.5 × lower flow completion times using the same number of queues, compared to existing solutions.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"11 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":"124825840","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
An Improved Data Aggregation Scheme for Wireless Sensor Networks Based on Robust Chinese Remainder Theorem 一种改进的基于鲁棒中国剩余定理的无线传感器网络数据聚合方案
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603176
Jinxin Zhang, Fuyou Miao
{"title":"An Improved Data Aggregation Scheme for Wireless Sensor Networks Based on Robust Chinese Remainder Theorem","authors":"Jinxin Zhang, Fuyou Miao","doi":"10.1145/3600061.3603176","DOIUrl":"https://doi.org/10.1145/3600061.3603176","url":null,"abstract":"In wireless sensor networks (WSNs), energy efficiency, reliability, and non-plaintext transmission of the sensed data are major concerns, and all three of them are indispensable. Based on robust Chinese Remainder Theorem (RCRT), this paper proposes an improved data aggregation scheme to satisfy the requirements of energy efficiency, reliability, and non-plaintext transmission simultaneously. Compared with the existing RCRT-based data aggregation scheme, our improved RCRT-based data aggregation scheme tolerates an unrestricted error at the expense of certain energy saving.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"46 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":"132700195","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
Improving Cloud Storage Network Bandwidth Utilization of Scientific Applications 提高云存储网络带宽利用率的科学应用
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603122
Steven W. D. Chien, Kento Sato, Artur Podobas, Niclas Jansson, S. Markidis, Michio Honda
{"title":"Improving Cloud Storage Network Bandwidth Utilization of Scientific Applications","authors":"Steven W. D. Chien, Kento Sato, Artur Podobas, Niclas Jansson, S. Markidis, Michio Honda","doi":"10.1145/3600061.3603122","DOIUrl":"https://doi.org/10.1145/3600061.3603122","url":null,"abstract":"Cloud providers began to provide managed services to attract scientific applications, which have been traditionally executed on supercomputers. One example is AWS FSx for Lustre, a fully managed parallel file system (PFS) released in 2018. However, due to the nature of scientific applications, the frontend storage network bandwidth is left completely idle for the majority of its lifetime. Furthermore, the pricing model does not match the scalability requirement. We propose iFast, a novel host-side caching mechanism for scientific applications that improves storage bandwidth utilization and end-to-end application performance: by overlapping compute and data writeback through inexpensive local storage. iFast supports the Massage Passing Interface (MPI) library that is widely used by scientific applications and is implemented as a preloaded library. It requires no change to applications, the MPI library, or support from cloud operators. We demonstrate how iFast can accelerate the end-to-end time of a representative scientific application Neko, by 13–40%.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"36 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":"117141715","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
SegaNet: An Advanced IoT Cloud Gateway for Performant and Priority-Oriented Message Delivery SegaNet:一种高级物联网云网关，用于高性能和面向优先级的消息传递
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600072
Yeonho Yoo, Zhixiong Niu, C. Yoo, Peng Cheng, Y. Xiong
{"title":"SegaNet: An Advanced IoT Cloud Gateway for Performant and Priority-Oriented Message Delivery","authors":"Yeonho Yoo, Zhixiong Niu, C. Yoo, Peng Cheng, Y. Xiong","doi":"10.1145/3600061.3600072","DOIUrl":"https://doi.org/10.1145/3600061.3600072","url":null,"abstract":"With the tremendous growth of IoT, the role of IoT cloud gateways in facilitating communication between IoT devices and the cloud has become more important than ever before. Most previous studies have focused on developing interoperability between IoT and cloud to accommodate various radio protocols. However, they have often neglected the performance aspect of the IoT cloud gateway, leaving users with limited options: either purchasing multiple gateways or connecting only a small number of IoT devices. Through our comprehensive measurements and analysis, we identified five key issues in IoT cloud gateways related to high latency, CPU bottlenecks, inefficient network stacks on ARM, substantial encryption overhead, and the lack of priority support. To address these issues, we propose a new IoT cloud gateway - SegaNet. We carefully design with 1) multiple agents management, 2) efficient TLS encryption, and 3) priority-oriented message delivery. Our prototype evaluation shows up to 16.7 × lower latency and 4.5 × lower CPU consumption than gateways of the existing IoT-cloud ecosystem.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"42 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":"124240888","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
EasyQuantile: Efficient Quantile Tracking in the Data Plane EasyQuantile:有效的分位数跟踪在数据平面
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600084
Bo Wang, Rongqiang Chen, Lu Tang
{"title":"EasyQuantile: Efficient Quantile Tracking in the Data Plane","authors":"Bo Wang, Rongqiang Chen, Lu Tang","doi":"10.1145/3600061.3600084","DOIUrl":"https://doi.org/10.1145/3600061.3600084","url":null,"abstract":"Quantile tracking is an essential component of network measurement, where the tracked quantiles of the key performance metrics allow operators to better understand network performance. Given the high network speed and huge volume of traffic, the line-rate packet-processing performance and network visibility of programmable switches make it a trend to track quantiles in the programmable data plane. However, due to the rigorous resource constraints of programmable switches, quantile tracking is required to be both memory and computation efficient to be deployed in the data plane. In this paper, we present EasyQuantile, an efficient quantile tracking approach that has small constant memory usage and involves only hardware-friendly computations. EasyQuantile adopts an adjustable incremental update approach and calculates a pre-specified quantile with high accuracy entirely in the data plane. We implement EasyQuantile on Intel Tofino switches with small resource usage. Trace-driven experiments show that EasyQuantile achieves higher accuracy and lower complexities compared with state-of-the-art approaches.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"2 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":"126920177","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
FlexCore: Leveraging XDP-SCTP for Scalable and Resilient Network Slice Service in Future 5G Core FlexCore:利用XDP-SCTP在未来5G核心中提供可扩展和弹性的网络切片服务
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600073
Bhavishya Sharma, Shwetha Vittal, Antony Franklin
{"title":"FlexCore: Leveraging XDP-SCTP for Scalable and Resilient Network Slice Service in Future 5G Core","authors":"Bhavishya Sharma, Shwetha Vittal, Antony Franklin","doi":"10.1145/3600061.3600073","DOIUrl":"https://doi.org/10.1145/3600061.3600073","url":null,"abstract":"The control plane of 5G Core (5GC) is typically shared among multiple dependent network slices of the data plane. But as the number of dependent slices and services on the common and shared control plane increases, its resilience threat also increases. This paper proposes FlexCore: a 5GC that is not only flexible and scalable but also resilient to cater to various service requirements on both stateful and stateless architectures of 5GC. FlexCore is built with an eXpress Data Path (XDP) and extended Berkeley Packet Filter (eBPF) based SCTP load balancer hooked at the entry point of the 3GPP compliant 5GC control plane, and a set of micro-AMF instances to serve the user requests. Precisely, the FlexCore is fabricated to honor the variety of incoming user requests on the control plane as per the service requirements, like, per slice, per user, or per control procedure of users too. Experiments on a 3GPP compliant 5G testbed show that FlexCore can provide average latency reduction of up to 14% and 79% on stateful and stateless architectures, respectively, and up to 63% latency reduction for latency-critical slices on the slice-aware architecture.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"9 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":"128626247","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 Unified, Flexible Framework in Network Topology Generation for Distributed Machine Learning 分布式机器学习网络拓扑生成的统一、灵活框架
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603132
Jianhao Liu, Xiaoyan Li, Yanhua Liu, Weibei Fan
{"title":"A Unified, Flexible Framework in Network Topology Generation for Distributed Machine Learning","authors":"Jianhao Liu, Xiaoyan Li, Yanhua Liu, Weibei Fan","doi":"10.1145/3600061.3603132","DOIUrl":"https://doi.org/10.1145/3600061.3603132","url":null,"abstract":"In this study, we propose a unified framework for designing a class of server-centric network topologies for DML by adopting top-down design method and combinatorial design theory. Simulation results show that this flexible framework is capable of effectively supporting various DML tasks. Our framework can generate compatible topologies that meet various resource constraints and different DML tasks.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"27 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":"131465620","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
Training ChatGPT-like Models with In-network Computation 用网络内计算训练类chatgpt模型
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603136
Shuhao Fu, Yong Liao, Pengyuan Zhou
{"title":"Training ChatGPT-like Models with In-network Computation","authors":"Shuhao Fu, Yong Liao, Pengyuan Zhou","doi":"10.1145/3600061.3603136","DOIUrl":"https://doi.org/10.1145/3600061.3603136","url":null,"abstract":"ChatGPT shows the enormous potential of large language models (LLMs). These models can easily reach the size of billions of parameters and create training difficulties for the majority. We propose a paradigm to train LLMs using distributed in-network computation on routers. Our preliminary result shows that our design allows LLMs to be trained at a reasonable learning rate without demanding extensive GPU resources.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"6 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":"131090488","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
Diagnosing Distributed Routing Configurations Using Sequential Program Analysis 使用顺序程序分析诊断分布式路由配置
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3600065
Xing Fang, Lizhao You, Qiao Xiang, Hanyang Shao, Gao Han, Ziyi Wang, J. Shu, L. Kong
{"title":"Diagnosing Distributed Routing Configurations Using Sequential Program Analysis","authors":"Xing Fang, Lizhao You, Qiao Xiang, Hanyang Shao, Gao Han, Ziyi Wang, J. Shu, L. Kong","doi":"10.1145/3600061.3600065","DOIUrl":"https://doi.org/10.1145/3600061.3600065","url":null,"abstract":"In this paper, we show that by capturing the causal relationship among the computation of routers, one can transform the distributed program composed of routing processes into a sequential program, which allows the use of various sequential program analysis theories and tools for diagnosing and repairing routing configuration errors. This insight sheds light on future research on automatic network configuration diagnosis and repair. To demonstrate its feasibility and generality, we give the preliminary design of two methods for routing configuration error diagnosis: (1) data flow analysis using minimal unsatisfiable core and error invariants; and (2) control flow analysis using selective symbolic execution. Using real-world topologies and synthetic configurations, we show that both methods can effectively find errors in routing configurations while incurring reasonable overhead.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"1 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":"130683950","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}
引用次数: 2
DFR: Dynamic-thresold Fault-tolerant Routing for Fat Tree DFR:胖树的动态阈值容错路由
Proceedings of the 7th Asia-Pacific Workshop on Networking Pub Date : 2023-06-29 DOI: 10.1145/3600061.3603125
Binyan Lan, Fei Lei, Ketong Wu, Dezun Dong
{"title":"DFR: Dynamic-thresold Fault-tolerant Routing for Fat Tree","authors":"Binyan Lan, Fei Lei, Ketong Wu, Dezun Dong","doi":"10.1145/3600061.3603125","DOIUrl":"https://doi.org/10.1145/3600061.3603125","url":null,"abstract":"","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"2 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":"133022014","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信