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%.
{"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}
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
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.
{"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}
Huisan Xu, Qiuyue Qin, Xing Fang, Qiao Xiang, J. Shu
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.
{"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}
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.
{"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}
Computing power network (CPN) has been proposed to allocate and schedule computing power resources among cloud, network, and edge according to the needs of computing services. CPN can improve the utilization rate of various computing resource pools. However, it brings other challenges that how to transfer data packets based on computing resource information. Since the size of routing table will be too large to store and search with lots of computing information. To solve this problem, we define three computing service types firstly. Then propose a hierarchical routing mechanism for computing services in CPN. Based on this mechanism, CPN can improve data forwarding efficiency and user experience. In the future, we will research standard of computing resource identification to provide more intelligent service for various application.
{"title":"A Hierarchical Routing Mechanism for Service in CPN","authors":"Jiacong Li, Hang Lv, Bo Lei, Yunpeng Xie","doi":"10.1145/3600061.3603120","DOIUrl":"https://doi.org/10.1145/3600061.3603120","url":null,"abstract":"Computing power network (CPN) has been proposed to allocate and schedule computing power resources among cloud, network, and edge according to the needs of computing services. CPN can improve the utilization rate of various computing resource pools. However, it brings other challenges that how to transfer data packets based on computing resource information. Since the size of routing table will be too large to store and search with lots of computing information. To solve this problem, we define three computing service types firstly. Then propose a hierarchical routing mechanism for computing services in CPN. Based on this mechanism, CPN can improve data forwarding efficiency and user experience. In the future, we will research standard of computing resource identification to provide more intelligent service for various application.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"211 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":"121216768","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}
This poster presents a time synchronization method based on the time difference of arrival (TDOA) with propagation delay estimation in 5G-TSN integrated networks. It improves the time synchronization accuracy about 8.9% compared to the conventional method based on the round trip delay estimation.
{"title":"Time Synchronization based on Time Difference of Arrival with Propagation Delay Estimation in 5G-TSN Integrated Networks","authors":"Xiaocong Wei, Yueping Cai, Xiaowen Zhang","doi":"10.1145/3600061.3603139","DOIUrl":"https://doi.org/10.1145/3600061.3603139","url":null,"abstract":"This poster presents a time synchronization method based on the time difference of arrival (TDOA) with propagation delay estimation in 5G-TSN integrated networks. It improves the time synchronization accuracy about 8.9% compared to the conventional method based on the round trip delay estimation.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"34 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":"128991989","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}
Most of the learning-based algorithms for bitrate adaptation are limited to offline learning, which inevitably suffers from the simulation-to-reality gap. Online learning can better adapt to dynamic real-time communication scenes but still face the challenge of lengthy training convergence time. In this paper, we propose a novel online grouped federated transfer learning framework named Bamboo to accelerate training efficiency. The preliminary experiments validate that our method remarkably improves online training efficiency by up to 302% compared to other reinforcement learning algorithms in various network conditions while ensuring the quality of experience (QoE) of real-time video communication.
{"title":"Bamboo: Boosting Training Efficiency for Real-Time Video Streaming via Online Grouped Federated Transfer Learning","authors":"Qian-Zhen Zheng, Hao Chen, Zhanghui Ma","doi":"10.1145/3600061.3600069","DOIUrl":"https://doi.org/10.1145/3600061.3600069","url":null,"abstract":"Most of the learning-based algorithms for bitrate adaptation are limited to offline learning, which inevitably suffers from the simulation-to-reality gap. Online learning can better adapt to dynamic real-time communication scenes but still face the challenge of lengthy training convergence time. In this paper, we propose a novel online grouped federated transfer learning framework named Bamboo to accelerate training efficiency. The preliminary experiments validate that our method remarkably improves online training efficiency by up to 302% compared to other reinforcement learning algorithms in various network conditions while ensuring the quality of experience (QoE) of real-time video communication.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"24 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":"116839827","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}
Fine granularity can greatly enhance load balancing opportunities, but packet reordering is still a challenge. In this paper, we propose EDFLet, a flowlet switching mechanism that uses deadlines to achieve in-order flowlet-level load balancing. We assign a deadline value to each packet of a flowlet based on its burst interval, which ensures that an earlier flowlet completes transmission before the next flowlet of the same flow. We also apply Earliest Deadline First scheduling at the switch, which guarantees that packets that packets meet their deadlines and arrive in order at the receiver. Our experimental results show that EDFLet performs better than existing methods in both symmetric and asymmetric topologies.
{"title":"Deadline Enables In-Order Flowlet Switching for Load Balancing","authors":"Xinglong Diao, Wenting Wei, Huaxi Gu","doi":"10.1145/3600061.3603126","DOIUrl":"https://doi.org/10.1145/3600061.3603126","url":null,"abstract":"Fine granularity can greatly enhance load balancing opportunities, but packet reordering is still a challenge. In this paper, we propose EDFLet, a flowlet switching mechanism that uses deadlines to achieve in-order flowlet-level load balancing. We assign a deadline value to each packet of a flowlet based on its burst interval, which ensures that an earlier flowlet completes transmission before the next flowlet of the same flow. We also apply Earliest Deadline First scheduling at the switch, which guarantees that packets that packets meet their deadlines and arrive in order at the receiver. Our experimental results show that EDFLet performs better than existing methods in both symmetric and asymmetric topologies.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"30 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":"114794018","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}
Fenglai Jiang, Yongyang Cheng, Boqin Qin, T. Zhang
To ensure the security of data transmission on the Internet, users usually encrypt the data during the process of sending and receiving data. For example, the commonly used HTTPS protocol verifies the identity of servers through TLS certificates and encrypts communication between browsers and servers. However, the encrypted part of the unstructured data is still re-encrypted by TLS during HTTPS transmission, wasting computing and energy resources. In this paper, we propose an energy efficient network protocol, namely MRP, that avoids multiple encryption. MRP could carry multiple types of application layer protocols, while freely configure the location and encryption approaches of the data that needs to be encrypted. Based on our proposed, users could freely segment application layer data, achieve on-demand encryption of data, reduce encryption costs without compromising user security requirements, avoid redundant double encryption and save energy.
{"title":"MRP: An Energy Efficient Network Protocol That Avoids Multiple Encryption in Cloud Computing Environment","authors":"Fenglai Jiang, Yongyang Cheng, Boqin Qin, T. Zhang","doi":"10.1145/3600061.3603131","DOIUrl":"https://doi.org/10.1145/3600061.3603131","url":null,"abstract":"To ensure the security of data transmission on the Internet, users usually encrypt the data during the process of sending and receiving data. For example, the commonly used HTTPS protocol verifies the identity of servers through TLS certificates and encrypts communication between browsers and servers. However, the encrypted part of the unstructured data is still re-encrypted by TLS during HTTPS transmission, wasting computing and energy resources. In this paper, we propose an energy efficient network protocol, namely MRP, that avoids multiple encryption. MRP could carry multiple types of application layer protocols, while freely configure the location and encryption approaches of the data that needs to be encrypted. Based on our proposed, users could freely segment application layer data, achieve on-demand encryption of data, reduce encryption costs without compromising user security requirements, avoid redundant double encryption and save energy.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"4 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":"121125105","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}
A social network has an in-born core-fringe structure. To increase the core nodes resolution, the paper proposes a new method, named KSCNR (K-Shell and Salton index based core node recognition) method, that combines both the local network topology features (Salton index with gravitational centrality) and the global network topology features (K-Shell iteration) to identify core nodes. The KSCNR method utilizes the weights to adjust the influences of the local and the global topology features according to the core nodes preferences, which makes the KSCNR method suitable for different social network scenarios. The experimental results show that the KSCNR method outperforms the known methods such as the K-Shell, the BC, the DC and the CC methods in the light of both effectiveness and accuracy.
社交网络具有与生俱来的核心-边缘结构。为了提高核心节点的分辨率，本文提出了一种结合局部网络拓扑特征(带引力中心性的Salton指数)和全局网络拓扑特征(K-Shell迭代)来识别核心节点的新方法KSCNR (K-Shell and Salton index based core node recognition)。KSCNR方法利用权重根据核心节点的偏好来调整局部和全局拓扑特征的影响，使得KSCNR方法适用于不同的社交网络场景。实验结果表明，KSCNR方法在有效性和准确性方面都优于K-Shell、BC、DC和CC方法。
{"title":"The core nodes identification method through adjustable network topology information","authors":"Xuemei Wang, Seung-Hyun Seo, Changda Wang","doi":"10.1145/3600061.3603127","DOIUrl":"https://doi.org/10.1145/3600061.3603127","url":null,"abstract":"A social network has an in-born core-fringe structure. To increase the core nodes resolution, the paper proposes a new method, named KSCNR (K-Shell and Salton index based core node recognition) method, that combines both the local network topology features (Salton index with gravitational centrality) and the global network topology features (K-Shell iteration) to identify core nodes. The KSCNR method utilizes the weights to adjust the influences of the local and the global topology features according to the core nodes preferences, which makes the KSCNR method suitable for different social network scenarios. The experimental results show that the KSCNR method outperforms the known methods such as the K-Shell, the BC, the DC and the CC methods in the light of both effectiveness and accuracy.","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":"134015758","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：