Traffic engineering with traditional IP routing protocols
By Bernard Fortz, Jennifer Rexford, Mikkel Thorup. IEEE Communications Magazine, 2002
551 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/69aea421e7e66055a3a6aee41dce32f65352ba4a
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
- Jennifer Rexford
- Mikkel Thorup
- Bernard Fortz
- Ion Stoica
- Aditya Akella
- Danda B. Rawat
- S. Reddy
- Srikanth Kandula
In Electrical and Electronic Engineering
- Jennifer Rexford
- Mikkel Thorup
- Bernard Fortz
- Danda B. Rawat
- S. Reddy
- Albert G. Greenberg
- Aditya Akella
- Ming Zhang
Citations in the corpus
- Increasing Internet Capacity Using Local Search (2004, background): “A description of the general infrastructure behind this kind of traffic engineering is given in [ 15 ].”
- A roadmap for traffic engineering in SDN-OpenFlow networks (2014, background): “Then each router computes shortest paths and creates a table that controls the forwarding of each IP packet to the next hop in its route [17].”
- Achieving high utilization with software-driven WAN (2013, background): “Optimizing WAN e ciency has rich literature including tuning ECMP weights [12], adapting allocations across preestablished tunnels [10, 17], storing and re-routing bulk data at relay nodes [21], caching at application-layer [32] and leveraging reconfigurable optical networks [22].”
- Software Defined Networking Architecture, Security and Energy Efficiency: A Survey (2017, methodology): “networks using load balancing and efficient routing paths such as shortest path routing protocols [180].”
- Low Latency Geo-distributed Data Analytics (2015, background): “4) Scheduling on the WAN: There has been much work on optimizing WAN transfers including tuning ECMP weights [32] and adapting allocations across pre-established tunnels [31, 39].”
- A clean slate 4D approach to network control and management (2005, methodology): “This optimi zation problem has been widely studied in the context of existing IP routing protocols, such as OSPF and BGP, where the output is a set of OSPF weights and BGP policies that indirectly determine t he forwarding-table entries [13, 14].”