Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding internet topology: principles, models, and validation
IEEE/ACM Transactions on Networking (TON)
Slack allocation techniques for intra-path load balancing
Journal of High Speed Networks
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
The measurement paradox in valiant network design
Research Letters in Communications
Survival value of communication networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Valiant load balancing, capacity provisioning and resilient backbone design
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Load balancing vs. distributed rate limiting: an unifying framework for cloud control
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Path selection and multipath congestion control
Communications of the ACM
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Proceedings of the 6th International COnference
Robust network planning in nonuniform traffic scenarios
Computer Communications
Flow-based load-balancing architecture for the agile all-photonic network
Photonic Network Communications
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.02 |
Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do this today: It is hard to accurately measure the current matrix, and harder still to predict future ones. Even if the matrices are known, how do we know a network will support them, particularly under failures? As a result, today’s networks are designed in a somewhat ad-hoc fashion, using rules-of-thumb and crude estimates of current and future traffic. Previously we proposed the use of Valiant Load-balancing (VLB) for backbone design. It can guarantee 100% throughput to any traffic matrix, even under link and router failures. Our initial work was limited to homogeneous backbones in which routers had the same capacity. In this paper we extend our results in two ways: First, we show that the same qualities of service (guaranteed support of any traffic matrix with or without failure) can be achieved in a realistic heterogeneous backbone network; and second, we show that VLB is optimal, in the sense that the capacity required by VLB is very close to the lower bound of total capacity needed by any architecture in order to support all traffic matrices.