Binary Trees Approach to Speedup Address Range Lookup in Peer-to-Peer Solutions
It has been analyzed specifics of underlying algorithms for address range lookup. Concerning the storage of IP ranges, the drawbacks and bottlenecks of existing implementations have been determined. A new, faster method based on binary trees for storing and accessing the IP range databases is propos...
Saved in:
| Date: | 2013 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут проблем реєстрації інформації НАН України
2013
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/103368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |
Institution
Data Recording, Storage & Processing| Summary: | It has been analyzed specifics of underlying algorithms for address range lookup. Concerning the storage of IP ranges, the drawbacks and bottlenecks of existing implementations have been determined. A new, faster method based on binary trees for storing and accessing the IP range databases is proposed. |
|---|