This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-19 Creation time: 18-01-46 --- Number of references 25 phdthesis 2012-goetz-phdthesis 2012 RWTH Aachen University StefanGötz inproceedings 2011-ipsn-alizai-pad 2011 4 fileadmin/papers/2011/2011-ipsn-alizai-pad.pdf Online ACM

New York, NY, USA

Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2011), Chicago, IL, USA Chicago, IL, USA en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel StefanGötz Jó AgilaBitsch Link KlausWehrle inproceedings 2010-kunz-mascots-horizon 2010 8 18 172-181 The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks. horizon fileadmin/papers/2010/2010-kunz-mascots-horizon.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10), Miami, FL, USA Miami, FL, USA 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10) August 17-19, 2010 en 978-0-7695-4197-6 1526-7539 10.1109/MASCOTS.2010.26 1 GeorgKunz OlafLandsiedel JamesGross StefanGötz FarshadNaghibi KlausWehrle inproceedings 2010-heer-pisa-sa 2010 8 2 1 588-593 With the goal of providing ubiquitous wireless services (e.g., tourist guides, environmental information, pedestrian navigation), municipal wireless networks are currently being established all around the world. For municipalities, it is often challenging to achieve the bandwidth and coverage that is necessary for many of the envisioned network services. At the same time, Wi-Fi-sharing communities achieve high bandwidth and good coverage at a very low cost by capitalizing on the dense deployment of private access points in urban areas. However, from a technical, conceptual, and security perspective, Wi-Fi sharing community networks resemble a patchwork of heterogeneous networks instead of one well-planned city-wide network. This patchwork character stands in stark contrast to a uniform, secure platform for public and commercial services desirable for the economic success of such a network. Hence, despite its cost-efficiency, the community-based approach cannot be adopted by municipalities easily. In this paper, we show how to realize municipal wireless services on top of a Wi-Fi-sharing infrastructure in a technically sound and economically attractive fashion. In particular, we focus on how to securely provide services to mobile clients with and without client-side software support. Our solution cleanly separates the roles of controlling and administering the network from providing bandwidth and wireless access. With this separation, commercial ISPs and citizens with their private Wi-Fi can contribute to the network infrastructure. This allows municipalities in turn to focus their resources on municipal wireless services. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-icc-pisa-sa.pdf Print IEEE Press

Washington, DC, USA

International Conference on Computer Communication Networks, ICCCN 2010, Zurich Zurich, Switzerland International Conference on Computer Communication Networks, ICCCN 2010 en 978-1-4244-7114-0 10.1109/ICCCN.2010.5560103 1 TobiasHeer ThomasJansen RenéHummen HannoWirtz StefanGötz EliasWeingaertner KlausWehrle inproceedings 2010-percomws-heer-munifi Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), IEEE. 2010 4 2 1 588 - 593 Municipal Wi-Fi networks aim at providing Internet access and selected mobile network services to citizens, travelers, and civil servants. The goals of these networks are to bridge the digital divide, stimulate innovation, support economic growth, and increase city operations efficiency. While establishing such urban networks is financially challenging for municipalities, Wi-Fi-sharing communities accomplish good coverage and ubiquitous Internet access by capitalizing on the dense deployment of private access points in urban residential areas. By combining Wi-Fi communities and municipal Wi-Fi, a collaborative municipal Wi-Fi system promises cheap and ubiquitous access to mobile city services. However, the differences in intent, philosophy, and technical realization between community and municipal Wi-Fi networks prevent a straight-forward combination of both approaches. In this paper, we highlight the conceptual and technical challenges that need to be solved to create collaborative municipal Wi-Fi networks. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-percomws-collaborative-municipal-wi-fi.pdf Print IEEE Press

Washington, DC, USA

Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), Mannheim, Germany. Mannheim, Germany Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010) April 02, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470505 TobiasHeer RenéHummen NicolaiViol HannoWirtz StefanGötz KlausWehrle inproceedings 2009-sensys-alizai-burstytraffic 2009 11 71-84 wld fileadmin/papers/2009/2009-alizai-sensys-bre.pdf ACM

New York, NY, USA

Proceeding of 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 09), Berkeley, CA, USA Berkley, California Sensys 09 November 2009 en 978-1-60558-519-2 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle techreport 200908alizaifgsnburstyrouting 2009 9 63-66 Accurate estimation of link quality is the key to enable efficient routing in wireless sensor networks. Current link estimators focus mainly on identifying long-term stable links for routing, leaving out a potentiality large set of intermediate links offering significant routing progress. Fine-grained analysis of link qualities reveals that such intermediate links are bursty, i.e., stable in the short term. In this paper, we use short-term estimation of wireless links to accurately identify short-term stable periods of transmission on bursty links. Our approach allows a routing protocol to forward packets over bursty links if they offer better routing progress than long-term stable links. We integrate a Short Term Link Estimator and its associated routing strategy with a standard routing protocol for sensor networks. Our evaluation reveals an average of 22% reduction in the overall transmissions when routing over long-range bursty links. Our approach is not tied to any special routing protocol and integrates seamlessly with existing routing protocols and link estimators. wld fileadmin/papers/2009/2009-08-alizai-fgsn-bursty-routing.pdf doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf Print Technical University Hamburg

