- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Active Networks / Wakamiya, Naoki; Solarski, Marcin; Sterbenz, James (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. - (Lecture Notes in Computer Science ; 2982). - S. 20-31. - ISBN 978-3-540-21250-8
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2007
- Creator
-
Kind, Andreas
Pletka, Roman
Waldvogel, Marcel
- URN
-
urn:nbn:de:bsz:352-opus-24765
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:55 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
- Kind, Andreas
- Pletka, Roman
- Waldvogel, Marcel
- Bibliothek der Universität Konstanz
Time of origin
- 2007
Other Objects (12)
Efficient Topology-Aware Overlay Network
Efficient hash tables for network applications
Optimizing message delivery in mobile-opportunistic networks
Prediction quality of contact history in opportunistic networks
Consistent deniable lying : privacy in mobile social networks
Major Domus Redux: Privacy in Mobile P2P Networks
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
Fast Incremental CRC Updates for IP over ATM Networks
Questioning flooding as a routing benchmark in Opportunistic Networks
Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications
Scalable Prefix Matching for Internet Packet Forwarding
Efficient Topology-Aware Overlay Network
Efficient hash tables for network applications
Optimizing message delivery in mobile-opportunistic networks
Prediction quality of contact history in opportunistic networks
Consistent deniable lying : privacy in mobile social networks
Major Domus Redux: Privacy in Mobile P2P Networks
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
Fast Incremental CRC Updates for IP over ATM Networks
Questioning flooding as a routing benchmark in Opportunistic Networks
Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications
Scalable Prefix Matching for Internet Packet Forwarding
Efficient Topology-Aware Overlay Network
Efficient hash tables for network applications
Optimizing message delivery in mobile-opportunistic networks
Prediction quality of contact history in opportunistic networks
Consistent deniable lying : privacy in mobile social networks
Major Domus Redux: Privacy in Mobile P2P Networks
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
Fast Incremental CRC Updates for IP over ATM Networks
Questioning flooding as a routing benchmark in Opportunistic Networks
Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks
Fast Longest Prefix Matching : Algorithms, Analysis, and Applications