Paper Info
Title
Palette: Distributing tables in software-defined networks
Abstract
In software-defined networks (SDNs), the network controller first formulates abstract network-wide policies, and then implements them in the forwarding tables of network switches. However, fast SDN tables often cannot scale beyond a few hundred entries. This is because they typically include wildcards, and therefore are implemented using either expensive and power-hungry TCAMs, or complex and slow data structures. This paper presents the Palette distribution framework for decomposing large SDN tables into small ones and then distributing them across the network, while preserving the overall SDN policy semantics. Palette helps balance the sizes of the tables across the network, as well as reduce the total number of entries by sharing resources among different connections. It copes with two NP-hard optimization problems: Decomposing a large SDN table into equivalent subtables, and distributing the subtables such that each connection traverses each type of subtable at least once. To implement the Palette distribution framework, we introduce graph-theoretical formulations and algorithms, and show that they achieve close-to-optimal results in practice.
Year
DOI
Venue
2013
10.1109/INFCOM.2013.6566832
INFOCOM
Keywords
Field
DocType
data structures,software radio,Palette distribution framework,TCAM,data structures,distributing tables,network controller,network switches,network-wide policies,software-defined networks
Data structure,Wildcard character,Computer science,Computer network,Network switch,Access control,Shared resource,Software-defined networking,Network interface controller,Optimization problem,Distributed computing
Conference
ISSN
ISBN
Citations 
0743-166X
978-1-4673-5944-3
86
PageRank 
References 
Authors
3.08
9
3
Name
Order
Citations
PageRank
Yossi Kanizo11638.10
David Hay21737.85
Isaac Keslassy398672.83