Technical University Hamburg

Proceedings of the 8th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Hamburg, Germany en 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle inproceedings 2009-landsiedel-visa-vipe 2009 8 17 45--52 Although the diversity of platforms for network experimentation is a boon to the development of protocols and distributed systems, it is challenging to exploit its benefits. Implementing or adapting the systems under test for such heterogeneous environments as network simulators, network emulators, testbeds, and end systems is immensely time and work intensive. In this paper, we present VIPE, a unified virtual platform for network experimentation, that slashes the porting effort. It allows to smoothly evolve a single implementation of a distributed system or protocol from its design up into its deployment by leveraging any form of network experimentation tool available. deployment, network experimentation, resource virtualization, simulation fileadmin/papers/2009/2009-landsiedel-visa-vipe.pdf Print ACM Press

New York, NY, USA

Proceedings of the 1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures, Barcelona, Spain Barcelona, Spain 1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures August 17, 2009 en 978-1-60558-595-6 10.1145/1592648.1592657 1 OlafLandsiedel GeorgKunz StefanGötz KlausWehrle poster 2009-kunz-nsdi-profab 2009 4 22 fileadmin/papers/2009/2009-kunz-nsdi-protocolFactory.pdf Poster Online USENIX Association

Berkeley, CA, USA

6th USENIX Symposium on Networked Systems Design and Implementation (NSDI'09) en 1 GeorgKunz OlafLandsiedel StefanGötz KlausWehrle inproceedings 200906MobiArchgoetzprotocolorchestration 2009 43-50 The diversity of today's networking environments, such as wired, wireless, cell-based, or multi-hop, is matched by an equally large amount and heterogeneity of specialized protocols, e.g., overlays, Wi-Fi positioning, MANET routing, cross-layer signaling. However, communication is typically performed with a static set of protocols selected at design time based on simplified assumptions ignoring the environment's heterogeneity. In this paper, we argue that protocols can be orchestrated as software components driven purely by their functionality and the demands of the execution environment. Our end-system protocol framework Adapt bases on extensible ontological models that semantically describe protocol and environment properties. At runtime, each connection receives a custom-tailored protocol stack that Adapt orchestrates from the requirements derived from the application, user, and environment. With this approach, end-systems can reason about the functionality and quality of automatically composed and adapted protocol compounds while remaining open to existing and future protocols. https://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-goetz-mobiarch-protocol-orchestration.pdf print Krzysztof Zielinski and Adam Wolisz and Jason Flinn and Anthony LaMarca ACM

New York, NY, USA

print Proceedings of the Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09) ACM Sigcomm/Sigmobile Krakow, Poland Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09), Krakow, Poland 2009-06-22 en 1 StefanGötz TobiasHeer KlausWehrle inproceedings 2009-icc-heer-middleboxes 2009 1 791-796 Today, middleboxes such as firewalls and network address translators have advanced beyond simple packet forwarding and address mapping. They also inspect and filter traffic, detect network intrusion, control access to network resources, and enforce different levels of quality of service. The cornerstones for these security-related network services are end-host authentication and authorization. Using a cryptographic namespace for end-hosts simplifies these tasks since it gives them an explicit and verifiable identity. The Host Identity Protocol (HIP) is a key-exchange protocol that introduces such a cryptographic namespace for secure end-to-end communication. Although HIP was designed with middleboxes in mind, these cannot securely use its namespace because the on-path identity verification is susceptible to replay attacks. Moreover, the binding between HIP as an authentication protocol and IPsec as payload transport is insufficient because on-path middleboxes cannot securely map payload packets to a HIP association. In this paper, we propose to prevent replays attack by treating packet-forwarding middleboxes as first-class citizens that directly interact with end-hosts. Also we propose a method for strengthening the binding between the HIP authentication process and its payload channel with hash-chain-based authorization tokens for IPsec. Our solution allows on-path middleboxes to efficiently leverage cryptographic end-host identities and integrates cleanly into existing protocol standards. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-heer-icc-end-host-authentication.pdf Print Piscataway, NJ, USA

Dresden, Germany

