A bi-criteria approach for Steiner's tree problems in communication networks

In this paper, an improved version of a previously proposed heuristic that finds 'good' compromise solutions for a bi-criteria Steiner trees problem is presented. This bi-criteria formulation of the Steiner's tree problem is well suited for application in telecommunication networks whenever it is important to find the minimum amount of resources to connect a given subset of network nodes. In fact there are some (additive) metrics that may not lead to a tree with the minimum number of Steiner nodes when used in the single criterion Steiner's tree problem. In this case it can be advantageous to consider also the minimisation of the hop count as a second criteria in the problem formulation. The performance of the new heuristic is evaluated and compared with the previous version by recurring to reference networks from a library of Steiner's tree problems.

[1]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[2]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

[3]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[4]  João C. N. Clímaco,et al.  Network performance improvement through evaluation of bicriteria routing methods in transport networks , 2013, Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013).

[5]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[6]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[9]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[10]  João C. N. Clímaco,et al.  An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions , 1999, Comput. Oper. Res..

[11]  Piet Van Mieghem,et al.  MAMCRA: a constrained-based multicast routing algorithm , 2002, Comput. Commun..

[12]  Jorge Crichigno,et al.  Multiobjective multicast routing algorithm for traffic engineering , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[13]  Henrik Esbensen.  Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm , 1994 .

[14]  Nuno Ferreira,et al.  A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks , 2011, 2011 7th International Conference on Network and Service Management.

[15]  Tomasz Radzik,et al.  Computing all efficient solutions of the biobjective minimum spanning tree problem , 2008, Comput. Oper. Res..

[16]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[17]  Horst W. Hamacher,et al.  A Survey on Multiple Objective Minimum Spanning Tree Problems , 2009, Algorithmics of Large and Complex Networks.

[18]  Horst W. Hamacher,et al.  On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..

[19]  Toshihide Ibaraki,et al.  An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[20]  R. Ravi,et al.  Bicriteria Network Design Problems , 1998, J. Algorithms.

[21]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[22]  Santosfeqvm,et al.  A NEW ALGORITHM FOR RANKING LOOPLESS PATHS , 1997 .

[23]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[24]  Marcos L. P. Bueno,et al.  Analyzing the effects of neighborhood crossover in multiobjective multicast flow routing problem , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.