2025-02-22T10:34:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22drspiprikievua-article-103368%22&qt=morelikethis&rows=5
2025-02-22T10:34:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22drspiprikievua-article-103368%22&qt=morelikethis&rows=5
2025-02-22T10:34:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T10:34:38-05:00 DEBUG: Deserialized SOLR response
Binary Trees Approach to Speedup Address Range Lookup in Peer-to-Peer Solutions

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...

Full description

Saved in:
Bibliographic Details
Main Author: Poryev, G. V.
Format: Article
Language:English
Published: Інститут проблем реєстрації інформації НАН України 2013
Subjects:
двійкові дерева
розподілені мережі
однорангові мережі
двоичные деревья
распределенные сети
одноранговые сети
binary trees
distributed networks
peer-to-peer
Online Access:http://drsp.ipri.kiev.ua/article/view/103368
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://drsp.ipri.kiev.ua/article/view/103368

Similar Items