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

2D-SVRF: A Terabit-Scale multicast Packet Switching Control Plane for 5G/6G Core Networks

IEEE INTERNET OF THINGS JOURNAL 2024年第17期11卷 28356-28369页

作者： Jia, Wen-Kang Chen, Yaw-Chung Shi, Xiaoning Fujian Normal Univ Coll Photon & Elect Engn Fuzhou 350007 Fujian Peoples R China Natl Yang Ming Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

Scalability and performance are major challenges in developing high-performance multicast packet switching technologies in the 5G/6G core networks. We propose a novel scheme called 2-D scalar-matrix and vectors routing and forwarding (2D-SVRF) to address these two issues. Our scheme improves upon commonly used algorithms, Bloom filter (BF) and scalar-pair vectors routing and forwarding (SVRF), which have limitations in space and time efficiency, especially in carrier-grade packet forwarding engines (PFEs) with high-port-density and large membership-capacity. 2D-SVRF transforms a scalar-vector into a scalar-matrix by dividing an n-element group into N-rows (sub-blocks) and dividing an output-port bitmap with rho -elements into M-columns within each sub-block. This enables the reuse of smaller and identical prime keys among different sub-blocks and subscalars. By leveraging this approach, multicast forwarding can be partitioned to exploit parallelism, resulting in reduced memory usage and lower computational complexity. Simulation evaluation confirms that 2D-SVRF outperforms competing algorithms in terms of scalability and efficiency, particularly when optimized with the (M, N) parameters. The 2D-SVRF approach is expected to make the implementation of SVRF feasible in carrier-grade multicast-enabled switches and routers.

关键词： Switches Routing multicast algorithms Vectors Memory management Cathode ray tubes Scalability Carrier-grade membership query multicast packet forwarding engine (PFE) scalability

来源：评论

学校读者我要写书评

暂无评论

Integrated multicast and Unicast Transmission in IRS-NOMA Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2023年第4期72卷 5473-5478页

作者： Xie, Ye Ding, Zhiguo Dai, Xuchu Chinese Acad Sci Univ Sci & Technol China Key Lab Wireless Opt Commun Hefei 230026 Peoples R China Univ Manchester Sch Elect & Elect Engn Manchester M13 9PL England

This paper considers an integrated multicast and unicast downlink communication system using the non-orthogonal multiple access (NOMA) scheme assisted by an intelligent reflecting surface (IRS). We aim to maximize the unicast data rate while keeping the multicast data rates above a target level by adjusting the reflecting elements of the IRS. The corresponding formulated problem is a nonconvex quadratically constrained quadratic program (QCQP), which is NP-hard. We propose a global optimal algorithm based on branch and bound (BB) and a low-complexity suboptimal algorithm based on semidefinite relaxation (SDR). The simulation results show that the proposed IRS-NOMA scheme outperforms IRS-assisted orthogonal multiple access (OMA) and IRS-NOMA with random phases. Besides, the suboptimal algorithm achieves a better tradeoff between performance and complexity.

关键词： Unicast multicast algorithms NOMA Optimization Internet of Things Wireless communication Resource management Branch and bound IRS nonconvex QCQP SDR

来源：评论

学校读者我要写书评

暂无评论

Joint User Grouping and Resource Allocation for LEO Satellite multicast

引用

IEEE SYSTEMS JOURNAL 2023年第3期17卷 4695-4702页

作者： Li, Yuwei Zhu, Shibing Dai, Jianmei Space Engn Univ Beijing 100000 Peoples R China

Similar to the dilemma encountered by terrestrial wireless networks, low Earth orbit (LEO) satellite networks are also facing the problem of increasing pressure caused by the growth of wireless traffic. Wireless multicast technology is an effective technique on improving the spectrum efficiency by sending the same signal to multiple users who request the same service. In this article, the LEO satellite transmission system is considered and a maximum system capacity problem is formulated. To solve the original nonconvex problem efficiently, a joint user grouping and resource allocation scheme is proposed. There are two parts in the scheme: on the one hand, we propose an improved K-means++ algorithm for user grouping;on the other hand, we proposed a joint power and bandwidth allocation algorithm using the two stage iteration method. Compared with the baseline approach, our proposed scheme can improve the capacity 10% higher at least.

关键词： Satellites multicast algorithms Low earth orbit satellites Resource management Doppler effect Satellite broadcasting Clustering algorithms Improved k-means plus plus joint resource allocation low Earth orbit (LEO) satellite networks multicast

来源：评论

学校读者我要写书评

暂无评论

Delay-Optimized multicast Tree Packing in Software-Defined Networks

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2023年第1期16卷 261-275页

