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

Softwarized IP multicast in the Cloud

IEEE NETWORK 2021年第6期35卷 233-239页

作者： Luo, Shouxi Xing, Huanlai Fan, Pingzhi Southwest Jiaotong Univ Sch Comp & Artificial Intelligence Chengdu Peoples R China Southwest Jiaotong Univ Inst Mobile Commun Chengdu Peoples R China

In this article, we revisit the problem of how to provide "native" IP multicast support to enterprise distributed applications in today's clouds, without touching either the application implementation or the underlying network hardware. We propose SDM, Software-Defined IP multicast, to explore the idea of performing multicast-to-Unicast (M2U) and Unicast-to-multicast (U2M) translations at the virtualized network edge. At the data plane, with novel architecture designs, SDM achieves efficient M2U and U2M translations by only using Open vSwitch (OVS), an OpenFlow-compatible open-source software switch widely deployed in modern clouds. At the control plane, SDM dynamically adopts multicast trees respecting the join and leave of receivers with flexible cost-based algorithms. SDM is very easy to deploy and use, as its required features are already supported by off-the-shelf OVS software (version >= 2.3) and the OpenFlow protocol (version >= 1.1). Performance evaluations of its control-plane algorithms also imply that SDM is flexible to construct throughput and latency/height optimized multicast trees respecting task requirements.

关键词： IP networks Cloud computing Receivers Unicast Servers multicast algorithms Containers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Low Latency Allcast Over Broadcast Erasure Channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第3期69卷 1604-1617页

作者： Graham, Mark A. Ganesh, Ayalvadi J. Piechocki, Robert J. Univ Bristol Sch Math CDT Commun Bristol England RokeManor Meteor Court Gloucester GL4 3GG England Univ Bristol Sch Math Bristol BS8 1UG England Univ Bristol Dept Elect & Elect Engn Bristol BS8 1UB England

Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each broadcast reaches a random subset of nodes. The objective is to minimise the time until all nodes have received all packets. We study two schemes, (i) random relaying, and (ii) random linear network coding, and analyse their performance in an asymptotic regime in which n tends to infinity. Simulation results for a wide range of n are also presented.

关键词： Approximation algorithms Network coding multicast algorithms Delays Topology Costs Upper bound broadcast channels random graphs

来源：评论

学校读者我要写书评

暂无评论

Delay-Sensitive Multi-Source multicast Resource Optimization in NFV-Enabled Networks: A Column Generation Approach

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2021年第1期18卷 286-300页

作者： Muhammad, Ali Sorkhoh, Ibrahim Qu, Long Assi, Chadi Concordia Univ Elect & Comp Engn Dept Montreal PQ H3G 1M8 Canada Concordia Univ Comp Sci & Software Engn Dept Montreal PQ H3G 1M8 Canada Ningbo Univ Fac Elect Engn & Comp Sci Ningbo 315211 Peoples R China Concordia Univ Informat Syst Engn Dept Montreal PQ H3G 1M8 Canada

Telecommunication networks are currently realizing more-huge-than-ever data demands from subscribers all over the world. Due to the ongoing pandemic, nearly all businesses have adapted working models with remote operations. People engaged with major industries, e.g., academia, health and municipalities are utilizing online platforms to carryout their routine tasks. This indeed shifts the attention from one-to-one (unicast) communication to one-to-many (multicast) and many-to-many (multi-source multi-destination) communications. Network operators are facing increased pressure to provide quick responses in order to satisfy the bandwidth hungry and time sensitive user demands. This can only be done by enhancing deployability as well as manageability of the services. Network Function Virtualization (NFV) provides a transformation of traditional proprietary network designs to a more agile and software based environment in order to achieve flexible deployments, reduced setup costs and less-time-to-market for the new services which is very much needed in the current scenarios. Previous studies on NFV-enabled multicast problem either proposed Integer Linear Program (ILP) models, that are pretty unscalable, or heuristic-based techniques that do not guarantee good quality of the solutions obtained. In this article, we propose an NFV multicast resource optimization model exploiting the use of multiple sources and considering the end-to-end delay and bandwidth requirements. Herein, we propose a novel Dantzig-Wolfe (DW) decomposition model that tackles the complexity of the problem by breaking it down into a master problem and several pricing problems. We compare the DW approach with the ILP and heuristic methods and demonstrate that our approach achieves near to optimal solution (in comparison to heuristic based methods) much faster than ILP. We also study the dynamic admission of NFV-enabled multicast requests by solving the problem in an online manner using the batch processi

关键词： Delays Unicast Optimization multicast algorithms Bandwidth Routing Hardware NFV delay multicast resource optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Management of multicast Traffic in Directional mmWave Networks

引用

IEEE TRANSACTIONS ON BROADCASTING 2021年第3期67卷 593-605页

