Volume
OASIcs, Volume 17
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)
- Part of: Series: Open Access Series in Informatics (OASIcs)
Event
KiVS 2011, March 8-11, 2011, Kiel, GermanyEditors
Publication Details
- published at: 2011-02-25
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-27-9
- DBLP: db/conf/kivs/kivs2011
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 17, KiVS'11, Complete Volume
Abstract
OASIcs, Volume 17, KiVS'11, Complete Volume
Cite as
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Proceedings{luttenberger_et_al:OASIcs.KiVS.2011,
title = {{OASIcs, Volume 17, KiVS'11, Complete Volume}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2012},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011},
URN = {urn:nbn:de:0030-drops-35798},
doi = {10.4230/OASIcs.KiVS.2011},
annote = {Keywords: Distributed Systems}
}
Document
Front Matter
Frontmatter, Preface, Table of Contents, List of Authors
Abstract
Frontmatter, Preface, Table of Contents, List of Authors
Cite as
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. i-xi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{luttenberger_et_al:OASIcs.KiVS.2011.i,
author = {Luttenberger, Norbert and Peters, Hagen},
title = {{Frontmatter, Preface, Table of Contents, List of Authors}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {i--xi},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.i},
URN = {urn:nbn:de:0030-drops-29658},
doi = {10.4230/OASIcs.KiVS.2011.i},
annote = {Keywords: Frontmatter, Preface, Table of Contents, List of Authors}
}
Document
The Scope of the IBGP Routing Anomaly Problem
Abstract
Correctness problems in the iBGP routing, the de-facto standard to spread global routing information in Autonomous Systems, are a well-known issue. Configurations may route cost-suboptimal, inconsistent, or even behave non-convergent and -deterministic. However, even if a lot of studies have shown many exemplary problematic configurations, the exact scope of the problem is largely unknown: Up to now, it is not clear which problems may appear under which iBGP architectures. The exact scope of the iBGP correctness problem is of high theoretical and practical interest. Knowledge on the resistance of specific architecture schemes against certain anomaly classes and the reasons may help to improve other iBGP schemes. Knowledge on the specific problems of the different schemes helps to identify the right scheme for an AS and develop workarounds.
Cite as
Uli Bornhauser, Peter Martini, and Martin Horneffer. The Scope of the IBGP Routing Anomaly Problem. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 2-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{bornhauser_et_al:OASIcs.KiVS.2011.2,
author = {Bornhauser, Uli and Martini, Peter and Horneffer, Martin},
title = {{The Scope of the IBGP Routing Anomaly Problem}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {2--13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.2},
URN = {urn:nbn:de:0030-drops-29538},
doi = {10.4230/OASIcs.KiVS.2011.2},
annote = {Keywords: Inter-domain Routing, Border Gateway Protocol, Routing Anomalies}
}
Document
A Reputation-Based Approach to Self-Adaptive Service Selection
Abstract
Service-orientation provides concepts and tools for flexible composition and management of largescale distributed software applications. The automated run-time management of such loosely coupled software systems, however, poses still major challenges and is therefore an active research area, including the use of novel computing paradigms. In this context, the dynamic and adaptive selection of best possible service providers is an important task, which can be addressed by an appropriate middleware layer that allows considering different service quality aspects when managing the adaptive execution of distributed service workflows dynamically. In such an approach, service consumers are enabled to delegate the adaptive selection of service providers at run-time to the execution infrastructure. The selection criteria used are based on the cost of a service provision and the continuous, dynamic evaluation of reputations of providers, i.e. maintained track records of meeting the respective service commitments. This paper discusses the design and operating principle of such an automatic service selection middleware extension. Its ability to balance different quality criteria for service selection, such as service cost vs. the reliability of provision, is empirically evaluated based on a multi-agent platform approach.
Cite as
Jan Sudeikat, Wolfgang Renz, Ante Vilenica, and Winfried Lamersdorf. A Reputation-Based Approach to Self-Adaptive Service Selection. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 14-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{sudeikat_et_al:OASIcs.KiVS.2011.14,
author = {Sudeikat, Jan and Renz, Wolfgang and Vilenica, Ante and Lamersdorf, Winfried},
title = {{A Reputation-Based Approach to Self-Adaptive Service Selection}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {14--25},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.14},
URN = {urn:nbn:de:0030-drops-29540},
doi = {10.4230/OASIcs.KiVS.2011.14},
annote = {Keywords: Service, Workflow, Multagent System, Self-Adaptivity}
}
Document
A Service-Oriented Operating System and an Application Development Infrastructure for Distributed Embedded Systems
Abstract
The paradigm of service-orientation promises a significant ease of use in creating and managing distributed software systems. A very important aspect here is that also application domain experts and stakeholders, who are not necessarily skilled in computer programming, get a chance to create, analyze, and adapt distributed applications. However, up to now, service-oriented architectures have been mainly discussed in the context of complex business applications. In this paper we will investigate how to transfer the benefits of a service-oriented architecture into the field of embedded systems, so that this technology gets accessible to a much wider range of users. As an example, we will demonstrate this scheme for sensor network applications. In order to address the problem of limited device resources we will introduce a minimal operating system for such devices. It organizes all pieces of code running on a sensor node in a service-oriented fashion and also features the relocation of code to a different node at runtime. We will demonstrate that it is possible to design a sensor network application from a set of already existing services in a highly modular way by employing already existing technologies and standards.
Cite as
Martin Lipphardt, Nils Glombitza, Jana Neumann, Christian Werner, and Stefan Fischer. A Service-Oriented Operating System and an Application Development Infrastructure for Distributed Embedded Systems. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 26-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{lipphardt_et_al:OASIcs.KiVS.2011.26,
author = {Lipphardt, Martin and Glombitza, Nils and Neumann, Jana and Werner, Christian and Fischer, Stefan},
title = {{A Service-Oriented Operating System and an Application Development Infrastructure for Distributed Embedded Systems}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {26--37},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.26},
URN = {urn:nbn:de:0030-drops-29550},
doi = {10.4230/OASIcs.KiVS.2011.26},
annote = {Keywords: service-oriented OS, sensor network, distributed embedded systems}
}
Document
An adaptive protocol for distributed beamforming
Abstract
We study distributed adaptive beamforming in networks of wireless nodes. In particular, we observe that for the synchronisation of carrier phases, distinct algorithmic configurations are optimal in various environmental settings and propose a protocol that utilises organic computing principles to find optimum parameters. Furthermore, we study the impact of different modulation schemes on the bit error rate of a signal sequence transmitted collaboratively by distributed devices via adaptive beamforming.
Cite as
Stephan Sigg and Michael Beigl. An adaptive protocol for distributed beamforming. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 38-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{sigg_et_al:OASIcs.KiVS.2011.38,
author = {Sigg, Stephan and Beigl, Michael},
title = {{An adaptive protocol for distributed beamforming}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {38--48},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.38},
URN = {urn:nbn:de:0030-drops-29565},
doi = {10.4230/OASIcs.KiVS.2011.38},
annote = {Keywords: Distributed beamforming, Adaptive synchronisation protocol}
}
Document
Web Workload Generation According to the UniLoG Approach
Abstract
Generating synthetic loads which are suffciently close to reality represents an important and challenging task in performance and quality-of-service (QoS) evaluations of computer networks and distributed systems. Here, the load to be generated represents sequences of requests at a well-defined service interface within a network node. The paper presents a tool (UniLoG.HTTP) which can be used in a flexible manner to generate realistic and representative server and network loads, in terms of access requests to Web servers as well as creation of typical Web traffic within a communication network. The paper describes the architecture of this load generator, the critical design decisions and solution approaches which allowed us to obtain the desired flexibility.
Cite as
Andrey W. Kolesnikov and Bernd E. Wolfinger. Web Workload Generation According to the UniLoG Approach. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{kolesnikov_et_al:OASIcs.KiVS.2011.49,
author = {Kolesnikov, Andrey W. and Wolfinger, Bernd E.},
title = {{Web Workload Generation According to the UniLoG Approach}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {49--60},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.49},
URN = {urn:nbn:de:0030-drops-29571},
doi = {10.4230/OASIcs.KiVS.2011.49},
annote = {Keywords: Web workload generation, Web traffic generation, Unfied Load Generator, Performance Evaluation, HTTP/1.1}
}
Document
Improving Markov-based TCP Traffic Classification
Abstract
This paper presents an improved variant of our Markov-based TCP traffic classifier and demonstrates its performance using traffic captured in a university network. Payload length, flow direction, and position of the first data packets of a TCP connection are reflected in the states of the Markov models. In addition, we integrate a new "end of connection" state to further improve the classification accuracy. Using 10-fold cross validation, we identify appropriate settings for the payload length intervals and the number of data packets considered in the models. Finally, we discuss the classification results for the different applications.
Cite as
Gerhard Münz, Stephan Heckmüller, Lothar Braun, and Georg Carle. Improving Markov-based TCP Traffic Classification. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 61-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{munz_et_al:OASIcs.KiVS.2011.61,
author = {M\"{u}nz, Gerhard and Heckm\"{u}ller, Stephan and Braun, Lothar and Carle, Georg},
title = {{Improving Markov-based TCP Traffic Classification}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {61--72},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.61},
URN = {urn:nbn:de:0030-drops-29582},
doi = {10.4230/OASIcs.KiVS.2011.61},
annote = {Keywords: Markov model, TCP Traffic Classification, network}
}
Document
IT Management Using a Heavyweight CIM Ontology
Abstract
This paper presents an approach for ontology-based IT management based on a heavyweight (formal) ontology using the Web Ontology Language (OWL). The ontology comprises a complete OWL representation of the Common Information Model (CIM) and management rules defined in the Semantic Web Rule Language (SWRL). The ontology not only models the managed system types, but a runtime system dynamically updates model instances in the ontology that reflect values of managed system entities. This allows the evalution of rules that take into account both model and model instances. A reaction module uses the CIM interface of the managed system to invoke CIM methods according to rule evaluation results, thus resulting in automated management. In order to ensure the consistency of the ontology when changes are performed, belief change theory is employed.
Cite as
Andreas Textor, Jeanne Stynes, and Reinhold Kroeger. IT Management Using a Heavyweight CIM Ontology. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 73-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{textor_et_al:OASIcs.KiVS.2011.73,
author = {Textor, Andreas and Stynes, Jeanne and Kroeger, Reinhold},
title = {{IT Management Using a Heavyweight CIM Ontology}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {73--84},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.73},
URN = {urn:nbn:de:0030-drops-29591},
doi = {10.4230/OASIcs.KiVS.2011.73},
annote = {Keywords: CIM, OWL, ontology, SWRL, management}
}
Document
TOGBAD-LQ - Using Challenge-Response to Detect Fake Link Qualities
Abstract
The usage of link quality based routing metrics significantly improves the quality of the chosen paths and by that the performance of the network. But, attackers may try to exploit link qualities for their purposes. Especially in tactical multi-hop networks, routing may fall prey to an attacker. Such routing attacks are a serious threat to communication. TOGBAD is a centralised approach, using topology graphs to detect routing attacks. In this paper, we enhance TOGBAD with the capability to detect fake link qualities. We use a Challenge/Response method to estimate the link qualities in the network. Based on this, we perform plausibility checks for the link qualities propagated by the nodes in the network. Furthermore, we study the impact of attackers propagating fake link qualities and present simulation results showing TOGBAD's detection rate.
Cite as
Elmar Gerhards-Padilla, Nils Aschenbruck, and Peter Martini. TOGBAD-LQ - Using Challenge-Response to Detect Fake Link Qualities. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 85-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{gerhardspadilla_et_al:OASIcs.KiVS.2011.85,
author = {Gerhards-Padilla, Elmar and Aschenbruck, Nils and Martini, Peter},
title = {{TOGBAD-LQ - Using Challenge-Response to Detect Fake Link Qualities}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {85--96},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.85},
URN = {urn:nbn:de:0030-drops-29604},
doi = {10.4230/OASIcs.KiVS.2011.85},
annote = {Keywords: Fake Link, network, link quality, routing metrics}
}
Document
Avoiding Publication and Privatization Problems on Software Transactional Memory
Abstract
This paper presents a new approach to exclude problems arising from dynamically switching between protected concurrent and unprotected single-threaded use of shared data when using software transactional memory in OO languages such as Java. The approach is based on a simple but effective programming model separating transactions from non-transactional operation. It prevents the application programmer from errors but does not force the software transactional memory library to observe non-transactional access and thereby preserves modularity of the software. A prototypical toolchain for validation and source code instrumentation was implemented as a proof of concept.
Cite as
Holger Machens and Volker Turau. Avoiding Publication and Privatization Problems on Software Transactional Memory. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 97-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{machens_et_al:OASIcs.KiVS.2011.97,
author = {Machens, Holger and Turau, Volker},
title = {{Avoiding Publication and Privatization Problems on Software Transactional Memory}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {97--108},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.97},
URN = {urn:nbn:de:0030-drops-29614},
doi = {10.4230/OASIcs.KiVS.2011.97},
annote = {Keywords: Software Transactional Memory, Publication, Privatization}
}
Document
A Resilient and Energy-saving Incentive System for Resource Sharing in MANETs
Abstract
Despite of all progress in terms of computational power, communication bandwidth, and feature richness, limited battery capacity is the major bottleneck for using the resources of mobile devices in innovative distributed applications. Incentives are required for motivating a user to spend energy on behalf of other users and it must be ensured that providing these incentives neither consumes much energy by itself nor allows for free-riding and other types of fraud. In this paper, we present a novel incentive system that is tailored to the application scenario of energyaware resource-sharing between mobile devices. The system has low energy consumption due to avoiding the use of public key cryptography. It uses a virtual currency with reusable coins and detects forgery and other fraud when cashing coins at an off-line broker. A prototype-based measurement study indicates the energy-efficiency of the system, while simulation studies show its resilience to fraud. Even in scenarios with 75% of fraudulent users that are colluding to disguise their fraud only 3.2% of them get away with it while the energy overhead (about 3%) for the incentive system is still moderate
Cite as
Holger Teske, Jochen Furthmüller, and Oliver P. Waldhorst. A Resilient and Energy-saving Incentive System for Resource Sharing in MANETs. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 109-120, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{teske_et_al:OASIcs.KiVS.2011.109,
author = {Teske, Holger and Furthm\"{u}ller, Jochen and Waldhorst, Oliver P.},
title = {{A Resilient and Energy-saving Incentive System for Resource Sharing in MANETs}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {109--120},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.109},
URN = {urn:nbn:de:0030-drops-29621},
doi = {10.4230/OASIcs.KiVS.2011.109},
annote = {Keywords: incentive system, resource sharing, fraud detection}
}
Document
Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks
Abstract
In this paper we present a novel peer-to-peer system specifically designed to support the unique properties of traffic information systems. We discuss important design decisions, such as update strategies and algorithms for dynamic vehicular route planning. Our system is then assessed using a combination of network (OverSim/OMNeT++) and road traffic (SUMO) simulators. We discuss the network load required by our system and show the benefits—in terms of travel time savings—that users can expect from it.
Cite as
Jedrzej Rybicki, Benjamin Pesch, Martin Mauve, and Björn Scheuermann. Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 121-132, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{rybicki_et_al:OASIcs.KiVS.2011.121,
author = {Rybicki, Jedrzej and Pesch, Benjamin and Mauve, Martin and Scheuermann, Bj\"{o}rn},
title = {{Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {121--132},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.121},
URN = {urn:nbn:de:0030-drops-29639},
doi = {10.4230/OASIcs.KiVS.2011.121},
annote = {Keywords: Peer-to-Peer, traffic information systems, network simulators}
}
Document
Distributed Probabilistic Network Traffic Measurements
Abstract
Measuring the per-flow traffic in large networks is very challenging due to the high performance requirements on the one hand, and due to the necessity to merge locally recorded data from multiple routers in order to obtain network-wide statistics on the other hand. The latter is nontrivial because traffic that traversed more than one measurement point must only be counted once, which requires duplicate-insensitive distributed counting mechanisms. Sampling-based traffic accounting as implemented in today’s routers results in large approximation errors, and does not allow for merging information from multiple points in the network into network-wide total traffic statistics. Here, we present Distributed Probabilistic Counting (DPC), an algorithm to obtain duplicate-insensitive distributed per-flow traffic statistics based on a probabilistic counting technique. DPC is structurally simple, very fast, and highly parallelizable, and therefore allows for efficient implementations in software and hardware. At the same time it provides very accurate traffic statistics, as we demonstrate based on both artificial and real-world traffic data.
Cite as
Alexander Marold, Peter Lieven, and Björn Scheuermann. Distributed Probabilistic Network Traffic Measurements. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 133-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{marold_et_al:OASIcs.KiVS.2011.133,
author = {Marold, Alexander and Lieven, Peter and Scheuermann, Bj\"{o}rn},
title = {{Distributed Probabilistic Network Traffic Measurements}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {133--144},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.133},
URN = {urn:nbn:de:0030-drops-29648},
doi = {10.4230/OASIcs.KiVS.2011.133},
annote = {Keywords: network measurement, flow monitoring, probabilistic techniques}
}
Document
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Abstract
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node localization in practice however is not exact. Errors ranging from several centimeters up to several meters are usual. How to perform localized routing in practice when such errors are prevalent? In this work we look at a promising routing variant which does not completely overcome this practical problem but which mitigates it. The concept does away with trying to find node positions as precise as possible but allows inaccuracies from the very beginning. It partitions the plane by a regular mesh of hexagons. The only information which is of interest is in which cell of that partitioning a node is located in. Using this node embedding, a virtual geographic overlay graph can then be constructed. To find the node positions we apply three variants of multidimensional scaling, two of them being a node localization approach which has been well studied in the context of sensor networks and one which we apply here for the first time in that context. Using the location information we get from these localization approaches we embed the nodes into the clusters their location falls into. We define two graph metrics to assess the quality of the overlay graph obtained by the embedding. Applying these two metrics in a simulation study, we show that cluster based routing is an eligible approach to support localized geographic routing when location errors are prevalent.
Cite as
Hannes Frey and Ranjith Pillay. A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 145-156, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{frey_et_al:OASIcs.KiVS.2011.145,
author = {Frey, Hannes and Pillay, Ranjith},
title = {{A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {145--156},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.145},
URN = {urn:nbn:de:0030-drops-29662},
doi = {10.4230/OASIcs.KiVS.2011.145},
annote = {Keywords: Geographical clustering, face routing, planar graph routing, localization, multi dimensional scaling, simulation study}
}
Document
An Arbitrary 2D Structured Replica Control Protocol
Abstract
Traditional replication protocols that logically arrange the replicas into a specific structure have reasonable availability, lower communication cost as well as system load than those that do not require any logical organisation of replicas. We propose in this paper the A2DS protocol: a single protocol that, unlike the existing proposed protocols, can be adapted to any 2D structure. Its read operation is carried out on any replica of every level of the structure whereas write operations are performed on all replicas of a single level of the structure. We present several basic 2D structures and introduce the new idea of obtaining other 2D structures by the composition of several basic ones. Two structures are proposed that have near optimal performance in terms of the communication cost, availability and system load of their read and write operations. Also, we introduce a new protocol that provides better performance for its write operations than those of ROWA protocol while preserving similar read performance.
Cite as
Robert Basmadjian and Hermann de Meer. An Arbitrary 2D Structured Replica Control Protocol. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 157-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{basmadjian_et_al:OASIcs.KiVS.2011.157,
author = {Basmadjian, Robert and de Meer, Hermann},
title = {{An Arbitrary 2D Structured Replica Control Protocol}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {157--168},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.157},
URN = {urn:nbn:de:0030-drops-29677},
doi = {10.4230/OASIcs.KiVS.2011.157},
annote = {Keywords: Replication, Performance attributes, Reliability, Availability, Load}
}
Document
Resolving Conflicts in Highly Reactive Teams
Abstract
In distributed cooperation frameworks for completely autonomous agents, conflicts between the involved agents can occur due to inconsistent data available to the agents. In highly dynamic domains, such as RoboCup, it is often neccessary to accept a certain level of conflicts in order to decrease reaction time of single agents, instead of relying on error-free, but extensive communication. However, this may lead to situations in which unresolved conflicts linger and cause cooperation to break down completely. In our cooperation framework, ALICA, we designed and implemented a simple but effective approach to detect these cases and resolve them quickly through a bully algorithm.
Cite as
Hendrik Skubch, Daniel Saur, and Kurt Geihs. Resolving Conflicts in Highly Reactive Teams. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 170-175, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{skubch_et_al:OASIcs.KiVS.2011.170,
author = {Skubch, Hendrik and Saur, Daniel and Geihs, Kurt},
title = {{Resolving Conflicts in Highly Reactive Teams}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {170--175},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.170},
URN = {urn:nbn:de:0030-drops-29687},
doi = {10.4230/OASIcs.KiVS.2011.170},
annote = {Keywords: Agents, Multi-agent, cooperation, time critical, conflict resolution}
}
Document
A Privacy-Preserving Social P2P Infrastructure for People-Centric Sensing
Abstract
The rapid miniaturization and integration of sensor technologies into mobile Internet devices combined with Online Social Networks allows for enhanced sensor information querying, subscription, and task placement within People-Centric Sensing networks. However, PCS systems which exploit knowledge about OSN user profiles and context information for enhanced service provision might cause an unsolicited application and dissemination of highly personal and sensitive data. In this paper, we propose a protocol extension to our OSN design Vegas which enables secure, privacy-preserving, and trustful P2P communication between PCS participants. By securing knowledge about social links with standard public key cryptography, we achieve a degree of anonymity at a trust level which is almost good as that provided by a centralized trusted third party.
Cite as
Michael Dürr and Kevin Wiesner. A Privacy-Preserving Social P2P Infrastructure for People-Centric Sensing. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 176-181, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{durr_et_al:OASIcs.KiVS.2011.176,
author = {D\"{u}rr, Michael and Wiesner, Kevin},
title = {{A Privacy-Preserving Social P2P Infrastructure for People-Centric Sensing}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {176--181},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.176},
URN = {urn:nbn:de:0030-drops-29695},
doi = {10.4230/OASIcs.KiVS.2011.176},
annote = {Keywords: People-Centric Sensing, Online Social Networks, P2P, Privacy, Trust}
}
Document
Optimization-based Secure Multi-hop Localization in Wireless Ad Hoc Networks
Abstract
The problem of localizing nodes without GPS based on a small fraction of anchor nodes which are aware of their positions is considered to be an important service for applications in wireless ad hoc networks. With an adversary trying to mislead nodes about their estimated locations, several approaches aiming to defeat attackers by means of robustness instead of cryptographic measures have been proposed in the past. Nevertheless, these robust techniques focus on single-hop based localization. Hence, we investigate the impact of employing the well-known Least Median of Squares (LMS) algorithm in the context of the multi-hop based DV-hop approach. We argue that in this case LMS is no longer able to meet its requirements. We examine the source of this behavior and show that LMS leads to more accurate results when using the median to obtain average hop lengths in DV-hop. Furthermore, we investigate the feasibility of performing lateration using the l1-norm instead of the typically employed l2-norm, as well as the possibility of enhancing the robustness of LMS using lateration based on the l1-norm. Contrary to our expectations, the l1-norm only results in a slight, neglectable advantage compared to the computationally less expensive l2-norm lateration.
Cite as
Sander Wozniak, Tobias Gerlach, and Guenter Schaefer. Optimization-based Secure Multi-hop Localization in Wireless Ad Hoc Networks. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 182-187, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{wozniak_et_al:OASIcs.KiVS.2011.182,
author = {Wozniak, Sander and Gerlach, Tobias and Schaefer, Guenter},
title = {{Optimization-based Secure Multi-hop Localization in Wireless Ad Hoc Networks}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {182--187},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.182},
URN = {urn:nbn:de:0030-drops-29708},
doi = {10.4230/OASIcs.KiVS.2011.182},
annote = {Keywords: localization, secure, multi-hop, optimization}
}
Document
Efficient Distributed Intrusion Detection applying Multi Step Signatures
Abstract
Intrusion Detection Systems (IDS) offer valuable measures to cope with today’s attacks on computers and networks. But the increasing performance of networks and end systems and the growing complexity of IT systems lead to rapidly growing volumes of observation data and large signature bases. Therefore, IDS are forced to drop observations in high load situations offering chances to attackers to act undetectable. We introduce an efficient dynamically adaptable, distributed approach for a multi-step signature based IDS. Finally, we discuss initial performance evaluations of a prototype implementation and motivate future work scopes.
Cite as
Michael Vogel and Sebastian Schmerl. Efficient Distributed Intrusion Detection applying Multi Step Signatures. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 188-193, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{vogel_et_al:OASIcs.KiVS.2011.188,
author = {Vogel, Michael and Schmerl, Sebastian},
title = {{Efficient Distributed Intrusion Detection applying Multi Step Signatures}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {188--193},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.188},
URN = {urn:nbn:de:0030-drops-29716},
doi = {10.4230/OASIcs.KiVS.2011.188},
annote = {Keywords: Computer Security, Distributed Intrusion Detection, Attack Signatures}
}
Document
Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm
Abstract
Hop-count based weighted centroid localization is a simple and straightforward localization algorithm, which uses anchors with known positions and the hop count to these anchors to estimate the real position of nodes. Especially in sensor networks, where energy restrictions prevent more complex algorithms, this fast and simple algorithm can be used. Unfortunately the localization error of the algorithm can hinder the practical usage. In this paper we will improve the weighted centroid algorithm for hop count based localization by adding the node degree on the paths to the referenced anchors into the weights. After an analysis to obtain theoretically optimal coefficients we will show by means of simulation that for longer hop counts to the anchors and areas with different node degrees the proposed ND-WCL algorithm outperforms the known hop count based weighted centroid localization algorithm.
Cite as
Rico Radeke and Stefan Türk. Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 194-199, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{radeke_et_al:OASIcs.KiVS.2011.194,
author = {Radeke, Rico and T\"{u}rk, Stefan},
title = {{Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {194--199},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.194},
URN = {urn:nbn:de:0030-drops-29726},
doi = {10.4230/OASIcs.KiVS.2011.194},
annote = {Keywords: Localization, Weighted Centroid}
}
Document
Automated generic integration of flight logbook data into aircraft maintenance systems
Abstract
The automated transfer of flight logbook information from aircrafts into aircraft maintenance systems leads to reduced ground and maintenance time and is thus desirable from an economical point of view. Until recently, flight logbooks have not been managed electronically in aircrafts or at least the data transfer from aircraft to ground maintenance system has been executed manually. Latest aircraft types such as the Airbus A380 or the Boeing 787 do support an electronic logbook and thus make an automated transfer possible. A generic flight logbook transfer system must deal with different data formats on the input side -- due to different aircraft makes and models -- as well as different, distributed aircraft maintenance systems for different airlines as aircraft operators. This article contributes the concept and top level distributed system architecture of such a generic system for automated flight log data transfer. It has been developed within a joint industry and applied research project. The architecture has already been successfully evaluated in a prototypical implementation.
Cite as
Oliver Hunte, Carsten Kleiner, Uwe Koch, Arne Koschel, and Björn Koschel. Automated generic integration of flight logbook data into aircraft maintenance systems. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 201-204, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{hunte_et_al:OASIcs.KiVS.2011.201,
author = {Hunte, Oliver and Kleiner, Carsten and Koch, Uwe and Koschel, Arne and Koschel, Bj\"{o}rn},
title = {{Automated generic integration of flight logbook data into aircraft maintenance systems}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {201--204},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.201},
URN = {urn:nbn:de:0030-drops-29730},
doi = {10.4230/OASIcs.KiVS.2011.201},
annote = {Keywords: system integration, data mapping, XML, aerospace engineering, generic interface, configurable mapping}
}
Document
Alister 2.0 - Programmable Logic Controllers in Railway Interlocking Systems for Regional Lines of the DB Netze AG
Abstract
Railway interlockings are dominated by highly proprietary systems. We present the development project Alister 2.0 -- an interlocking system based on industry-proven standard components: Safety PLCs in distributed nodes communicate over safe network protocols. This enables a highly productive and highly maintainable fail-safe interlocking system for centralised traffic control.
Cite as
Reiner Saykowski, Elferik Schultz, and Joachim Bleidiessel. Alister 2.0 - Programmable Logic Controllers in Railway Interlocking Systems for Regional Lines of the DB Netze AG. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 205-207, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{saykowski_et_al:OASIcs.KiVS.2011.205,
author = {Saykowski, Reiner and Schultz, Elferik and Bleidiessel, Joachim},
title = {{Alister 2.0 - Programmable Logic Controllers in Railway Interlocking Systems for Regional Lines of the DB Netze AG}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {205--207},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.205},
URN = {urn:nbn:de:0030-drops-29747},
doi = {10.4230/OASIcs.KiVS.2011.205},
annote = {Keywords: electronic interlocking, PLC, regional lines, ESTW-R}
}
Document
Browser as a Service (BaaS): Security and Performance Enhancements for the Rich Web
Abstract
This paper introduces an architectural approach to access the Web via a virtual Web browser executed within a secure Cloud environment.
Cite as
Nils Gruschka and Luigi Lo Iacono. Browser as a Service (BaaS): Security and Performance Enhancements for the Rich Web. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 208-210, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{gruschka_et_al:OASIcs.KiVS.2011.208,
author = {Gruschka, Nils and Lo Iacono, Luigi},
title = {{Browser as a Service (BaaS): Security and Performance Enhancements for the Rich Web}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {208--210},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.208},
URN = {urn:nbn:de:0030-drops-29755},
doi = {10.4230/OASIcs.KiVS.2011.208},
annote = {Keywords: Web, Security, Performance, Cloud, SaaS}
}
Document
Model Driven Development of Distributed Business Applications
Abstract
The present paper presents a model driven generative approach to the design and implementation of destributed business applications, which consequently and systematically implements many years of MDSD experience for the software engineering of large application development projects in an industrial context.
Cite as
Wolfgang Goerigk. Model Driven Development of Distributed Business Applications. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 211-213, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{goerigk:OASIcs.KiVS.2011.211,
author = {Goerigk, Wolfgang},
title = {{Model Driven Development of Distributed Business Applications}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {211--213},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.211},
URN = {urn:nbn:de:0030-drops-29768},
doi = {10.4230/OASIcs.KiVS.2011.211},
annote = {Keywords: MDSD, Softwarearchitektur, Modellierung, Codegenerierung}
}
Document
A Mobility Model for the Realistic Simulation of Social Context
Abstract
Simulation is a fundamental means for evaluating mobile applications based on ad-hoc networks. In recent years, the new breed of social mobility models (SMMs) has risen. Contrary to most classical mobility models, SMMs model the social aspects of human mobility, i.e. which users meet, when and how often. Such information is indispensable for the simulation of a wide range of socially-aware communication protocols mostly based on delay-tolerant networks, including opportunistic ad-hoc routing and data dissemination systems. Each SMM needs a model of the relations between a set of relevant people (called social network model -- SNM) in order to simulate their mobility. Existing SMMs lack flexibility since each of them is implicitly restricted to a specific, simplifying SNM. We present GeSoMo (General Social Mobility Model), a new SMM that separates the core mobility model from the structural description of the social network underlying the simulation. This simple and elegant design principle gives GeSoMo generalizing power: Arbitrary existing and future SNMs can be used without changing GeSoMo itself. Our evaluation results show that GeSoMo produces simulations that are coherent with a broad range of empirical data describing real-world human social behavior and mobility.
Cite as
Daniel Fischer. A Mobility Model for the Realistic Simulation of Social Context. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 215-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{fischer:OASIcs.KiVS.2011.215,
author = {Fischer, Daniel},
title = {{A Mobility Model for the Realistic Simulation of Social Context}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {215--220},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.215},
URN = {urn:nbn:de:0030-drops-29772},
doi = {10.4230/OASIcs.KiVS.2011.215},
annote = {Keywords: Mobility Model, Simulation, ad-hoc networks}
}
Document
Anonymous Communication in the Digital World
Abstract
Privacy on the Internet is becoming a concern as an already significant and ever growing part of our daily activities is carried out online. While cryptography can be used to protect the integrity and confidentiality of contents of communication, everyone along the route on which a packet is traveling can still observe the addresses of the respective communication parties. This often is enough to uniquely identify persons participating in a communication. Anonymous communication is used to hide relationships between the communicating parties. These relationships as well as patterns of communication can often be as revealing as their content. Hence, anonymity is a key technology needed to retain privacy in communications. This paper provides a very brief overview of my doctoral dissertation "Anonymous Communication in the Age of the Internet" [A. Panchenko. Anonymous Communication in the Age of the Internet. PhD thesis, Department of Computer Science, RWTH Aachen University, 2010] and then concisely focuses on one randomly selected aspect, namely, the attack on the anonymization concept called Crowds.
Cite as
Andriy Panchenko. Anonymous Communication in the Digital World. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 221-226, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{panchenko:OASIcs.KiVS.2011.221,
author = {Panchenko, Andriy},
title = {{Anonymous Communication in the Digital World}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {221--226},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.221},
URN = {urn:nbn:de:0030-drops-29782},
doi = {10.4230/OASIcs.KiVS.2011.221},
annote = {Keywords: Security, privacy, anonymity, anonymous communication, confidentiality}
}
Document
Optimized DTN-Routing for Urban Public Transport Systems
Abstract
Communication is crucial to the coordination and efficient operation of public transport systems. However, deployment of infrastructure based communication systems is expensive, esp. due to long-term operational costs. Delay tolerant vehicular networks are a promising alternative since only very few infrastructure elements are required. This paper presents a DTN routing algorithm for urban public transport systems which exploits the knowledge about system characteristics and node mobility to improve the routing performance. Various DTN routing schemes are compared with the presented algorithm. Moreover, the impact of disturbances on the routing performance is examined.
Cite as
Tobias Pögel. Optimized DTN-Routing for Urban Public Transport Systems. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 227-232, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{pogel:OASIcs.KiVS.2011.227,
author = {P\"{o}gel, Tobias},
title = {{Optimized DTN-Routing for Urban Public Transport Systems}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {227--232},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.227},
URN = {urn:nbn:de:0030-drops-29799},
doi = {10.4230/OASIcs.KiVS.2011.227},
annote = {Keywords: DTN, Routing, Public Transport, RUTS, The ONE}
}
Document
A Novel Algorithm for Distributed Dynamic Interference Coordination in Cellular Networks
Abstract
Wireless systems based on Orthogonal Frequency Division Multiple Access (OFDMA) multiplex different users in time and frequency. One of the main problems in OFDMA-systems is the inter-cell interference. A promising approach to solve this problem is interference coordination (IFCO). In this paper, we present a novel distributed IFCO scheme, where a central coordinator communicates coordination information in regular time intervals. This information is the basis for a local inner optimization in every basestation. The proposed scheme achieves an increase of more than 100% with respect to the cell edge throughput, and a gain of about 30% in the aggregate spectral efficiency compared to a reuse 3 system.
Cite as
Marc C. Necker. A Novel Algorithm for Distributed Dynamic Interference Coordination in Cellular Networks. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 233-238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{necker:OASIcs.KiVS.2011.233,
author = {Necker, Marc C.},
title = {{A Novel Algorithm for Distributed Dynamic Interference Coordination in Cellular Networks}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {233--238},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.233},
URN = {urn:nbn:de:0030-drops-29802},
doi = {10.4230/OASIcs.KiVS.2011.233},
annote = {Keywords: 3GPP LTE, 802.16e, OFDMA, WiMAX, beamforming, graph coloring, interference coordination, scheduling}
}
Document
Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?
Abstract
Trustworthy applications in fully decentralized systems require a trust anchor. This paper describes how such an anchor can be implemented efficiently in p2p systems. The basic concept is to use threshold cryptography in order to sign messages by a quorum of peers. The focus is put on advanced mechanisms to secure the shares of the secret key over time, using proactive secret sharing. This mechanism was researched in context of the token-based accounting scheme.
Cite as
Nicolas C. Liebau, Andreas U. Mauthe, Vasilios Darlagiannis, and Ralf Steinmetz. Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 239-244, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
Copy BibTex To Clipboard
@InProceedings{liebau_et_al:OASIcs.KiVS.2011.239,
author = {Liebau, Nicolas C. and Mauthe, Andreas U. and Darlagiannis, Vasilios and Steinmetz, Ralf},
title = {{Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
pages = {239--244},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Luttenberger, Norbert and Peters, Hagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.239},
URN = {urn:nbn:de:0030-drops-29818},
doi = {10.4230/OASIcs.KiVS.2011.239},
annote = {Keywords: peer-to-peer, proactive secret sharing}
}