A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1....
-
date post
19-Dec-2015 -
Category
Documents
-
view
217 -
download
3
Transcript of A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1....
![Page 1: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/1.jpg)
A Dynamic Binary Hash Scheme for IPv6 Lookup
Q. Sun1, X. Huang1, X. Zhou1, and Y. Ma1,2
1. School of Computer Science and Technology2. Beijing Key Laboratory of Intelligent
Telecommunications Software and MultimediaBeijing University of Posts and Telecommunications
IEEE GLOBECOM 2008
![Page 2: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/2.jpg)
MDS: Maximum Disjoint Set [13] K. Zheng and B. Liu, “V6Gene: A scalable IPv6 prefix gen
erator for route lookup algorithm benchmark,” IEEE AINA 2006
Characteristic of IPv6 table
![Page 3: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/3.jpg)
The proposed greedy algorithm to find a MDS for a given routing table
![Page 4: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/4.jpg)
OS: Overlap Set
Overall structure
![Page 5: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/5.jpg)
Insert procedure of DBH
![Page 6: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/6.jpg)
Delete procedure of DBH
![Page 7: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/7.jpg)
Most of the MDS prefix lengths are less than 64 bits
There is no prefix with prefix length less than 16 The routes peak at lengths of 32, 35, and 48 The total number of unique MDS prefix lengths in
combined distribution is 16, greatly less than the length of IPv6 address 128
![Page 8: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/8.jpg)
Optimized searching path for current IPv6 routing table
![Page 9: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/9.jpg)
For future IPv6 consideration According to RFC 3177 and RIPE 267, the IPv6
address blocks should be allocated to subscribes following three rules
‘/48’ in the general case, expect for very large subscribes, which could receive a ‘/47’ or multiple ‘/48s’
‘/64’ when it is known that one and only one subnet is needed by design
‘/128’ when it is ABSOLUTELY known that one and only one device is connecting
So the future IPv6 routes should peak at lengths of 48, 47, 64, and 32
![Page 10: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/10.jpg)
Optimized searching path for future IPv6 routing table
the future IPv6 routes should peak at lengths of 48, 47, 64, and 32
![Page 11: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/11.jpg)
Evaluation platform
Implemented in standard C Intel Pentium 4 PC 2.4GHz CPU 512M DDR333 Red Hat Enterprise Linux Advanced
Server 4.0
![Page 12: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/12.jpg)
Lookup speed
Avg. lookup memory access number is only 2.7 for current IPv6 routing tables
Quite stable for future IPv6 routing tables
![Page 13: A Dynamic Binary Hash Scheme for IPv6 Lookup Q. Sun 1, X. Huang 1, X. Zhou 1, and Y. Ma 1,2 1. School of Computer Science and Technology 2. Beijing Key.](https://reader036.fdocuments.net/reader036/viewer/2022062714/56649d2a5503460f949ff2f8/html5/thumbnails/13.jpg)
Memory and update