A relatively simple safety-belt mechanism for improving DNS system availability and efficiency is proposed here. While it may seem ambitious, a careful examination shows it is both feasible and beneficial for the DNS system. The mechanism called "DNS Real-time Update" (DNSRU), a service that facilitates real-time and secure updates of cached domain records in DNS resolvers worldwide, even before the expiration of the corresponding Time To Live (TTL) values. This service allows Internet domain owners to quickly rectify any erroneous global IP address distribution, even if a long TTL value is associated with it. By addressing this critical DNS high availability issue, DNSRU eliminates the need for short TTL values and their associated drawbacks. Therefore, DNSRU DNSRU reduces the traffic load on authoritative servers while enhancing the system's fault tolerance. In this paper we show that our DNSRU design is backward compatible, supports gradual deployment, secure, efficient, and feasible.
本文提出了一种相对简单的安全带机制，用于提高 DNS 系统的可用性和效率。虽然它看似雄心勃勃，但仔细研究后发现，它对 DNS 系统来说既可行又有益。这种机制被称为 "DNS 实时更新"（DNSRU），它是一种服务，可对全球 DNS 解析器中的缓存域名记录进行实时、安全的更新，甚至在相应的 "有效时间"（TTL）值到期之前进行更新。这项服务允许互联网域名所有者快速纠正任何错误的全球 IP 地址分配，即使与之相关的 TTL 值很长。通过解决这一关键的 DNS 高可用性问题，DNSRU 消除了对短 TTL 值及其相关缺点的需求。本文表明，我们的 DNSRU 设计向后兼容、支持逐步部署、安全、高效且可行。
{"title":"Decoupling DNS Update Timing from TTL Values","authors":"Yehuda Afek, Ariel Litmanovich","doi":"arxiv-2409.10207","DOIUrl":"https://doi.org/arxiv-2409.10207","url":null,"abstract":"A relatively simple safety-belt mechanism for improving DNS system\u0000availability and efficiency is proposed here. While it may seem ambitious, a\u0000careful examination shows it is both feasible and beneficial for the DNS\u0000system. The mechanism called \"DNS Real-time Update\" (DNSRU), a service that\u0000facilitates real-time and secure updates of cached domain records in DNS\u0000resolvers worldwide, even before the expiration of the corresponding Time To\u0000Live (TTL) values. This service allows Internet domain owners to quickly\u0000rectify any erroneous global IP address distribution, even if a long TTL value\u0000is associated with it. By addressing this critical DNS high availability issue,\u0000DNSRU eliminates the need for short TTL values and their associated drawbacks.\u0000Therefore, DNSRU DNSRU reduces the traffic load on authoritative servers while\u0000enhancing the system's fault tolerance. In this paper we show that our DNSRU\u0000design is backward compatible, supports gradual deployment, secure, efficient,\u0000and feasible.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260224","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}
After more than a decade of development, real time communication (RTC) for video telephony has made significantly progress. However, emerging high-quality RTC applications with high definition and high frame rate requires sufficient bandwidth. The default congestion control mechanism specifically tuned for video telephony leaves plenty of room for optimization under high-rate scenarios. It is necessary to develop new rate control solutions to utilize bandwidth efficiently and to provide better experience for such services. A delay-based congestion control method called Cross is proposed, which regulates rate based on queue load with a multiplicative increase and multiplicative decrease fashion. A simulation module is developed to validate the effectiveness of these congestion control algorithms for RTC services. The module is released with the hope to provide convenience for RTC research community. Simulation results demonstrate that Cross can achieve low queuing delay and maintain high channel utilization under random loss environments. Online deployment shows that Cross can reduce the video freezing ratio by up to 58.45% on average when compared with a benchmark algorithm.
{"title":"Cross: A Delay Based Congestion Control Method for RTP Media","authors":"Songyang Zhang, Changpeng Yang","doi":"arxiv-2409.10042","DOIUrl":"https://doi.org/arxiv-2409.10042","url":null,"abstract":"After more than a decade of development, real time communication (RTC) for\u0000video telephony has made significantly progress. However, emerging high-quality\u0000RTC applications with high definition and high frame rate requires sufficient\u0000bandwidth. The default congestion control mechanism specifically tuned for\u0000video telephony leaves plenty of room for optimization under high-rate\u0000scenarios. It is necessary to develop new rate control solutions to utilize\u0000bandwidth efficiently and to provide better experience for such services. A\u0000delay-based congestion control method called Cross is proposed, which regulates\u0000rate based on queue load with a multiplicative increase and multiplicative\u0000decrease fashion. A simulation module is developed to validate the\u0000effectiveness of these congestion control algorithms for RTC services. The\u0000module is released with the hope to provide convenience for RTC research\u0000community. Simulation results demonstrate that Cross can achieve low queuing\u0000delay and maintain high channel utilization under random loss environments.\u0000Online deployment shows that Cross can reduce the video freezing ratio by up to\u000058.45% on average when compared with a benchmark algorithm.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260225","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}
Our study uses the centralized, flexible, dynamic, and programmable structure of Software-Defined networks (SDN) to overcome the problems. Although SDN effectively addresses the challenges present in traditional networks, it still requires further enhancements to achieve a more optimized network architecture. The Floodlight controller utilized in this study employs metrics such as hop count, which provides limited information for routing. In scenarios such as video transmission, this situation is insufficient and the need for optimization arises. For this purpose, an artificial intelligence (AI) based routing algorithm is proposed between the server and the client in the scenario based on NSFNET topology. The topology designed with the Floodlight controller in the Mininet simulation environment includes a client, a server, and 14 switches. A realistic network environment is provided by adding different receivers and creating TCP traffic between these receivers using the iperf3 tool. In three scenarios, video streaming is performed using the FFmpeg tool, and 49 path metrics such as RTT, throughput, and loss are recorded. In these scenarios, PSNR and SSIM calculations are made to observe the differences between the transmitted and the original video in congested and uncongested environments. Due to the lack of a dataset suitable for the proposed network environment in the literature, a new dataset consisting of 876 records is created using continuously transmitted video traffic. Low and high traffic levels are created within the dataset, and different machine learning techniques such as KNN, Random Forest, SVM, AdaBoost, Logistic Regression and XGBoost are applied using the features that affect the traffic levels.
{"title":"Enhancing Video Transmission with Machine Learning based Routing in Software-Defined Networks","authors":"Anıl Dursun İpek, Murtaza Cicioğlu, Ali Çalhan","doi":"arxiv-2409.10512","DOIUrl":"https://doi.org/arxiv-2409.10512","url":null,"abstract":"Our study uses the centralized, flexible, dynamic, and programmable structure\u0000of Software-Defined networks (SDN) to overcome the problems. Although SDN\u0000effectively addresses the challenges present in traditional networks, it still\u0000requires further enhancements to achieve a more optimized network architecture.\u0000The Floodlight controller utilized in this study employs metrics such as hop\u0000count, which provides limited information for routing. In scenarios such as\u0000video transmission, this situation is insufficient and the need for\u0000optimization arises. For this purpose, an artificial intelligence (AI) based\u0000routing algorithm is proposed between the server and the client in the scenario\u0000based on NSFNET topology. The topology designed with the Floodlight controller\u0000in the Mininet simulation environment includes a client, a server, and 14\u0000switches. A realistic network environment is provided by adding different\u0000receivers and creating TCP traffic between these receivers using the iperf3\u0000tool. In three scenarios, video streaming is performed using the FFmpeg tool,\u0000and 49 path metrics such as RTT, throughput, and loss are recorded. In these\u0000scenarios, PSNR and SSIM calculations are made to observe the differences\u0000between the transmitted and the original video in congested and uncongested\u0000environments. Due to the lack of a dataset suitable for the proposed network\u0000environment in the literature, a new dataset consisting of 876 records is\u0000created using continuously transmitted video traffic. Low and high traffic\u0000levels are created within the dataset, and different machine learning\u0000techniques such as KNN, Random Forest, SVM, AdaBoost, Logistic Regression and\u0000XGBoost are applied using the features that affect the traffic levels.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260223","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}
Waqas Khalid, A. -A. A. Boulogeorgos, Trinh Van Chien, Junse Lee, Howon Lee, Heejung Yu
Wireless-powered communications (WPCs) are increasingly crucial for extending the lifespan of low-power Internet of Things (IoT) devices. Furthermore, reconfigurable intelligent surfaces (RISs) can create favorable electromagnetic environments by providing alternative signal paths to counteract blockages. The strategic integration of WPC and RIS technologies can significantly enhance energy transfer and data transmission efficiency. However, passive RISs suffer from double-fading attenuation over RIS-aided cascaded links. In this article, we propose the application of an active RIS within WPC-enabled IoT networks. The enhanced flexibility of the active RIS in terms of energy transfer and information transmission is investigated using adjustable parameters. We derive novel closed-form expressions for the ergodic rate and outage probability by incorporating key parameters, including signal amplification, active noise, power consumption, and phase quantization errors. Additionally, we explore the optimization of WPC scenarios, focusing on the time-switching factor and power consumption of the active RIS. The results validate our analysis, demonstrating that an active RIS significantly enhances WPC performance compared to a passive RIS.
{"title":"Optimal Operation of Active RIS-Aided Wireless Powered Communications in IoT Networks","authors":"Waqas Khalid, A. -A. A. Boulogeorgos, Trinh Van Chien, Junse Lee, Howon Lee, Heejung Yu","doi":"arxiv-2409.09719","DOIUrl":"https://doi.org/arxiv-2409.09719","url":null,"abstract":"Wireless-powered communications (WPCs) are increasingly crucial for extending\u0000the lifespan of low-power Internet of Things (IoT) devices. Furthermore,\u0000reconfigurable intelligent surfaces (RISs) can create favorable electromagnetic\u0000environments by providing alternative signal paths to counteract blockages. The\u0000strategic integration of WPC and RIS technologies can significantly enhance\u0000energy transfer and data transmission efficiency. However, passive RISs suffer\u0000from double-fading attenuation over RIS-aided cascaded links. In this article,\u0000we propose the application of an active RIS within WPC-enabled IoT networks.\u0000The enhanced flexibility of the active RIS in terms of energy transfer and\u0000information transmission is investigated using adjustable parameters. We derive\u0000novel closed-form expressions for the ergodic rate and outage probability by\u0000incorporating key parameters, including signal amplification, active noise,\u0000power consumption, and phase quantization errors. Additionally, we explore the\u0000optimization of WPC scenarios, focusing on the time-switching factor and power\u0000consumption of the active RIS. The results validate our analysis, demonstrating\u0000that an active RIS significantly enhances WPC performance compared to a passive\u0000RIS.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"41 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260231","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}
Terahertz (THz) communications will be pivotal in sixth-generation (6G) wireless networks, offering significantly wider bandwidths and higher data rates. However, the unique propagation characteristics of the THz frequency band, such as high path loss and sensitivity to blockages, pose substantial challenges. Reconfigurable intelligent surfaces (RISs) present a promising solution for enhancing THz communications by dynamically shaping the propagation environment to address these issues. Active RISs, in particular, can amplify reflected signals, effectively mitigating the multiplicative fading effects in RIS-aided links. Given the highly directional nature of THz signals, beam misalignment is a significant concern, while discrete phase shifting is more practical for real-world RIS deployment compared to continuous adjustments. This paper investigates the performance of active-RIS-aided THz communication systems, focusing on discrete phase shifts and beam misalignment. An expression for the ergodic capacity is derived, incorporating critical system parameters to assess performance. Numerical results offer insights into optimizing active-RIS-aided THz communication systems.
{"title":"Active RIS-Aided Terahertz Communications with Phase Error and Beam Misalignment","authors":"Waqas Khalid, Heejung Yu, Farman Ali, Huiping Huang","doi":"arxiv-2409.09713","DOIUrl":"https://doi.org/arxiv-2409.09713","url":null,"abstract":"Terahertz (THz) communications will be pivotal in sixth-generation (6G)\u0000wireless networks, offering significantly wider bandwidths and higher data\u0000rates. However, the unique propagation characteristics of the THz frequency\u0000band, such as high path loss and sensitivity to blockages, pose substantial\u0000challenges. Reconfigurable intelligent surfaces (RISs) present a promising\u0000solution for enhancing THz communications by dynamically shaping the\u0000propagation environment to address these issues. Active RISs, in particular,\u0000can amplify reflected signals, effectively mitigating the multiplicative fading\u0000effects in RIS-aided links. Given the highly directional nature of THz signals,\u0000beam misalignment is a significant concern, while discrete phase shifting is\u0000more practical for real-world RIS deployment compared to continuous\u0000adjustments. This paper investigates the performance of active-RIS-aided THz\u0000communication systems, focusing on discrete phase shifts and beam misalignment.\u0000An expression for the ergodic capacity is derived, incorporating critical\u0000system parameters to assess performance. Numerical results offer insights into\u0000optimizing active-RIS-aided THz communication systems.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260393","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}
Preempting attacks targeting supercomputing systems before damage remains the top security priority. The main challenge is that noisy attack attempts and unreliable alerts often mask real attacks, causing permanent damages such as system integrity violations and data breaches. This paper describes a security testbed embedded in live traffic of a supercomputer at the National Center for Supercomputing Applications (NCSA). The objective is to demonstrate attack preemption, i.e., stopping system compromise and data breaches at petascale supercomputers. Deployment of our testbed at NCSA enables the following key contributions: 1) Insights from characterizing unique attack patterns found in real security logs of over 200 security incidents curated in the past two decades at NCSA. 2) Deployment of an attack visualization tool to illustrate the challenges of identifying real attacks in HPC environments and to support security operators in interactive attack analyses. 3) Demonstrate the testbed's utility by running novel models, such as Factor Graph-Based models, to preempt a real-world ransomware family.
{"title":"Security Testbed for Preempting Attacks against Supercomputing Infrastructure","authors":"Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer","doi":"arxiv-2409.09602","DOIUrl":"https://doi.org/arxiv-2409.09602","url":null,"abstract":"Preempting attacks targeting supercomputing systems before damage remains the\u0000top security priority. The main challenge is that noisy attack attempts and\u0000unreliable alerts often mask real attacks, causing permanent damages such as\u0000system integrity violations and data breaches. This paper describes a security\u0000testbed embedded in live traffic of a supercomputer at the National Center for\u0000Supercomputing Applications (NCSA). The objective is to demonstrate attack\u0000preemption, i.e., stopping system compromise and data breaches at petascale\u0000supercomputers. Deployment of our testbed at NCSA enables the following key\u0000contributions: 1) Insights from characterizing unique attack patterns found in real security\u0000logs of over 200 security incidents curated in the past two decades at NCSA. 2) Deployment of an attack visualization tool to illustrate the challenges of\u0000identifying real attacks in HPC environments and to support security operators\u0000in interactive attack analyses. 3) Demonstrate the testbed's utility by running novel models, such as Factor\u0000Graph-Based models, to preempt a real-world ransomware family.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260236","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}
Yudong Huang, Shuo Wang, Shiyin Zhu, Guoyu Peng, Xinyuan Zhang, Tao Huang, Xinmin Liu
The time-critical industrial applications pose intense demands for enabling long-distance deterministic networks. However, previous priority-based and weight-based scheduling methods focus on probabilistically reducing average delay, which ignores strictly guaranteeing task-oriented on-time packet delivery with bounded worst-case delay and jitter. This paper proposes a new Programmable Cycle-Specified Queue (PCSQ) for long-distance industrial deterministic packet scheduling. By implementing the first high-precision rotation dequeuing, PCSQ enables microsecond-level time slot resource reservation (noted as T) and especially jitter control of up to 2T. Then, we propose the cycle tags computation to approximate cyclic scheduling algorithms, which allows packets to actively pick and lock their favorite queue in a sequence of nodes. Accordingly, PCSQ can precisely defer packets to any desired time. Further, the queue coordination and cycle mapping mechanisms are delicately designed to solve the cycle-queue mismatch problem. Evaluation results show that PCSQ can schedule tens of thousands of time-sensitive flows and strictly guarantee $ms$-level delay and us-level jitter.
{"title":"Programmable Cycle-Specified Queue for Long-Distance Industrial Deterministic Packet Scheduling","authors":"Yudong Huang, Shuo Wang, Shiyin Zhu, Guoyu Peng, Xinyuan Zhang, Tao Huang, Xinmin Liu","doi":"arxiv-2409.09592","DOIUrl":"https://doi.org/arxiv-2409.09592","url":null,"abstract":"The time-critical industrial applications pose intense demands for enabling\u0000long-distance deterministic networks. However, previous priority-based and\u0000weight-based scheduling methods focus on probabilistically reducing average\u0000delay, which ignores strictly guaranteeing task-oriented on-time packet\u0000delivery with bounded worst-case delay and jitter. This paper proposes a new Programmable Cycle-Specified Queue (PCSQ) for\u0000long-distance industrial deterministic packet scheduling. By implementing the\u0000first high-precision rotation dequeuing, PCSQ enables microsecond-level time\u0000slot resource reservation (noted as T) and especially jitter control of up to\u00002T. Then, we propose the cycle tags computation to approximate cyclic\u0000scheduling algorithms, which allows packets to actively pick and lock their\u0000favorite queue in a sequence of nodes. Accordingly, PCSQ can precisely defer\u0000packets to any desired time. Further, the queue coordination and cycle mapping\u0000mechanisms are delicately designed to solve the cycle-queue mismatch problem.\u0000Evaluation results show that PCSQ can schedule tens of thousands of\u0000time-sensitive flows and strictly guarantee $ms$-level delay and us-level\u0000jitter.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260227","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 aim of this paper is to analyze methods of flexible control in SDN networks and to propose a self-developed solution that will enable intelligent adaptation of SDN controller performance. This work aims not only to review existing solutions, but also to develop an approach that will increase the efficiency and adaptability of network management. The project uses a modern type of machine learning, Reinforcement Learning, which allows autonomous decisions of a network that learns based on its choices in a dynamically changing environment, which is most similar to the way humans learn. The solution aims not only to improve the network's performance, but also its flexibility and real-time adaptability - flexible traffic control.
本文旨在分析 SDN 网络中的灵活控制方法，并提出一种自主开发的解决方案，以实现 SDN 控制器性能的智能适应。这项工作的目的不仅在于回顾现有的解决方案，还在于开发一种能够提高网络管理效率和适应性的方法。该项目使用了一种现代机器学习类型--强化学习，它允许网络根据其在动态变化环境中的选择进行自主决策，这与人类的学习方式最为相似。该解决方案的目的不仅在于提高网络的性能，还在于提高其灵活性和实时适应性--灵活的交通控制。
{"title":"Analysis of flexible traffic control method in SDN","authors":"Marta Szymczyk","doi":"arxiv-2409.11436","DOIUrl":"https://doi.org/arxiv-2409.11436","url":null,"abstract":"The aim of this paper is to analyze methods of flexible control in SDN\u0000networks and to propose a self-developed solution that will enable intelligent\u0000adaptation of SDN controller performance. This work aims not only to review\u0000existing solutions, but also to develop an approach that will increase the\u0000efficiency and adaptability of network management. The project uses a modern\u0000type of machine learning, Reinforcement Learning, which allows autonomous\u0000decisions of a network that learns based on its choices in a dynamically\u0000changing environment, which is most similar to the way humans learn. The\u0000solution aims not only to improve the network's performance, but also its\u0000flexibility and real-time adaptability - flexible traffic control.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260192","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}
Yudong Huang, Tao Huang, Xinyuan Zhang, Shuo Wang, Hongyang Du, Dusit Niyato, Fei Richard Yu
Booming time-critical services, such as automated manufacturing and remote operations, stipulate increasing demands for facilitating large-scale Industrial Internet of Things (IoT). Recently, a cycle specified queuing and forwarding (CSQF) scheme has been advocated to enhance the Ethernet. However, CSQF only outlines a foundational equipment-level primitive, while how to attain network-wide flow scheduling is not yet determined. Prior endeavors primarily focus on the range of a local area, rendering them unsuitable for long-distance factory interconnection. This paper devises the cycle tags planning (CTP) mechanism, the first integer programming model for the CSQF, which makes the CSQF practical for efficient global flow scheduling. In the CTP model, the per-hop cycle alignment problem is solved by decoupling the long-distance link delay from cyclic queuing time. To avoid queue overflows, we discretize the underlying network resources into cycle-related queue resource blocks and detail the core constraints within multiple periods. Then, two heuristic algorithms named flow offset and cycle shift (FO-CS) and Tabu FO-CS are designed to calculate the flows' cycle tags and maximize the number of schedulable flows, respectively. Evaluation results show that FO-CS increases the number of scheduled flows by 31.2%. The Tabu FO-CS algorithm can schedule 94.45% of flows at the level of 2000 flows.
{"title":"CSQF-based Time-Sensitive Flow Scheduling in Long-distance Industrial IoT Networks","authors":"Yudong Huang, Tao Huang, Xinyuan Zhang, Shuo Wang, Hongyang Du, Dusit Niyato, Fei Richard Yu","doi":"arxiv-2409.09585","DOIUrl":"https://doi.org/arxiv-2409.09585","url":null,"abstract":"Booming time-critical services, such as automated manufacturing and remote\u0000operations, stipulate increasing demands for facilitating large-scale\u0000Industrial Internet of Things (IoT). Recently, a cycle specified queuing and\u0000forwarding (CSQF) scheme has been advocated to enhance the Ethernet. However,\u0000CSQF only outlines a foundational equipment-level primitive, while how to\u0000attain network-wide flow scheduling is not yet determined. Prior endeavors\u0000primarily focus on the range of a local area, rendering them unsuitable for\u0000long-distance factory interconnection. This paper devises the cycle tags\u0000planning (CTP) mechanism, the first integer programming model for the CSQF,\u0000which makes the CSQF practical for efficient global flow scheduling. In the CTP\u0000model, the per-hop cycle alignment problem is solved by decoupling the\u0000long-distance link delay from cyclic queuing time. To avoid queue overflows, we\u0000discretize the underlying network resources into cycle-related queue resource\u0000blocks and detail the core constraints within multiple periods. Then, two\u0000heuristic algorithms named flow offset and cycle shift (FO-CS) and Tabu FO-CS\u0000are designed to calculate the flows' cycle tags and maximize the number of\u0000schedulable flows, respectively. Evaluation results show that FO-CS increases\u0000the number of scheduled flows by 31.2%. The Tabu FO-CS algorithm can schedule\u000094.45% of flows at the level of 2000 flows.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260228","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}
It's possible to distribute the Internet to users via drones. However it is then necessary to place the drones according to the positions of the users. Moreover, the 5th Generation (5G) New Radio (NR) technology is designed to accommodate a wide range of applications and industries. The NGNM 5G White Paper cite{5gwhitepaper} groups these vertical use cases into three categories: - enhanced Mobile Broadband (eMBB) - massive Machine Type Communication (mMTC) - Ultra-Reliable Low-latency Communication (URLLC). Partitioning the physical network into multiple virtual networks appears to be the best way to provide a customised service for each application and limit operational costs. This design is well known as textit{network slicing}. Each drone must thus slice its bandwidth between each of the 3 user classes. This whole problem (placement + bandwidth) can be defined as an optimization problem, but since it is very hard to solve efficiently, it is almost always addressed by AI in the litterature. In my internship, I wanted to prove that viewing the problem as an optimization problem can still be useful, by building an hybrid solution involving on one hand AI and on the other optimization. I use it to achieve better results than approaches that use only AI, although at the cost of slightly larger (but still reasonable) computation times.
{"title":"A hybrid solution for 2-UAV RAN slicing","authors":"Nathan Boyer","doi":"arxiv-2409.11432","DOIUrl":"https://doi.org/arxiv-2409.11432","url":null,"abstract":"It's possible to distribute the Internet to users via drones. However it is\u0000then necessary to place the drones according to the positions of the users.\u0000Moreover, the 5th Generation (5G) New Radio (NR) technology is designed to\u0000accommodate a wide range of applications and industries. The NGNM 5G White\u0000Paper cite{5gwhitepaper} groups these vertical use cases into three\u0000categories: - enhanced Mobile Broadband (eMBB) - massive Machine Type Communication (mMTC) - Ultra-Reliable Low-latency Communication (URLLC). Partitioning the physical network into multiple virtual networks appears to\u0000be the best way to provide a customised service for each application and limit\u0000operational costs. This design is well known as textit{network slicing}. Each\u0000drone must thus slice its bandwidth between each of the 3 user classes. This\u0000whole problem (placement + bandwidth) can be defined as an optimization\u0000problem, but since it is very hard to solve efficiently, it is almost always\u0000addressed by AI in the litterature. In my internship, I wanted to prove that\u0000viewing the problem as an optimization problem can still be useful, by building\u0000an hybrid solution involving on one hand AI and on the other optimization. I\u0000use it to achieve better results than approaches that use only AI, although at\u0000the cost of slightly larger (but still reasonable) computation times.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260191","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
扫码关注我们
求助内容：
应助结果提醒方式：