Name
Abstract | ||
|---|---|---|
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as ternary content-addressable memory (TCAM). One typical solution of this problem would be to use MPLS-like tunneling, but this approach spoils the advantage of flow-by-flow path selection for load-balancing or QoS. We demonstrate a method named "Source Flow" that allows us to handle a huge amount of flows without changing the granularity of flows. By using our method, expensive and power consuming search engine devices can be removed from the core nodes, and the network can grow pretty scalable. In our demo, we construct a small network that consists of small number of OpenFlow switches, a single OpenFlow controller, and end-hosts. The hosts generate more than one million flows simultaneously and the flows are controlled on a per-flow-basis. All active flows are monitored and visualized on a user interface and the user interface allows audiences to confirm if our method is feasible and deployable. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1851182.1851266 | SIGCOMM |
Keywords | Field | DocType |
search engine,load balance,openflow,user interface | Control theory,Content-addressable memory,Search engine,Computer security,Computer science,Quality of service,Computer network,OpenFlow,Granularity,User interface,Distributed computing,Scalability | Conference |
Volume | Issue | ISSN |
40 | 4 | 0146-4833 |
Citations | PageRank | References |
14 | 0.95 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasunobu Chiba | 1 | 23 | 1.52 |
| Yusuke Shinohara | 2 | 88 | 10.26 |
| Hideyuki Shimonishi | 3 | 124 | 22.41 |