In the context of multi-controller software-defined networks (SDNs), the efficacy of load-balancing can be improved through fractional switch migration. This letter proposes a controller load balancing approach using fractional switch migration, named FractionalLB. FractionalLB aims to reduce the difference between the load of each controller and its corresponding predefined threshold, which is used to identify overloaded and underloaded controllers. The load balancing is achieved by redistributing the load fractionally from the heavily loaded controller to other controllers. We formulate FractionalLB as an optimization problem using a mixed-integer linear program (MILP). When MILP is not tractable, we introduce a heuristic approach based on MILP. Numerical results indicate that FractionalLB outperforms a conventional scheme that follows time-sharing switch migration in terms of synchronization cost and the min-max controller’s load ratio.
{"title":"FractionalLB: Controller Load Balancing Using Fractional Switch Migration in Software-Defined Networks","authors":"Upendra Prajapati;Bijoy Chand Chatterjee;Amit Banerjee","doi":"10.1109/LNET.2024.3357089","DOIUrl":"https://doi.org/10.1109/LNET.2024.3357089","url":null,"abstract":"In the context of multi-controller software-defined networks (SDNs), the efficacy of load-balancing can be improved through fractional switch migration. This letter proposes a controller load balancing approach using fractional switch migration, named FractionalLB. FractionalLB aims to reduce the difference between the load of each controller and its corresponding predefined threshold, which is used to identify overloaded and underloaded controllers. The load balancing is achieved by redistributing the load fractionally from the heavily loaded controller to other controllers. We formulate FractionalLB as an optimization problem using a mixed-integer linear program (MILP). When MILP is not tractable, we introduce a heuristic approach based on MILP. Numerical results indicate that FractionalLB outperforms a conventional scheme that follows time-sharing switch migration in terms of synchronization cost and the min-max controller’s load ratio.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"129-133"},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286617","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 traditional role of the network layer is the transfer of packet replicas from source to destination through intermediate network nodes. We present a generative network layer that uses Generative AI (GenAI) at intermediate or edge network nodes and analyze its impact on the required data rates in the network. We conduct a case study where the GenAI-aided nodes generate images from prompts that consist of substantially compressed latent representations. The results from network flow analyses under image quality constraints show that the generative network layer can achieve an improvement of more than 100% in terms of the required data rate.
{"title":"Generative Network Layer for Communication Systems With Artificial Intelligence","authors":"Mathias Thorsager;Israel Leyva-Mayorga;Beatriz Soret;Petar Popovski","doi":"10.1109/LNET.2024.3354114","DOIUrl":"https://doi.org/10.1109/LNET.2024.3354114","url":null,"abstract":"The traditional role of the network layer is the transfer of packet replicas from source to destination through intermediate network nodes. We present a generative network layer that uses Generative AI (GenAI) at intermediate or edge network nodes and analyze its impact on the required data rates in the network. We conduct a case study where the GenAI-aided nodes generate images from prompts that consist of substantially compressed latent representations. The results from network flow analyses under image quality constraints show that the generative network layer can achieve an improvement of more than 100% in terms of the required data rate.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"82-86"},"PeriodicalIF":0.0,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286745","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-01-05DOI: 10.1109/LNET.2024.3350434
Z. Mohammadi;M. Soleimanpour Moghadam;S. Talebi;H. Ahmadi
This letter investigates a desirable power allocation scheme for shared spectrum networks and formulate it as a constrained optimization model that falls into the nonlinear class fractional programming problems. The investigation focuses on different solutions for the problem under consideration. The first investigated approach utilizes the convex optimization problem (COP) equivalent from of the problem by employing the Charnes-Cooper transformation. This approach finds the optimal solution and thus is the most appropriate from a viewpoint of optimality. The second approach employs the approximate linear programming (LP). From the complexity point of view, the LP problem can be cast as the benchmark. Our proposed linear model has lower complexity with an acceptable accuracy leading to decreasing the time delay to make the final decision on the availability. Simulation results indicate a higher coherence between the two latter approaches and the superior performance than the state-of-the-art literature in different system parameter.
{"title":"Shared Spectrum Cooperative Networks: A Linear Programming-Based Approach","authors":"Z. Mohammadi;M. Soleimanpour Moghadam;S. Talebi;H. Ahmadi","doi":"10.1109/LNET.2024.3350434","DOIUrl":"https://doi.org/10.1109/LNET.2024.3350434","url":null,"abstract":"This letter investigates a desirable power allocation scheme for shared spectrum networks and formulate it as a constrained optimization model that falls into the nonlinear class fractional programming problems. The investigation focuses on different solutions for the problem under consideration. The first investigated approach utilizes the convex optimization problem (COP) equivalent from of the problem by employing the Charnes-Cooper transformation. This approach finds the optimal solution and thus is the most appropriate from a viewpoint of optimality. The second approach employs the approximate linear programming (LP). From the complexity point of view, the LP problem can be cast as the benchmark. Our proposed linear model has lower complexity with an acceptable accuracy leading to decreasing the time delay to make the final decision on the availability. Simulation results indicate a higher coherence between the two latter approaches and the superior performance than the state-of-the-art literature in different system parameter.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"77-81"},"PeriodicalIF":0.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286616","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-01-02DOI: 10.1109/LNET.2023.3349301
Qingjun Yuan;Weina Niu;Yongjuan Wang;Gaopeng Gou;Bin Lu
To train robust malicious traffic identification models under noisy labeled datasets, a number of learning with noise labels approaches have been introduced, among which parallel training methods have been proved to be effective. Parallel training methods tend to select samples with disagreement to mitigate the risk of self-control degradation. However, it also introduces noisy knowledge into training. In this letter, we try to avoid introducing noisy knowledge by enhancing the consistency of the representations of parallel networks. Meanwhile, the two networks are heterogeneous and introduce information from different modalities, thus mitigating the risk of self-control degradation from multiple perspectives.
{"title":"Malicious Traffic Detection With Noise Labels Based on Cross-Modal Consistency","authors":"Qingjun Yuan;Weina Niu;Yongjuan Wang;Gaopeng Gou;Bin Lu","doi":"10.1109/LNET.2023.3349301","DOIUrl":"https://doi.org/10.1109/LNET.2023.3349301","url":null,"abstract":"To train robust malicious traffic identification models under noisy labeled datasets, a number of learning with noise labels approaches have been introduced, among which parallel training methods have been proved to be effective. Parallel training methods tend to select samples with disagreement to mitigate the risk of self-control degradation. However, it also introduces noisy knowledge into training. In this letter, we try to avoid introducing noisy knowledge by enhancing the consistency of the representations of parallel networks. Meanwhile, the two networks are heterogeneous and introduce information from different modalities, thus mitigating the risk of self-control degradation from multiple perspectives.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"148-151"},"PeriodicalIF":0.0,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286584","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 : 2023-12-28DOI: 10.1109/LNET.2023.3347724
Avijit Gayen;Sukriti Santra;Ayush Dey;Angshuman Jana
In the rapidly evolving landscape of cyber threats, phishing continues to be a prominent vector for cyberattacks, posing significant risks to individuals, organizations and information systems. This letter delves into a comprehensive analysis of phishing sites, focusing on their distinctive characteristics through the lens of network perspectives. In this letter, we study the underlying characteristics of phishing sites from the hyperlinked connectivity perspectives. In this letter, we have used a phishing site dataset available at Mendeley data. As the dataset does not contain any hyperlinked information, We further collect the hyperlinks in each site and store that information in a JSON file. We further analyze the hyperlinks and the various features of those sites. The initial study reveals that though the Phishing sites mimic the original legitimate sites to trap people in their sites, it has distinct differences from the perspective of structural connectivity as well as the content of sites.
{"title":"A Network Model to Study the Underlying Characteristics of Phishing Sites","authors":"Avijit Gayen;Sukriti Santra;Ayush Dey;Angshuman Jana","doi":"10.1109/LNET.2023.3347724","DOIUrl":"https://doi.org/10.1109/LNET.2023.3347724","url":null,"abstract":"In the rapidly evolving landscape of cyber threats, phishing continues to be a prominent vector for cyberattacks, posing significant risks to individuals, organizations and information systems. This letter delves into a comprehensive analysis of phishing sites, focusing on their distinctive characteristics through the lens of network perspectives. In this letter, we study the underlying characteristics of phishing sites from the hyperlinked connectivity perspectives. In this letter, we have used a phishing site dataset available at Mendeley data. As the dataset does not contain any hyperlinked information, We further collect the hyperlinks in each site and store that information in a JSON file. We further analyze the hyperlinks and the various features of those sites. The initial study reveals that though the Phishing sites mimic the original legitimate sites to trap people in their sites, it has distinct differences from the perspective of structural connectivity as well as the content of sites.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"46-49"},"PeriodicalIF":0.0,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042931","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 : 2023-12-13DOI: 10.1109/LNET.2023.3342424
You Zhao;Yuchao Zhu;Shaowei Wang
To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.
{"title":"User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method","authors":"You Zhao;Yuchao Zhu;Shaowei Wang","doi":"10.1109/LNET.2023.3342424","DOIUrl":"https://doi.org/10.1109/LNET.2023.3342424","url":null,"abstract":"To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2023-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042929","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 : 2023-12-01DOI: 10.1109/LNET.2023.3338363
Marius Corici;Fabian Eichhorn;Thomas Magedanz
6G visionaries propose uniform control plane operations across connected devices, radio, and core networks. We introduce an advanced, organic 6G continuum concept and architecture, extending the core network’s control plane to encompass near-real-time radio control and user equipment via a novel Web-based services functionality split. This design, when compared with the 5G Service Based Architecture, showcases a reduction in complexity and an increase in flexibility.
{"title":"Organic 6G Continuum Architecture: A Uniform Control Plane Across Devices, Radio, and Core","authors":"Marius Corici;Fabian Eichhorn;Thomas Magedanz","doi":"10.1109/LNET.2023.3338363","DOIUrl":"https://doi.org/10.1109/LNET.2023.3338363","url":null,"abstract":"6G visionaries propose uniform control plane operations across connected devices, radio, and core networks. We introduce an advanced, organic 6G continuum concept and architecture, extending the core network’s control plane to encompass near-real-time radio control and user equipment via a novel Web-based services functionality split. This design, when compared with the 5G Service Based Architecture, showcases a reduction in complexity and an increase in flexibility.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10336892","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042930","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：