A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Bicriteria network design problems
Journal of Algorithms
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
Computers and Operations Research
A multicast tree algorithm considering maximum delay bound for real-time applications
LCN '96 Proceedings of the 21st Annual IEEE Conference on Local Computer Networks
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
A Survey on Multiple Objective Minimum Spanning Tree Problems
Algorithmics of Large and Complex Networks
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
A bi-criteria approach for Steiner's tree problems in communication networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
| Hi-index | 0.00 |
For a Carrier Ethernet or MPLS-TP service provider the determination of a multipoint-to-multipoint (mp2mp) virtual connection must be done in an efficient way in order to maximise network performance. This problem can be formulated as a Steiner tree problem which is a very complex combinatorial problem, being NP-complete. In general, any transport network ideal management system should seek to balance the load of the links while, at the same time, seeking to minimize the resources involved in each connection. In this work it is presented a bi-criteria formulation for the Steiner tree problem which includes these objectives. In order to solve this problem a heuristic was developed based on a known bi-criteria spanning tree algorithm that finds the set of efficient supported solutions in a given sub-graph. This new heuristic allows to obtain 'good' compromise Steiner trees in an efficient manner. The obtained solution set contains some times the optimal solution for each objective included in the problem formulation. It is important to note that the analysis of the whole set of solutions may be important in some management transport network scenarios.