- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000. - IEEE Comput. Soc, 2000. - S. 200-207. - ISBN 0-7695-0912-6
In: 25th Annual IEEE Conference on Local Computer Networks. LCN 2000, Tampa, FL, USA
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2007
- Creator
-
Waldvogel, Marcel
- URN
-
urn:nbn:de:bsz:352-opus-24693
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Waldvogel, Marcel
- Bibliothek der Universität Konstanz
Time of origin
- 2007
Other Objects (12)
Scalable Prefix Matching for Internet Packet Forwarding
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications
Fast longest prefix matching: algorithms, analysis, and applications
GOSSIB vs. IP Traceback Rumors
Synchronizing Entities in Replicated Log-Structured Databases with Disconnected Operation
Scalable Best Matching Prefix Lookups
Scalable High-Speed Prefix Matching
Light-weight End-to-End QoS as DoS Prevention
Reality-Check for DTN Routing Algorithms
Efficient Privacy Preserving Multicast DNS Service Discovery
Prediction quality of contact history in opportunistic networks
A Rate-based End-to-end Multicast Congestion
Scalable Prefix Matching for Internet Packet Forwarding
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications
Fast longest prefix matching: algorithms, analysis, and applications
GOSSIB vs. IP Traceback Rumors
Synchronizing Entities in Replicated Log-Structured Databases with Disconnected Operation
Scalable Best Matching Prefix Lookups
Scalable High-Speed Prefix Matching
Light-weight End-to-End QoS as DoS Prevention
Reality-Check for DTN Routing Algorithms
Efficient Privacy Preserving Multicast DNS Service Discovery
Prediction quality of contact history in opportunistic networks
A Rate-based End-to-end Multicast Congestion
Scalable Prefix Matching for Internet Packet Forwarding
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications
Fast longest prefix matching: algorithms, analysis, and applications
GOSSIB vs. IP Traceback Rumors
Synchronizing Entities in Replicated Log-Structured Databases with Disconnected Operation
Scalable Best Matching Prefix Lookups
Scalable High-Speed Prefix Matching
Light-weight End-to-End QoS as DoS Prevention
Reality-Check for DTN Routing Algorithms
Efficient Privacy Preserving Multicast DNS Service Discovery
Prediction quality of contact history in opportunistic networks