arXiv - CS - Networking and Internet Architecture最新文献_第2页

Decoupling DNS Update Timing from TTL Values 将 DNS 更新时序与 TTL 值解耦

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-16 DOI: arxiv-2409.10207

Yehuda Afek, Ariel Litmanovich

引用次数: 0

Cross: A Delay Based Congestion Control Method for RTP Media 交叉基于延迟的 RTP 媒体拥塞控制方法

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-16 DOI: arxiv-2409.10042

Songyang Zhang, Changpeng Yang

{"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}

引用次数: 0

Enhancing Video Transmission with Machine Learning based Routing in Software-Defined Networks 在软件定义网络中利用基于机器学习的路由选择增强视频传输功能

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-16 DOI: arxiv-2409.10512

Anıl Dursun İpek, Murtaza Cicioğlu, Ali Çalhan

{"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}

引用次数: 0

Optimal Operation of Active RIS-Aided Wireless Powered Communications in IoT Networks 物联网网络中主动式 RIS 辅助无线供电通信的优化运行

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.09719

Waqas Khalid, A. -A. A. Boulogeorgos, Trinh Van Chien, Junse Lee, Howon Lee, Heejung Yu

{"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}

引用次数: 0

Active RIS-Aided Terahertz Communications with Phase Error and Beam Misalignment 具有相位误差和波束错位的有源 RIS 辅助太赫兹通信

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.09713

Waqas Khalid, Heejung Yu, Farman Ali, Huiping Huang

{"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}

引用次数: 0

Security Testbed for Preempting Attacks against Supercomputing Infrastructure 防范针对超级计算基础设施攻击的安全测试平台

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.09602

Phuong Cao, Zbigniew Kalbarczyk, Ravishankar Iyer

{"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}

引用次数: 0

Programmable Cycle-Specified Queue for Long-Distance Industrial Deterministic Packet Scheduling 用于长距离工业确定性数据包调度的可编程周期指定队列

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.09592

Yudong Huang, Shuo Wang, Shiyin Zhu, Guoyu Peng, Xinyuan Zhang, Tao Huang, Xinmin Liu

{"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}

引用次数: 0

Analysis of flexible traffic control method in SDN SDN 中的灵活流量控制方法分析

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.11436

Marta Szymczyk

引用次数: 0

CSQF-based Time-Sensitive Flow Scheduling in Long-distance Industrial IoT Networks 长距离工业物联网网络中基于 CSQF 的时敏流量调度

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.09585

Yudong Huang, Tao Huang, Xinyuan Zhang, Shuo Wang, Hongyang Du, Dusit Niyato, Fei Richard Yu

{"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}

引用次数: 0

A hybrid solution for 2-UAV RAN slicing 2-UAV RAN 切片的混合解决方案

arXiv - CS - Networking and Internet Architecture Pub Date : 2024-09-15 DOI: arxiv-2409.11432

Nathan Boyer

{"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}

引用次数: 0