Efficient Routing Heuristics for Internet Traffic Engineering

Salles, Ronaldo Moreira; Rolla, Vitor

doi:10.1016/j.comcom.2007.02.008

Cited by 7 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is forced to use a heuristic method to solve the OSPF problem. In paper [5] Ronaldo proposed three routing heuristic, namely HeurCoupling, HeurRosa, HeurOne, to abtain the dynamic link weights. HeurCoupling is a two step approach to evaluate the optimal weight for the same return path.…”

Section: Related Workmentioning

confidence: 99%

Traffic Optimization on the Dynamic Switching of ABR for OSPF Networks

Jieru

et al. 2009

2009 International Conference on Information Technology and Computer Science

View full text Add to dashboard Cite

Open Shortest Path First (OSPF) is a dynamic and inter-domain routing protocol with hierarchical architecture used in Internet networks routing. Area border router (ABR) had been proved to be an effective solution to the complicated network and scalability problem. Obviously, manual selection of ABR can not satisfy the dynamic change in the network load. A new scheme, based on the traffic engineering and flow splitting for the procedure of dynamic ABR switching for OSPF networks, is proposed in the paper. By the traffic observation and links weights optimizing algorithm, the OSPF network can obtain good load balancing and network performance improvement.

show abstract

Section: Related Workmentioning

confidence: 99%

Traffic Optimization on the Dynamic Switching of ABR for OSPF Networks

Jieru

et al. 2009

2009 International Conference on Information Technology and Computer Science

View full text Add to dashboard Cite

show abstract

“…The routing problem represents one of the central questions in today's internet traffic engineering [1][2][3][4][5]. Different routing protocols lead to different outcomes concerning the traffic flow throughout the network.…”

Section: Introductionmentioning

confidence: 99%

Self avoiding paths routing algorithm in scale-free networks

Rachadi¹,

Jedra²,

Zahid³

2013

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

In this paper, we present a new routing algorithm called "the Self Avoiding Paths Routing Algorithm". Its application to traffic flow in sclae-free networks shows a great improvement over the so called "efficient routing" protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self consistent manner with a relatively small number of iterations by maintaining an equilibrated path distribution especially among the hubs. This results in a significant shifting of the critical packet generation rate over which traffic congestion occurs, thus permitting the network to sustain more information packets in the free flow state. The performance of the algorithm is discussed both on a Barábasi-Albert (BA) network and real autonomous system (AS) network data.

show abstract

“…If the traffic demand matrix is known a-priori, the link weights can be determined by solving an optimisation problem for TE purposes [2]. Although the problem of obtaining optimal weights is known to be NP-hard, a number of heuristics can be used to find near-optimal solutions [2,3]. Despite the relative ease of implementation of link weight-based methods, it is not only hard to reach optimality by using shortest path routing but also hard to estimate traffic demands that may comprise unpredictable spikes [4].…”

Section: Introductionmentioning

confidence: 99%

TCP flow aware adaptive path switching in diffserv enabled MPLS networks

Alparslan¹,

Akar²,

Karasan³

2011

Trans Emerging Tel Tech

View full text Add to dashboard Cite

We propose an adaptive flow-level multi-path routing-based traffic engineering solution for an IP backbone network carrying TCP/IP traffic. Incoming TCP flows are switched between two explicitly routed paths, namely the primary and secondary paths (PP and SP), for resilience and potential goodput improvement at the TCP layer. In the proposed architecture, PPs receive a preferential treatment over SPs using differentiated services mechanisms. The reason for this choice is not for service differentiation but for coping with the detrimental knock-on effect stemming from the use of longer SP that is well known for conventional network load balancing algorithms. Moreover, both paths are congestion-controlled using Explicit Congestion Notification marking at the core and Additive Increase Multiplicative Decrease rate adjustment at the ingress nodes. The delay difference between PP and SP is estimated using two per-egress rate-controlling buffers maintained at the ingress nodes for each path, and this delay difference is used to determine the path over which a new TCP flow will be routed. We perform extensive simulations using ns-2 in order to demonstrate the viability of the proposed distributed adaptive multi-path routing method in terms of per-flow TCP goodput. The proposed solution consistently outperforms the single-path routing policy and provides substantial per-flow goodput gains under poor PP conditions. Moreover, highest goodput improvements under the proposed scheme are achieved by flows that receive the lowest goodputs with single-path routing, while the performance of the flows with high goodputs with single-path routing does not deteriorate with the proposed path switching technique.

show abstract

Efficient Routing Heuristics for Internet Traffic Engineering

Cited by 7 publications

References 13 publications

Traffic Optimization on the Dynamic Switching of ABR for OSPF Networks

Traffic Optimization on the Dynamic Switching of ABR for OSPF Networks

Self avoiding paths routing algorithm in scale-free networks

TCP flow aware adaptive path switching in diffserv enabled MPLS networks

Contact Info

Product

Resources

About