Topological design of MPLS networks

Pióro, Michał; Mysŀek, A.; Jüttner, Alpár; Harmatos, J.; Szentesi, A.

doi:10.1109/glocom.2001.965071

Cited by 16 publications

(16 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to provide some reference values for the results of heuristic methods, we have performed simple lower bound (LB) computations for TNLLP. Table 2 presents values of LB, which has been proposed in Reference [7] as part of a branch-and-bound procedure. The LB is constructed by incorporating the fixed cost of nodes and links into the variable cost coefficients of links, and by routing flows according to such modified link weights.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…On the other hand, the node-link formulation does not require us to predefine paths, hence it may be easier to use in some cases. The node-link formulation of TNLLP has been presented in References [7,8]. The exact solutions, which serve as point of reference for other methods in Section 4, were obtained with the CPLEX optimisation package [11] working on the TNLLP in the node-link notation.…”

Section: Problem Formulationmentioning

confidence: 99%

“…Propositions of some approaches to solve TNLLP may be found in literature. An exact method is described in detail in Reference [7]. Heuristics, such as Simulated Annealing, Simulated Allocation and individual flow shifting have been proposed in Reference [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Heuristic methods for topological design of telecommunication networks

Karaś

Mysŀek

2005

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYThe paper addresses a generic topological network design problem. The target of the optimisation is to determine a network structure and a demand allocation pattern that would minimise the cost of the network, given a list of potential node locations and a list of admissible interconnections between these nodes. Since the problem is known to be NP-hard, use of specialised heuristic algorithms is proposed. Presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following concepts and methods: individual and bulk flow shifting, methods based on Minoux and Yaged heuristics, Simulated Allocation, cost function modification and Hybrid GRASP. A numerical study enables us to draw conclusions on the efficiency of the methods.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic methods for topological design of telecommunication networks

Karaś

Mysŀek

2005

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Controlling the whole network allows switching off or reducing the performance of some devices while demands of users are served by the remaining equipment (Bianco et al, 2007;Roy, 2008). Such a task resembles traditional network design (Pióro et al, 2001) or QoS provisioning problems (e.g., Jaskóła and Malinowski, 2004;Malinowski et al, 2010), with the performance index covering mostly energy consumption of the network. The resulting problems typically involve a large number of binary variables to compute routes and flow rates, so their application is limited to relatively small networks.…”

Section: Introductionmentioning

confidence: 99%

Simultaneous routing and flow rate optimization in energy–aware computer networks

Jaskóła

Arabas²,

Karbowski³

2016

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The model of power dissipation as a function of carried traffic in a typical software router is introduced. Then the problem is expressed in a form suitable for the mixed integer quadratic programming (MIQP) solver. The paper is concluded with a set of small, illustrative computational examples. Computed solutions are implemented in a testbed to validate the accuracy of energy consumption models and the correctness of the proposed traffic engineering algorithm.

show abstract

“…His method is able to handle different cost models. Pioro et al [3], [4] developed several methods to solve various telecommunication network design tasks. Other heuristics was proposed in [5] for designing failure protected networks.…”

Section: Related Workmentioning

confidence: 99%

A cluster-based resource provisioning model in virtual private networks

Antal

Harmatos

Jutner

et al.

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.

Self Cite

View full text Add to dashboard Cite

This paper presents a novel resource provisioning method for Virtual Private Networks. TYunk and hose models are well known bandwidth provisioning models for VPNs but both have significant disadvantages if applied to large scale networks. The management complexity of the trunk model highly increases with the size of the network, while bandwidth efficiency of the hose model is often excessively low. We propose an intermediate solution between hose and trunk models. By dividing the network into clusters and using cluster based traffic description we can find an appropriate equilibrium between management complexity and overprovisioning. A method for computing the necessary links capacities for a traffic given by cluster based description is also presented, which makes it possible to design congestion free networks. We also suggest routing strategies to further improve the performance of the new provisioning method. The applicability and limitations of the method and the effect of different routing strategies and fault tolerance are examined by simulating several test scenarios.

show abstract

Topological design of MPLS networks

Cited by 16 publications

References 6 publications

Heuristic methods for topological design of telecommunication networks

Heuristic methods for topological design of telecommunication networks

Simultaneous routing and flow rate optimization in energy–aware computer networks

A cluster-based resource provisioning model in virtual private networks

Contact Info

Product

Resources

About