% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-04-20
% Creation time: 14-17-56
% --- Number of references
% 21
% 

@Conference { 200810riechelcncerco,
   title = {Range Queries and Load Balancing in a Hierarchically Structured P2P System},
   year = {2008},
   month = {10},
   day = {14},
   pages = {28-35},
   abstract = {Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, are used more and more for file-sharing and content distribution applications. However, a major weakness of traditional DHTs is the search for stored content, as data is assigned to nodes based on hash functions, and the very nature of hash tables allows only exact pattern matches. We present Cerco, a solution for the problem of range queries by using the principles of order-preserving DHTs and a hierarchically structured P2P approach. To guarantee an efficient routing and load balancing, Cerco uses a dynamic hierarchy of DHTs by creating subrings on demand and two explicit load balancing strategies. Our evaluation shows that Cerco is able to achieve the goals of supporting range queries, logarithmic-hop routing, and efficient load balancing.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4664131\&arnumber=4664148\&count=180\&index=16},
   web_url = {http://web.informatik.uni-bonn.de/IV/Mitarbeiter/matthew/Mirror_LCN2008_Website/www.ieeelcn.org/},
   misc2 = {Print},
   publisher = {IEEE Press},
   booktitle = {Proceedings of 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008)},
   organization = {IEEE},
   event_place = {Montreal, Canada},
   event_name = {33rd Annual IEEE Conference on Local Computer Networks (LCN 2008)},
   event_date = {14-17 Oct. 2008},
   language = {en},
   ISBN = {978-1-4244-2412-2},
   DOI = {10.1109/LCN.2008.4664148},
   reviewed = {1},
   author = {Rieche, Simon and Vinh, Bui The and Wehrle, Klaus}
}

@Conference { 200803riechemmvecluster,
   title = {Clustering Players for Load Balancing in Virtual Worlds},
   year = {2008},
   month = {3},
   day = {18},
   pages = {9-13},
   abstract = {Massively Multiplayer Online Games (MMOGs) have become increasingly popular in the last years. So far the distribution of load, caused by the players in these games, is not distributed dynamically. After the launch of a new game, the introduction of new content, during special ingame events, or also during normal operations, players tend to concentrate in certain regions of the game worlds and cause overload conditions. Therefore we propose the use of structured P2P technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas; however this approach often split a group of players to different servers, causing additional overhead. This work presents a cluster-based Peer-to-Peer approach, which can be used for load balancing in MMOGs or in other virtual worlds. The system is able to dynamically adapt to the current state of the game and handle uneven distributions of the players in the game world. We show through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based systems, which split the world in rectangular areas.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://www.pap.vs.uni-due.de/MMVE08/papers/proceedings.pdf},
   web_url = {http://www.pap.vs.uni-due.de/MMVE08/},
   misc2 = {Online},
   editor = {Gregor Schiele, Daniel Weiskopf, Ben Leong, Shun-Yun Hu},
   booktitle = {Proceedings of 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008)},
   event_place = {Reno, Nevada, USA},
   event_name = {1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008)},
   event_date = {March 8th, 2008},
   language = {en},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Teifel, Timo and Carle, Georg}
}

@Article { 200812riecheIJAMCcluster,
   title = {Clustering Players for Load Balancing in Virtual Worlds},
   journal = {International Journal of Advanced Media and Communication (IJAMC)},
   year = {2008},
   volume = {2},
   number = {4},
   pages = {351-363},
   abstract = {In current Massively Multiplayer Online Games (MMOGs) the distribution of load is not distributed dynamically. But players tend to concentrate in certain regions of the game world and cause overload conditions. Therefore we propose the use of structured Peer-to-Peer technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas but often split a group of players to different servers. This work presents a cluster-based P2P approach, which is able to dynamically adapt to the current state of the game and handle uneven distributions of players.Weshow through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based system.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   web_url = {http://www.inderscience.com/browse/index.php?journalID=67},
   misc2 = {print},
   language = {en},
   ISSN = {1462-4613},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Teifel, Timo and Carle, Georg}
}

@Conference { 200701riecheccncmmog,
   title = {Peer-to-Peer-based Infrastructure Support for Massively Multiplayer Online Games},
   year = {2007},
   month = {1},
   day = {11},
   pages = {763-767},
   abstract = {Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive betatesting suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4199088\&arnumber=4199243\&count=254\&index=154},
   web_url = {http://www.ieee-ccnc.org/2007/},
   misc2 = {Print},
   publisher = {IEEE Press},
   booktitle = {Proceedings of 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007)},
   organization = {IEEE},
   event_place = {Las Vegas, Nevada, USA},
   event_name = {4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007)},
   event_date = {11-13 January 2007},
   language = {en},
   ISBN = {1-4244-0667-6},
   DOI = {10.1109/CCNC.2007.155},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Petrak, Leo and Carle, Georg}
}