作者： Zhang, Xinchang Wang, Yinglong Geng, Guanggang Yu, Jiguo Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Peoples R China Qilu Univ Technol Shandong Acad Sci Coll Comp Sci & Technol Jinan 250014 Peoples R China Qilu Univ Technol Shandong Acad Sci Shandong Prov Key Lab Comp Net works Jinan 250014 Peoples R China Jinan Univ Coll Cyber Secur Guangzhou 510632 Peoples R China

In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network accommodation capacity but is disadvantageous to fully use network resources. In this article, we propose a delay-optimized multicast tree packing problem called delivery delay minimized multicast tree packing (DDMMTP), which aims to minimize the average source-destination delay, under constraints on the bandwidth and maximum source-destination delay, according to available network resources. A low source-destination delay is desirable because it improves the service quality, especially for time-sensitive applications. In practice, the DDMMTP is highly valuable for the software-defined network (SDN) mainly because this new network paradigm has the ability to rapidly rearrange multicast routes on demand. The DDMMTP problem is NP-hard. We solve it approximately by a batched multicast tree packing algorithm and a network accommodation capacity improvement algorithm that adjusts existing multicast paths on demand. We also propose a source-destination delay improvement algorithm to further reduce source-destination delays based on new available network resources.

关键词： Delays multicast algorithms Receivers Bandwidth Heuristic algorithms Topology multicast communication multicast tree packing software-defined network delay bandwidth

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource allocation for multicast in SDM-EON: time-decoupled dynamic path cross talk and joint weight

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2023年第9期15卷 687-699页

作者： Ma, Yudong Yang, Xin Sun, Qang Zhao, Yue Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China

With the development of the Internet and the rise of multicast, enabling multicast in a space division multi-plexing elastic optical network (SDM-EON) is considered highly necessary. This paper focuses on the dynamic resource allocation for multicast in SDM-EON. First, to ensure service survivability and reduce the complexity of inter-core cross talk computation, we design a path-based strict cross talk avoidance routing, modulation, core, and spectrum allocation (PSCA-RMCSA) algorithm. Then, based on PSCA-RMCSA, a joint weight and PSCA-RMCSA (JW-PSCA-RMCSA) algorithm is proposed to further reduce the blocking probability (BBP) of services. Simulation results show that PSCA-RMCSA reduces the BBP by up to 7.55% and the resource allocation time by up to 88.63%, while JW-PSCA-RMCSA reduces the BBP by up to 10.43% and the resource allocation time by up to 82.11%, when compared to the shortest path tree RMSCA. (c) 2023 Optica Publishing Group

关键词： Resource management multicast algorithms Routing Heuristic algorithms Optical switches Complexity theory Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning Based Intelligent Resource Allocation in Hybrid Vehicle Scenario

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2025年第3期74卷 4656-4668页

作者： Lou, Chengkai Hou, Fen Li, Bo Ding, Hongwei Univ Macau State Key Lab IoT Smart City Macau 999078 Peoples R China Univ Macau Dept ECE Macau 999078 Peoples R China Yunnan Univ Sch Informat Sci & Engn Kunming 650106 Peoples R China

In recent years, there has been rapid development in vehicular networks and autonomous driving. While vehicles of various intelligence levels are becoming more common on the road, most research overlooks the data distribution across different vehicles in multicast scenarios. Our aim is to allow different kinds of vehicles to receive the needed content in a multicast scenario and to fulfill certain freshness requirements. Although deep reinforcement learning (DRL) has been widely used to address this issue, it suffers from slow training convergence and unstable performance. Hence, this study proposes combining DRL algorithms with behavior cloning and action mask, leveraging prior knowledge and expert algorithms to enhance performance. Finally, the freshness of the data content is ensured for all kinds of vehicles and effective data transmission is achieved. The simulation results indicate a significant improvement in the training efficiency and performance in our proposed method, with 15.6% to 31.9% improvement in terms of effective traffic compared to other counterparts.

关键词： Resource management Optimization Vehicle dynamics Cloning Real-time systems multicast algorithms Autonomous vehicles Quality of service Heuristic algorithms Dynamic scheduling Age of information deep reinforcement learning multicastvehicular network

来源：评论

学校读者我要写书评

暂无评论

P³FA: Unified Unicast/multicast Forwarding Algorithm for High-Performance Router/Switch

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2022年第4期68卷 327-335页

作者： Jin, Zhu Jia, Wen-Kang Fujian Normal Univ Coll Photon & Elect Engn Fuzhou 350117 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 211189 Peoples R China

High-performance multicast packet switching technologies are evolving to meet the growing demand for scalability on the Internet and datacenters, etc. Implementing a high-performance switch/router relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representatives of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as false-positive probability and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the RNS, we propose a simplified forwarding algorithm in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, P3FA improves multicast and unicast time efficiency by 1 to 4 orders of magnitude in the port-density 16-1024 range compared to previous works. Although it comes at the expense of hardware cost, it is still acceptable compared to recently improved previous work.

