检索结果-内蒙古大学图书馆

Throughput Maximization for Result multicasting by Admitting Delay-Aware Tasks in MEC Networks for High-Speed Railways

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第6期73卷 8765-8781页

作者： Xu, Junyi Wei, Zhenchun Yuan, Xiaohui Qiao, Yan Lyu, Zengwei Han, Jianghong Hefei Univ Technol Sch Comp Sci & Informat Engn Hefei 230002 Peoples R China Minist Educ Engn Res Ctr Safety Crit Ind Measurement & Control Hefei 230002 Peoples R China Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

The rapid expansion of high-speed railways (HSRs) and the growing demand for diverse data services during long journeys require efficient computing services. Mobile Edge Computing (MEC) emerged as a promising platform to fulfill this demand. We envision a scenario wherein passengers interact with each other on the same or different trains in real-time by offloading computationally intensive and delay-sensitive tasks to the track-side MEC networks for HSRs and computation results are multicast to the receivers. To improve the quality of data services, we propose a novel approach to optimize network throughput by admitting as many tasks as possible, subject to delay constraints, and multicasting the maximum number of results. The high mobility of trains and the frequent handovers during train-ground communication are factored into our scheme, which presents significant challenges to jointly consider the dynamic multicast grouping and admission/rejection policies for tasks/results. We introduce the multi-group-shared Group Steiner tree (GST) model and propose an efficient heuristic algorithm that reduces the multicast routing problem to finding a GST for each candidate cloudlet. The effectiveness of our proposed algorithm is demonstrated through simulations and the results are promising.

关键词： Task analysis Cloud computing Throughput Delays Routing multicast communication multicast algorithms Edge computing high-speed railways multicasting group Steiner tree problem admission control

来源：评论

学校读者我要写书评

暂无评论

Modeling of Multi-Service Switching Networks With multicast Connections

引用

IEEE ACCESS 2022年 10卷 5359-5377页

作者： Stasiak, Maciej Sobieraj, Maciej Zwierzykowski, Piotr Poznan Univ Tech Inst Commun & Comp Networks PL-60965 Poznan Poland

This article presents an analytical model of a switching network that can be used in the nodes of a large number of modern multi-service networks. The model of a multi-service three-stage switching network proposed in this article has the advantage of providing the possibility to evaluate the point-to-point blocking probability for multicast connections. The information obtained in this way can then be used both at the stage of the estimation of the capacity of a new network and during the optimisation process of an existing network. In the calculations performed during the investigations, three scenarios for the fan out of multicast connections in the switching network are taken into consideration. The assumption is that the branching of a connection can occur in the first, second and the third stage of the switching network. The model proposed in the article is based on the concept of "effective" availability. The article discusses the methods for the determination of the effective availability parameter for successive connections that belong to a given multicast connection. The results of the analytical modelling are compared with the simulation data for three selected structures of multi-service switching networks to which different mixtures of multi-service BPP traffic are offered. The results of the calculations and the data provided by the simulation experiments validate and confirm high accuracy of the proposed model. This allows the model to be easily applied in practice to different environments to evaluate the capacities of the nodes in multi-service networks.

关键词： Switches Data models Computational modeling Analytical models multicast algorithms Optical switches Control systems multicast connections multi-service traffic optical switches switching network traffic engineering

来源：评论

学校读者我要写书评

暂无评论

Interference-Aware NFV-Enabled multicast Service in Resource-Constrained Wireless Mesh Networks

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2022年第1期19卷 424-436页

作者： Mirjalily, Ghasem Asgarian, Mina Luo, Zhi-Quan Yazd Univ Dept Elect Engn Yazd *** Iran Chinese Univ Hong Kong Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China

Network Function Virtualization is a key technology that enables network operators to provide diverse communication services flexibly over a common infrastructure, resulting in a significantly reduced cost. This paper addresses the problem of optimal network function virtualization for providing multicast services in wireless mesh networks with minimal total cost. This problem is modeled in two different ways: Link-based Model (LBM) and Path-based Model (PBM). In both models, we formulate the problem as an integer linear program to find the best hosts for virtual network functions and to steer traffic across them by considering wireless interference and resource budgets. Furthermore, we propose a heuristic solution based on the decomposition of the problem into two smaller sub-problems that can be solved sequentially in two phases. In the first phase, a multicast tree for forwarding traffic is constructed, while in the second phase, the required network functions are instantiated in appropriately chosen nodes. Simulation results are presented to compare the performance and complexity of the exact solutions of link-based and path-based approaches and the proposed heuristic approach. These results demonstrate the effectiveness of the proposed path-based model and the heuristic algorithm.

