Name
Abstract | ||
|---|---|---|
Load-balancing and network optimization in SDN networks require efficient flow splitting during the path computation phase. The way flow splitting is typically implemented in switches is to map the output of an hash function computed on the headers of incoming flows to the content stored in a Ternary Content Addressable Memory (TCAM), a very efficient but scarce resource. Although a large TCAM budget means that the flow distribution can more accurately model a fractional ideal, the distribution of flow volume amongst the paths is constrained in reality to use only a limited number of TCAM rows. In this paper, we present a flow splitting algorithm that maximizes the total number of demands allocated in the network according to the TCAM size constraints and, at the same time, minimize the total routing cost. Although the problem is NP-hard, we show through simulations that we can achieve good approximations of the optimal solution in a reasonable amount of time. |
Year | Venue | Field |
|---|---|---|
2016 | IEEE Global Communications Conference | Approximation algorithm,Mathematical optimization,Content-addressable memory,Global optimization,Computer science,Computer network,Network topology,Real-time computing,Bandwidth (signal processing),Hash function,Throughput,Computation |
DocType | ISSN | Citations |
Conference | 2334-0983 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Medagliani | 1 | 80 | 12.94 |
| Jeremie Leguay | 2 | 303 | 28.78 |
| Mohammed Abdullah | 3 | 0 | 0.34 |
| Mathieu Leconte | 4 | 31 | 2.63 |
| Stefano Paris | 5 | 140 | 15.36 |