2014 · 17 citations · 4 references
ComputingComputer ScienceComputer NetworksInterconnection NetworksNetwork AdministrationLatency OptimizationNetwork Performance AnalysisNetwork SwitchingRoutingRouting AlgorithmsRouting ArchitectureApplication Performance OptimizationBandwidthDijkstra's AlgorithmLatency-aware RoutingNetwork RoutingRouting OptimizationShortest Path RoutingShortest Paths
Bandwidth and latency are two major factors that contribute the most to network application performance. Between each pair of switches in a network, there may be multiple paths connecting them. Each path has different properties because of multiple factors. Traditional shortest-path routing does not take this knowledge into consideration and may result in sub-optimal performance of applications and underutilization of network. We proposed a concept of "bandwidth and latency aware routing". The idea is that we could improve overall performance of the network by separating application into bandwidth-oriented and latency-oriented application and allocate different route for each type of application accordingly. We also proposed a design of this network system implemented using Open Flow. Routes are calculated from monitored information using Dijkstra algorithm and its variation. To support our design, we show a use case in which our design performs better than traditional routing as well as evaluation results.
4
Nick McKeown, Tom Anderson, Hari Balakrishnan et al. · ACM SIGCOMM Computer Communication Review · 2008 · 8.4K citations
Bob Lantz, Brandon Heller, Nick McKeown · 2010 · 1.8K citations
The power of software-defined networking
Boris Koldehofe, Frank Dürr, Muhammad Adnan Tariq et al. · 2012 · 34 citations