32 Search Results for "Luttenberger, Norbert"

Volume

OASIcs, Volume 17

17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

KiVS 2011, March 8-11, 2011, Kiel, Germany

Editors: Norbert Luttenberger and Hagen Peters

Document
Complete Volume
DOI: 10.4230/OASIcs.KiVS.2011
OASIcs, Volume 17, KiVS'11, Complete Volume

Authors: Norbert Luttenberger and Hagen Peters

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.i
Frontmatter, Preface, Table of Contents, List of Authors

Authors: Norbert Luttenberger and Hagen Peters

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.2
The Scope of the IBGP Routing Anomaly Problem

Authors: Uli Bornhauser, Peter Martini, and Martin Horneffer

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.14
A Reputation-Based Approach to Self-Adaptive Service Selection

Authors: Jan Sudeikat, Wolfgang Renz, Ante Vilenica, and Winfried Lamersdorf

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.26
A Service-Oriented Operating System and an Application Development Infrastructure for Distributed Embedded Systems

Authors: Martin Lipphardt, Nils Glombitza, Jana Neumann, Christian Werner, and Stefan Fischer

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.38
An adaptive protocol for distributed beamforming

Authors: Stephan Sigg and Michael Beigl

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.49
Web Workload Generation According to the UniLoG Approach

Authors: Andrey W. Kolesnikov and Bernd E. Wolfinger

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.61
Improving Markov-based TCP Traffic Classification

Authors: Gerhard Münz, Stephan Heckmüller, Lothar Braun, and Georg Carle

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.73
IT Management Using a Heavyweight CIM Ontology

Authors: Andreas Textor, Jeanne Stynes, and Reinhold Kroeger

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.85
TOGBAD-LQ - Using Challenge-Response to Detect Fake Link Qualities

Authors: Elmar Gerhards-Padilla, Nils Aschenbruck, and Peter Martini

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.97
Avoiding Publication and Privatization Problems on Software Transactional Memory

Authors: Holger Machens and Volker Turau

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.109
A Resilient and Energy-saving Incentive System for Resource Sharing in MANETs

Authors: Holger Teske, Jochen Furthmüller, and Oliver P. Waldhorst

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.121
Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks

Authors: Jedrzej Rybicki, Benjamin Pesch, Martin Mauve, and Björn Scheuermann

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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
DOI: 10.4230/OASIcs.KiVS.2011.133
Distributed Probabilistic Network Traffic Measurements

Authors: Alexander Marold, Peter Lieven, and Björn Scheuermann

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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}
}
  • Refine by Type
  • 31 Document/PDF
  • 1 Volume

  • Refine by Publication Year
  • 1 2012
  • 30 2011
  • 1 2008

  • Refine by Author
  • 3 Luttenberger, Norbert
  • 2 Martini, Peter
  • 2 Peters, Hagen
  • 2 Scheuermann, Björn
  • 1 Aschenbruck, Nils
  • Show More...

  • Refine by Series/Journal
  • 30 OASIcs
  • 1 DagSemProc

  • Refine by Classification

  • Refine by Keyword
  • 2 Security
  • 2 localization
  • 2 network
  • 1 3GPP LTE
  • 1 802.16e
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact