This paper describes a networking approach for cloud data
centers architectures based on a novel use of in-packet Bloom filters to
encode randomized network paths. In order to meet the scalability,
performance, and cost-efficiency goals of a cloud infrastructure,
innovation is called for at many areas of the data center environment,
including the underlying switching topology and new packet forwarding
paradigms. Motivated by the advent of high-radix, low-cost, commodity
switches coupled with a substrate of programmability (OpenFlow), our
proposal contributes to the body of work re-thinking how to interconnect
racks of commodity PCs at large. In this work, we present the design
principles and testbed implementation of a data center architecture
governed by Rack Managers, which are responsible to transparently
provide the networking and support functions to cost-efficiently operate
the DCN. We evaluate the proposal in terms of state requirements, our
claims of false-positive-free forwarding, and the load balancing
capabilities.
%0 Conference Paper
%1 rothenberg2010center
%A Rothenberg, Christian Esteve
%A Macapuna, Carlos
%A Verdi, Fabio
%A Magalhães, Mauricio
%A Zahemszky, Andras
%B SBRC 2010
%D 2010
%K bloom center data filter networking packet
%T Data center networking with in-packet Bloom filters
%U http://XXXXX/64116_1.pdf
%X This paper describes a networking approach for cloud data
centers architectures based on a novel use of in-packet Bloom filters to
encode randomized network paths. In order to meet the scalability,
performance, and cost-efficiency goals of a cloud infrastructure,
innovation is called for at many areas of the data center environment,
including the underlying switching topology and new packet forwarding
paradigms. Motivated by the advent of high-radix, low-cost, commodity
switches coupled with a substrate of programmability (OpenFlow), our
proposal contributes to the body of work re-thinking how to interconnect
racks of commodity PCs at large. In this work, we present the design
principles and testbed implementation of a data center architecture
governed by Rack Managers, which are responsible to transparently
provide the networking and support functions to cost-efficiently operate
the DCN. We evaluate the proposal in terms of state requirements, our
claims of false-positive-free forwarding, and the load balancing
capabilities.
@inproceedings{rothenberg2010center,
abstract = {This paper describes a networking approach for cloud data
centers architectures based on a novel use of in-packet Bloom filters to
encode randomized network paths. In order to meet the scalability,
performance, and cost-efficiency goals of a cloud infrastructure,
innovation is called for at many areas of the data center environment,
including the underlying switching topology and new packet forwarding
paradigms. Motivated by the advent of high-radix, low-cost, commodity
switches coupled with a substrate of programmability (OpenFlow), our
proposal contributes to the body of work re-thinking how to interconnect
racks of commodity PCs at large. In this work, we present the design
principles and testbed implementation of a data center architecture
governed by Rack Managers, which are responsible to transparently
provide the networking and support functions to cost-efficiently operate
the DCN. We evaluate the proposal in terms of state requirements, our
claims of false-positive-free forwarding, and the load balancing
capabilities.},
added-at = {2010-06-27T16:30:59.000+0200},
author = {Rothenberg, Christian Esteve and Macapuna, Carlos and Verdi, Fabio and Magalhães, Mauricio and Zahemszky, Andras},
biburl = {https://www.bibsonomy.org/bibtex/24fcd6b9ab8a26fbd44a27420631b91f5/chesteve},
booktitle = {SBRC 2010},
days = {24-28},
interhash = {7a3c834dda9e2e10a841e80db8ab35a7},
intrahash = {4fcd6b9ab8a26fbd44a27420631b91f5},
keywords = {bloom center data filter networking packet},
month = may,
timestamp = {2010-06-27T16:30:59.000+0200},
title = {Data center networking with in-packet Bloom filters},
url = {http://XXXXX/64116_1.pdf},
year = 2010
}