Core based trees (CBT)

BallardieTony,; FrancisPaul,; CrowcroftJon,

doi:10.1145/167954.166246

Cited by 251 publications

(95 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many multicast routing protocols have been proposed for mobile ad-hoc networks that have been categorized in Fig 1. Existing multicast routing protocol in MANETs can be classified into three catogories as, tree-based routing protocols [7][8][9][10][11][12][13], mesh-based routing protocols [14][15][16], and hybrid-based routing protocols [17,18]. Tree-based routing protocols establish a tree structure during data packet transmission from source host to a set of destination host, while mesh-based routing protocols build a mesh structure that provides redundant routing path between the source host to a set of destination host, if in a case transmission channel is failure between two nodes then there is no need of recomputation of a mesh structure.…”

Section: Related Workmentioning

confidence: 99%

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

Yadav

Tripathi

2015

Wireless Pers Commun

View full text Add to dashboard Cite

A mobile ad-hoc network (MANETs) is a wireless network of mobile nodes without any fixed base-station or any centralized administration. When a node sends a data packet to more than one node at a time, it is called multicasting, multicast often used to utilize the network resources like channel bandwidth and node energy to improve the network efficiency. Multicast in MANETs have several challenges due to frequent changes in the network such as node mobility, reliability, limited resources, etc. The MANETs is widely used in several fields like emergency searches, rescues operation, and military battlefields where sharing of information is mandatory. These operations often require a rapid deployable and quick reconfigurable routing protocols. Since mobile nodes in wireless ad-hoc network have limited resources so an efficient multicast routing protocol is needed to reduce the wastage of resources. This paper proposes a traffic load balanced multicast routing protocol (LBMRP) in order to reduce the network overhead and increases the network life. In this scheme all mobile nodes are randomly classified into multi group (three groups) and create a tree for each group in order to achieve efficient data transmission. Simulation results shows that the proposed LBMRP scheme outperforms with some existing multicast routing protocols as multicast ad-hoc on-demand distance vector routing protocol, reliability of the multicast ad-hoc on demand distance vector and Parallel multiple nearly-disjoint trees multicast routing schemes.

show abstract

Section: Related Workmentioning

confidence: 99%

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

Yadav

Tripathi

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Moreover, each receiver r in mul- 1 Any multicast groups can have the same receivers. Therefore, the sets R t cannot be disjoint.…”

Section: Problem Definitionmentioning

confidence: 99%

“…We introduced the concept of the CBT algorithm, which builds a bidirectional and group-shared tree rooting at a single "multicasting core" and spans to all of the group member nodes with minimal cost, out of many multicast routing protocols (DVMRP, PIM, MOSPF, 6 and so on [1,27,28]), as the method for generating a multicast tree, because a multicast tree has to be readily represented in the genetic representation presented in Section 4. In order to apply the CBT algorithm to this problem, first, the maximum bandwidth available from the multicasting core to each destination is computed using a Dijkstra-like algorithm, called the computation algorithm of maximum bandwidth, as follows.…”

Section: Single Multicast Tree Generationmentioning

confidence: 99%

“…A typical example is that of a video conferencing system, where each group member can send messages to all group members and also receive messages from other group members. Therefore, we must find a set of routing trees, one for each member of the group, so that each member can use its own routing tree to multicast messages to other group members through the use of the Core-Based Tree (CBT) protocol [1], the one source-based Steiner tree (for each source separately) [2], or the heuristic algorithm [3]. However, in this work we focus on finding multiple single-source multicast routing trees in which the designated sender of each group can use its own routing tree to multicast messages to other members of each group.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evolutionary algorithms for route selection and rate allocation in multirate multicast networks

Kim

Choi²

2007

Appl Intell

View full text Add to dashboard Cite

In multirate multicasting, different users (receivers) in the same multicast group can receive service at different rates, depending on the user requirements and the network congestion level. Compared with unirate multicasting, this provides more flexibility to the users and allows more efficient usage of the network resources. In this paper, we simultaneously address the route selection and rate allocation problem in multirate multicast networks; that is, the problem of constructing multiple multicast trees and simultaneously allocating the rate of receivers for maximizing the sum of utilities over all receivers, subject to link capacity and delay constraints for high-bandwidth delay-sensitive applications in point-to-point communication networks. We propose a genetic algorithm for this problem and elaborate on many of the elements in order to improve solution quality and computational efficiency in applying the proposed methods to the problem. These include the genetic representation, evaluation function, genetic operators, and procedure. Additionally, a new method using an artificial intelligent search technique, called the coevolutionary algorithm, is proposed to achieve better solutions, and methods of selecting environmental individuals and evaluating fitness are developed. The results of extensive computational simulations show that

show abstract

“…The process of sending the control information so as to maintain the view consistency among all users requires a tremendous amount of communication bandwidth. Recent research work on multicasting techniques [3], [10], [11] can help to reduce the network resource demand. In [22], [23], the authors propose approaches to connect all participating clients using different communication subgraph construction algorithms.…”

Section: Introductionmentioning

confidence: 99%

An efficient partitioning algorithm for distributed virtual environment systems

Lui

Chan²

2002

IEEE Trans. Parallel Distrib. Syst.

177

118

View full text Add to dashboard Cite

AbstractÐDistributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In general, a DVE system is composed of many servers and each server is responsible to manage multiple clients who want to participate in the virtual world. Each server receives updates from different clients (such as the current position and orientation of each client) and then delivers this information to other clients in the virtual world. The server also needs to perform other tasks, such as object collision detection and synchronization control. A large scale DVE system needs to support many clients and this imposes a heavy requirement on networking resources and computational resources. Therefore, how to meet the growing requirement of bandwidth and computational resources is one of the major challenges in designing a scalable and cost-effective DVE system. In this paper, we propose an efficient partitioning algorithm that addresses the scalability issue of designing a large scale DVE system. The main idea is to dynamically divide the virtual world into different partitions and then efficiently assign these partitions to different servers. This way, each server will process approximately the same amount of workload. Another objective of the partitioning algorithm is to reduce the server-to-server communication overhead. The theoretical foundation of our dynamic partitioning algorithm is based on the linear optimization principle. We also illustrate how one can parallelize the proposed partitioning algorithm so that it can efficiently partition a very large scale DVE system. Lastly, experiments are carried out to illustrate the effectiveness of the proposed partitioning algorithm under various settings of the virtual world.

show abstract

Core based trees (CBT)

Cited by 251 publications

References 4 publications

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

Evolutionary algorithms for route selection and rate allocation in multirate multicast networks

An efficient partitioning algorithm for distributed virtual environment systems

Contact Info

Product

Resources

About