scholarly journals Multi Criterion Multicast Routing Algorithm Comparison for Large Networks

2017 ◽  
Vol 22 (1) ◽  
pp. 49-56
Author(s):  
Krzysztof Stachowiak
Keyword(s):  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Network Size ◽  
Steiner Tree Problem ◽  
Simulation Techniques ◽  
Wide Range ◽  
Algorithm Comparison ◽  
Minimum Steiner Tree Problem ◽  
Small Models

Abstract QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase significantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem - MCMST) have been presented for a wide range of network sizes reaching thousands of nodes.

scholarly journals Strategyproof auction mechanisms for network procurement

OR Spectrum ◽  
2020 ◽  
Vol 42 (4) ◽  
pp. 965-994
Author(s):  
Martin Bichler ◽  
Zhen Hao ◽  
Richard Littmann ◽  
Stefan Waldherr
Keyword(s):  
Heuristic Algorithms ◽  
Allocative Efficiency ◽  
Telecommunications Industry ◽  
Steiner Tree Problem ◽  
Solution Quality ◽  
Worst Case ◽  
Average Case ◽  
Auction Mechanisms ◽  
Deferred Acceptance ◽  
Minimum Steiner Tree Problem

Abstract Deferred-acceptance auctions can be seen as heuristic algorithms to solve $${{\mathcal {N}}}{{\mathcal {P}}}$$ N P -hard allocation problems. Such auctions have been used in the context of the Incentive Auction by the US Federal Communications Commission in 2017, and they have remarkable incentive properties. Besides being strategyproof, they also prevent collusion among participants. Unfortunately, the worst-case approximation ratio of these algorithms is very low in general, but it was observed that they lead to near-optimal solutions in experiments on the specific allocation problem of the Incentive Auction. In this work, which is inspired by the telecommunications industry, we focus on a strategic version of the minimum Steiner tree problem, where the edges are owned by bidders with private costs. We design several deferred-acceptance auctions (DAAs) and compare their performance to the Vickrey–Clarke–Groves (VCG) mechanism as well as several other approximation mechanisms. We observe that, even for medium-sized inputs, the VCG mechanisms experiences impractical runtimes and that the DAAs match the approximation ratios of even the best strategy-proof mechanisms in the average case. We thus provide another example of an important practical mechanism design problem, where empirics suggest that carefully designed deferred-acceptance auctions with their superior incentive properties need not come at a cost in terms of allocative efficiency. Our experiments provide insights into the trade-off between solution quality and runtime and into the additional premium to be paid in DAAs to gain weak group-strategyproofness rather than just strategyproofness.

Routing algorithm with QoS constraints for real time multicast communications using particle swarm optimization and genetic meta-optimizer

2016 ◽  
Vol 33 (2) ◽  
Author(s):  
YEISON JULIAN CAMARGO ◽  
Leonardo Juan Ramirez ◽  
Ana Karina Martinez
Keyword(s):  
Particle Swarm Optimization ◽  
Design Methodology ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Minimum Cost ◽  
Fine Tuning ◽  
Steiner Tree Problem ◽  
Swarm Optimization ◽  
Routing Problem

Purpose The current work shows an approach to solve the QoS multicast routing problem by using Particle Swarm Optimization (PSO). The problem of finding a route from a source node to multiple destination nodes (multicast) at a minimum cost is an NP-Complete problem (Steiner tree problem) and is even greater if Quality of Service -QoS- constraints are taken into account. Thus, approximation algorithms are necessary to solve this problem. This work presents a routing algorithm with two QoS constraints (delay and delay variation) for solving the routing problem based on a modified version of particle swarm optimization. Design/methodology/approach This work involved the following methodology: 1. Literature Review 2. Routing algorithm design 3. Implementation of the designed routing algorithm by java programming. 4. Simulations and results. Findings In this work we compared our routing algorithm against the exhaustive search approach. The results showed that our algorithm improves the execution times in about 40% with different topologies. Research limitations/implications The algorithm was tested in three different topologies with 30, 40 and 50 nodes with and a dense graph topology. Originality/value Our algorithm implements a novel technique for fine tuning the parameters of the implemented bio-inspired model (Particles Swarm Optimization) by using a Genetic Meta-Optimizer. We also present a simple and multi implementation approach by using an encoding system that fits multiple bio-inspired models.

scholarly journals Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Huanlin Liu ◽  
Hongyue Dai ◽  
Fei Zhai ◽  
Yong Chen ◽  
Chengying Wei
Keyword(s):  
Cost Control ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Low Cost ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Control Factor ◽  
Wavelength Channel ◽  
Longest Path

Limited by the sparse light-splitting capability in WDM networks, some nodes need to reroute the optical packet to different destination nodes with the high cost of routing for reducing packet loss possibility. In the paper, the longest path reroute optimization algorithm is put forward to jointly optimize the multicast routing cost and wavelength channel assignment cost for sparse splitting WDM networks. Based on heuristic algorithms, the longest path reroute routing algorithm calls multiple longest paths in existing multicast tree to reroute the path passing from the nodes which are violating the light-splitting constraint to the nodes which are not violating light-splitting constraint with few wavelength channels and low rerouting cost. And a wavelength cost control factor is designed to select the reroute path with the lowest cost by comparing the multicast rerouting path cost increment with the equivalent wavelength channel required cost increment. By adjusting wavelength cost control factor, we can usually get the optimized multicast routing according to the actual network available wavelength conversion cost. Simulation results show that the proposed algorithm can get the low-cost multicast tree and reduce the required number of wavelength channels.

A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem

2013 ◽  
Vol 756-759 ◽  
pp. 3647-3651
Author(s):  
Ying Xu ◽  
Xiong Fei Zheng ◽  
Ren Fa Li
Keyword(s):  
Optimization Problem ◽  
Multicast Routing ◽  
Telecommunication Networks ◽  
Steiner Tree Problem ◽  
Adaptive Search ◽  
Routing Problem ◽  
Complete Problem ◽  
Pilot Method ◽  
Np Complete ◽  
Minimum Steiner Tree Problem

Multicast routing problem is a well know optimization problem for transmitting real-time multimedia applications in telecommunication networks. As the underpinning mathematical model, the constrained minimum Steiner tree problem in graphs is a well-known NP-complete problem. In this paper we investigate a new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Least-Cost (DCLC) multicast routing problem. Experimental results demonstrate the efficiency of the hybrid GRASP algorithm and the contributions of the post-processing pilot method to better solutions in most cases. The proposed GRASP approach is a competitive approach in solving the DCLC multicast routing problem.

Overlay multicast routing algorithm with minimum overlay cost

2009 ◽  
Vol 28 (10) ◽  
pp. 2569-2572
Author(s):  
Long-xin LIN ◽  
Jie ZHOU ◽  
Ling ZHANG ◽  
Zhao YE
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Overlay Multicast ◽  
Multicast Routing Algorithm
Sign in / Sign up

Export Citation Format

Share Document