关键词： Routing multicast algorithms Measurement Wireless mesh networks Interference Heuristic algorithms Servers Interference network function virtualization multicast routing wireless mesh network

来源：评论

学校读者我要写书评

暂无评论

Quantum Binary Improved Artificial Bee Colony Algorithm to Solve the Spanning Tree Construction Problem in Vehicular Ad Hoc Network

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第22期11卷 36014-36029页

作者： Pan, Xiuqin Peng, Delong Li, Sumin Minzu Univ China Sch Informat Engn Beijing 100081 Peoples R China

Vehicle ad hoc network (VANET), with its characteristics of fast mobility and uneven distribution, adds complexity and uncertainty to the network. To ensure reliable routing connectivity in VANET, it is crucial to tackle challenges, such as implementing small-scale and low-precision solutions based on the spanning tree, as well as addressing the absence of effective contingency plans in case of failures. Constructing a large-scale suboptimal spanning tree solution set (LST) becomes the key to solving the aforementioned problems. Previous researchers have utilized swarm intelligence optimization algorithms to address the spanning tree construction problem. However, these methods suffer from drawbacks, such as low precision, poor scalability, lack of diversity, and uneven distribution. To tackle the aforementioned issues, this article proposes a quantum binary artificial bee colony algorithm (QBABC). First, the spanning tree hit ratio (SHR) is introduced to evaluate the probability of acquiring a spanning tree in VANET. Second, a mathematical model and data set are constructed based on the considered Quality-of-Service (QoS) metrics. Then, a quantum random number generator (QRNG) is proposed, which incorporates a fusion of binary encoding strategies. Finally, a multistage search strategy inspired by honeybee behavior is adopted. Through nonparametric statistics and validation with corresponding metrics, the results demonstrate that QBABC exhibits strong competitiveness and provides effective solutions in the event of VANET failures. QBABC's advantages lie in improving the precision, scalability, diversity, and uniformity of spanning tree construction. This research is of significant importance for enhancing reliable routing connectivity in VANET.

关键词： Vehicular ad hoc networks Search problems Routing multicast algorithms Quality of service Mathematical models Materials requirements planning Artificial bee colony algorithm (ABC) multicast routing multistage search strategy quantum random number generator (QRNG) spanning trees vehicular ad hoc network

来源：评论

学校读者我要写书评

暂无评论

On Batch Writing in COTS RFID Systems

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2024年第5期23卷 3846-3857页

作者： Liu, Kanghuai Chen, Lin Yu, Jihong Cui, Haochen Sun Yat Sen Univ Sch Comp Sci & Engn GuangDong Prov Key Lab Informat Secur Technol Guangzhou 510275 Peoples R China Beijing Inst Technol Sch Informat & Elect Beijing 100811 Peoples R China

We study the batch writing problem in RFID systems, where the reader seeks the most time-efficient way to write information into a given subset of tags. The problem is analogous to the multicast problem in classical networks, but one-to-many transmission is not supported in COTS RFID systems. Driven by the technical challenge, this paper addresses the problem of designing batch writing algorithms for COTS RFID systems. We make three contributions. First, we establish the minimal execution time for any batch writing algorithm, thus setting the theoretical performance limit. Second, we quantitatively compare and gauge the existing propositions applicable to our problem. Third, we develop a novel batch writing algorithm with minimal 25% performance gain over the best state-of-the-art solution. Our key technicalities are designing an encoding scheme allowing the reader to efficiently perform batch writing and optimizing the batch writing sequence to minimize the overall execution time. We also perform extensive experiments to demonstrate the effectiveness of our algorithm.

关键词： Writing Radiofrequency identification Standards Encoding Servers Optimization multicast algorithms Batch writing throughput optimization COTS RFID systems

来源：评论

学校读者我要写书评

暂无评论

Secure MIMO Communication Relying on Movable Antennas

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第4期73卷 2159-2175页