@Conference { rieche2006cerco,
   title = {Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System},
   year = {2006},
   month = {11},
   day = {14},
   pages = {509-510},
   abstract = {Structured Peer-to-Peer systems are designed for a highly scalable,
self organizing, and efficient lookup for data. The key space of the
so-called Distributed Hash Tables (DHTs) is partitioned and each
partition with its keys and values is assigned to a node in the DHT.
For data retrieval however, the very nature of hash tables allows
only exact pattern matches.

We propose Cerco, a simple solution for the problem of range queries
by employing a hierarchically structured P2P approach based on the
principles of Distributed Hash Tables. We show that a dynamic
hierarchy of DHTs with on-demand classification of items can
positively influence the response time of queries while maintaining
lookup correctness.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4116490\&arnumber=4116594\&count=192\&index=90},
   web_url = {http://web.archive.org/web/20061008091738/http://www.ieeelcn.org/},
   misc2 = {Print},
   publisher = {IEEE Press},
   booktitle = {Proceedings of 31st IEEE Conference on Local Computer Networks (LCN 2006)},
   organization = {IEEE},
   event_place = {Tampa, Florida, USA},
   event_name = {31st IEEE Conference on Local Computer Networks (LCN 2006)},
   event_date = {14-16 November 2006},
   language = {en},
   ISBN = {1-4244-0418-5},
   DOI = {10.1109/LCN.2006.322147},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Petrak, Leo and Wrzodek, Clemens}
}

