Optimal multicast multichannel routing in computer networks

Isazadeh, Ayaz; Heydarian, Mohsen

doi:10.1016/j.comcom.2008.09.007

Cited by 13 publications

(27 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing algorithms such as OMMR [12] supports QoS and multicasting, but cannot change and support traffic distribution. In the multicast routing problems, we distinguish between a centralized and a distributed versions.…”

Section: The Problemmentioning

confidence: 99%

“…In this section, we survey some existing unicast and multicast algorithms such as OSPF [16], GRP [1], OUMR [20], DPST [10], and OMMR [12]. We survey these algorithms to recognize their weaknesses.…”

Section: Survey Of Previous Workmentioning

confidence: 99%

“…In Sect. 2, we present a briefly survey of some existing unicast and multicast algorithms such as OSPF [16], GRP [1], OUMR [20], DPST [10], and OMMR [12]. In this section, we also present some terminologies and some mathematical definitions such as multicast multichannel path, multicast multichannel routing, etc., which are necessary to construct the proposed algorithm, Distributed-Optimal Multicast Multichannel Routing (DOMMR).…”

Section: Paper Outlinementioning

confidence: 99%

“…The OMMR [12] gives solution for the following problem: Let σ > 0 be the size of the message to be transmitted from source node s to destination nodes t 1 , t 2 , . .…”

Section: Optimal Multicast Multichannel Routingmentioning

confidence: 99%

“…This paper presents our recent work, as a part of our ongoing research on multicast multichannel QoS routing [12]. The Next Generation Internet (NGI) technology will, for the most part, be driven by the increasing need for high performance, optimized throughput, and low latency [11,14,15].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Traffic distribution for end-to-end QoS routing with multicast multichannel services

Isazadeh

Heydarian

2009

J Supercomput

Self Cite

View full text Add to dashboard Cite

With the development of multimedia group applications and multicasting demands, the construction of multicast routing tree satisfying Quality of Service (QoS) is more important. A multicast tree, which is constructed by existing multicast algorithms, suffers three major weaknesses: (1) it cannot be constructed by multichannel routing, transmitting a message using all available links, thus the data traffic cannot be preferably distributed; (2) it does not formulate duplication capacity; consequently, duplication capacity in each node cannot be optimally distributed;(3) it cannot change the number of links and nodes used optimally. In fact, it cannot employ and cover unused backup multichannel paths optimally. To overcome these weaknesses, this paper presents a polynomial time algorithm for distributed optimal multicast routing and Quality of Service (QoS) guarantees in networks with multichannel paths which is called Distributed Optimal Multicast Multichannel Routing Algorithm (DOMMR). The aim of this algorithm is: (1) to minimize End-to-End delay across the multichannel paths, (2) to minimize consumption of bandwidth by using all available links, and (3) to maximize data rate by formulating network resources. DOMMR is based on the Linear Programming Formulation (LPF) and presents an iterative optimal solution to obtain the best distributed routes for traffic demands between all edge nodes. Computational experiments and numerical simulation results will show that the proposed algorithm is more efficient than the existing methods. The simulation results are obtained by applying network simulation tools such as QSB, OpNet and MATLB to some samples of network. We then introduce a generalized problem, called the delay-constrained multicast multichannel routing problem, and show that this generalized problem can be solved in polynomial time.

show abstract

Section: The Problemmentioning

confidence: 99%

Section: Survey Of Previous Workmentioning

confidence: 99%

Section: Paper Outlinementioning

confidence: 99%

“…The OMMR [12] gives solution for the following problem: Let σ > 0 be the size of the message to be transmitted from source node s to destination nodes t 1 , t 2 , . .…”

Section: Optimal Multicast Multichannel Routingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Traffic distribution for end-to-end QoS routing with multicast multichannel services

Isazadeh

Heydarian

2009

J Supercomput

Self Cite

View full text Add to dashboard Cite

show abstract

QoS multicast routing in cognitive radio ad hoc networks

Xie

Jia

Zhou

2011

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this paper, we discussed the issues of QoS multicast routing in cognitive radio ad hoc networks. The problem of our concern was: given a cognitive radio ad hoc network and a QoS multicast request, how to find a multicast tree so that the total bandwidth consumption of the multicast is minimized while the QoS requirements are met. We proposed two methods to solve it. One is a two-phase method. In this method, we first employed a minimal spanning tree-based algorithm to construct a multicast tree and then proposed a slot assignment algorithm to assign timeslots to the tree links such that the bandwidth consumption of the tree is minimized. The other is an integrated method that considers the multicast routing together with the slot assignment. Extensive simulations were conducted to show the performance of our proposed methods.

show abstract

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

Heydarian

2012

J Supercomput

View full text Add to dashboard Cite

Optimal multicast multichannel routing in computer networks

Cited by 13 publications

References 26 publications

Traffic distribution for end-to-end QoS routing with multicast multichannel services

Traffic distribution for end-to-end QoS routing with multicast multichannel services

QoS multicast routing in cognitive radio ad hoc networks

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

Contact Info

Product

Resources

About