TY - GEN
T1 - Towards a flexible data center fabric with source routing
AU - Jyothi, Sangeetha Abdu
AU - Dong, Mo
AU - Godfrey, P. Brighten
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/6/17
Y1 - 2015/6/17
N2 - An emerging architecture for software-defined data centers andWANs is the network fabric, where complex application- sensitive functions are factored out, leaving the network itself to provide a simple, robust high-performance data delivery abstraction. This requires performing route optimization, in real time and across a diverse choice of paths. A large variety of techniques have been proposed to provide path diversity for network fabrics. But, running up against the constraint of forwarding table size, these proposals are topology-dependent, complex, and still only provide limited path choice which (we show) can impact performance. We propose a simple approach to realize the vision of a exible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice. To this end, we observe that source routing can be encoded and processed compactly into a single field, even in large networks, with OpenFlow 1.3. We show that, in addition to the expected decrease in required forwarding table size, source routing supports optimal throughput performance, in some cases significantly higher than some past proposals. We thus believe source routing offers a clean abstraction and effcient implementation for future network fabrics.
AB - An emerging architecture for software-defined data centers andWANs is the network fabric, where complex application- sensitive functions are factored out, leaving the network itself to provide a simple, robust high-performance data delivery abstraction. This requires performing route optimization, in real time and across a diverse choice of paths. A large variety of techniques have been proposed to provide path diversity for network fabrics. But, running up against the constraint of forwarding table size, these proposals are topology-dependent, complex, and still only provide limited path choice which (we show) can impact performance. We propose a simple approach to realize the vision of a exible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice. To this end, we observe that source routing can be encoded and processed compactly into a single field, even in large networks, with OpenFlow 1.3. We show that, in addition to the expected decrease in required forwarding table size, source routing supports optimal throughput performance, in some cases significantly higher than some past proposals. We thus believe source routing offers a clean abstraction and effcient implementation for future network fabrics.
KW - Data centers
KW - Source routing
UR - http://www.scopus.com/inward/record.url?scp=84962106247&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84962106247&partnerID=8YFLogxK
U2 - 10.1145/2774993.2775005
DO - 10.1145/2774993.2775005
M3 - Conference contribution
AN - SCOPUS:84962106247
T3 - Symposium on Software Defined Networking (SDN) Research, SOSR 2015
BT - Symposium on Software Defined Networking (SDN) Research, SOSR 2015
PB - Association for Computing Machinery
T2 - 1st ACM SIGCOMM Symposium on Software Defined Networking Research, SOSR 2015
Y2 - 17 June 2015 through 18 June 2015
ER -