- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
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
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2007
- Urheber
-
Waldvogel, Marcel
- URN
-
urn:nbn:de:bsz:352-opus-24693
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Waldvogel, Marcel
- Bibliothek der Universität Konstanz
Entstanden
- 2007
Ähnliche Objekte (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