作者： Chukhno, Nadezhda Chukhno, Olga Pizzi, Sara Molinaro, Antonella Iera, Antonio Araniti, Giuseppe Univ Mediterranea Reggio Calabria DIIES Dept I-89124 Reggio Di Calabria Italy Univ Jaume 1 Inst New Imaging Technol Castellon de La Plana 12071 Spain Tampere Univ ITC Fac Dept Elect Engn Tampere 33014 Finland Univ Mediterranea Reggio Calabria DIIE I-89124 Reggio Di Calabria Italy CNIT Parma Italy Univ Paris Saclay CentraleSupelec F-91190 Gif Sur Yvette France Univ Calabria DIMES Dept I-87036 Arcavacata Di Rende Italy

multicasting is becoming more and more important in the Internet of Things (IoT) and wearable applications (e.g., high definition video streaming, virtual reality gaming, public safety, among others) that require high bandwidth efficiency and low energy consumption. In this regard, millimeter wave (mmWave) communications can play a crucial role to efficiently disseminate large volumes of data as well as to enhance the throughput gain in fifth-generation (5G) and beyond networks. There are, however, challenges to face in view of providing multicast services with high data rates under the conditions of short propagation range caused by high path loss at mmWave frequencies. Indeed, the strong directionality required at extremely high frequency bands excludes the possibility of serving all multicast users via a single transmission. Therefore, multicasting in directional systems consists of a sequence of beamformed transmissions to serve all multicast group members, subgroup by subgroup. This paper focuses on multicast data transmission optimization in terms of throughput and, hence, of the energy efficiency of resource-constrained devices such as wearables, running their resource-hungry applications. In particular, we provide a means to perform the beam switching and propose a radio resource management (RRM) policy that can determine the number and width of the beams required to deliver the multicast content to all interested users. Achieved simulation results show that the proposed RRM policy significantly improves network throughput with respect to benchmark approaches. It also achieves a high gain in energy efficiency over unicast and multicast with fixed predefined beams.

关键词： Unicast 5G mobile communication Throughput multicast algorithms Transmitting antennas Switches Performance evaluation multicast millimeter wave communication radio resource management wearable devices

来源：评论

学校读者我要写书评

暂无评论

Effect of DIS Attack on 6TiSCH Network Formation

引用

IEEE COMMUNICATIONS LETTERS 2022年第5期26卷 1190-1193页

作者： Kalita, Alakesh Brighente, Alessandro Khatua, Manas Conti, Mauro Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 India Univ Padua Dept Math I-35122 Padua Italy Univ Padua HIT Res Ctr I-35122 Padua Italy Univ Padua Dept Math I-35122 Padua Italy Univ Padua HIT Res Ctr I-35122 Padua Italy Delft Univ Technol Fac Elect Engn Math & Comp Sci NL-2628 CD Delft Netherlands

The 6TiSCH standard provides minimum latency and reliability in mission-critical IoT applications. To optimize resource allocation during 6TiSCH network formation, IETF released the 6TiSCH minimal configuration (6TiSCH-MC) standard. 6TiSCH-MC considered IETF's IPv6 Routing Protocol for Low power and Lossy network (RPL) as a routing protocol for both upward and downward routing. In RPL, new joining nodes or joined nodes transmit DODAG Information Solicitation (DIS) requests to get routing information from the network. However, we observe that malicious node(s) can severely affect 6TiSCH networks by sending multiple DIS requests. In this letter, we show and experimentally evaluate on real devices the impact of the DIS attack during 6TiSCH networks formation. We show that the attacker does not need expensive resources or access to the network's sensitive information to execute the DIS attack. Our testbed experiments show that the DIS attack significantly degrades the nodes' joining time and energy consumption, increasing them by 34% and 16%, respectively, compared to normal functioning during 6TiSCH network formation.

关键词： Energy consumption Synchronization multicast algorithms Routing Standards Routing protocols Joining processes 6TiSCH DIS attack network formation RPL attack

来源：评论

学校读者我要写书评

暂无评论

On Efficient Delay-Aware Multisource multicasting in NFV-Enabled Softwarized Networks

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2022年第3期19卷 3371-3386页

作者： Ren, Cheng Chen, Xuxiang Xiang, Haiyun Wang, Yu Li, Yaxin Li, Hao Southwest Petr Univ Sch Elect Engn & Informat Chengdu 610500 Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 610056 Peoples R China Southwest Petr Univ Network & Informat Ctr Chengdu 610500 Peoples R China

