@inproceedings{788, author = {{Dannewitz, Christian and Herlich, Matthias and Karl, Holger}}, booktitle = {{37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012}}, pages = {{1061----1069}}, title = {{{OpenNetInf - prototyping an information-centric Network Architecture}}}, doi = {{10.1109/LCNW.2012.6424044}}, year = {{2012}}, } @inproceedings{789, author = {{Dräxler, Martin and Biermann, Thorsten and Karl, Holger and Kellerer, Wolfgang}}, booktitle = {{23rd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012, Sydney, Australia, September 9-12, 2012}}, pages = {{1383----1389}}, title = {{{Cooperating base station set selection and network reconfiguration in limited backhaul networks}}}, doi = {{10.1109/PIMRC.2012.6362563}}, year = {{2012}}, } @inproceedings{790, author = {{Dräxler, Martin and Beister, Frederic and Kruska, Stephan and Aelken, J. and Karl, Holger}}, booktitle = {{International ICST Conference on Simulation Tools and Techniques, SIMUTOOLS '12, Sirmione-Desenzano, Italy, March 19-23, 2012}}, pages = {{157----165}}, title = {{{Using OMNeT++ for energy optimization simulations in mobile core networks}}}, doi = {{10.4108/icst.simutools.2012.247676}}, year = {{2012}}, } @inproceedings{791, author = {{Volkhausen, Tobias and Schinköthe, Kai and Karl, Holger}}, booktitle = {{2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, Paris, France, April 1-4, 2012}}, pages = {{575----580}}, title = {{{Quantization techniques for accurate soft message combining}}}, doi = {{10.1109/WCNC.2012.6214434}}, year = {{2012}}, } @inproceedings{792, author = {{Volkhausen, Tobias and Dridger, Kornelius and S. Lichte, Hermann and Karl, Holger}}, booktitle = {{10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012}}, pages = {{299----304}}, title = {{{Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware}}}, year = {{2012}}, } @inproceedings{8055, author = {{Becker, Matthias and Luckey, Markus and Becker, Steffen}}, booktitle = {{Proceedings of the International Conference on Quality of Software Architecture}}, publisher = {{ACM}}, title = {{{Model-driven Performance Engineering of Self-Adaptive Systems: A Survey}}}, year = {{2012}}, } @inproceedings{8056, abstract = {{Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers. However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners.}}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}}, booktitle = {{Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS'12)}}, pages = {{709--725}}, publisher = {{Springer-Verlag}}, title = {{{Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}}}, doi = {{http://dx.doi.org/10.1007/978-3-642-33666-9_45}}, volume = {{7590}}, year = {{2012}}, } @book{8226, author = {{Kremer, Marion and Engels, Gregor and Hofmann, Alexander and Hohwiller, Jörg and E. Nandico, Oliver and Nötzold, Thomas and Prott, Karl and Schlegel, Diethelm and Seidl, Andreas and Wolf, Thomas}}, publisher = {{Capgemini CSD Research, Offenbach 2012}}, title = {{{Quasar 3.0 - A Situational Approach to Software Engineering}}}, year = {{2012}}, } @article{570, abstract = {{This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks}}, author = {{Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}}, journal = {{Theoretical Computer Science}}, pages = {{137--148}}, publisher = {{Elsevier}}, title = {{{Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}}}, doi = {{10.1016/j.tcs.2012.07.029}}, year = {{2012}}, } @inproceedings{572, abstract = {{Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners.}}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}}, booktitle = {{Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)}}, pages = {{709----725}}, title = {{{Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}}}, doi = {{10.1007/978-3-642-33666-9_45}}, year = {{2012}}, } @inproceedings{573, abstract = {{In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services.}}, author = {{Arifulina, Svetlana}}, booktitle = {{Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}}, editor = {{W. Eisenecker, Ulrich and Bucholdt, Christian}}, pages = {{23----26}}, title = {{{Towards a Framework for the Integration of Modeling Languages}}}, year = {{2012}}, } @article{574, abstract = {{We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.}}, author = {{Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}}, journal = {{Theoretical Computer Science}}, pages = {{18--35}}, publisher = {{Elsevier}}, title = {{{Tiara: A self-stabilizing deterministic skip list and skip graph}}}, doi = {{10.1016/j.tcs.2011.12.079}}, year = {{2012}}, } @inproceedings{5753, author = {{Nagel, Benjamin and Gerth, Christian and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}}, booktitle = {{Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012}}, pages = {{4}}, title = {{{Model-driven specification of adaptive cloud-based systems}}}, doi = {{10.1145/2446224.2446228}}, year = {{2012}}, } @misc{5760, author = {{Yigitbas, Enes}}, title = {{{Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}}}, year = {{2012}}, } @proceedings{577, abstract = {{SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems.}}, editor = {{Richa, Andrea W. and Scheideler, Christian}}, location = {{Paderborn, Germany}}, title = {{{Stabilization, Safety, and Security of Distributed Systems}}}, doi = {{10.1007/978-3-642-33536-5}}, year = {{2012}}, } @article{579, abstract = {{A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.}}, author = {{Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}}, journal = {{Transactions on Algorithms}}, number = {{3}}, pages = {{30}}, publisher = {{ACM}}, title = {{{Smoothed analysis of left-to-right maxima with applications}}}, doi = {{10.1145/2229163.2229174}}, year = {{2012}}, } @inproceedings{580, abstract = {{We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.}}, author = {{Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}}, booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}}, editor = {{Even, Guy and Rawitz, Dror}}, pages = {{218--231}}, title = {{{Slow Down & Sleep for Profit in Online Deadline Scheduling}}}, doi = {{10.1007/978-3-642-34862-4_17}}, year = {{2012}}, } @inproceedings{581, abstract = {{Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.}}, author = {{Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}}, booktitle = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{1272--1283}}, title = {{{Self-Organizing Particle Systems}}}, doi = {{10.1109/IPDPS.2012.116}}, year = {{2012}}, } @misc{582, author = {{Strothmann, Thim Frederik}}, publisher = {{Universität Paderborn}}, title = {{{Self-Optimizing Binary Search Trees - A Game Theoretic Approach}}}, year = {{2012}}, } @misc{584, author = {{Hohenberger, Till}}, publisher = {{Universität Paderborn}}, title = {{{Queuing Latency at Cooperative Base Stations}}}, year = {{2012}}, }