Internet traffic engineering by optimizing OSPF weights

By Bernard Fortz, Mikkel Thorup. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000

1,360 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/19c02554cefb5a75b383bb053dfd8acd483c942c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs (2003, background): “… and Subject Descriptors C.2 [Communication Networks]: C.2.2 Network Protocols;C.2.3 Network Operations; F.2 [Analysis of Algorithms]: F.2.2 Nonumerical Algorithms and Problems General Terms Algorithms,Design,Management,Performance,Reliability Keywords routing; TM estimation;…”
CONGA: distributed congestion-aware load balancing for datacenters (2015, background): “Traditional traffic engineering mechanisms for wide-area networks [15, 14, 42, 49] use centralized algorithms operating at coarse timescales (hours) based on long-term estimates of traffic matrices.”
Deriving traffic demands for operational IP networks: methodology and experience (2001, background): “For example, consider the task of optimizing the configuration of intradomain routing to balance network load [11].”
Joint VM placement and routing for data center traffic engineering (2012, background): “2) Approximated Markov Chain Promoting Localized Implementation: We next consider a special class of objective function g(·), where g is a linear or piece-wise linear cost function commonly used in traffic engineering problems [10].”
Multi-constrained optimal path selection (2001, background): “In [43] the authors investigated how to set link weights based on the previous measurements so that the shortest paths can provide better load balancing and can meet the desired QoS requirements.”
Increasing Internet Capacity Using Local Search (2004, methodology): “Indeed, in a recent white paper, [33, p. 7] refers to the announcement in [ 17 ] of the work of the current paper as one of the reasons for not deploying MPLS in their IP backbone.”
Routing, flow, and capacity design in communication and computer networks (2004, methodology): “These issues are treated also in [ERP02], [FT00], [LORS01], and [RR01].”
A roadmap for traffic engineering in SDN-OpenFlow networks (2014, background): “So far, the most of IP-based traffic engineering solutions in [16–18], have basic routing schemes that are based on”
On selfish routing in Internet-like environments (2003, background): “According to [13], [14] , the cost of a link can be modeled using a piecewise-linear, increasing, convex function with slopes specified as follow s:”
Traffic engineering with traditional IP routing protocols (2002, methodology): “The example in Figure 2 from [5] shows how to control the distribution of traffic in a network by”
MicroTE: fine grained traffic engineering for data centers (2011, methodology): “The implication of those observations ontraf.c engineeringisthat we cannotdirectlyadopttraf.cengineeringtechniquesdesignedfor ISPs, which function at coarse time scales of several hours and assume relatively smoothertraf.cpatterns.”