Arrabbella
New member
- Joined
- Mar 21, 2013
- Member Type
- Student or Learner
- Native Language
- Czech
- Home Country
- Czech Republic
- Current Location
- Czech Republic
Good morning,
could you please correct these five sentences for me? Thanks a lot.
Abstract
As the speed of computer networks grows, all network devices have to work faster to keep up with services running in the network. LPM (longest prefix match) is one of the most time-consuming network operations which has to be done in every router. This article proposes a new Generic Hash Tree Bitmap LPM algorithm for fast longest prefix match for both both IPv4 and IPv6 networks. The algorithm takes full advantage of using hash function, which is used to jump over the sparse part of the IP prefix tree.
could you please correct these five sentences for me? Thanks a lot.
Abstract
As the speed of computer networks grows, all network devices have to work faster to keep up with services running in the network. LPM (longest prefix match) is one of the most time-consuming network operations which has to be done in every router. This article proposes a new Generic Hash Tree Bitmap LPM algorithm for fast longest prefix match for both both IPv4 and IPv6 networks. The algorithm takes full advantage of using hash function, which is used to jump over the sparse part of the IP prefix tree.