This file was created by the TYPO3 extension
bib
--- Timezone: CET
Creation date: 2023-03-23
Creation time: 02-37-08
--- Number of references
8
inproceedings
landsiedel2005anonymous
Anonymous IP-Services via Overlay Routing
2005
3
Although research provides anonymous Internet communication schemes,
anonymous IP-services received only limited attention. In this paper
we present SARA (Anonymous Overlay Routing Providing Sender And
Receiver Anonymity), which enables sender, receiver and relationship
anonymity using layered encryption and distributed traffic mixes,
similar to a Chaumian Mix. Via IP-datagram service and address
virtualization it is fully transparent to applications. Organized as
structured Peer-To-Peer system, SARA is highly scalable and fault
tolerant.
In SARA each communication partner randomly selects a number of
nodes from the overlay and concatenates them to an anonymous
communication path. The sender selects the head of the path, the
receiver builds the tail and publishes this information in the
overlay network using an anonymous ID. Via this ID the sender
retrieves the tail nodes of the path and concatenates both path
section. Layered encryption hides the identities of the sender,
receiver and the intermediate nodes.
5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung"
Würzburg, Germany
5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung"
March 2005
OlafLandsiedel
SimonRieche
HeikoNiedermayer
KlausWehrle
GeorgCarle
inproceedings
petrak2005dienstguete
Dienstgüte in strukturierten hierarchischen Overlay Netzwerken
2005
3
Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005
Kaiserslautern, Germany
Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005
March 2005
LeoPetrak
SimonRieche
KlausWehrle
inproceedings
niedermayer2005distribution
On the Distribution of Nodes in Distributed Hash Tables
2005
3
Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005
Kaiserslautern, Germany
Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005
March 2005
HeikoNiedermayer
SimonRieche
KlausWehrle
GeorgCarle
inproceedings
200507riecheipgames
On the Use of Structured Peer-to-Peer Systems for Online Gaming
2005
3
Massively multiplayer games are becoming increasingly popular today. However, even high-budget titles suffer from downtimes because of hard- and software problems. Our approach is to use structured Peer-to-Peer technology for the server infrastructure of massively multiplayer online games, which improves reliability and scalability of these applications.
5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung"
Würzburg, Germany
5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung"
March 2005
SimonRieche
MarcFouquet
HeikoNiedermayer
KlausWehrle
GeorgCarle
inbook
200509riechep2pbookreliability
Reliability and Load Balancing in Distributed Hash Tables
2005
119-135
Ralf Steinmetz, Klaus Wehrle
Springer
Heidelberg, Germany
Lecture Notes in Computer Science, LNCS
9
Peer-to-Peer Systems and Applications
SimonRieche
HeikoNiedermayer
StefanGötz
KlausWehrle
inbook
200509goetzp2pbookdhtalgorithms
Selected Distributed Hash Table Algorithms
2005
95-117
Ralf Steinmetz, Klaus Wehrle
Springer
Heidelberg, Germany
Lecture Notes in Computer Science, LNCS
8
Peer-to-Peer Systems and Applications
StefanGötz
SimonRieche
KlausWehrle
inbook
200509wehrlep2pbookdhts
Distributed Hash Tables
2005
79-93
Ralf Steinmetz, Klaus Wehrle
Springer
Heidelberg, Germany
Lecture Notes in Computer Science, LNCS
7
Peer-to-Peer Systems and Applications
KlausWehrle
StefanGötz
SimonRieche
inproceedings
200503landsiedelfgsnaeon
Project AEON
2005
481
72-76
Power consumption is a crucial characteristic of sensor networks and their applications, as sensor nodes are commonly battery driven. Although recent research focuses strongly on energy aware applications and operating systems, power consumption is still a limiting factor. Once sensor nodes are deployed, it is challenging and sometimes even impossible to change batteries. As a result, erroneous lifetime prediction causes high costs and may render a sensor network useless, before its purpose is fulfilled. In this paper we present AEON, a novel evaluation tool to quantitatively predict power consumption of sensor nodes and whole sensor networks. Our energy model, based on measurements of node current draw and the execution of real code, enables accurate prediction of the actual power consumption of sensor nodes. Consequently, preventing erroneous assumptions on node and network lifetime. Moreover, our detailed energy model allows to compare different low power and energy aware approaches in terms of energy efficiency.
Zürich, CH
Proceedings of the 4th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Techical Report No. 481
OlafLandsiedel
KlausWehrle
SimonRieche
StefanGötz
LeoPetrak