Pub Date : 2024-04-17DOI: 10.1109/LNET.2024.3390610
Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi
Aerial technologies represent a fundamental part of transport systems, and the overload of terrestrial transportation as well as the high demand in urban scenarios are forcing for new solutions. From this perspective, Urban Air Mobility (UAM) is emerging as an outperforming solution to guarantee high-speed vertical transportation taking advantage of low altitudes. Connectivity is a key factor for UAM vehicles, and mobile networks represent the best solution to provide immediate connectivity with high-performance and low expenses. This calls for the development of enhancement strategies for terrestrial radio access networks. This letter aims to investigate a strategy to provide connectivity for UAM vehicles while minimizing the number of base stations required to provide UAM connectivity. Insights on the impact of different design parameters on the number of enhanced BSs required to guarantee average and minimum throughput requirements for UAM users are provided.
{"title":"Enhancing Mobile Networks for Urban Air Mobility Connectivity","authors":"Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi","doi":"10.1109/LNET.2024.3390610","DOIUrl":"https://doi.org/10.1109/LNET.2024.3390610","url":null,"abstract":"Aerial technologies represent a fundamental part of transport systems, and the overload of terrestrial transportation as well as the high demand in urban scenarios are forcing for new solutions. From this perspective, Urban Air Mobility (UAM) is emerging as an outperforming solution to guarantee high-speed vertical transportation taking advantage of low altitudes. Connectivity is a key factor for UAM vehicles, and mobile networks represent the best solution to provide immediate connectivity with high-performance and low expenses. This calls for the development of enhancement strategies for terrestrial radio access networks. This letter aims to investigate a strategy to provide connectivity for UAM vehicles while minimizing the number of base stations required to provide UAM connectivity. Insights on the impact of different design parameters on the number of enhanced BSs required to guarantee average and minimum throughput requirements for UAM users are provided.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"110-114"},"PeriodicalIF":0.0,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10504640","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-10DOI: 10.1109/LNET.2024.3386974
Marc Jayson Baucas;Petros Spachos
Social media services enable global communication via instant messaging (IM) platforms. However, their widespread usage has resulted in server regulation issues because most are centralized, while they also pose privacy concerns due to endpoint-based security vulnerabilities. In response, we present a private blockchain-based IM platform that utilizes blockchains to secure data through immutability. We implement it in a RESTful Application Programming Interface (REST API) Web server for better load balancing compared to the centralized IM architectures via decentralization. We further implement end-to-end encryption (E2EE) using public-private key pairs to improve data privacy. We evaluated the proposed design by highlighting its advantages over centralized IM platforms.
{"title":"Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services","authors":"Marc Jayson Baucas;Petros Spachos","doi":"10.1109/LNET.2024.3386974","DOIUrl":"https://doi.org/10.1109/LNET.2024.3386974","url":null,"abstract":"Social media services enable global communication via instant messaging (IM) platforms. However, their widespread usage has resulted in server regulation issues because most are centralized, while they also pose privacy concerns due to endpoint-based security vulnerabilities. In response, we present a private blockchain-based IM platform that utilizes blockchains to secure data through immutability. We implement it in a RESTful Application Programming Interface (REST API) Web server for better load balancing compared to the centralized IM architectures via decentralization. We further implement end-to-end encryption (E2EE) using public-private key pairs to improve data privacy. We evaluated the proposed design by highlighting its advantages over centralized IM platforms.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"106-109"},"PeriodicalIF":0.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286738","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}
Pub Date : 2024-04-04DOI: 10.1109/LNET.2024.3385008
Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.
{"title":"DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks","authors":"Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki","doi":"10.1109/LNET.2024.3385008","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385008","url":null,"abstract":"This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"143-147"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286635","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}
Pub Date : 2024-04-04DOI: 10.1109/LNET.2024.3385679
Han Zhang;Halvin Yang;Guopeng Zhang
In federated learning (FL) systems, the parameter server (PS) and clients form a monopolistic market, where the number of PS is far less than the number of clients. To improve the performance of FL and reduce the cost to incentive clients, this letter suggests distinguishing the pricing of FL services provided by different clients, rather than applying the same pricing to them. The price is differentiated based on the performance improvements brought to FL by clients and their heterogeneity in computing and communication capabilities. To this end, a price-discrimination game (PDG) is formulated to comprehensively address the distributed resource management problems in FL, including multi-objective trade-off, client selection, and incentive mechanism. As the PDG includes a mixed-integer nonlinear programming problem, a distributed semi-heuristic algorithm with low computational complexity and low communication overhead is designed to solve the Nash equilibrium (NE) of the PDG. The simulation result verifies that the NE achieves a good tradeoff between the training loss, training time, and the cost of motivating clients to participate in FL.
{"title":"Price-Discrimination Game for Distributed Resource Management in Federated Learning","authors":"Han Zhang;Halvin Yang;Guopeng Zhang","doi":"10.1109/LNET.2024.3385679","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385679","url":null,"abstract":"In federated learning (FL) systems, the parameter server (PS) and clients form a monopolistic market, where the number of PS is far less than the number of clients. To improve the performance of FL and reduce the cost to incentive clients, this letter suggests distinguishing the pricing of FL services provided by different clients, rather than applying the same pricing to them. The price is differentiated based on the performance improvements brought to FL by clients and their heterogeneity in computing and communication capabilities. To this end, a price-discrimination game (PDG) is formulated to comprehensively address the distributed resource management problems in FL, including multi-objective trade-off, client selection, and incentive mechanism. As the PDG includes a mixed-integer nonlinear programming problem, a distributed semi-heuristic algorithm with low computational complexity and low communication overhead is designed to solve the Nash equilibrium (NE) of the PDG. The simulation result verifies that the NE achieves a good tradeoff between the training loss, training time, and the cost of motivating clients to participate in FL.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"124-128"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286613","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}
Pub Date : 2024-04-04DOI: 10.1109/LNET.2024.3385661
Diogo Pereira;Rodolfo Oliveira;Daniel Benevides da Costa;Hyong Kim
In recent medium access control (MAC) protocols, such as the ones adopted in IEEE 802.11ad and IEEE 802.11ay, stations mandatorily access one of the $N_{S} gt 0 $ consecutive slots forming a frame. This can be seen as a variant of the traditional slotted-aloha (SA), where instead of accessing a slot with probability p and not accessing in the finite frame with probability $(1-p)^{N_{S}}$ , a station always accesses at least once in a frame, i.e., stations mandatorily access in a frame’s slot. Additionally, a station can also perform multiple retries in the frame when the previous attempt did not succeed. Given the lack of modeling efforts and performance evaluation for SA schemes with mandatory access and retries (SAMAR), in this letter, we evaluate the expected number of stations that can successfully access the channel in a frame composed of a finite number of slots. Contrarily to SA, the analysis of SAMAR performance is challenging due to its enumerative nature. We propose an innovative recursive model of SAMAR performance, showing that SAMAR can achieve higher performance than that of SA parameterized with asymptotically optimal access probabilities. A comparative analysis shows the operational region where SAMAR overpasses SA’s performance, which is of crucial importance to define the number of slots of the SAMAR frame.
在最近的介质访问控制（MAC）协议中，例如在 IEEE 802.11ad 和 IEEE 802.11ay 中采用的协议，站点必须访问构成帧的 $N_{S}gt 0 $ 连续时隙中的一个。这可以看作是传统插槽式网络（SA）的一种变体，在这种变体中，一个站不是以概率 p 访问一个插槽，而是以概率 $(1-p)^{N_{S}}$ 在有限帧中不访问，在一个帧中总是至少访问一次，也就是说，站必须在一个帧的插槽中访问。此外，如果上一次尝试不成功，站点还可以在帧中进行多次重试。鉴于目前缺乏对强制接入和重试的 SA 方案（SAMAR）的建模工作和性能评估，我们在这封信中评估了在由有限个时隙组成的帧中能成功接入信道的台站的预期数量。与 SA 不同，SAMAR 的性能分析因其枚举性而具有挑战性。我们提出了一种创新的 SAMAR 性能递归模型，表明 SAMAR 可以达到比以渐近最优接入概率为参数的 SA 更高的性能。对比分析表明了 SAMAR 性能超过 SA 性能的运行区域，这对确定 SAMAR 框架的时隙数至关重要。
{"title":"Performance Analysis of Slotted-Aloha With Mandatory Access and Retries in a Finite Frame","authors":"Diogo Pereira;Rodolfo Oliveira;Daniel Benevides da Costa;Hyong Kim","doi":"10.1109/LNET.2024.3385661","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385661","url":null,"abstract":"In recent medium access control (MAC) protocols, such as the ones adopted in IEEE 802.11ad and IEEE 802.11ay, stations mandatorily access one of the \u0000<inline-formula> <tex-math>$N_{S} gt 0 $ </tex-math></inline-formula>\u0000 consecutive slots forming a frame. This can be seen as a variant of the traditional slotted-aloha (SA), where instead of accessing a slot with probability p and not accessing in the finite frame with probability \u0000<inline-formula> <tex-math>$(1-p)^{N_{S}}$ </tex-math></inline-formula>\u0000, a station always accesses at least once in a frame, i.e., stations mandatorily access in a frame’s slot. Additionally, a station can also perform multiple retries in the frame when the previous attempt did not succeed. Given the lack of modeling efforts and performance evaluation for SA schemes with mandatory access and retries (SAMAR), in this letter, we evaluate the expected number of stations that can successfully access the channel in a frame composed of a finite number of slots. Contrarily to SA, the analysis of SAMAR performance is challenging due to its enumerative nature. We propose an innovative recursive model of SAMAR performance, showing that SAMAR can achieve higher performance than that of SA parameterized with asymptotically optimal access probabilities. A comparative analysis shows the operational region where SAMAR overpasses SA’s performance, which is of crucial importance to define the number of slots of the SAMAR frame.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"101-105"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286585","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}
Pub Date : 2024-04-01DOI: 10.1109/LNET.2024.3383601
Anmol Kumar;Gaurav Somani;Mayank Agarwal
Web-services have become most common IT enablers today. Cyber attacks such as the distributed denial of service (DDoS) attacks pose availability concerns which may result into service outages and consequently financial and reputation losses. Load balancing software such as HAProxy (high availability proxy) is an important building block of the Web service delivery today. Load balancing software provides incoming request distribution among Web-servers and admission control which may even help with combating DDoS attacks. In this letter, we study and explore the performance of different load distribution or scheduling strategies in the presence of DDoS attacks. With the help of attack experiments, we find that First, HDR, Source, and URI scheduling algorithms performs best for both static and Poisson arrivals.
网络服务已成为当今最常见的 IT 手段。分布式拒绝服务（DDoS）攻击等网络攻击带来了可用性问题，可能导致服务中断，进而造成经济和声誉损失。负载平衡软件，如 HAProxy（高可用性代理），是当今网络服务交付的重要组成部分。负载均衡软件可在网络服务器之间分配接收到的请求，并进行接纳控制，甚至可帮助打击 DDoS 攻击。在这封信中，我们研究并探讨了在 DDoS 攻击情况下不同负载分配或调度策略的性能。在攻击实验的帮助下，我们发现 First、HDR、Source 和 URI 调度算法在静态和泊松到达情况下都表现最佳。
{"title":"Comparing HAProxy Scheduling Algorithms During the DDoS Attacks","authors":"Anmol Kumar;Gaurav Somani;Mayank Agarwal","doi":"10.1109/LNET.2024.3383601","DOIUrl":"https://doi.org/10.1109/LNET.2024.3383601","url":null,"abstract":"Web-services have become most common IT enablers today. Cyber attacks such as the distributed denial of service (DDoS) attacks pose availability concerns which may result into service outages and consequently financial and reputation losses. Load balancing software such as HAProxy (high availability proxy) is an important building block of the Web service delivery today. Load balancing software provides incoming request distribution among Web-servers and admission control which may even help with combating DDoS attacks. In this letter, we study and explore the performance of different load distribution or scheduling strategies in the presence of DDoS attacks. With the help of attack experiments, we find that First, HDR, Source, and URI scheduling algorithms performs best for both static and Poisson arrivals.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"139-142"},"PeriodicalIF":0.0,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286638","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}
Pub Date : 2024-03-28DOI: 10.1109/LNET.2024.3382955
Natchanon Luangsomboon;Jörg Liebeherr
Flow control in a data center network (DCN) prevents packet losses by pausing transmissions from upstream switches, whereas congestion control prevents network overload by regulating traffic sources. For two widely deployed flow and congestion control algorithms, namely PFC and DCQCN, we derive a necessary and sufficient condition that ensures that congestion control mechanisms in a shared-memory switch are triggered before flow control. The condition creates an imbalance of buffer requirements at the ingress and egress of a switch. For fair queuing and priority scheduling at the egress, we present traffic scenarios that saturate the condition. The lack of such traffic scenarios for FIFO scheduling suggests that choosing appropriate schedulers may help reducing minimal buffer requirements.
{"title":"Necessary and Sufficient Condition for Triggering ECN Before PFC in Shared Memory Switches","authors":"Natchanon Luangsomboon;Jörg Liebeherr","doi":"10.1109/LNET.2024.3382955","DOIUrl":"https://doi.org/10.1109/LNET.2024.3382955","url":null,"abstract":"Flow control in a data center network (DCN) prevents packet losses by pausing transmissions from upstream switches, whereas congestion control prevents network overload by regulating traffic sources. For two widely deployed flow and congestion control algorithms, namely PFC and DCQCN, we derive a necessary and sufficient condition that ensures that congestion control mechanisms in a shared-memory switch are triggered before flow control. The condition creates an imbalance of buffer requirements at the ingress and egress of a switch. For fair queuing and priority scheduling at the egress, we present traffic scenarios that saturate the condition. The lack of such traffic scenarios for FIFO scheduling suggests that choosing appropriate schedulers may help reducing minimal buffer requirements.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"119-123"},"PeriodicalIF":0.0,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286639","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
扫码关注我们
求助内容：
应助结果提醒方式：