Related papers: Delay-Constrained Multicast Routing Algorithm Base…
Multicast allows sending a message to multiple recipients without having to create and send a separate message for each recipient. This preserves network bandwidth, which is particularly important in time-sensitive networks. These networks…
Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets…
In Application layer multicast (ALM) also called Overlay Multicast, multicast-related functionalities are moved to end-hosts. The key advantages, overlays offers, are flexibility, adaptability and ease of deployment [1]. Application layer…
As we know, the member-only algorithm in provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. However, the diameter of tree is too big and the average delay…
We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of…
Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous volumes of bulk multicast traffic generated as a result of…
Multicast routing is considered as one of the most important process in Mobile Ad hoc Networks (MANETs) to enable video sharing and data dissemination. Multicast routing can be used without any difficulties if a medium can be accessed by…
Multicasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy…
Searching in P2P networks is fundamental to all overlay networks. P2P networks based on Distributed Hash Tables (DHT) are optimized for single key lookups, whereas unstructured networks offer more complex queries at the cost of increased…
In this articlewestudy themulticast routing problem in all-opticalWDMnetworks under the spare light splitting constraint. To implement a multicast session, several light-trees may have to be used due to the limited fanouts of network nodes.…
Multicasting technology uses the minimum network resources to serve multiple clients by duplicating the data packets at the closest possible point to the clients. This way at most only one data packets travels down a network link at any one…
In this paper, we adopt a cross layer design approach for analyzing the throughput-delay tradeoff of the multicast channel in a single cell system. To illustrate the main ideas, we start with the single group case, i.e., pure multicast,…
Multicast communication technology is widely applied in wireless environments with a high device density. Traditional wireless network architectures have difficulty flexibly obtaining and maintaining global network state information and…
The optimal multicast tree problem in the Software-Defined Networking (SDN) multicast routing is an NP-hard combinatorial optimization problem. Although existing SDN intelligent solution methods, which are based on deep reinforcement…
Cognitive radio (CR) technology enables an intelligent wireless communication system. CR provides an efficient solution for the inefficient spectrum utilization by allowing dynamic and opportunistic spectrum access. In designing CR…
Emerging ad hoc networks are infrastructure-less networks consisting of wireless devices with various power constraints, capabilities and mobility characteristics. An essential capability in future ad hoc networks is the ability to provide…
In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the…
In this paper, a distributed convex optimization algorithm, termed \emph{distributed coordinate dual averaging} (DCDA) algorithm, is proposed. The DCDA algorithm addresses the scenario of a large distributed optimization problem with…
This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…
Application layer multicast (ALM) also called Overlay Multicast, is an attractive alternative solution to most of the problems associated with IP multicast. In ALM, multicast-related functionalities are moved to end-hosts. Application layer…