To comply with security and performance policies, multicast communication requires inline service that chains an ordered sequence of virtualized network functions (VNFs) with an emerging paradigm of network function virtualization (NFV). As many-to-many multicast pattern is widely used especially in current MEC, multimedia and big data industries, in this paper we focus on multi-source NFV-enabled multicasting in software-defined networks (SDN). By jointly investigating VNF placement and multicast tree routing strategy, it is envisioned to construct service function tree with minimum network resource expenditure while yielding lower delay. We explore this problem in static and online scenarios individually. In static situation with a bunch of multicast requests to be served, a column generation based computing model is first formulated, based on which an approximation algorithm MDNM that leverages logic of Viterbi and puts emphasis on resource optimization and segmental delay satisfaction is developed. In online situation with a single incoming request, another ILP model to enhance VNF instance reuse is established. Then, SVM algorithm giving importance to source determination and VNF instance consolidation is designed to efficiently construct a service function tree with minimum resource usage and delay. Simulation results show that the gap between each of the two proposed algorithms and their respective ILP models is marginal, and both MDNM and SVM outperform the state-of-art work.

关键词： Delays Costs Routing Radio frequency multicast communication multicast algorithms Switches multicast network function virtualization software-defined networks service function tree

来源：评论

学校读者我要写书评

暂无评论

A Secured MANET Using multicast Routing Protocols and Semi Markov Process

引用

Journal of Cyber Security and Mobility 2025年第1-2期7卷 53-68页

作者： Maragatharajan M. Balakannan S. P. Department of Information Technology Kalasalingam University Tamilnadu India

Reliable data delivery is essential in the mobile ad hoc network (MANET) and the devices change their positions very frequently since they do not have any fixed infrastructure. In this paper, we have proposed multicast routing protocols for military communications. The military communications with MANET require data security. We using one of the most widely used algorithms Neighbor supporting Ad hoc multicast routing protocol which is Mesh-based routing algorithm. Semi Markov process is used to develop the node behavior model for network survivability. In this work, reliable data delivery is obtained for the MANET by estimating the present performance of the network through isolating the forwarder node in Semi Markov process.

关键词： Military communication multicast algorithms Data security Markov processes Routing Routing protocols Reliability Computer crime Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Cache-Enabled multicast Content Pushing With Structured Deep Learning

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2021年第7期39卷 2135-2149页

作者： Chen, Qi Wang, Wei Chen, Wei Yu, F. Richard Zhang, Zhaoyang Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

The cache-enabled multicast content pushing, which multicasts the content items to multiple users and caches them until requested, is a promising technique to alleviate the heavy network load by enhancing the traffic offloading. This, in turn, has called for the optimization of content pushing strategy while considering both the transmission and caching resources, which jointly result in the complicated coupling among pushing decisions and lead to high computational complexity. Unlike most existing approaches which simplify the pushing problem via bypassing the complicated coupling, in this paper, we propose a multicast content pushing strategy to maximize the offloaded traffic with the cost on content caching based on structured deep learning. Specifically, we design the convolution stage to extract the spatio-temporal correlations of one content item between different pushing decisions, and construct the fully-connected stage to capture the spatial coupling among the decisions of pushing different content items to different user devices. Moreover, to address the absence of the ground truth on multicast content pushing, we relax the transmission constraint to derive a performance upper bound for guiding the training direction. This relaxed problem is solved based on dynamic programming in a bottom-up manner. Compared to the state-of-the-art baselines including both the traditional model-based and the general neural network-based strategies, the proposed pushing strategy achieves significant performance gain in both the random-generated dataset and the real LastFM dataset. In addition, it is also shown that the proposed strategy is robust to the uncertainty of user request information.

关键词： Couplings Deep learning Training Neural networks multicast algorithms Convolution Upper bound Wireless networks edge caching content pushing deep learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Group multicast Beamforming by Superiorized Projections Onto Convex Sets

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2021年 69卷 5708-5722页

作者： Fink, Jochen Cavalcante, Renato Luis Garrido Stanczak, Slawomir Heinrich Hertz Inst Nachrichtentech Berlin GmbH Fraunhofer Inst Telecommun D-10587 Berlin Germany Tech Univ Berlin D-10587 Berlin Germany

In this paper, we propose an iterative algorithm to address the nonconvex multi-group multicast beamforming problem with quality-of-service constraints and per-antenna power constraints. We formulate a convex relaxation of the problem as a semidefinite program in a real Hilbert space, which allows us to approximate a point in the feasible set by iteratively applying a bounded perturbation resilient fixed-point mapping. Inspired by the superiorization methodology, we use this mapping as a basic algorithm, and we add in each iteration a small perturbation with the intent to reduce the objective value and the distance to nonconvex rank-constraint sets. We prove that the sequence of perturbations is bounded, so the algorithm is guaranteed to converge to a feasible point of the relaxed semidefinite program. Simulations show that the proposed approach outperforms existing algorithms in terms of both computation time and approximation gap in many cases.

关键词： Array signal processing Signal processing algorithms Quality of service Approximation algorithms Perturbation methods multicast algorithms Convergence multicast beamforming nonconvex optimization semidefinite relaxation projections onto convex sets superiorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：