This file was created by the TYPO3 extension
bib
--- Timezone: UTC
Creation date: 2025-02-17
Creation time: 20-59-17
--- Number of references
15
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
inproceedings
200503goetzp2psawindowsfilesharing
Spontaneous Windows File Sharing via Virtual Groups
2005
2
28
61
143-146
Although File and printer sharing services have been deployed almost ubiquitously for a long time as part of Microsoft Windows, only recent peer-to-peer applications popularized file-sharing on a global scale. As the Windows CIFS protocol was designed for local area networks, its use has been con?ned to relatively small environments. We propose a mechanism to set up spontaneous virtual groups that allow to use legacy Windows file and printer sharing globally in virtual LANs.
https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-kivs-spontaneous-file-sharing.pdf
print
Paul Müller, Reinhard Gotzhein, Jens B. Schmitt
Gesellschaft für Informatik (GI)
Bonn, Germany
print
LNI
Proceedings of Workshop on Peer-to-Peer-Systems and -Applications
Gesellschaft für Informatik (GI)
Kaiserslautern, Germany
Kommunikation in Verteilten Systemen (KiVS), Kaiserslautern, Germany
2005-02-28
en
3-88579-390-3
1
StefanGötz
KlausWehrle
article
200504landsiedelpikenergy
Enabling Detailed Modeling and Analysis of Sensor Networks
Special Issue on Sensor Networks, PIK Journal
2005
28
2
Simulation is the de-facto standard tool for the evaluation of distributed and communication systems like sensor networks. Most simulation efforts focus on protocol- and algorithm-level issues, thus depending on the right choice and configuration of models. However, as such models commonly neglect time dependent issues, many research challenges, like energy consumption and radio channel utilization still remain. In this article we present two new tools to model and analyze sensor networks: Avrora, a fast and accurate sensor network simulator, and AEON, a novel tool built on top of Avrora, to evaluate the energy consumption and to accurately predict the lifetime of sensor networks. Avrora is a highly scalable instruction-level simulator for sensor network programs. It simulates the execution of the program down to the level of individual clock cycles, a time quantum of about 135 ns. By incorporating state of the art simulation techniques, including an efficiently maintained event queue, fast-forward through sleep-time, and parallel simulation, it can simulate entire networks of nodes in real time. AEON's energy model is based on Avrora and makes use of the cycle accurate execution of sensor node applications for precise energy measurements. Due to limited energy resources, power consumption is a crucial characteristic of sensor networks. AEON uses accurate measurements of node current draw and the execution of real code to enable accurate prediction of the actual power consumption of sensor nodes. Consequently, it prevents 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. Thus, it enables a highly precise estimation of the overall lifetime of a sensor network.
OlafLandsiedel
KlausWehrle
Ben LTitzer
JensPalsberg
inbook
200502IThandbook
IP-QoS: Flexible and Scalable Quality-of-Service with Differentiated Services
2005
33 pages
Richard Zurawski
CRC Press
xx
The Industrial Information Technology Handbook
KlausWehrle
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
conference
200509petraksoftcommobility
Towards Realistic Strategy-Based Mobility Models for Ad Hoc Communication
2005
Proceedings of the 2005 Conference on Software for Communication Systems and Computer Networks
LeoPetrak
OlafLandsiedel
KlausWehrle
conference
200509landsiedelp2ptdht
T-DHT: Topology-Based Distributed Hash Tables
2005
In this paper, we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path.
Proceedings of Fifth International IEEE Conference on Peer-to-Peer-Computing, Konstanz, Germany
OlafLandsiedel
KatharinaLehmann
KlausWehrle
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
inproceedings
200511goetzmmsctransparent
Transparent End-Host-Based Service Composition through Network Virtualization
2005
31-36
Mobile devices have become a popular medium for delivering multimedia services to end users. A large variety of solutions have been proposed to flexibly compose such services and to provide quality-of-service guarantees for the resulting contents. However, low-level mobility artifacts resulting from network transitions (disconnected operation, reconfiguration, etc.) still prevent a seamless user experience of these technologies. This paper presents an architecture for supporting legacy applications with such solutions in mobile scenarios. Through network virtualization, it hides mobility artifacts and ensures connectivity at the network and transport level. Its adoption for multimedia applications poses unique challenges and advantages, which are discussed herein.
https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-mmc-transparent-service-composition.pdf
print
Wolf-Tilo Balke and Klara Nahrstedt
ACM
New York, NY, USA
print
Proceedings of the First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference
ACM
Singapore
First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference, Singapore
2005-08-01
en
1-59593-245-3
10.1145/1099423.1099430
1
StefanGötz
KlausWehrle
techreport
200605OCALATechReportUCB
OCALA: An Architecture for Supporting Legacy Applications over Overlays
2005
UCB/CSD-005/1397
The ever increasing demand of new applications coupled with the increasing rigidity of the Internet has led researchers to propose overlay networks as a means of introducing new functionality in the Internet. However, despite sustained efforts, few overlays are used widely. Providing support for legacy Internet applications to access such overlays would significantly expand the user base of the overlays, as the users can instantly benefit from the overlay functionality. We present the design and implementation of OCALA, an Overlay Convergence Architecture for Legacy Applications. Unlike previous efforts, OCALA allows users to access different overlays simultaneously, as well as hosts in different overlays to communicate with each other. In addition, OCALA reduces the implementation burden on the overlay developers, by factoring out the functions commonly required to support legacy applications, such as tapping legacy traffic, authentication and encryption. Our implementation of OCALA as a proxy requires no changes to the applications or operating systems. We currently support two overlays, i3 and RON, on Linux and Windows XP/2000 platforms. We (and a few other research groups and end-users) have used the proxy over a eleven-month period with many legacy applications ranging from web browsers to remote desktop applications.
http://ocala.cs.berkeley.edu
UCB, Berkeley, USA
University of California at Berkeley
DilipJoseph
JayanthkumarKannan
AyumuKubota
IonStoica
KlausWehrle