Topological design of telecommunication networks Nodes and links localization under demand constraints

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

doi:10.1016/s1388-3437(01)80157-8

Cited by 12 publications

(24 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Integer Linear programming (ILP) is a powerful mathematical tool used to study optimality in many areas of research. In networking, it is typically used to solve network provisioning, performance improvement, and routing problems [23][24][25]. is approach has the advantage of being extremely modular because a change in the properties of the routing algorithm consists only in modifying all the constraints, and possibly the objective function, of the linear program.…”

Section: Optimization Of Overall Energy Consumptionmentioning

confidence: 99%

A Simple and Efficient Way to Save Energy in Multihop Wireless Networks with Flow Aggregation

Laubé

Quadri

Martin

et al. 2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Today, whether in industry, research, or civil applications, there are many incentives to reduce the energy footprint of automated systems. In multihop wireless networks, the main objective in that regard is usually to maximize the lifetime of the network by distributing the load over all nodes. In this paper, we improve a solution that aggregates flows to optimize the number of nodes that can be turned off. We introduce interference awareness in a routing metric designed to aggregate flows to avoid overloading the network and to preserve the quality of service required by the flows. This way, it becomes possible to integrate this metric into classical shortest path routing algorithms that do not consider interference. We also show that flow aggregation and overall energy consumption are equivalent problems.

show abstract

Section: Optimization Of Overall Energy Consumptionmentioning

confidence: 99%

A Simple and Efficient Way to Save Energy in Multihop Wireless Networks with Flow Aggregation

Laubé

Quadri

Martin

et al. 2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…Most of the proposed flow shifting methods are new implementations of approaches already presented in literature (c.f. [1,2]), in many places original modifications have been introduced. The flow shifting algorithms are rather simple and serve as basis for some of the more complex methods described in the following subsections.…”

Section: Flow Shifting and Reroutingmentioning

confidence: 99%

“…Individual flow shifting (IFS) was proposed in [1] as a simple heuristic for solving the LLP and TNLLP. Firstly an initial allocation of demands is performed with a greedy type of algorithm.…”

Section: Individual Flow Shiftingmentioning

confidence: 99%

“…In case of BFS they are rerouted globally and individually which usually produces a better result. This algorithm differs from the bulk flow shifting approach presented in [1] where the deallocation decision was based on δ e computations as described for MGA. Several variants of the algorithm have been analysed.…”

Section: Bulk Flow Shiftingmentioning

confidence: 99%

“…The method is known to converge, in a finite number of steps, to local optimum points compliant with the Kühn-Tucker conditions. Extensions of the algorithm have been presented in [1].…”

Section: Yaged Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Heuristic algorithms in topological design of telecommunication networks

Karaś

2003

JTIT

View full text Add to dashboard Cite

The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described by linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard, the use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.

show abstract

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

Topological design of telecommunication networks Nodes and links localization under demand constraints

Cited by 12 publications

References 12 publications

A Simple and Efficient Way to Save Energy in Multihop Wireless Networks with Flow Aggregation

A Simple and Efficient Way to Save Energy in Multihop Wireless Networks with Flow Aggregation

Heuristic algorithms in topological design of telecommunication networks

Heuristic methods for topological design of telecommunication networks

Contact Info

Product

Resources

About