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

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

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Joint Antenna Selection and Robust Multi-Group multicast Beamforming for Massive MIMO

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2024年 72卷 792-808页

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

We consider low-complexity design for joint antenna selection and robust multi-group multicast beamforming in massive multiple-input multiple-output (MIMO) systems. Relying on the estimated channel covariance and assuming a limited number of antennas for transmission at the base station, we aim to minimize the transmit power subject to the worst-case signal-to-interference-plus-noise-ratio (SINR) guarantee and per selected antenna power budget. Converting the worst-case SINR constraints to a set of non-convex constraints, we propose a two-phase approach to solve the problem efficiently: the antenna selection phase, followed by the robust multicast beamforming generation phase. We propose an SINR-based approach for antenna selection, where the challenging mixed-integer problem is converted into an approximate joint optimization problem via a sequence of transformation, relaxation, and SINR approximation. We develop a fast two-layered alternating direction method of multipliers (ADMM)-based algorithm to compute an approximate solution. In particular, with our ADMM construction, we obtain semi-closed-form solutions for antenna selection and beamforming subproblems at each ADMM iteration for fast updates. To further reduce the computational complexity, we propose a signal-to-leakage-ratio (SLR)-based approach using the SLR constraints in the joint optimization problem. This allows us to develop a two-layered ADMM-based algorithm, which can compute a solution more efficiently due to the SLR structure. The robust multicast beamforming solution for the selected antennas is computed using the fast algorithm we developed recently. Simulation results show the effectiveness of our two proposed approximated approaches for antenna selection and the overall two-phase approach in both overall performance and substantially low computational complexity in a massive MIMO setting.

关键词： Array signal processing Antennas multicast algorithms Massive MIMO Transmitting antennas Signal to noise ratio Interference Antenna selection robust multicast beamforming large-scale systems ADMM low complexity

来源：评论

学校读者我要写书评

暂无评论

Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks

引用

PARALLEL COMPUTING 1998年第2期24卷 267-286页

作者： Misic, J Hong Kong Univ Sci & Technol Dept Comp Sci Kowloon Peoples R China

A contention-free unicast-based multicast algorithm is developed for wormhole-routed star graph interconnection networks. Since the size of the buffers in the wormhole routing controller is much smaller than the size of the message, only destination nodes of multicast should receive message and store it in their local buffers;all other nodes can only relay message via their routing controllers. For this reason, the neighbor-to-neighbor communications approach (used for developing broadcast, scatter and total exchange algorithms) is replaced with a hierarchical approach: a multicast tree composed of unicasts, in which only destination;nodes receive the message. Furthermore, a methodology for proving the contention-free property of the hierarchical multicast implementation of the algorithm is developed. This methodology provides sufficient conditions for contention avoidance in the multicast algorithm regardless of the number of simultaneous unicasts permitted by the hardware architecture of the communication processor from the particular node. In order to eliminate contention in the multicast algorithm, a deterministic nonminimal routing algorithm is developed as well. It is shown that the proposed nonminimal routing uses only the same number of virtual channels. (n - 1) required by the minimal routing to avoid deadlock. This feature allows minimal and nonminimal routing to exist in the network at the same time. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： communication multicast algorithms star graph interconnection networks nonminimal routing algorithm contention-free algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Optimal multicast Scheduling and Caching for Improved Performance and Energy Saving in Wireless Heterogeneous Networks

引用

IEEE TRANSACTIONS ON BROADCASTING 2021年第1期67卷 119-130页

作者： Zhong, Lujie Xu, Changqiao Chen, Jiewei Yan, Weiqi Yang, Shujie Muntean, Gabriel-Miro Capital Normal Univ Informat Engn Coll Beijing 100048 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Dublin City Univ Sch Elect Engn Performance Engn Lab Dublin 9 Ireland

Base station caching and multicast are two promising methods to support mass content delivery in future wireless network environments. However, existing scheduling designs do not take full advantage of the two methods. This article focuses on employing multicast scheduling and caching in a network architecture which involves both macro cell base stations (MBS) and small cell base stations (SBS) in order to achieve joint optimization of average delay and power consumption. We describe this co-optimization problem as the multicast-Aware Caching Scheduling Problem (MACSP). This article proposes a novel pending request queue model, which aims to solve the problem of long waiting time for non-popular content, and transform this collaborative multicast-cache scheduling problem into a Markov Decision Process that can be solved using reinforcement learning methods. For actual deployment, the paper further introduces a Distributed Policy Gradient algorithm (DPG) with similar performance and lower complexity. The simulation-based testing results demonstrate that our model and algorithm have better performance and lower energy consumption than existing state-of-the-art approaches.