Proceedings of the IEEE International Conference on Communications 2009 (ICC 2009), Dresden, Gemany IEEE Dresden, Germany IEEE International Conference on Communications 2009 (ICC 2009) en 978-1-4244-3435-0 1938-1883 10.1109/ICC.2009.5198984 1 TobiasHeer RenéHummen MiikaKomu StefanGötz KlausWehrle inproceedings goetz2008adapt 2008 12 10 5343/2008 287-292 Although modularized protocol frameworks are flexible and adaptive to the increasing heterogeneity of networking environments, it remains a challenge to automatically compose communication stacks from protocol modules. The typical static classification into network layers or class hierarchies cannot appropriately accommodate cross-cutting changes such as overlay routing or cross-layer signaling. In this paper, we discuss how protocol composition can be driven by functionality and demand at runtime based on extensible semantic models of protocols and their execution environment. Such an approach allows to reason about the functionality and quality of automatically composed and adapted protocol compounds and it is open to existing and future protocols. https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-goetz-mobiarch-adapt.pdf Print Karin Anna Hummel and James P. G. Sterbenz Springer-Verlag

Tiergartenstraße 17, 69121 Heidelberg, Germany

Lecture Notes in Computer Science Proceedings of the 3rd International Workshop on Self-Organizing Systems, Vienna, Austria Vienna, Austria 3rd International Workshop on Self-Organizing Systems (IWSOS) 2008-12-10 en 978-3-540-92156-1 10.1007/978-3-540-92157-8\_27 1 StefanGötz ChristianBeckel TobiasHeer KlausWehrle inproceedings heer-2008-conext-alpha 2008 12 1 23:1--23:12 http://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-heer-conext-alpha.pdf Print ACM

New York, NY, USA

CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference, Madrid, Spain Madrid, Spain ACM Conext 2008 December 2008 en 978-1-60558-210-8 10.1145/1544012.1544035 1 TobiasHeer StefanGötz OscarGarcia-Morchon KlausWehrle conference 2008-heer-pisa-full 2008 6 16 1 1-7 The proliferation of broadband Internet connections has lead to an almost pervasive coverage of densely populated areas with private wireless access points. To leverage this coverage, sharing of access points as Internet uplinks among users has first become popular in communities of individuals and has recently been adopted as a business model by several companies. However, existing implementations and proposals suffer from the security risks of directly providing Internet access to strangers. In this paper, we present the P2P Wi-Fi Internet Sharing Architecture PISA, which eliminates these risks by introducing secure tunneling, cryptographic identities, and certificates as primary security concepts. Thus, PISA offers nomadic users the same security that they expect from a wired Internet connection at home. Based on its three fundamental mechanisms, PISA achieves a flexibility which opens significant advantages over existing systems. They include user mobility, anonymity, service levels with different performance and availability characteristics, and different revenue models for operators. With this combination of key features, PISA forms an essential basis for global, seamless, and secure Wi-Fi sharing for large communities. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-heer-ict-secure-wifi.pdf Print IEEE

Washington, DC, USA

Proc. of 15th International Conference on Telecommunication (ICT), St. Petersburg, Russian Federation St. Petersburg, Russian Federation 15th International Conference on Telecommunication (ICT) 16-19 June 2008 en 978-1-4244-2035-3 1 TobiasHeer StefanGötz EliasWeingaertner KlausWehrle inproceedings 2006-heer-percomws-adapt-dht 2006 3 16 1 1-6 http://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2006-heer-percomws-dht-adhoc.pdf Print IEEE

Washington, DC, USA

In Proceedings of 3. IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P'06), Pisa, Italy. Pisa, Italy IEEE International Workshop on Mobile Peer-to-Peer Computing March 2006 en 0-7695-2520-2 10.1109/PERCOMW.2006.16 1 TobiasHeer StefanGötz SimonRieche KlausWehrle inproceedings 200608landsiedelp2p06scalablemobility 2006 203-209 For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, we explore how DHTs and mobile ad-hoc networks (MANETs) fit together. We argue that both share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore, we argue that with little global knowledge, such as a map of the city or whatever area the nodes move in, one can even further improve the scalability and reduce DHT maintenance overhead significantly, allowing MHT to scale up to several ten thousands of nodes. https://www.comsys.rwth-aachen.de/fileadmin/papers/2006/2006-landsiedel-p2p-mobility.pdf print IEEE

Washington, DC, USA

print Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), Cambridge, UK IEEE Cambridge, UK Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06) 2006-09-06 en 0-7695-2679-9 10.1109/P2P.2006.46 1 OlafLandsiedel StefanGötz KlausWehrle inproceedings 200503goetzp2psawindowsfilesharing 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 inbook 200509riechep2pbookreliability 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 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 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 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 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 inproceedings 200410riechehotp2preliability 2004 10 108-113 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. Print 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) Volendam, Netherlands 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 Oct. 2004 en 1 SimonRieche KlausWehrle OlafLandsiedel StefanGötz LeoPetrak inproceedings 200410wehrlefgpcintegriertekonstruktionsmethode 2004

Stuttgart, Germany

Proceedings of the GI/ITG KuVS Fachgespräch Systemsoftware für Pervasive Computing KlausWehrle OlafLandsiedel SimonRieche StefanGötz LeoPetrak inproceedings 200407wehrlesmsoipncontentoriented 2004 04411 Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany Dagstuhl Seminar Proceedings Service Management and Self-Organization in IP-based Networks KlausWehrle StefanGötz