Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date:...
-
Upload
rebecca-simmons -
Category
Documents
-
view
218 -
download
0
Transcript of Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date:...
![Page 1: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/1.jpg)
1
Parallelizing FIB Lookup in Content Centric Networking
Authors: Shuai Ding, Zhen Chen, and Zhi Liu
Publisher: ICNDC 2012
Presenter: Chai-Yi Chu
Date: 2013/03/20
![Page 2: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/2.jpg)
2
Introduction Implementation◦Generating FIB and Interest◦ Parallelizing FIB Lookup
Experiment
Outline
![Page 3: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/3.jpg)
3
Leverages multi-core platform to accelerate the FIB lookup in CCN router.
Based on TILEPro64 platform, which has 64 identical tiles.
Two parallelized lookup algorithms1. based on hash table. 2. based on Bloom filter
Introduction
![Page 4: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/4.jpg)
4
![Page 5: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/5.jpg)
5
Use a special server called ASN server, which returns corresponding AS number upon receiving a query of domain name.
![Page 6: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/6.jpg)
6
![Page 7: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/7.jpg)
7
![Page 8: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/8.jpg)
8
TILEPro64 multicore platform◦ 64 identical tiles, each of which is a full featured processor.◦ 43 of them are available to user space programs.
FIB Generator◦ generates FIB entries.
Interest Generator ◦ generates Interests to search in FIB.
FIB ◦ implements lookup algorithms.
Implementation
![Page 9: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/9.jpg)
9
![Page 10: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/10.jpg)
10
Simulate CCN Interests with http URL requests.◦ extract 50,000 URLs from realistic pcap files captured at the
gateway of an office. Generate FIB ◦we set a seed for a random number generator and use statistics
of domain names. Generate Interest
1. generate a FIB prefix using the same seed as generating FIB.
2. produce the suffix using another random number generator based on the statistics of URL path.
Generating FIB and Interest
![Page 11: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/11.jpg)
11
Hash table based lookup algorithm Start by the longest prefix, each prefix is searched in
FIB until a certain prefix matching is found.
Parallelizing FIB Lookup
![Page 12: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/12.jpg)
12
![Page 13: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/13.jpg)
13
Bloom filter is searched at first, if a prefix doesn’t exist in Bloom filter, there is no need to search for it in the hash table any more.
![Page 14: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/14.jpg)
14
![Page 15: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/15.jpg)
15
load factor is 1.0
Experiment
![Page 16: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/16.jpg)
16
load factor is 10.0
![Page 17: Authors: Shuai Ding, Zhen Chen, and Zhi Liu Publisher: ICNDC 2012 Presenter: Chai-Yi Chu Date: 2013/03/20 1.](https://reader035.fdocuments.in/reader035/viewer/2022062322/56649e5f5503460f94b59a72/html5/thumbnails/17.jpg)
17
Hash based