Download now Free registration required
Data Center (DC) networks exhibit much more centralized characteristics than the legacy Internet, yet they are operated by similar distributed routing and control algorithms that fail to exploit topological redundancy to deliver better and more sustainable performance. Multipath protocols, for example, use node-local and heuristic information to only exploit path diversity between shortest paths. In this paper, the authors use a measurement-based approach to schedule flows over both shortest and non-shortest paths based on temporal network-wide utilization.
- Format: PDF
- Size: 741.14 KB