| Summary: | 碩士 === 國立清華大學 === 資訊工程學系 === 104 === Efficient utilization of routing table is an major issue in software-defined network(SDN)
due to the high price of the lookup routing table. In this paper, we focus on mini-
mizing the usage of TCAM of mice flows (85 percentage overall) in the data center.
The liberated spaces of the routing table by the algorithm could be use for increasing
the throughput of the network by other traffic engineering functions. First of all, we
provide a routing policy is to reuse the default rule as many as possible in order to
decrease the TCAM table size. Next, different from the original default tree, which
is built as a shortest path tree, we construct a new default rule tree called CDRT
tree which could efficiently reuse by the routing policy. Further more, the tree is con-
structed by using linear optimization model. At last, we evaluate the performance of
CDRT using Bcube topology, and compare with two routing policy. One is shortest
path routing, which is the original routing policy for mice flows, the other is to reuse
shortest path tree for routing. At last, avoiding the routing path overstretch because
of the reuse of the routing method, we would set length limitation on the routing
path.
Keywords: Default Rule Tree, Efficient Routing.
|
|---|