关键词： Base stations Wireless networks Computer architecture Optimization multicast algorithms 5G mobile communication Cache multicast Markov decision process reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Online Scheduling for Dynamic VM Migration in multicast Time-Sensitive Networks

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2020年第6期16卷 3778-3788页

作者： Yu, Qinghan Wan, Hai Zhao, Xibin Gao, Yue Gu, Ming Tsinghua Univ Sch Software Beijing 100084 Peoples R China

With the development of hardware virtualization and cloud computing, modern industry has a tendency to upgrade from the traditional industrial networks to virtual machine (VM) based networks. To provide firm latency guarantees for control messages in these networks, the time-sensitive network (TSN) is a promising technology due to its determinacy for real-time applications. However, TSN faces the challenge of providing a rapid response to dynamic transmission requirement changes incurred by VM migrations. In this paper, we proposed an online scheduling approach to deal with dynamic VM migrations in multicast TSN. In this approach, we devise a novel online scheduling framework [minimal distance tree (MDT) construction - heuristic breadth first search] containing an offline scheduling phase and an online rescheduling phase. While the offline phase introduces a MDT to increase reusable scheduling results, the online phase proposes a heuristic scheduling approach to reuse the results of the offline phase as much as possible to accelerate the rescheduling process. Experiments show that our framework can provide a rapid response to dynamic VM migrations compared with the existing approaches where the amount of control data does not exceed 50% of the bandwidth.

关键词： Job shop scheduling Schedules Real-time systems Routing Dynamic scheduling multicast algorithms Processor scheduling Online scheduling real time time-sensitive network (TSN) virtual machine (VM) migration

来源：评论

学校读者我要写书评

暂无评论

Resource Scheduling for High-Capacity multicast Service in Ultra-Dense LEO Satellite Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第2期73卷 2468-2481页

作者： Ma, Ting Qian, Bo Qin, Xiaohan Zhang, Xin Cai, Lin X. Zhou, Haibo Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Peoples R China Peng Cheng Lab Dept Math & Theories Shenzhen 518000 Peoples R China IIT Dept Elect & Comp Engn Chicago IL 60616 USA

Ultra-dense low earth orbit (LEO) network has been envisioned as a promising solution to improve communication coverage and reliability. In this article, we investigate the resource scheduling for the downlink multigroup multicast cooperative transmissions in an ultra-dense LEO network, where multiple LEO satellites serve as aerial base stations to cooperatively offer high-capacity multicast service for ground users (GUs) within the coverage. To obtain the system max-min fair (MMF) capacity, we formulate a weighted MMF downlink beamforming and subchannel assignment problem. As the formulated problem is NP-hard and non-convex, we adopt a many-to-many matching model to solve the subchannel assignment, and apply the successive convex approximation (SCA) coupled with Gaussian randomization and cochannel power control to obtain the downlink beamforming during the matching process. Furthermore, the matching algorithm is guaranteed to converge to a two-side exchange stable matching within finite iteration steps. Extensive numerical results are provided to demonstrate the superiority and effectiveness of the proposed resource scheduling scheme for cooperative multicast transmissions.

关键词： Low earth orbit satellites Satellites Satellite broadcasting Array signal processing Antenna arrays Downlink multicast algorithms Resource scheduling multicast ultra-dense LEO networks beamforming subchannel assignment

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Optimization in U2U multicast Networks: A Hypergraph-Based Matching Approach

引用

IEEE SYSTEMS JOURNAL 2023年第2期17卷 2189-2200页

作者： Jia, Qian Zhang, Yuli Chen, Runfeng Liu, Dianxiong Wang, Haichao Jiao, Yutao Li, Guoxin Army Engn Univ PLA Coll Commun Engn Nanjing 210000 Peoples R China Acad Mil Sci Natl Innovat Inst Def Technol Beijing 100071 Peoples R China Acad Mil Sci Inst Syst Engn Beijing 100141 Peoples R China