作者： Tang, Jun Pan, Cunhua Zhang, Yang Ren, Hong Wang, Kezhi Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Brunel Univ London Dept Comp Sci Uxbridge UB8 3PH England

This paper considers a movable antenna (MA)-aided secure multiple-input multiple-output (MIMO) communication system consisting of a base station (BS), a legitimate information receiver (IR) and an eavesdropper (Eve), where the BS is equipped with MAs to enhance the system's physical layer security (PLS). Specifically, we aim to maximize the secrecy rate (SR) by jointly optimizing the transmit precoding (TPC) matrix, the artificial noise (AN) covariance matrix and the MAs' positions under the constraints of the maximum transmit power and the minimum spacing between MAs. To solve this non-convex problem with highly coupled optimization variables, the block coordinate descent (BCD) method is applied to alternately update the variables. Specifically, we first reformulate the SR into a tractable form, and derive the optimal TPC matrix and the AN covariance matrix with fixed MAs' positions by applying the Lagrangian multiplier method in semi-closed forms. Then, the majorization-minimization (MM) algorithm is employed to iteratively optimize each MA's position while keeping others fixed. We also extend this work to the more general multicast scenario. Finally, simulation results are provided to demonstrate the effectiveness of the proposed algorithms and the significant advantages of the MAs over conventional fixed position antennas (FPAs) in enhancing system's security.

关键词： Covariance matrices MIMO communication Antennas Security Optimization multicast algorithms Array signal processing Movable antenna (MA) physical layer security (PLS) artificial noise (AN) antenna position optimization

来源：评论

学校读者我要写书评

暂无评论

Optimizing Resource Allocation for Wireless VR Services

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2024年第5期17卷 2719-2732页

作者： Wang, Chih-Hang Shi, Yishuo Yang, De-Nian Chen, Chih-Yen Liao, Wanjiun Acad Sinica Inst Informat Sci Taipei City 115201 Taiwan Wenzhou Univ Coll Math & Phys Dept Stat & Informat Sci Wenzhou 325035 Peoples R China Acad Sinica Res Ctr Informat Technol Innovat Taipei 115201 Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 10617 Taiwan

The virtual reality (VR) market is expected to reach 202.7 billion dollars by 2028, at a compound annual growth rate of 24.74% over the forecast period 2023-2028. It motivates innovative VR services in touring, E-commerce, and social activities, and effective VR video streaming becomes essential. However, VR services are envisaged to consume a large amount of bandwidth, but current research primarily focuses on multimedia streaming for each individual user without considering the opportunity of view synthesis for multicast to reduce wireless resource consumption further. In this article, we formulate a new optimization problem VR Content Sharing and multicasting (VCSM) and prove the NP-hardness. Then, we propose an approximation algorithm, named Efficient View Synthesis and multicasting (EVSM), to select multicast views and their Modulation and Coding Schemes (MCS) for wireless VR services. Afterward, we extend EVSM to support dynamic user behaviors and increase scalability with distributed mobile edge computing. We also explore the intrinsic properties of view selections to find the optimal solution for regular user deployment. Experiment results show that EVSM can effectively reduce bandwidth consumption for VR services by more than 50%.

关键词： Bandwidth multicast algorithms Wireless communication multicast communication Heuristic algorithms Approximation algorithms Streaming media Optimization approximation algorithm multicast VR

来源：评论

学校读者我要写书评

暂无评论

Approaching Work-Conserving Scheduling Algorithm for Mixed Unicast and multicast in Combined Input and Crosspoint Queued Switch

引用

IEEE SYSTEMS JOURNAL 2022年第1期16卷 1400-1411页

作者： Yan, Fulong Deng, Xiong Li, Chao Chen, Chen Alibaba Grp Alibaba Cloud Beijing Peoples R China Eindhoven Univ Technol Dept Elect Engn Eindhoven Netherlands Southwest Jiaotong Univ Sch Informat Sci & Technol Ctr Informat Photon & Commun Chengdu 611756 Peoples R China Anhui Univ Inst Phys Sci & Informat Technol Informat Mat & Intelligent Sensing Lab Anhui Prov Hefei Anhui Peoples R China Chongqing Univ Sch Microelect & Commun Engn Chongqing 400044 Peoples R China

