author: tong yang, ruian duan, jianyuan lu, shenjiang zhang, huichen dai and bin liu
DESCRIPTION
CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy. Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu Publisher: IEEE ICDCS, 2012 Presenter: Kai-Yang, Liu Date: 2013/3/13. INTRODUCTION. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/1.jpg)
CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup withReduced Dynamic Redundancy
Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin LiuPublisher: IEEE ICDCS, 2012
Presenter: Kai-Yang, Liu
Date: 2013/3/13
![Page 2: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/2.jpg)
INTRODUCTION
•To achieve high performance, backbone routers must gracefully handle the three problems: routing table Compression, fast routing Lookup, and fast incremental UpdatE (CLUE).
•CLUE consists of three parts: a routing table compression algorithm, an improved parallel lookup mechanism, and a new fast incremental update mechanism.
2
![Page 3: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/3.jpg)
Compression Algorithm• ONRTC compresses the routing table size to 70%
of its original size. • Prefix overlap is eliminated.
3
![Page 4: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/4.jpg)
ONRTC Algorithm
4
![Page 5: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/5.jpg)
Partition Algorithm•In order to achieve parallel lookup, the
prefixes should be split into partitions firstly.
•Step 1: compute the partition size. Suppose the size of routing table is M and the partition count is n, then the size of each partition is M/n.
•Step 2: traverse the trie by inorder, then put every M/n prefixes to each bucket.
5
![Page 6: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/6.jpg)
Improved Parallel Lookup Mechanism
6
![Page 7: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/7.jpg)
The DRed update process of CLPL’s mechanism
7
![Page 8: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/8.jpg)
The DRed update process of CLUE’s mechanism
8
![Page 9: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/9.jpg)
The Incremental Update Mechanism
• The whole update process is divided into three steps :
1) trie update; 2) TCAM update; 3) DRed update.
• Time to Fresh (TTF) is defined in this paper, including TTF1 (TTF-trie), TTF2 (TTF-TCAM), and TTF3 (TTF-DRed).
9
![Page 10: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/10.jpg)
Experiments on Compression by ONRTC
10
![Page 11: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/11.jpg)
Partition comparison among the three algorithms
11
![Page 12: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/12.jpg)
TTF1 comparison between CLPL and CLUE
12
![Page 13: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/13.jpg)
TTF2 comparison between CLPL and CLUE
13
![Page 14: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/14.jpg)
TTF3 comparison between CLPL and CLUE
14
![Page 15: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/15.jpg)
TTF1+TTF2+TT3 comparison between CLPL and CLUE
15
![Page 16: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/16.jpg)
WORKLOAD ON DIFFERENT PARTITIONS AND TCAM CHIPS.
16
![Page 17: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/17.jpg)
Load balance of workload distribution by CLUE
• Each TCAM takes 4 clocks to process a packet, while a packet arrives per clock. The FIFO is set to 256 and redundancy size is set to 1024 prefixes.
17
![Page 18: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/18.jpg)
Speedup factor comparison between CLPL and CLUE
18
![Page 19: Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang Zhang, Huichen Dai and Bin Liu](https://reader035.vdocument.in/reader035/viewer/2022062323/56815286550346895dc0acf4/html5/thumbnails/19.jpg)
Hit rate comparison between CLPL and CLUE
19