TY - GEN
T1 - An efficient TCAM update scheme for packet classification
AU - Chang, Yeim-Kuan
AU - Liu, Kai Yang
PY - 2013/8/8
Y1 - 2013/8/8
N2 - Ternary Content Address Memory (TCAM) becomes a popular hardware device for storing the packet classifiers due to the advantages of high and deterministic lookup performance. However, managing the filter set in TCAM is quite complicated when filters need to be updated. To ensure the correctness of search results, it is required to obtain the right position in TCAM for storing the new filter. In addition, some filters need to be moved to other positions for maintaining the correct filter overlapping relationship based on their priorities. Normally, an auxiliary data structure is used to compute how to insert or delete a filter into/from TCAM. However, this auxiliary data structure is usually complicated and large. Instead of maintaining an auxiliary data structure, in this paper, we propose an efficient TCAM update scheme that simply uses a very small portion of TCAM search cycles to compute how to move the filters related to the filter to be inserted or deleted. Therefore, a large amount of memory for storing the auxiliary data structure along with the local CPU for updates can be avoided. In addition, our simulation results show that the proposed update scheme needs less number of TCAM movements than the existing CoPTUA update scheme [2].
AB - Ternary Content Address Memory (TCAM) becomes a popular hardware device for storing the packet classifiers due to the advantages of high and deterministic lookup performance. However, managing the filter set in TCAM is quite complicated when filters need to be updated. To ensure the correctness of search results, it is required to obtain the right position in TCAM for storing the new filter. In addition, some filters need to be moved to other positions for maintaining the correct filter overlapping relationship based on their priorities. Normally, an auxiliary data structure is used to compute how to insert or delete a filter into/from TCAM. However, this auxiliary data structure is usually complicated and large. Instead of maintaining an auxiliary data structure, in this paper, we propose an efficient TCAM update scheme that simply uses a very small portion of TCAM search cycles to compute how to move the filters related to the filter to be inserted or deleted. Therefore, a large amount of memory for storing the auxiliary data structure along with the local CPU for updates can be avoided. In addition, our simulation results show that the proposed update scheme needs less number of TCAM movements than the existing CoPTUA update scheme [2].
UR - http://www.scopus.com/inward/record.url?scp=84881057229&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881057229&partnerID=8YFLogxK
U2 - 10.1109/AINA.2013.96
DO - 10.1109/AINA.2013.96
M3 - Conference contribution
AN - SCOPUS:84881057229
SN - 9780769549538
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 1017
EP - 1024
BT - Proceedings - IEEE International Conference on Advanced Information Networking and Applications, AINA 2013
T2 - 27th IEEE International Conference on Advanced Information Networking and Applications, AINA 2013
Y2 - 25 March 2013 through 28 March 2013
ER -