% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-04-29
% Creation time: 12-54-54
% --- Number of references
% 6
% 

@Inproceedings { 2009-sensys-alizai-burstytraffic,
   title = {Bursty Traffic over Bursty Links},
   year = {2009},
   month = {11},
   pages = {71-84},
   tags = {wld},
   url = {fileadmin/papers/2009/2009-alizai-sensys-bre.pdf},
   publisher = {ACM},
   address = {New York, NY, USA},
   booktitle = {Proceeding of 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 09), Berkeley, CA, USA},
   event_place = {Berkley, California},
   event_name = {Sensys 09},
   event_date = {November 2009},
   language = {en},
   ISBN = {978-1-60558-519-2},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Bitsch Link, J{\'o} Agila and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Techreport { 200908alizaifgsnburstyrouting,
   title = {Routing Over Bursty Wireless Links},
   year = {2009},
   month = {9},
   pages = {63-66},
   abstract = {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.},
   tags = {wld},
   url = {fileadmin/papers/2009/2009-08-alizai-fgsn-bursty-routing.pdf},
   web_url = {doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf},
   misc2 = {Print},
   publisher = {Technical University Hamburg},
   address = {Technical University Hamburg},
   booktitle = {Proceedings of the 8th GI/ITG KuVS Fachgespr{\"a}ch ''Wireless Sensor Networks'', Hamburg, Germany},
   language = {en},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Bitsch Link, J{\'o} Agila and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Inproceedings { 2009-landsiedel-visa-vipe,
   title = {A Virtual Platform for Network Experimentation},
   year = {2009},
   month = {8},
   day = {17},
   pages = {45--52},
   abstract = {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.},
   keywords = {deployment, network experimentation, resource virtualization, simulation},
   url = {fileadmin/papers/2009/2009-landsiedel-visa-vipe.pdf},
   misc2 = {Print},
   publisher = {ACM Press},
   address = {New York, NY, USA},
   booktitle = {Proceedings of the 1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures, Barcelona, Spain},
   event_place = {Barcelona, Spain},
   event_name = {1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures},
   event_date = {August 17, 2009},
   language = {en},
   ISBN = {978-1-60558-595-6},
   DOI = {10.1145/1592648.1592657},
   reviewed = {1},
   author = {Landsiedel, Olaf and Kunz, Georg and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Poster { 2009-kunz-nsdi-profab,
   title = {Poster Abstract: Protocol Factory: Reuse for Network Experimentation},
   year = {2009},
   month = {4},
   day = {22},
   url = {fileadmin/papers/2009/2009-kunz-nsdi-protocolFactory.pdf},
   misc = {Poster},
   misc2 = {Online},
   publisher = {USENIX Association},
   address = {Berkeley, CA, USA},
   booktitle = {6th USENIX Symposium on Networked Systems Design and Implementation (NSDI'09)},
   language = {en},
   reviewed = {1},
   author = {Kunz, Georg and Landsiedel, Olaf and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Inproceedings { 200906MobiArchgoetzprotocolorchestration,
   title = {Protocol Orchestration: A Semantic Approach to Communication Stacks},
   year = {2009},
   pages = {43-50},
   abstract = {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.},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-goetz-mobiarch-protocol-orchestration.pdf},
   misc2 = {print},
   editor = {Krzysztof Zielinski and Adam Wolisz and Jason Flinn and Anthony LaMarca},
   publisher = {ACM},
   address = {New York, NY, USA},
   howpublished = {print},
   booktitle = {Proceedings of the Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09)},
   organization = {ACM Sigcomm/Sigmobile},
   event_place = {Krakow, Poland},
   event_name = {Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09), Krakow, Poland},
   event_date = {2009-06-22},
   language = {en},
   reviewed = {1},
   author = {G{\"o}tz, Stefan and Heer, Tobias and Wehrle, Klaus}
}

@Inproceedings { 2009-icc-heer-middleboxes,
   title = {End-host Authentication and Authorization for Middleboxes based on a Cryptographic Namespace},
   year = {2009},
   volume = {1},
   pages = {791-796},
   abstract = {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.},
   tags = {mobile_access},
   url = {http://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-heer-icc-end-host-authentication.pdf},
   misc2 = {Print},
   publisher = {Piscataway, NJ, USA},
   address = {Dresden, Germany},
   booktitle = {Proceedings of the IEEE International Conference on Communications 2009 (ICC 2009), Dresden, Gemany},
   organization = {IEEE},
   event_place = {Dresden, Germany},
   event_name = {IEEE International Conference on Communications 2009 (ICC 2009)},
   language = {en},
   ISBN = {978-1-4244-3435-0},
   ISSN = {1938-1883},
   DOI = {10.1109/ICC.2009.5198984},
   reviewed = {1},
   author = {Heer, Tobias and Hummen, Ren{\'e} and Komu, Miika and G{\"o}tz, Stefan and Wehrle, Klaus}
}