Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
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
Multi-constraint QoS routing using a new single mixed metrics
Journal of Network and Computer Applications
Optimal multicast multichannel routing in computer networks
Computer Communications
A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
Advances in Engineering Software
Retransmission and backoff strategies for wireless broadcasting
Ad Hoc Networks
Cisco CCNA/CCENT Exam 640-802, 640-822, 640-816 Preparation Kit
Cisco CCNA/CCENT Exam 640-802, 640-822, 640-816 Preparation Kit
Traffic distribution for end-to-end QoS routing with multicast multichannel services
The Journal of Supercomputing
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Journal of Network and Computer Applications
Sender access and data distribution control for inter-domain multicast groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
A tree-based particle swarm optimization for multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Expert Systems with Applications: An International Journal
QoS multicast routing using a quantum-behaved particle swarm optimization algorithm
Engineering Applications of Artificial Intelligence
Multi-constraint Qos Unicast Routing Using Genetic Algorithm (MURUGA)
Applied Soft Computing
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Architecture of Network Systems
Architecture of Network Systems
Distributed dynamic mobile multicast
Journal of Parallel and Distributed Computing
On performance of group key distribution techniques when applied to IPTV services
Computer Communications
Review: Review of multicast routing mechanisms in mobile ad hoc networks
Journal of Network and Computer Applications
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
A dynamic multicast tree based routing scheme without replication in delay tolerant networks
Journal of Parallel and Distributed Computing
On fair and optimal multi-source IP-multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparison of load-balancing approaches for multipath connectivity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable and efficient broadcasting algorithms for very large internetworks
Computer Communications
Optimal multichannel data transmission in computer networks
Computer Communications
Fast and scalable packet classification
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Each single source multicast session (SSMS) transmits packets from a source node s i to a group of destination nodes t i , i=1,2,驴,n. An SSMS's path can be established with a routing algorithm, which constructs multicast path between source and destinations. Also, for each SSMS, the routing algorithm must be performed once. When the number of SSMS increases to N驴2, the routing algorithm must be separately performed N驴2 times because the number of source nodes increase to N驴2 (for each SSMS the routing algorithm must be performed once). This causes that time of computation and bandwidth consumption to grow. To remove this problem, in this paper, we will present a new approach for merging different SSMSs to make a new multicast session, which is performed only with one execution of a routing algorithm. The new approach, merging different sessions together, is based on the optimal resource allocation and Constraint Based Routing (CBR). We will show that as compared to other available routing algorithms, it improves time of computation and bandwidth consumption and increases data rate and network efficiency. The new approach uses CBR and merges more than one single source multicast session (SSMS) problem to one multisource multicast session (MSMS) problem. By solving one MSMS problem instead of solving more than one SSMS, we can obtain an optimal solution that is more efficient than optimal solutions of SSMS problems.