This file was created by the TYPO3 extension bib --- Timezone: UTC Creation date: 2024-10-06 Creation time: 16-48-06 --- Number of references 35 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-ntms-samad-RFID 2008 11 5 1-5 Online IEEE 2nd International Conference on New Technologies, Mobility, and Security (NTMS 2008), Tangier, Morocco Tangier, Morocco International Conference on New Technologies, Mobility and Security 5-7 Nov. 2008 en 978-2-9532443-0-4 FahadSamad SadeqAli Makram inproceedings 2008-sensys-sasnauskas-kleenet 2008 11 425--426 We present KleeNet, a Klee based bug hunting tool for sensor network applications before deployment. KleeNet automatically tests code for all possible inputs, ensures memory safety, and integrates well into TinyOS based application development life cycle, making it easy for developers to test their applications. bug finding, memory safety, tinyos, type safety kleenet fileadmin/papers/2008/2008-11-Sasnauskas-SenSys08-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 6th ACM conference on Embedded network sensor systems (SenSys'08), Raleigh, NC, USA en 978-1-59593-990-6 http://doi.acm.org/10.1145/1460412.1460485 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle inproceedings 200810ThieleSensors08RatPack 2008 10 26 709 -- 711 Working towards the observation of rats (and other small rodents) in the wild we have developed tools that will enable us to study their behavior using a wireless network of wearable sensor nodes. The space and weight constraints resulting from the size of the animals have led to simple but functional approaches for vocalization classification and position estimation. For the resulting data we have developed novel, delay-tolerant routing and collection strategies. These are expected to be used in a sparse, dynamic network resulting from various rats being tagged with our nodes and running around freely - an area that will eventually be too big to be covered solely by stationary data sinks. Furthermore, the system is designed to extract information on the social interactions between animals from the routing data. It currently works in an indoor environment and we are preparing it for tests in a controlled outdoor setup. RatPack fileadmin/papers/2008/2008-10-Thiele-Sensors08-RatPack.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4716540 Online IEEE

New York City, NY, USA

Proceedings of IEEE Sensors 2008, Lecce, Italy IEEE Lecce, Italy IEEE Sensors 2008 26-29 Oct. 2008 en 978-1-4244-2580-8 1930-0395 10.1109/ICSENS.2008.4716540 1 JohannesThiele OkuaryOsechas Jó AgilaBitsch Link KlausWehrle conference 200810riechelcncerco 2008 10 14 28-35 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. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4664131&arnumber=4664148&count=180&index=16 http://web.informatik.uni-bonn.de/IV/Mitarbeiter/matthew/Mirror_LCN2008_Website/www.ieeelcn.org/ Print IEEE Press Proceedings of 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) IEEE Montreal, Canada 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) 14-17 Oct. 2008 en 978-1-4244-2412-2 10.1109/LCN.2008.4664148 1 SimonRieche Bui TheVinh KlausWehrle techreport draft-ietf-hip-cert-00 2008 10 1 draft-ietf-hip-cert-00.txt <prt>expires: January 2, 2010 (work in progress)</prt> http://tools.ietf.org/html/draft-ietf-hip-cert-00 Online <prt>IETF Trust</prt> An online version is available at: http://tools.ietf.org/html/draft-ietf-hip-cert-00 Internet Drafts <prt>Internet Engineering Task Force</prt> Internet Engineering Task Force en 1 TobiasHeer SamuVarjonen inproceedings DugosijaEHVHM2008 2008 9 16 386 Gaming has undergone a transition from a niche hobby to a part of everyday culture, with the most prominent examples of professional gaming in Korea and the success of World of Warcraft. This transition alongside with the advance of use of the Internet has created a new kind of social environment, commonly known as virtual life. This paper presents an excerpt of the results of a survey investigating this environment with particular regard to the interaction between gaming and career, relationships as well as social groups. “Man only plays when in the full meaning of the word he is a man, and he is only completely a man when he plays. ” Schiller 1 https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-steg-vaegs-gaming.pdf http://www.slideshare.net/vaegs/online-gaming-as-tool-for-career-development-presentation Ralf Klamma, Nalin Sharda, Baltasar Fernández-Manjón, Harald Kosch and Marc Spaniol CEUR Workshop Proceedings Proceedings of the First International Workshop on Story-Telling and Educational Games (STEG'08) Maastricht School of Management, Maastricht, The Netherlands First International Workshop on Story-Telling and Educational Games (STEG'08) September 16, 2008 en DarkoDugosija VadiEfe StephanHackenbracht TobiasVaegs AnnaHannemann techreport 2008-fgsn-sasnauskas-kleenet 2008 9 Testing sensor network applications is an essential and a difficult task. Due to their distributed and faulty nature, severe resource constraints, unobservable interactions, and limited human interaction, sensor networks, make monitoring and debugging of applications strenuous and more challenging. In this paper we present KleeNet - a Klee based platform independent bug hunting tool for sensor network applications before deployment - which can automatically test applications for all possible inputs, and hence, ensures memory safety for TinyOS based applications. Upon finding a bug, KleeNet generates a concrete test case with real input values identifying a specific error path in a program. Additionally, we show that KleeNet integrates well into TinyOS application development life cycle with minimum manual effort, making it easy for developers to test their applications. kleenet fileadmin/papers/2008/2008-09-Sasnauskas-FGSN08-BugHunting.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Freie Universität Berlin, Institute of Computer Science

Berlin, Germany

Proceedings of the 7th GI/ITG Fachgespraech Wireless Sensor Networks, Berlin, Germany Chair of Communication and Distributed Systems (ComSys) en 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle inproceedings 200808OsechasEMBC08RatPack 2008 8 20 538--541 The goal of our project is to describe the behavior of rats. For this purpose we are using wireless sensor networks, monitoring various quantities that yield important information to complement current knowledge on the behavioral repertoire of rats. So far, on the sensing and processing side we have developed innovative, minimalist approaches pointing in two directions: vocalization analysis and movement tracking. On the data collection and routing side we have adapted to the known burrowing habits of rats by developing new methods for synchronization and data aggregation under the paradigm of sporadic connectivity in a sparse, dynamic network. Animals;Behavior, Animal;Clothing;Equipment Design;Equipment Failure Analysis;Miniaturization;Monitoring, Ambulatory;Rats;Reproducibility of Results;Sensitivity and Specificity;Transducers; ratpack fileadmin/papers/2008/2008-08-Osechas-EMBC08-RatPack.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4649209 Online The Printing House

Stoughton, WI, USA

Proceedings of the 30th Annual International IEEE Engineering in Medicine and Biology Conference, Vancouver, BC, Canada IEEE EMBS Vancouver, BC, Canada Engineering in Medicine and Biology Society, 2008. EMBS 2008. 30th Annual International Conference of the IEEE 20-25 Aug. 2008 en 978-1-4244-1814-5 1557-170X 10.1109/IEMBS.2008.4649209 1 OkuaryOsechas JohannesThiele Jó AgilaBitsch Link KlausWehrle inproceedings 200808BitschSIGCOMM08RatPack 2008 8 17 467--468 The goal of this pro ject is to investigate the behavior of wild living rats using sensor networks. The main challenge with respect to communication is the sparse and very dynamic network determined by the burrow dwelling behavior of rats, which makes delay tolerant data transmission schemes a necessity. The physical and computional restrictions in embedded devices make routing an interesting challenge for which we are currently developing new strategies. ratpack fileadmin/papers/2008/2008-08-Bitsch-SIGCOMM08-RatPack.pdf http://conferences.sigcomm.org/sigcomm/2008/posters.php http://www.worldcat.org/title/sigcomm-08-proceedings-of-the-2008-sigcomm-conference-and-co-located-workshops-nsdr08-wosn08-mobiarch08-netecon08-presto08-seattle-wa-usa-august-17-22-2008/oclc/300481768 Online ACM

New York City, NY, USA

ACM SIGCOMM 2008 Poster Proceedings, Seattle, WA, USA ACM Seattle, WA, USA ACM SIGCOMM 2008 August 17-22, 2008 en 978-1-60558-175-0 1 Jó AgilaBitsch Link KlausWehrle OkuaryOsechas JohannesThiele techreport draft-varjonen-hip-cert-01 2008 7 1 draft-varjonen-hip-cert-01.txt <prt>expires: January 15, 2009 (work in progress)</prt> http://tools.ietf.org/html/draft-varjonen-hip-cert-01 Online <prt>IETF Trust</prt> An online version is available at: http://tools.ietf.org/html/draft-varjonen-hip-cert-01 Internet Drafts <prt>Internet Engineering Task Force</prt> Internet Engineering Task Force en 1 TobiasHeer SamuVarjonen techreport 2008-fgsn-alizai-stle 2008 7 27-30 wld fileadmin/papers/2008/2008-08-alizai-fgsn-stle.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Fachbereich Mathematik und Informatik

Berlin, Germany

Proceedings of the 7th GI/ITG Workshop on Wireless Sensor Networks FGSN 08 September 2010 en 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle AlexanderBecher 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 200809WeingaertnerSyncNetworkEmulation 2008 6 3 1 1 1-2 Awarded with ACM SIGMETRICS Best Student Panelist Award. The corresponding Abstract was included on the USB Stick of the 2007 SIGMETRICS conference. https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/sigmetrics-thesis-panel.pdf Online

Annapolis, MD

Proceedings of the ACM SIGMETRICS 2008 Student Thesis Panel, Annapolis, MD ACM en 1 EliasWeingaertner inproceedings 2008-becher-hotemnets-linkestimation 2008 6 3 1--5 Commonly, routing in sensor networks is limited to longterm stable links. Unstable links, although often promising to be of large routing progress, are not considered for packet forwarding as link estimators typically cannot handle their dynamics. In this paper we introduce short-term link estimation to capture link dynamics at a high resolution in time and to identify when these render a link temporarily reliable or unreliable. We identify such dynamics based on packet overhearing, predict short-term availability and unavailability, and adapt neighbor tables, thereby enlarging the set of links useable by any routing algorithm. Additionally, we show that short-term link estimation integrates seamlessly into today's sensor network link estimators and routing protocols. wld fileadmin/papers/2008/2008-becher-hotemnets-linkestimation.pdf Online ACM Press

New York, NY, USA

Proceedings of Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08), Charlottesville, VA, USA Chalottesville, USA Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08) June 2-3, 2008 en 978-1-60558-209-2 1 AlexanderBecher OlafLandsiedel GeorgKunz KlausWehrle conference 200803riechemmvecluster 2008 3 18 9-13 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. RWTH Aachen University - Distributed Systems Group http://www.pap.vs.uni-due.de/MMVE08/papers/proceedings.pdf http://www.pap.vs.uni-due.de/MMVE08/ Online Gregor Schiele, Daniel Weiskopf, Ben Leong, Shun-Yun Hu Proceedings of 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) Reno, Nevada, USA 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) March 8th, 2008 en 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle techreport draft-varjonen-hip-cert-00 2008 2 1 draft-varjonen-hip-cert-01.txt <prt>expires: August 21, 2008 (work in progress)</prt> http://tools.ietf.org/html/draft-varjonen-hip-cert-00 Online <prt>IETF Trust</prt> An online version is available at: http://tools.ietf.org/html/draft-varjonen-hip-cert-01 Internet Drafts <prt>Internet Engineering Task Force</prt> Internet Engineering Task Force en TobiasHeer SamuVarjonen article 200808WeingaertnerSIGMETRICSPERSyncNetWorkEmulation SIGMETRICS Performance Evaluation Review 2008 36 2 58-63 Network emulation, in which real systems interact with a network simulation, is a common evaluation method in computer networking research. Until now, the simulation in charge of representing the network has been required to be real-time capable, as otherwise a time drift between the simulation and the real network devices may occur and corrupt the results. In this paper, we present our work on synchronized network emulation. By adding a central synchronization entity and by virtualizing real systems for means of control, we can build-up network emulations which contain both unmodified x86 systems and network simulations of any complexity. This is a revised version of a paper originally presented at the ACM HotMetrics 2008 workshop. print en 0163-5999 10.1145/1453175.1453185 1 EliasWeingaertner FlorianSchmidt TobiasHeer KlausWehrle article 200812riecheIJAMCcluster International Journal of Advanced Media and Communication (IJAMC) 2008 2 4 351-363 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. RWTH Aachen University - Distributed Systems Group http://www.inderscience.com/browse/index.php?journalID=67 print en 1462-4613 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle inbook 2008-thissen-LNCS-multimedia 2008 268-299 Print M. Nagl, W. Marquardt Springer Lecture Notes in Computer Science 4970 Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support en 978-3-540-70551-2 AndréSchüppen OttoSpaniol DirkThißen IngoAssenmacher EdmundHaberstroh ThorstenKuhlen inbook 2008-thissen-LNCS-management 2008 401-429 Print M. Nagl, W. Marquardt Springer Lecture Notes in Computer Science 4970 Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support en 978-3-540-70551-2 YuriBabich OttoSpaniol DirkThißen inbook 2008-thissen-LNCS-synergy 2008 519-526 Print M. Nagl, W. Marquardt Springer Lecture Notes in Computer Science 4970 Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support en 978-3-540-70551-2 SimonBecker MarkusHeller MatthiasJarke WolfgangMarquardt ManfredNagl OttoSpaniol DirkThißen inbook 2008-heer-hipbook-lhip 2008 1 121-163 http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470997907.html Print Andrei Gurtov Wiley and Sons