The energy issue of unmanned aerial vehicle (UAV) has received unprecedented attention recently. UAV-to-UAV multicast technology reduces transmit power through neighbor transmission, which is critical for saving energy and reducing information redundancy. This article investigates an energy efficiency optimization problem of the base station-UAVs system with the heterogeneous requirements of UAVs. The optimization problem is modelled as a weighted directed hypergraph matching game based on group preference, which is proven to achieve stable results. To address the topological change problem of UAV networks, a fast convergence algorithm is proposed in this article, which exhibits high stability when small fluctuations appear in the UAV topology. The proposed algorithm integrates the potential matching algorithm and local search, by which no-quota deferred acceptance can be realized. Compared with existing algorithms, the proposed algorithm improves throughput per energy consumption by more than 20%.

关键词： Optimization Autonomous aerial vehicles Games Task analysis multicast algorithms Resource management Redundancy Energy efficiency matching game multicast potential game

来源：评论

学校读者我要写书评

暂无评论

multicast Optimization for CLOS Fabric in Media Data Centers

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2019年第4期16卷 1855-1868页

作者： Latif, Ammar Kathail, Pradeep Vishwarupe, Sachin Dhesikan, Subha Khreishah, Abdallah Jararweh, Yaser New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Cisco Syst Inc Network Architecture Grp San Jose CA 95134 USA Duquesne Univ Comp Sci Dept Pittsburgh PA 15219 USA

multicast is widely deployed in data centers for point-to-multi-point communications. multicast is increasingly being used to carry uncompressed video in media data centers with very large bandwidth requirements per flow. multicast control protocols such as IGMP and PIM build multicast trees without trying to maximize the overall fabric capacity, leading to decreased fabric utilization and inability to service flows. In addition, existing multicast protocols are not bandwidth-aware and could cause links to over-subscribe leading to packet loss and negative user quality of experience. In this paper, we formulate offline optimization for multicast trees in clos fabric. We then design and implement two novel algorithms, iRP and LiRP, to optimize multicast tree formation and increase overall fabric multicast capacity. iRP algorithm optimizes online formation of multicast trees while addressing bandwidth requirements using SDN controller. We share analysis of TV studio repetitive traffic patterns the benefits of time series forecasting to predict multicast group membership and bring online optimization efficiency closer to offline optimization results. We then implement and test LiRP algorithm to increases iRP's fabric efficiency by implementing k-fold cross validation method to predict future multicast group memberships leading to optimized multicast tree placement. We implement iRP and LiRP algorithms using controller-based system and test both algorithms using Cisco Nexus commercially available switches. Testing results confirm that iRP Algorithm increases fabric capacity by 60 compared to PIM performance. LiRP system increases the efficiency of iRP by up to 40 through prediction of multicast group memberships with online arrival.

关键词： Fabrics Bandwidth multicast algorithms Optimization Data centers Prediction algorithms Streaming media multicast controller dc fabric uncompressed video neural networks optimization

来源：评论

学校读者我要写书评

暂无评论

TIME-SLOT ASSIGNMENT IN TDM multicast SWITCHING SYSTEMS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1994年第1期42卷 149-165页

作者： CHEN, WT SHEU, PR YU, JH Department of Computer Science National Tsing Hua University Hsinchu Taiwan

The time slot assignment problem in time-division multiplexed switching systems which tan support multicast transmissions is studied. It is shown that this problem is NP-complete, i.e., computationally intractable. Two effective heuristic algorithms are proposed, and computer simulations are also performed to evaluate the performance of both algorithms. The results of the simulations indicate that the solutions generated by these heuristic algorithms are very close to the optimal on the average. In addition, this problem is also examined under a more restrictive condition that the destination sets of any two multicast packets are either identical or disjoint, a situation often encountered in many practical applications. It is proved that this special problem is still: NP-complete, Two fast heuristic algorithms are given, which can find solutions not greater than twice the optimal solution. Computer simulations for evaluating these two heuristic algorithms are also performed, Experimental results demonstrate that the solutions of the two algorithms are almost equal to the optimal.

关键词： Time division multiplexing Switching systems Matrix decomposition multicast algorithms Heuristic algorithms Computer simulation Computational modeling Application software Performance evaluation Packet switching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：