Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective

Chiesa, Marco; Kindler, Guy; Schapira, Michael

doi:10.1109/tnet.2016.2614247

Cited by 109 publications

(51 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…See Equation (C7). PD optimization with multiple path routing (PD‐MPR): This approach is similar to PD‐GLW. However, the multi‐path routing is taken into consideration. In other words, we can choose one of the paths from given the set of paths.…”

Section: Methodsmentioning

confidence: 99%

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

Fan

2019

Int J Communication

View full text Add to dashboard Cite

The exponential growth of various applications requires deploying an ever-growing number of network services. A generalized service deployment framework for Open Shortest Path First (OSPF) networks is proposed in this paper. The framework includes placing programmable routers, distributing different types of services on these routers, and leading traffic flow through them according to the predetermined sequence order requirement. However, it is not possible to direct all the traffic flows through the required service nodes along the shortest path with a single and suitable set of link weights. To address the issue, multiple topology routing (MTR) technique is incorporated to have various logical topologies with multiple sets of link weights. Correspondingly, the problem of jointly optimizing Placement of programmable routers, Distribution of different types of services among these routers, and Link Weights setting based on MTR (shortened to PD-LW-MTR) and its mixed integer linear programming formulation are presented in this paper. A novel decomposition algorithm is also proposed to address this problem efficiently. Experiment results validate the correctness and feasibility of our algorithm. It is also shown that the optimization algorithm can obtain near-optimal solution and just only a few logical topologies over multiple sets of link weights are necessary for traffic flows to guarantee service order requirements. KEYWORDS link weight setting, multiple topology routing (MTR), placement and distribution (PD), service deployment, service order requirement Int J Commun Syst. 2019;32:e3978.wileyonlinelibrary.com/journal/dac

show abstract

Section: Methodsmentioning

confidence: 99%

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

Fan

2019

Int J Communication

View full text Add to dashboard Cite

show abstract

“…This process is too slow for a transient event, and may impact negatively other traffic flows. Furthermore, as ECMP will load-balance the traffic evenly across all next-hops, reaching the optimal configuration is an intractable problem [4]. Using MPLS and RSVP-TE avoids the shortcomings of the IGP, but introduces overhead on both the control and data planes, by establishing a potentially-high number of tunnels, encapsulating packets, and performing statefull uneven load-balancing.…”

Section: Flexible Ecmp With Fibbingmentioning

confidence: 99%

Fibbing in action

Tilmans

Vissicchio

Vanbever

et al. 2016

Proceedings of the 2016 ACM SIGCOMM Conference

View full text Add to dashboard Cite

Video streaming, in conjunction with social networks, have given birth to a new traffic pattern over the Internet: transient, localized traffic surges, known as flash crowds. Traditional traffic-engineering methods can hardly cope with these surges, as they are unpredictable by nature. Consequently, networks either have to be overprovisioned, which is expensive and wastes resources, or risk to periodically incur congestion, which infuriates customers. This demonstration shows how Fibbing [1] can improve network performance and preserve users' quality of experience when accessing video streams, by implementing a fine-grained load-balancing service. This service leverages two unique features of Fibbing: programming per destination load-balancing and implementing uneven splitting ratios.

show abstract

“…The single-path routing strategy may lead to a high blocking probability when some network links are congested during the period of high traffic load. In light of this, multi-path routing has been investigated [5,9,11,25,20,21,26].…”

Section: Introductionmentioning

confidence: 99%

“…Second, a higher Quality of Service (QoS) and Quality of Experience (QoE) can be obtained [19,20,25]. Thus, many multi-path routing protocols and algorithms have been proposed, for instance, generalized destination-based multi-path routing [26], equal-cost multi-path routing [11] and minimum routing cost multi-path routing [21]. In general, there are two main variants of multi-path routing, whose optimization goal is either to minimize the network congestion ratio through load balancing [5,17,23,26], or to minimize the total routing cost of traffic flows on all paths [9,11,21].…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, the network operator should also assure that the deployed routing protocol is able to provide all the traffic demands in the link capacity constraint. We assume that the multi-path routing protocol minimizing total link capacity utilization (a simple version of total routing cost of all traffic flows on paths) [21,9,11] is used by the ISP network operator. However, the energy consumption and link capacity utilization cannot be optimized simultaneously, and an equilibrium should be achieved for the two control plane functions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach

et al. 2019

View full text Add to dashboard Cite

In recent years, green networking has attracted a lot of attention from device manufacturers and Internet Service Providers (ISP) to reduce energy consumption. In the literature, energy-aware traffic engineering problem is proposed to minimize the total energy consumption by switching off unused network devices (routers and links) while guaranteeing full network connectivity. In this work, we are interested in the problem of energy-aware Traffic Engineering while using multi-path routing (ETE-MPR) to minimize link capacity utilization in ISP backbone networks. To this end, we propose a bi-level optimization model where the upper level represents the energy management function, and the lower level refers to the deployed multi-path routing protocol. Then, we reformulate it as a one-level MILP replacing the second level problem by different sets of optimality conditions. We further use these formulations to solve the problem with classical branch-and-bound, cutting plane, and branchand-cut algorithms. The computational experiments are performed on real instances to compare the proposed algorithms and to evaluate the efficiency of our model against the existing single-path and multi-objective approaches.

show abstract

Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective

Cited by 109 publications

References 26 publications

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

Fibbing in action

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach

Contact Info

Product

Resources

About