West Sussex, England, UK

8 Host Identity Protocol (HIP): Towards the Secure Mobile Internet en 978-0-470-99790-1 TobiasHeer inbook 2008-heer-hipbook-security 2008 1 13-42 http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470997907.html Print Andrei Gurtov Wiley and Sons

West Sussex, England, UK

2 Host Identity Protocol (HIP): Towards the Secure Mobile Internet en 978-0-470-99790-1 TobiasHeer inproceedings wessel2008GMDS 2008 665-667 German Medical Science GMS Publishing House 53. Jahrestagung der Deutschen Gesellschaft für Medizinische Informatik, Biometrie und Epidemiologie (gmds). Brückenschlag von Medizinischer Informatik, Biometrie und Epidemiologie zur Medizintechnik, Stuttgart, Germany en ChristaWeßel SandraGeisler UtaChristoph inproceedings 2008-thissen-ICEB-replication 2008 155-160 CD-ROM INSTICC Proceedings of the International Conference on e-Business (ICE-B 2008), Porto, Portugal Porto, Portugal International Conference on e-Business (ICE-B 2008) en 978-989-8111-58-6 1 DirkThißen ThomasBrambring inproceedings 2008-thissen-NGMAST-IMS 2008 207-212 Print IEEE Proceedings of the 2nd IEEE Conference and Exhibition on Next Generation Mobile Applications, Services and Technologies (NGMAST 2008), Cardiff, UK Cardiff, UK Next Generation Mobile Applications, Services and Technologies (NGMAST 2008) en 978-0-7695-3333-9 1 Juan MiguelEspinosa Carlín DirkThißen inproceedings 2008-thissen-MWCN-IMS 2008 259-270 Print Springer Proceedings of the 10th IFIP International Conference on Mobile and Wireless Communications Networks (MWCN 2008), Toulouse, France Toulouse, France 10th IFIP International Conference on Mobile and Wireless Communications Networks (MWCN 2008) en 978-0-387-84838-9 1 Juan MiguelEspinosa Carlín DirkThißen inproceedings 2008-thissen-ICWI-replication 2008 283-290 CD-ROM IADIS Press Proceedings of the IADIS International Conference on WWW and Internet (ICWI 2008), Freiburg, Germany Freiburg IADIS International Conference on WWW and Internet (ICWI 2008) 2008 en 978-972-8924-68-3 1 DirkThißen ThomasBrambring inproceedings 200804landsiedelIPSN08TimingMatters 2008 344-354 The rising complexity of data processing algorithms in sensor networks combined with their severely limited computing power necessitates an in-depth understanding of their temporal behavior. However, today only cycle accurate emulation and test-beds provide a detailed and accurate insight into the temporal behavior of sensor networks. In this paper we introduce fine grained, automated instrumentation of simulation models with cycle counts derived from sensor nodes and application binaries to provide detailed timing information. The presented approach bridges the gap between scalable but abstracting simulation and cycle accurate emulation for sensor network evaluation. By mapping device-specific code with simulation models, we can derive the time and duration a certain code line takes to get executed on a sensor node. Hence, eliminating the need to use expensive instruction-level emulators with limited speed and restricted scalability. Furthermore, the proposed design is not bound to a specific hardware platform, a major advantage compared to existing emulators. Our evaluation shows that the proposed technique achieves a timing accuracy of 99% compared to emulation while adding only a small overhead. Concluding, it combines essential properties like accuracy, speed and scalability on a single simulation platform. fileadmin/papers/2008/2008-04-IPSN-2008-landsiedel-Timing-Matters.pdf Print IEEE Computer Society