A novel scheduling algorithm supporting mixed unicast and multicast traffic and featured by the longest virtual queue first (LVQF) was proposed for combined input and crosspoint queued (CICQ) architecture. Considering the differences between unicast and multicast traffic, LVQF takes the virtual queue length as the weight value for unicast and multicast queues. The weight setting of LVQF coordinates the fairness of unicast and multicast scheduling efficiently. Moreover, the design of LVQF is characterized by approaching the inherent work-conserving of the output queued architecture. By balancing the occupancy of crosspoint buffers, LVQF maintains the switch operating in a work-conserving state to the largest extend. By introducing the traffic regulation module in CICQ, an enhanced approaching work-conserving (AWC) algorithm developed from LVQF (AWC-LVQF) is proposed to further approach the work-conserving state. Simulation results demonstrate that LVQF and AWC-LVQF algorithms can significantly improve the average latency performance with respect to the existing popular algorithms for CICQ switch. In particular, the performance improvement enlarges as the ratio of multicast traffic increases.

关键词： Unicast Switches Scheduling multicast algorithms Scheduling algorithms Throughput Regulation Combined input and crosspoint queued (CICQ) packet scheduling unicast and multicast weight

来源：评论

学校读者我要写书评

暂无评论

DH-SVRF: A Reconfigurable Unicast/multicast Forwarding for High-Performance Packet Forwarding Engines

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第5期33卷 1262-1275页

作者： Jin, Zhu Jia, Wen-Kang Fujian Normal Univ Coll Photon & Elect Engn Fuzhou 350007 Fujian Peoples R China

High-performance multicast-enabled packet forwarding engines (PFEs), as an essential component of high-end switches, use a polynomial-time membership query algorithm to determine which port(s) the data packet should be forwarded. The currently widely used query algorithm is Bloom Filter (BF), which has been proven to have many fatal flaws. Another error-free membership query algorithm includes Scalar-pair Vectors Routing Forwarding (SVRF), Fractional-N Scalar-pair Vectors Routing Forwarding (Frac-N SVRF), and the Per-Port Prime Filter Array (P(3)FA) also have some shortcomings in space and time efficiencies. In this paper, we proposed a hybrid strategy: Divaricate Heterogeneous SVRF (DH-SVRF) scheme, which based on the P(3)FA and Frac-N SVRF, which randomly divides all member ships into N groups, and each group has the same structure and is independent of each other to obtain higher time efficiency and space utilization. Finally, we also discussed the selection of the optimal egress-diversity threshold. Through mathematical modeling and simulation, we validate that the proposed DH-SVRF scheme is superior to the SVRF/Frac-N SVRF and traditional BF in terms of scalability, space utilization, and time efficiency in specific conditions such as appropriate egress-diversity thresholds.

关键词： Engines Routing Unicast Scalability multicast algorithms Switches Filtering algorithms multicast packet forwarding engine (PFE) membership querying bloom filter (BF) scalar-pair vectors routing and forwarding (SVRF) divaricate heterogeneous

来源：评论

学校读者我要写书评

暂无评论

Fast First-Order Algorithm for Large-Scale Max-Min Fair Multi-Group multicast Beamforming

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2022年第8期11卷 1560-1564页

作者： Zhang, Chong Dong, Min Liang, Ben Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada Ontario Tech Univ Dept Elect Comp & Software Engn Oshawa ON L1G 0C5 Canada

We propose a first-order fast algorithm for the weighted max-min fair (MMF) multi-group multicast beamforming problem in large-scale systems. Utilizing the optimal multicast beamforming structure obtained recently, we convert the nonconvex MMF problem into a min-max weight minimization problem and show that it is a weakly convex problem. We propose using the projected subgradient algorithm (PSA) to solve the problem directly, instead of the conventional method that requires iteratively solving its inverse problem. We show that PSA for our problem has closed-form updates and thus is computationally cheap. Furthermore, PSA converges to a near-stationary point of our problem within finite time. Simulation results show that our PSA-based algorithm offers near-optimal performance with considerably lower computational complexity than existing methods for large-scale systems.

关键词： Array signal processing Signal to noise ratio multicast algorithms Interference Quality of service Optimization Signal processing algorithms multicast beamforming optimal beamforming structure large scale projected subgradient weakly convex optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：