Single path routing with delay considerations
Computer Networks and ISDN Systems
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
Fast data transmission and maximal dynamic flow
Information Processing Letters
Optimum multicast of multimedia streams
Computers and Operations Research
Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
OSPF Network Design Solutions
Heuristic algorithms for packing of multiple-group multicasting
Computers and Operations Research
MATE: multipath adaptive traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal quality of service routing and admission control using the utility model
Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
An efficient QoS routing algorithm for quorumcast communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
A Suggested Computation for Maximal Multi-Commodity Network Flows
Management Science
Optimal multichannel data transmission in computer networks
Computer Communications
A comparison of the Internet multicast routing protocols
Computer Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Fast and scalable packet classification
IEEE Journal on Selected Areas in Communications
Traffic distribution for end-to-end QoS routing with multicast multichannel services
The Journal of Supercomputing
QoS-based cooperative algorithm for integral multi-commodity flow problem
Computer Communications
QoS multicast routing in cognitive radio ad hoc networks
International Journal of Communication Systems
The Journal of Supercomputing
The Journal of Supercomputing
| Hi-index | 0.25 |
This paper presents a polynomial time algorithm for optimal multicast routing and quality of service (QoS) guarantees in networks with multichannel paths. It minimizes end-to-end delay and consumption of bandwidth across channels using linear programming formulation (LPF). At first, we study some existing unicast and multicast algorithms. The existing unicast algorithms transfer messages from a source node to a destination node and existing multicast algorithms transfer messages from a source node to a group of destination nodes using single paths, multichannel paths or minimum spanning trees in a minimum time. Our survey shows that there are some problems and weaknesses in applying these algorithms to the network. Then we will remove these weaknesses by constructing a new algorithm, called optimal multicast multichannel routing algorithm, which is more efficient than existing algorithms. The OMMR algorithm formulates capacities and resources of the network in terms of a linear programming system of equalities or inequalities. It also, transfers data from a sender node to the group of receivers using multichannel paths in minimal time. In fact, the key innovative aspect of this work lies in the ability to allocating resources to traffic flows in multicast environments optimally. Computer examples will show that the new algorithm is more efficient than the existing algorithms.