Washington, DC, USA

Proceedings of the 7th ACM International Conference on Information Processing in Sensor Networks (IPSN 2008), St. Louis, MO, USA en 978-0-7695-3157-1 1 OlafLandsiedel Muhammad HamadAlizai KlausWehrle techreport 200807VOMLEHNAIB200816NetworkSimulatorComparison Aachener Informatik Berichte 2008 2008-16 AIB 2008-16 1-28 Ranging from the development of new protocols to validating analytical performance metrics, network simulation is the most prevalent methodology in the field of computer network research. While the well known ns-2 toolkit has established itself as the quasi standard for network simulation, the successors are on their way. In this paper, we first survey recent contributions in the field of network simulation tools as well as related aspects such as parallel network simulation. Moreover, we present preliminary results which compare the resource demands for ns-3, JiST, SimPy and OMNeT++ by implementing the identical simulation scenario in all these network simulation tools. https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/AIB-2008-16.pdf Online

Ahornstr. 55, Aachen, Germany

RWTH Aachen University Technical Report 0935-3232 Hendrikvom Lehn EliasWeingaertner KlausWehrle techreport 2008-heer-draft-cert-2 2008 This document specifies a certificate parameter called CERT for the Host Identity Protocol (HIP). The CERT parameter is a container for Simple Public Key Infrastructure (SPKI) and X.509 certificates. It is used for carrying these certificates in HIP control messages. Additionally, this document specifies the representations of Host Identity Tags in SPKI certificates. Work in progress Internet Engineering Task Force Internet-Draft SamuVarjonen TobiasHeer techreport 2008-heer-draft-midauth 2008 draft-heer-hip-midauth-01 The Host Identity Protocol is a signaling protocol for secure communication, mobility, and multihoming. It achieves these properties by introducing a new cryptographic namespace. This document specifies an extension for HIP that enables middleboxes to unambiguously verify the identities of hosts that communicate across them. This extension enables middleboxes to verify the liveness and freshness of a HIP association and, thus, enables reliable and secure access control in middleboxes. Work in progress Internet Engineering Task Force Internet-Draft TobiasHeer MiikaKomu KlausWehrle techreport 2008-heer-draft-cert 2008 This document specifies a certificate parameter called CERT for the Host Identity Protocol (HIP). The CERT parameter is a container for Simple Public Key Infrastructure (SPKI) and X.509 certificates. It is used for carrying these certificates in HIP control messages. Additionally, this document specifies the representations of Host Identity Tags in SPKI certificates. draft-varjonen-hip-cert-01.txt. Work in progress. Internet Engineering Task Force Internet-Draft SamuVarjonen TobiasHeer