关键词： Routing Switches multicast algorithms Scalability Internet IP networks Performance evaluation multicast communication multicast router switch packet forwarding engine membership querying scalar-pair vectors routing and forwarding (SVRF)

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity Location-Based Hybrid Multiple Access and Relay Selection in V2X multicast Communications

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2022年第9期71卷 10185-10190页

作者： Wei, Chun-Yi Wang, Yung Kai Natl Taipei Univ Dept Commun Engn New Taipei 23741 Taiwan Natl Yang Ming Chiao Tung Univ Coll Elect & Comp Engn Hsinchu 300 Taiwan

This study investigated relay-assisted mode 1 sidelink (SL) multicast transmission, which encounters interference from mode 2 SL transmission, for use in low-latency vehicle-to-everything communications. To accommodate mode 1-mode 2 SL traffic, we use the hybrid multiple access (MA) approach, which combines orthogonal MA (OMA) and nonorthogonal MA (NOMA) schemes. We introduce a low-complexity location-based hybrid MA algorithm and its associated relay selection that can be used when SL channel state information is unavailable.

关键词： Relays NOMA Vehicle-to-everything Unicast multicast algorithms Complexity theory 3GPP 5G multicast multiple access relay V2X

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity ADMM-Based Algorithm for Robust Multi-Group multicast Beamforming in Large-Scale Systems

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 2046-2061页

作者： Mohamadi, Niloofar Dong, Min Shahbaz Panahi, Shahram Ontario Tech Univ Dept Elect Comp & Software Engn Oshawa ON L1G 0C5 Canada

We design an efficient robust multi-group multicast beamforming scheme for massive multiple-input multiple-output (MIMO) systems. Assuming only estimates of the channel covariance matrices are available at the base station with a bounded error, we formulate the robust quality-of-service (QoS) problem, which is to minimize the transmit power subject to the worst-case minimum signal-to-interference-plus-noise-ratio (SINR) guarantee. We directly solve the worst-case SINR problem and convert the robust QoS constraint into a number of non-convex constraints. Based on the recent convergence result of the alternating direction method of multipliers (ADMM) for non-convex problems, we develop an ADMM-based fast algorithm to directly tackle the reformulated non-convex problem with a convergence guarantee. The algorithm contains two layers of ADMM procedures. We design the outer-layer ADMM to decompose the problem into three convex subproblems and solve them alternatingly. We further develop an inner-layer consensus-ADMM-based algorithm to efficiently solve one subproblem. By exploring each subproblem structure and developing the special optimization techniques, we obtain closed-form or semi-closed-form solutions to each subproblem. These results lead to a fast iterative algorithm, which is guaranteed to converge to a stationary point of the original robust QoS problem. Simulation shows that our proposed algorithm provides a favorable performance compared with existing alternative methods with magnitudes of computational complexity reduction.

关键词： Array signal processing Quality of service multicast algorithms Signal to noise ratio Signal processing algorithms Interference Convergence Robust multicast beamforming large-scale systems alternating direction method of multipliers (ADMM) low-complexity convergence

来源：评论

学校读者我要写书评

暂无评论

Cooperative Robust Video multicast in Integrated Terrestrial-Satellite Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第10期21卷 8276-8291页

作者： Zhang, Ming Lu, Hancheng Hong, Peilin Univ Sci & Technol China CAS Key Lab Wireless Opt Commun Hefei 230027 Peoples R China Hefei Comprehens Natl Sci Ctr Inst Artificial Intelligence Hefei 230088 Peoples R China

Integrated terrestrial-satellite networks (ITSNs) are the promising trends of future networks. However, there exist great challenges when performing video multicast in ITSNs due to the strong heterogeneity of users in comprehensive satellite coverage and the inter-system complex co-channel interference. To overcome these, we make the first attempt to propose an efficient cooperative robust video multicast (CRVM-ITSN) framework in ITSNs. The basic idea is to leverage the non-orthogonal multiple access technique in the cooperative transmission of ITSNs to achieve high-efficiency robust video multicast. The desired robust multicast performance realizes that the recovered video quality can adapt to diverse channel conditions of users. In CRVM-ITSN, to achieve the optimal cooperative transmission performance, power allocation and chunk scheduling of video data are jointly formulated as a distortion minimization problem, which is a non-convex mixed integer non-linear programming problem. To solve it, we design a provably convergent optimal algorithm by converting it to be convex. Besides, based on the theorem on optimal chunks selection of satellite cooperative transmission, a low-complexity chunk grouping algorithm is proposed to accelerate the optimal algorithm. Simulation results have demonstrated the superiority of proposed CRVM-ITSN against existing reference schemes, achieving about 4.1dB more gains in the recovered video quality.

关键词： Satellites NOMA Resource management Satellite broadcasting multicast algorithms Video recording Quality assessment Integrated terrestrial-satellite networks video multicast non-orthogonal multiple access non-convex mixed integer non-linear programming

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：