2023 32nd International Conference on Computer Communications and Networks (ICCCN)最新文献_第5页

E-App: Adaptive mmWave Access Point Planning with Environmental Awareness in Wireless LANs E-App:无线局域网中具有环境意识的自适应毫米波接入点规划

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230133

Yuchen Liu, Mingzhe Chen, Dongkuan Xu, Zhaohui Yang, Shangqing Zhao

{"title":"E-App: Adaptive mmWave Access Point Planning with Environmental Awareness in Wireless LANs","authors":"Yuchen Liu, Mingzhe Chen, Dongkuan Xu, Zhaohui Yang, Shangqing Zhao","doi":"10.1109/ICCCN58024.2023.10230133","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230133","url":null,"abstract":"To enable ultra-high throughputs while addressing the potential blockage problem, maintaining an adaptive access point (AP) planning is critical to mmWave networking. By investigating the hidden interaction between the environment map and the placement of mmWave APs, we develop an adaptive AP planning (E-app) approach that can accurately sense the environment dynamics, reconstruct the obstacle map, and then predict the placements of mmWave APs adaptively. Specifically, our solution leverages mmWave radio itself to sniff the unacceptable performance degradation through sensing only a small fraction of observation points that are identified by a sparsity-aware analytical model, thereby accurately triggering a prediction module for AP positioning when necessary. Extensive evaluations show a very high prediction accuracy for our solution, which can provide around 25% improvement on user throughput performance in mmWave WLANs. This intelligent AP-planning framework well handles the environment dynamics that affect the average-case network performance, which is of utmost interest for network deployers because of its usage convenience and adaptivity.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114335118","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 Gateway Proxy with ECN Buffer Control for Inter-Datacenter Congestion Control 带ECN缓冲控制的网关代理数据中心间拥塞控制

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230141

Keita Aoki, M. Yamamoto

{"title":"A Gateway Proxy with ECN Buffer Control for Inter-Datacenter Congestion Control","authors":"Keita Aoki, M. Yamamoto","doi":"10.1109/ICCCN58024.2023.10230141","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230141","url":null,"abstract":"In a data center (DC) where inter- and intra-DC flows share high-speed data center networks (DCNs), these two types of flows have significantly different round-trip times (RTTs). When congestion occurs in a DCN, the congestion signal is detected first by the intra-DC flow, resulting in unfairness where only it reacts to congestion. This technical problem is especially important for the receiving DCN because the congestion point is far from the sender. To solve this issue, we propose DC performance enhancing proxy (DC-PEP) with ECN (Explicit Congestion Notification) buffer control as a proxy at the gateway of the receiving DCN. DC-PEP divides the end-to-end congestion control loop into two loops, which homogenizes the congestion loop inside the receiving DCN. To absorb the throughput difference between these two congestion loops, a buffer is required at DC-PEP. By implementing ECN-Echo notification, excessive queueing at DC-PEP can be avoided. Our simulation results show that our proposed DC-PEP with ECN improves fairness between inter- and intra-DC flows without incurring large queue sizes at the proxy.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822780","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

Deep Learning-based Transceiver with One-bit ADC Over Fading Channel 基于深度学习的衰落信道1位ADC收发器

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230206

Metasebia D. Gemeda, Minsig Han, A. T. Abebe, C. G. Kang

引用次数: 0

A Secure Federated Learning Approach to Smart Microgrid Stability Prediction 一种安全的联邦学习方法用于智能微电网稳定性预测

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230128

A. Reza, Anway Bose, Li Bai

{"title":"A Secure Federated Learning Approach to Smart Microgrid Stability Prediction","authors":"A. Reza, Anway Bose, Li Bai","doi":"10.1109/ICCCN58024.2023.10230128","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230128","url":null,"abstract":"This paper addresses the challenges posed by the proliferation of Internet-of-Things (IoT) based smart grids in modern power systems, which can threaten the stability and security of next-generation smart microgrids. Sharing sensitive information about suppliers and consumers to maintain communication with the primary grid can lead to breaches in confidentiality or availability, resulting in significant economic damage, loss of life, or national security threats. To reduce the risk of sensitive information exposure, the paper presents a secure federated learning framework that only allows microgrids to exchange their encrypted learned models that predict the grid's stability. The communication channel between the server and clients (microgrids) is authenticated using Transport Layer Security (TLS) protocols, and a Tree-based Group Diffie-Hellman (TGDH) group encryption scheme is employed to encrypt the model updates between the server and clients, ensuring the security of the data-link layer. Finally, the paper presents a comparative analysis to determine the impact of data sharing on the accuracy of stability predictions for each microgrid.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"21 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122578630","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

PLR: An In-Network Proactive Loss Recovery Scheme for Named Data Networking 命名数据网络的网络内主动损失恢复方案

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230118

Yuxin Chen, Jiayu Yang, Xuanbo Huang, Jiangping Han, Bobo Wang, Jian Li, Kaiping Xue

{"title":"PLR: An In-Network Proactive Loss Recovery Scheme for Named Data Networking","authors":"Yuxin Chen, Jiayu Yang, Xuanbo Huang, Jiangping Han, Bobo Wang, Jian Li, Kaiping Xue","doi":"10.1109/ICCCN58024.2023.10230118","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230118","url":null,"abstract":"With potential advantages over TCP/IP for content delivery, mobility, and security, Named Data Networking (NDN) has become a promising architecture for the next-generation network. However, its poor performance in reliable transmission is still an unsolved problem. Many existing schemes in NDN employ inaccurate retransmission timeouts calculated with RTTs from diverse content sources to detect packet loss, which is lagging and may deteriorate transmission performance. Besides, after identifying the loss, the consumer costly resends the request to recover it, further increasing recovery time. In this paper, we propose an in-network Proactive Loss Recovery (PLR) scheme, which provides an efficient in-network method for timely detection and proactive recovery of lost packets. Deployed on each router, PLR detects the loss by monitoring queue status and sends high-priority explicit feedback to notify consumers of loss events timely. Meanwhile, lost packets are stored in each router's cache and will be retransmitted at an adaptive rate based on the detected remaining bandwidth. The simulation shows that PLR can vastly reduce the number of retransmissions on consumers, and the content completion time can be decreased by up to 21.8% compared with the baseline.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131249700","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

Beam Profiling and Beamforming Modeling for mmWave NextG Networks 毫米波下一代网络的波束剖面和波束成形建模

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230100

E. Fathalla, Sahar Zargarzadeh, Chunsheng Xin, Hongyi Wu, Peng Jiang, Joao F. Santos, Jacek Kibiłda, Aloizio Pereira da Silva

{"title":"Beam Profiling and Beamforming Modeling for mmWave NextG Networks","authors":"E. Fathalla, Sahar Zargarzadeh, Chunsheng Xin, Hongyi Wu, Peng Jiang, Joao F. Santos, Jacek Kibiłda, Aloizio Pereira da Silva","doi":"10.1109/ICCCN58024.2023.10230100","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230100","url":null,"abstract":"This paper presents an experimental study on mmWave beam profiling on a mmWave testbed, and develops a machine learning model for beamforming based on the experiment data. The datasets we have obtained from the beam profiling and the machine learning model for beamforming are valuable for a broad set of network design problems, such as network topology optimization, user equipment association, power allocation, and beam scheduling, in complex and dynamic mmWave networks. We have used two commercial-grade mmWave testbeds with operational frequencies on the 27 Ghz and 71 GHz, respectively, for beam profiling. The obtained datasets were used to train the machine learning model to estimate the received downlink signal power, and data rate at the receivers (user equipment with different geographical locations in the range of a transmitter (base station). The results have showed high prediction accuracy with low mean square error (loss), indicating the model's ability to estimate the received signal power or data rate at each individual receiver covered by a beam. The dataset and the machine learning based beamforming model can assist researchers in optimizing various network design problems for mmWave networks.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131656221","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

Environmentally-Aware Robotic Vehicle Networks Routing Computation for Last-mile Deliveries 基于环境意识的机器人车辆网络最后一英里配送路径计算

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230089

Chengyi Qu, Rounak Singh, S. Srinivas, P. Calyam

{"title":"Environmentally-Aware Robotic Vehicle Networks Routing Computation for Last-mile Deliveries","authors":"Chengyi Qu, Rounak Singh, S. Srinivas, P. Calyam","doi":"10.1109/ICCCN58024.2023.10230089","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230089","url":null,"abstract":"For next-generation logistics management, robotic vehicles such as autonomous ground robots and aerial drones can alleviate the strain on last-mile distribution. They can help avoid on-road congestion, navigate hard-to-reach locations, and parallelize delivery operations. However, as the robotic vehicles move in a given delivery area, environmental barriers e.g., trees or buildings, affect air-to-air (A2A), air-to-ground (A2G), ground-to-ground (G2G) network communications on a hybrid truck-drone-robot system. In this paper, we present an environmentally-aware cooperative network routing computation scheme to avoid obstacle blockage in A2A/A2G/G2G network communications for addressing large-scale coordinated operations of the hybrid truck-drone-robot system. Specifically, we propose an offline policy-based routing algorithm and two online extensions (i.e., heuristics and learning-based) to solve the hybrid last-mile delivery vehicles communication problem in order to trade-off between end-to-end communication (i.e., increase network throughput) and delivery efficiencies (i.e., lower parcel delivery time consumption). We evaluate our scheme using state-of-the-art network routing algorithms in a trace-based simulator that integrates both the vehicles and networking sides. Performance evaluation results from our simulations show that: (i) our offline approach is Pareto-optimal among non-learning supported algorithms in a pre-delivery scenario, and (ii) our RL-based online algorithm achieves between 85–96 % of the Oracle strategy performance during delivery procedures.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133117643","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

Multigraph-Based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing 延迟容忍网络中基于多图的路由:接触图路由的替代方案

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230117

Alan Hylton, Michael Moy, Robert Kassouf-Short, Jacob Cleveland

{"title":"Multigraph-Based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing","authors":"Alan Hylton, Michael Moy, Robert Kassouf-Short, Jacob Cleveland","doi":"10.1109/ICCCN58024.2023.10230117","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230117","url":null,"abstract":"Satellites are leaving the realms of niche use, extending our day-to-day networked infrastructure to space - thereby forcing a generalization of network architectures. The Delay Tolerant Networking (DTN) protocol is being developed to give rise to this new Solar System Internet. Predominantly, DTNs in space use globally-distributed contact tables to compute routes. In this paper, we propose and analyze a novel optimized approach for route computations that improves upon traditional approaches. As the general DTN will always include some scheduled links, our new algorithm enables greater scalability and practicality of DTN routing. These contact tables include windows when two nodes can communicate and were classically organized into a contact graph, where the vertices represent contact opportunities. Because the complexity of a contact graph grows with the number of contacts, pathfinding on it does not scale. A new structure using multigraphs with the same data is proposed. We show that a multigraph-based approach, which we call contact multigrapb routing, exhibits performance superior to routing based on contact graphs, allowing greater scaling to schedule-based routing. In this paper, the multigraph-based algorithm is detailed and a proof is included showing it outperforms the previous algorithm given the same input. Pseudocode is included, as are simulation results. We conclude with suggested future work.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133147102","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

Early Marking for Controllable Maximum Queue Length in Data Center Networks 数据中心网络中可控最大队列长度的早期标记

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230181

Wentao Wang, Jiangping Han, Rui Zhuang, Kaiping Xue, Qibin Sun, Jun Lu

{"title":"Early Marking for Controllable Maximum Queue Length in Data Center Networks","authors":"Wentao Wang, Jiangping Han, Rui Zhuang, Kaiping Xue, Qibin Sun, Jun Lu","doi":"10.1109/ICCCN58024.2023.10230181","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230181","url":null,"abstract":"In data center networks (DCNs), numerous congestion control schemes utilize explicit congestion notification (ECN) to achieve low average queue delay. Such schemes generally mark packets based on the current queue length exceeding a marking threshold. However, due to the delay of ECN feedback, the queue length may further increase before the congestion notification is delivered to senders, which may lead to uncontrollable maximum queue length when bursts occur. In this paper, we propose an early ECN marking scheme based on prediction, E-ECN, to control the maximum queue length in DCNs. E-ECN uses predicted queue length rather than the current to indicate congestion with an advance time which offsets the hysteresis of ECN. We theoretically and experimentally demonstrate that early marking does not impact the throughput with appropriate selection of the advance time, and we provide guidelines for the selection in DCNs. Our simulation results show that E-ECN achieves shorter average queue delay and controllable maximum queue length in general with a bandwidth utilization guarantee. E-ECN greatly reduces queue overflow and improves the robustness of DCNs.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129545136","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

Value Trees: Multi-Hop and Asynchronous Economic Transactions in Distributed Systems 价值树:分布式系统中的多跳和异步经济事务

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230130

Puming Fang, T. Wolf

引用次数: 0