% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-04-26
% Creation time: 01-27-40
% --- Number of references
% 6
% 

@Inproceedings { 200503goetzp2psawindowsfilesharing,
   title = {Spontaneous Windows File Sharing via Virtual Groups},
   year = {2005},
   month = {2},
   day = {28},
   volume = {61},
   pages = {143-146},
   abstract = {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.},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-kivs-spontaneous-file-sharing.pdf},
   misc2 = {print},
   editor = {Paul M{\"u}ller, Reinhard Gotzhein, Jens B. Schmitt},
   publisher = {Gesellschaft f{\"u}r Informatik (GI)},
   address = {Bonn, Germany},
   howpublished = {print},
   series = {LNI},
   booktitle = {Proceedings of Workshop on Peer-to-Peer-Systems and -Applications},
   organization = {Gesellschaft f{\"u}r Informatik (GI)},
   event_place = {Kaiserslautern, Germany},
   event_name = {Kommunikation in Verteilten Systemen (KiVS), Kaiserslautern, Germany},
   event_date = {2005-02-28},
   language = {en},
   ISBN = {3-88579-390-3},
   reviewed = {1},
   author = {G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Inbook { 200509riechep2pbookreliability,
   title = {Reliability and Load Balancing in Distributed Hash Tables},
   year = {2005},
   pages = {119-135},
   editor = {Ralf Steinmetz, Klaus Wehrle},
   publisher = {Springer},
   address = {Heidelberg, Germany},
   series = {Lecture Notes in Computer Science, LNCS},
   chapter = {9},
   booktitle = {Peer-to-Peer Systems and Applications},
   author = {Rieche, Simon and Niedermayer, Heiko and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Inbook { 200509goetzp2pbookdhtalgorithms,
   title = {Selected Distributed Hash Table Algorithms},
   year = {2005},
   pages = {95-117},
   editor = {Ralf Steinmetz, Klaus Wehrle},
   publisher = {Springer},
   address = {Heidelberg, Germany},
   series = {Lecture Notes in Computer Science, LNCS},
   chapter = {8},
   booktitle = {Peer-to-Peer Systems and Applications},
   author = {G{\"o}tz, Stefan and Rieche, Simon and Wehrle, Klaus}
}

@Inbook { 200509wehrlep2pbookdhts,
   title = {Distributed Hash Tables},
   year = {2005},
   pages = {79-93},
   editor = {Ralf Steinmetz, Klaus Wehrle},
   publisher = {Springer},
   address = {Heidelberg, Germany},
   series = {Lecture Notes in Computer Science, LNCS},
   chapter = {7},
   booktitle = {Peer-to-Peer Systems and Applications},
   author = {Wehrle, Klaus and G{\"o}tz, Stefan and Rieche, Simon}
}

@Inproceedings { 200503landsiedelfgsnaeon,
   title = {Project AEON},
   year = {2005},
   number = {481},
   pages = {72-76},
   abstract = {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.},
   address = {Z{\"u}rich, CH},
   booktitle = {Proceedings of the 4th GI/ITG KuVS Fachgespr{\"a}ch ''Wireless Sensor Networks'', Techical Report No. 481},
   author = {Landsiedel, Olaf and Wehrle, Klaus and Rieche, Simon and G{\"o}tz, Stefan and Petrak, Leo}
}

@Inproceedings { 200511goetzmmsctransparent,
   title = {Transparent End-Host-Based Service Composition through Network Virtualization},
   year = {2005},
   pages = {31-36},
   abstract = {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.},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-mmc-transparent-service-composition.pdf},
   misc2 = {print},
   editor = {Wolf-Tilo Balke and Klara Nahrstedt},
   publisher = {ACM},
   address = {New York, NY, USA},
   howpublished = {print},
   booktitle = {Proceedings of the First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference},
   organization = {ACM},
   event_place = {Singapore},
   event_name = {First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference, Singapore},
   event_date = {2005-08-01},
   language = {en},
   ISBN = {1-59593-245-3},
   DOI = {10.1145/1099423.1099430},
   reviewed = {1},
   author = {G{\"o}tz, Stefan and Wehrle, Klaus}
}