To minimize the number of wavelengths required by a multicast session in sparse light splitting wavelength division multiplexing (WDM) networks, a light-hierarchy structure, which occupies the same wavelength on all links, is proposed to span as many destinations as possible. Different from a light-tree, a light-hierarchy accepts cycles, which are used to traverse crosswise a 4-degree (or above) multicast incapable (MI) node twice (or above) and switch two light signals on the same wavelengths to two destinations in the same multicast session. In this paper, firstly, a graph renewal and distance priority light-tree algorithm (GRDP-LT) is introduced to improve the quality of light-trees built for a multicast request. Then, it is extended to compute light-hierarchies. Obtained numerical results demonstrate the GRDP-LT light-trees can achieve a much lower links stress, better wavelength channel cost, and smaller average end-to-end delay as well as diameter than the currently most efficient algorithm. Furthermore, compared to light-trees, the performance in terms of link stress and network throughput is greatly improved again by employing the light-hierarchy, while consuming the same amount of wavelength channel cost.
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
多播是通信网络从应用程序接受单个消息并将消息的副本传递给不同位置的多个接收者的能力。随着Internet的发展，组播被广泛应用于各种多媒体实时应用中：分布式多媒体系统、协同计算、视频会议、远程教育等。为了构造时延约束的组播路由树，首先分析了平均距离启发式算法（ADH）。在此基础上，提出了一种时延约束算法DCADH（delay-constrained average distance heuristic）。利用ADH可以构造出一棵最小代价的组播路由树，如果路径时延不满足时延上界，则将Dijkstra算法计算出的一条最短时延路径合并到现有的组播路由树中，以满足时延上界。仿真实验表明，DCADH在实现低代价组播路由树方面具有良好的性能。
This paper proposes the HPIM-DM (Hard-state Protocol Independent Multicast - Dense Mode) multicast routing protocol. HPIM-DM is a hard-state version of PIM-DM that keeps its main characteristics but has faster convergence and better resilience to replay attacks. Like PIM-DM, HPIM-DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding checks. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping in…
Vehicular Ad Hoc Network (VANET) is a type of mobile ad hoc network (MANET) that facilitates communication among vehicles. VANET provides inter-vehicular communications to serve for the application like road traffic safety and traffic efficiency. Infotainment service has been an anticipating trend in VANETs, and video streaming has a high potential in VANET. Although, this emerging technology is trending, there are still some issues like QoS provisions, decentralized medium access control, node coverage area, and finding and maintaining routes due to highly dynamic topology. These issues make …
Multi-layer Mechanism for Multicast Routing in Multihop Cognitive Radio Networks
多播路由被认为是移动自组网中实现视频共享和数据分发的重要过程之一。如果任何发送器在任何给定时间都可以访问介质，则可以毫无困难地使用多播路由。然而，认知无线电网络（CRN）可能会出现诸如主用户（PU）的意外行为及其接入优先级以及网络异构性等挑战。在这篇论文中，我们提出了一个基于最小生成树和最短路径树的多跳移动Ad Hoc CRN多层组播路由协议。该算法采用成功的概率（POS）度量在执行信道分配过程。仿真实验进行了调查，所提出的方案的有效性，比较所提出的方案与最先进的方案的性能，并研究所提出的方案在各种网络条件下的吞吐量和分组投递率（PDR）的性能。仿真结果表明，SPT算法在吞吐量方面始终优于MST算法。
Traditional IP multicast routing is not suitable for cloud data center (DC) networks due to the need for supporting large numbers of groups with large group sizes. State-of-the-art DC multicast routing approaches aim to overcome the scalability issues by, for instance, taking advantage of the symmetry of DC topologies and the programmability of DC switches to compactly encode multicast group information inside packets, thereby reducing the overhead resulting from the need to store the states of flows at the network switches. However, although these scale well with the number of multicast group…
Guilin University of Electronic Technology（桂林电子科技大学）；Fujian University of Technology（福建工程学院）；Peng Cheng Lab.（鹏城实验室）
Traditional multicast routing methods have some problems in constructing a multicast tree, such as limited access to network state information, poor adaptability to dynamic and complex changes in the network, and inflexible data forwarding. To address these defects, the optimal multicast routing problem in software-defined networking (SDN) is tailored as a multi-objective optimization problem, and an intelligent multicast routing algorithm DRL-M4MR based on the deep Q network (DQN) deep reinforcement learning (DRL) method is designed to construct a multicast tree in SDN. First, the multicast t…
The paradigm of network function virtualization (NFV) with the support of software defined networking (SDN) emerges as a promising approach for customizing network services in fifth generation (5G) networks. In this paper, a multicast service orchestration framework is presented, where joint traffic routing and virtual network function (NF) placement are studied for accommodating multicast services over an NFV-enabled physical substrate network. First, we investigate a joint routing and NF placement problem for a single multicast request accommodated over a physical substrate network, with bot…
Networks-on-chips (NoCs) have become the mainstream communication infrastructure for chip multiprocessors (CMPs) and many-core systems. The commonly used parallel applications and emerging machine learning-based applications involve a significant amount of collective communication patterns. In CMP applications, multicast is widely used in multithreaded programs and protocols for barrier/clock synchronization and cache coherence. Multicast routing plays an important role on the system performance of a CMP. Existing partition-based multicast routing algorithms all use static destination set part…
Achieving high bandwidth utilization in cloud computing is essential for better network performance. However, it is difficult to attain high bandwidth utilization in cloud computing due to the complex and distributed natures of cloud computing resources. Recently, a growing demand for multicast transmission is perceived in cloud computing, due to the explosive growth of multi-point communication applications, such as video conferencing, online gaming, etc. Nonetheless, the inherent complexity in multicast routing in cloud computing, existing multicast plans failed to produce effective and effi…
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks
School of Telecommunications Engineering, Xidian University（西安电子科技大学电信工程学院）；Division of Integrative Systems and Design, The Hong Kong University of Science and Technology（香港科学与技术大学整合系统与设计系）；School of Electronic and Information Engineering, Beijing Jiaotong University（北京交通大学电子与信息工程学院）；Department of Electrical and Computer Engineering, University of Waterloo（滑铁卢大学电气与计算机工程系）
软件路由器集成到嵌入式系统中是最现代的路由器的可能性，以更实惠的价格。IP网络上的传输服务电视和无线电信号仅通过使用多播1协议进行路由来激活。多播路由2目前仅是昂贵的硬件解决方案的特征。XORP开源平台通过软件路由器提供多播路由，能够集成到廉价的嵌入式平台中。- Integracijom softverskog rutera u embedded sisteme dobija se moguarnost najsavremenijih rutera，po znatno pristupačnijoj ceni.提供IP电话服务的电视和广播信号，提供多个路由协议。第二个多功能路由器是一个非常简单的路由器。XORP开放源代码平台是一个多功能的开源软件平台，它可以集成到嵌入式平台。
Distributed computing (cloud) networks, e.g., mobile edge computing (MEC), are playing an increasingly important role in the efficient hosting, running, and delivery of real-time stream-processing applications such as industrial automation, immersive video, and augmented reality. While such applications require timely processing of real-time streams that are simultaneously useful for multiple users/devices, existing technologies lack efficient mechanisms to handle their increasingly multicast nature, leading to unnecessary traffic redundancy and associated network congestion. In this paper, we…
Optical shuffle-exchange networks (SENs) have wide application in different kinds of interconnection networks. This paper proposes an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs). According to the wavelength routing property of AWGs, we demonstrate for the first time that an AWG is functionally equivalent to a classical shuffle network by nature. Based on this result, we devise a systematic method to design a large-scale wavelength-division-multiplexing (WDM) shuffle network using a set of small-size AWGs …
North Carolina State University（北卡罗来纳州立大学）；Lund University（隆德大学）
Numerous protocols for geocast have been proposed in literature. It has been shown that explicit route setup approaches perform poorly with VANETs due to limited route lifetime and frequent network fragmentation. The broadcast based approaches have considerable redundancy and add significantly to the overhead of the protocol. A completely distributed and robust geocast approach is presented in this paper, that is resilient to frequent topology changes and network fragmentation. A distance-based backoff algorithm is used to reduce the number of hops and a novel mechanism to reduce redundant bro…
Unicast and Multicast Qos Routing with Soft Constraint Logic Programming
Università di Chieti-Pescara（基耶蒂-佩斯卡拉大学）；Institute for Informatics and Telematics（信息学与电信学研究所）；Università di Pisa（比萨大学）；Università di Padova（帕多瓦大学）；IMT - Institute for Advanced Studies（IMT高等研究院）
An Overlay Multicast Routing Method Based on Network Situational Awareness and Hierarchical Multi-Agent Reinforcement Learning
School of Information and Communication, Guilin University of Electronic Technology（桂林电子科技大学信息与通信学院）；School of Computer Science and Information Security, Guilin University of Electronic Technology（桂林电子科技大学计算机科学与信息安全学院）；Information Center, Guilin Medical University（桂林医学院信息中心）；School of Optoelectronic Engineering, Guilin University of Electronic Technology（桂林电子科技大学光电工程学院）
A cross-layer cognitive radio system is designed to support unicast and multicast traffic with integration of dynamic spectrum access (DSA), backpressure algorithm, and network coding for multi-hop networking. The full protocol stack that operates with distributed coordination and local information exchange is implemented with software-defined radios (SDRs) and assessed in a realistic test and evaluation (T\&E) system based on a network emulation testbed. Without a common control channel, each SDR performs neighborhood discovery, spectrum sensing and channel estimation, and executes a distribu…
The increasing pervasive and ubiquitous presence of devices at the edge of the Internet is creating new scenarios for the emergence of novel services and applications. This is particularly true for location- and context-aware services. These services call for new decentralized, self-organizing communication schemes that are able to face issues related to demanding resource consumption constraints, while ensuring efficient locality-based information dissemination and querying. Voronoi-based communication techniques are among the most widely used solutions in this field. However, when used for f…
The coded caching scheme originally proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages from a server to users equipped with caches via a capacitated shared-link and was shown to be information theoretically optimal within a constant multiplicative factor. This work extends the MAN scheme to a class of two-hop wired-wireless networks including one server connected via fronthaul links to a layer of $H$ helper nodes (access points/base stations), which in turns communicate via a wireless access network to $K$ users, each equipped with its own cache. Two variants are consid…
Delay and Delay Variation Constrained Algorithm based on VNS Algorithm for RP Management in Mobile IPv6
随着网络多媒体技术的发展，越来越多的实时多媒体应用需要使用组播通信来传输信息。随着移动IPv6协议通过移动接收器和源的到来，这些应用变得更加重要。这些应用程序需要一个多播路由协议，该协议具有在指定的QoS保证和快速恢复机制内到达多播接收器的数据包。移动IPv6组播时，接收者和组播者的移动性会导致严重的问题。当接收者或发送者移动时，整个多播树的质量可能会下降，从而不能有效地转发多播数据报。D2 V-RPM（delay and delay variation RP Manager）问题是在给定的时延和时延变化范围内，为所有组播会话选择一个最优的组播路由器作为共享组播树（ST）的根，如果该路由器不是最优的或者发生故障，则恢复该路由器。这个NP难问题需要通过启发式算法来解决。在本文中，我们提出了一种新的RP管理算法的基础上可变邻域搜索算法，基于一个系统的邻域变化。D2 VVNS-RPM算法综合考虑树代价、时延和时延变化来选择和恢复RP路由器。仿真结果表明，该算法具有良好的性能.