@Techreport { 200608riechetrmmog,
   title = {Peer-to-Peer-based Infrastructure Support for Massively Multiplayer Online Games},
   year = {2006},
   month = {8},
   number = {WSI-2006-04},
   abstract = {Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive beta-testing suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://www.rieche.net/pdf/wsi-2006-04.pdf},
   misc2 = {Online},
   address = {T{\"u}bingen, Germany},
   institution = {Wilhelm-Schickard-Institute for Computer Science, University of T{\"u}bingen},
   type = {Technical Report},
   language = {en},
   author = {Rieche, Simon and Fouquet, Marc and Niedermayer, Heiko and Petrak, Leo and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { 2006-heer-percomws-adapt-dht,
   title = {Adapting Distributed Hash Tables for Mobile Ad Hoc Networks},
   year = {2006},
   month = {3},
   day = {16},
   volume = {1},
   pages = {1-6},
   url = {http://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2006-heer-percomws-dht-adhoc.pdf},
   misc2 = {Print},
   publisher = {IEEE},
   address = {Washington, DC, USA},
   booktitle = {In Proceedings of 3. IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P'06), Pisa, Italy.},
   event_place = {Pisa, Italy},
   event_name = {IEEE International Workshop on Mobile Peer-to-Peer Computing},
   event_date = {March 2006},
   language = {en},
   ISBN = {0-7695-2520-2},
   DOI = {10.1109/PERCOMW.2006.16},
   reviewed = {1},
   author = {Heer, Tobias and G{\"o}tz, Stefan and Rieche, Simon and Wehrle, Klaus}
}

@Poster { rieche2006poster,
   title = {Peer-to-Peer-based Infrastructure Support for Massively Multiplayer Online Games},
   year = {2006},
   month = {3},
   abstract = {Massively multiplayer online games (MMOGs) are becoming increasingly
popular today. However, even high-budget titles like World of
Warcraft that have gone through extensive beta-testing suffer from
downtimes because of hard- and software problems and lags on
overloaded servers. Our approach is to use structured P2P technology
for the server infrastructure of massively multiplayer online games
to improve reliability and scalability of these applications.
Structured P2P networks are able to adapt to the current state of
the game world and handle uneven distributions of the players. For
load balancing, we propose algorithms based on the virtual server
concept.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   web_url = {http://www.dagstuhl.de/de/programm/kalender/semhp/?semnr=06131},
   misc2 = {Print},
   editor = {Dagstuhl Seminar 06131 ''Peer-to-Peer Systems and Applications''},
   publisher = {Dagstuhl},
   organization = {Dagstuhl Seminar 06131},
   language = {en},
   author = {Rieche, Simon and Wehrle, Klaus}
}

@Inproceedings { landsiedel2005anonymous,
   title = {Anonymous IP-Services via Overlay Routing},
   year = {2005},
   month = {3},
   abstract = {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.},
   booktitle = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_place = {W{\"u}rzburg, Germany},
   event_name = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_date = {March 2005},
   author = {Landsiedel, Olaf and Rieche, Simon and Niedermayer, Heiko and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { petrak2005dienstguete,
   title = {Dienstg{\"u}te in strukturierten hierarchischen Overlay Netzwerken},
   year = {2005},
   month = {3},
   booktitle = {Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_place = {Kaiserslautern, Germany},
   event_name = {Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_date = {March 2005},
   author = {Petrak, Leo and Rieche, Simon and Wehrle, Klaus}
}

@Inproceedings { niedermayer2005distribution,
   title = {On the Distribution of Nodes in Distributed Hash Tables},
   year = {2005},
   month = {3},
   booktitle = {Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_place = {Kaiserslautern, Germany},
   event_name = {Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_date = {March 2005},
   author = {Niedermayer, Heiko and Rieche, Simon and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { 200507riecheipgames,
   title = {On the Use of Structured Peer-to-Peer Systems for Online Gaming},
   year = {2005},
   month = {3},
   abstract = {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.},
   booktitle = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_place = {W{\"u}rzburg, Germany},
   event_name = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_date = {March 2005},
   author = {Rieche, Simon and Fouquet, Marc and Niedermayer, Heiko and Wehrle, Klaus and Carle, Georg}
}

@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}
}

@Conference { rieche2004thermaldissipation,
   title = {A Thermal-Dissipation-based Approach for Balancing Data Load in Distributed Hash Tables},
   year = {2004},
   month = {11},
   pages = {15-23},
   abstract = {A major objective of peer-to-peer (P2P) systems is the management of
large amounts of data distributed across many systems. Distributed
hash tables (DHT) are designed for highly scalable, self-organizing,
and efficient distribution and lookup of data, whereby data is
stored globally persistent. The range of values of the corresponding
hash function is partitioned and each interval is assigned to a node
of the DHT. Because the assignment of data to nodes is based on hash
functions, one assumes that the respective data load is distributed
evenly across all participating nodes. However most DHT show
difficulties with load balancing as we demonstrate in this paper. As 
a solution for this problem, we present a new and very simple
approach for balancing stored data between peers in a fashion
analogous to the dissipation of heat energy in materials. We compare
this algorithm with other approaches for load balancing and present
results based on simulations and a prototype implementation. This
new algorithm improves the distribution of load in DHT without
requiring major changes of the DHT themselves. In addition, we show
that the fault tolerance of peer-to-peer systems is increased by the
proposed algorithm.},
   url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=29935\&arnumber=1367197\&count=128\&index=2},
   misc2 = {Print},
   publisher = {IEEE Press},
   booktitle = {Proceedings of LCN 2004 – 29th IEEE Conference on Local Computer Networks},
   organization = {IEEE},
   event_place = {Tampa, Florida, USA},
   event_name = {LCN 2004 – 29th IEEE Conference on Local Computer Networks},
   event_date = {November 2004},
   language = {en},
   ISBN = {0-7695-2260-2},
   DOI = {10.1109/LCN.2004.10},
   author = {Rieche, Simon and Petrak, Leo and Wehrle, Klaus}
}

@Inproceedings { 200410riechehotp2preliability,
   title = {Reliability of Data in Structured Peer-to-Peer Systems},
   year = {2004},
   month = {10},
   pages = {108-113},
   abstract = {Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose Distributed Hash Tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P-Systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured Peer-to-Peer system.},
   misc2 = {Print},
   booktitle = {Proceedings of HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)},
   event_place = {Volendam, Netherlands},
   event_name = {HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer},
   event_date = {Oct. 2004},
   language = {en},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Landsiedel, Olaf and G{\"o}tz, Stefan and Petrak, Leo}
}

@Inproceedings { rieche2004comparison,
   title = {Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems},
   year = {2004},
   month = {9},
   volume = {51},
   misc2 = {Print},
   publisher = {GI. LNI},
   address = {Bonn, Germany},
   series = {LNI},
   booktitle = {Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004},
   event_place = {Ulm, Germany},
   event_name = {GI-Jahrestagung Informatik 2004},
   language = {en},
   reviewed = {1},
   author = {Rieche, Simon and Petrak, Leo and Wehrle, Klaus}
}

@Inproceedings { 2006-heer-gi2004,
   title = {On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios},
   year = {2004},
   month = {9},
   volume = {51},
   pages = {239-244},
   abstract = {Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics – namely scalability, flexibility, and resilience – they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concerning the applicability of Distributed Hash Tables in mobile ad-hoc scenarios: Do new problems arise when both technologies are used together? Are there any synergy effects when both technologies are combined? Are the results and assumptions, made for the infrastructural Internet, still true if a mobile ad-hoc network is used instead? In this paper, we discuss these and further questions and offer some solutions for using Distributed Hash Tables in ad-hoc networks.},
   misc2 = {Print},
   publisher = {GI. LNI},
   address = {Bonn, Germany},
   series = {LNI},
   booktitle = {Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004, Bonn, Germany},
   event_place = {Ulm, Germany},
   event_name = {GI-Jahrestagung Informatik 2004},
   language = {en},
   ISBN = {3-88579-380-6},
   reviewed = {1},
   author = {Heer, Tobias and Niedermayer, Heiko and Petrak, Leo and Rieche, Simon and Wehrle, Klaus}
}

@Inproceedings { 200410wehrlefgpcintegriertekonstruktionsmethode,
   title = {Integrierte Konstruktionsmethoden f{\"u}r flexible Protokolle in ubiquit{\"a}ren Kommunikationssystemen},
   year = {2004},
   address = {Stuttgart, Germany},
   booktitle = {Proceedings of the GI/ITG KuVS Fachgespr{\"a}ch Systemsoftware f{\"u}r Pervasive Computing},
   author = {Wehrle, Klaus and Landsiedel, Olaf and Rieche, Simon and G{\"o}tz, Stefan and Petrak, Leo}
}