Intra-domain traffic engineering with shortest path routing protocols

Altın, Ayşegül; Fortz, Bernard; Thorup, Mikkel; Umit, Hakan

doi:10.1007/s10479-012-1270-7

Cited by 33 publications

(18 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each origin-destination pair s, t has an associated demand D p (s, t) that must flow between s and t at a certain period p. Each arc (i, j) in the network can only be used whether the corresponding installation cost c ij or the maintenance cost m ij is paid, in this case it has an aggregated (mutual) arc capacity C p ij . Also, individual arc capacities C stp ij are defined for the maximum amount of flow of the pair s, t on arc (i, j) at the period p. Furthermore, a routing cost for each arc (i, j) and each period p is defined by an increasing convex function of its utilization, inspired by [20], [6].…”

Section: Optimization Modelmentioning

confidence: 99%

See 1 more Smart Citation

Lagrangian relaxation for the time-dependent combined network design and routing problem

Papadimitriou¹,

Fortz

Gorgone

2015

2015 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Abstract-In communication networks, the routing decision process (distributed and online) remains decoupled from the network design process, i.e., resource installation and allocation planning process (centralized and offline). To reconcile both processes, we ambition to design a distributed optimization technique aware of distributed nature of the routing process by decomposing the optimization problem along same dimensions as (distributed) routing decision process. For this purpose, we generalize the capacitated multi-commodity capacitated fixed charge network design (MCND) class of problems by including different types of fixed costs (installation and maintenance costs) and variable costs (routing costs) but also variable traffic demands over multiple periods. However, conventional integer programming methods can typically solve only small to medium size instances. As an alternative, we propose a Lagrangian approach for computing a lower bound by relaxing the flow conservation constraints such that the Lagrangian subproblem itself decomposes by node. Though this approach yields one subproblem per network node, solving the Lagrangian dual by means of the bundle method remains a complex computational tasks. However, the approach is more robust than any LP solvers and it always returns some solutions. Instead, we proved that CPLEX, which uses the Dual Simplex algorithm, is not able to provide a solution for large instances.

show abstract

Section: Optimization Modelmentioning

confidence: 99%

“…Indeed, integer programming methods can typically solve only small to medium size instances as reported in [6]. To circumvent this problem, [1] among others have successfully applied the Lagrangian relaxation technique to compute efficient large-scale instances of the MCND problem.…”

Section: Introductionmentioning

confidence: 99%

Lagrangian relaxation for the time-dependent combined network design and routing problem

Papadimitriou¹,

Fortz

Gorgone

2015

2015 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similar problems can be found in many other applications, such as road network design [Mig95], toll setting [BLMS01], transportation of hazardous materials [KV04], location of speed-up subnetworks [SS14], network interdiction [Woo11], shipper-carrier interactions [LSC + 13] and telecommunication [AFTÜ09], see also [CMS07] for an overview. Furthermore, the contrast between route assignment and route choice is closely related to game theoretical concepts.…”

Section: Integration Of Network Design and Routingmentioning

confidence: 82%

Line planning with user-optimal route choice

Goerigk

Schmidt

2017

European Journal of Operational Research

View full text Add to dashboard Cite

We consider the problem of designing lines in a public transport system, where we include user-optimal route choice. The model we develop ensures that there is enough capacity present for every passenger to travel on a shortest route. We present two different integer programming formulations for this problem, and discuss exact solution approaches. To solve large-scale line planning instances, we also implemented a genetic solution algorithms.We test our algorithms in computational experiments using randomly generated instances along realistic data, as well as a realistic instance modeling the German long-distance network. We examine the advantages and disadvantages of using such user-optimal solutions, and show that our algorithms scale with instance size to be used for practical purposes.

show abstract

“…With the use of a totally stub area: In case of using a totally stub area, the routing table only contains the routes to the routers, located within this area, and a default route [16]. Even on such a small testbed, a significant reduction of the size of the routing table was observed; in case of increasing the number of the routers outside the totally stub area, the difference between the topology tables and the amount of occupied memory for routers located in the totally stub areas and those located in the generic domain, without division into areas, will only increase.…”

Section: Configuring Totally Stub Areasmentioning

confidence: 99%

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

Makarov¹,

Abdulnazarov²,

Anarbekov³

2016

ijacsa

View full text Add to dashboard Cite

Abstract-The paper deals with the data transmission network of the Krasnoyarsk Railway, its structure, the topology of data transmission and the routing protocol, which supports its operation, as well as the specifics of data transmission networking. The combination of the railway automation applications and the data transmission network make up the automation systems, making it possible to improve performance, increase the freight traffic volume, and improve the quality of passenger service. The objective of this paper is to study the existing data transmission network of the Krasnoyarsk Railway and to develop ways of its modernization, in order to improve the reliability of the network and the automated systems that use this network. It was found that the IS-IS and OSPF routing protocols have many differences, primarily due to the fact that the IS-IS protocol does not use IP addresses as paths. On the one hand, it makes it possible to use the IS-IS protocol for the operation in IPv6 networks, whereas OSPF version 2 doesn't provide this opportunity; therefore, OSPF version 3 was developed to solve this problem. However, on the other hand, in case of using IPv4, the routing configuration by means of the IS-IS protocol will imply the need to study a significant volume of information and use unusual methods of routing configuration.

show abstract

Intra-domain traffic engineering with shortest path routing protocols

Cited by 33 publications

References 37 publications

Lagrangian relaxation for the time-dependent combined network design and routing problem

Lagrangian relaxation for the time-dependent combined network design and routing problem

Line planning with user-optimal route choice

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

Contact Info

Product

Resources

About