Dynamic lookup networks

DOI10.1007/3-540-37795-6_17MaRDI QIDQ4413409zbMATH OpenFDO

Authors Dahlia Malkhi

Publication date 17 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2584/25840093.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Computing methodologies and applications (68U99)

Recommendations

• Adaptive data structures for IP lookups
• Dynamically fault-tolerant content addressable networks
• scientific article; zbMATH DE number 4049076
• Dynamic Routing in Fully Connected Networks
• Dynamic directed search
• Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
• High–performance routing–table lookup
• A cache-based internet protocol address lookup architecture
• Network routing in a dynamic environment

Cited in

(6)

• Distributed paged hash tables
• Efficient peer-to-peer lookup based on a distributed trie
• Serving DNS using a peer-to-peer lookup service
• scientific article; zbMATH DE number 2204042 (Why is no real title available?)
• Enabling dynamic querying over distributed hash tables
• Distributed object location in a dynamic network

This page was built for publication: Dynamic lookup networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413409)