regarding replica generation and placement of movie content in

content-distribution-networks or P2P overlays. Within this paper

we extend approaches for heterogeneous placement scenarios

described in prior publications. Therefor we presume heterogeneous

server peers' bandwidth, HD capacity, and movie popularities.

Movie documents are replicated and placed onto server peers with

respect to the predicted popularity values. Thus each document

aims to gain fair networks resources according to its popularity.

We present simulation results of heuristics of different placement

strategies and compare them with a near optimal technique.}, author = {Schomaker, Gunnar and Loeser, Christoph and Schubert, Matthias}, booktitle = {5th International Conference on Networking (ICN).}, title = {{Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks}}, year = {2006}, } @inbook{16476, author = {Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}, booktitle = {IFIP International Federation for Information Processing}, isbn = {9780387346328}, issn = {1571-5736}, title = {{Maintaining Communication Between an Explorer and a Base Station}}, doi = {10.1007/978-0-387-34733-2_14}, year = {2006}, } @proceedings{17417, abstract = {We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}, editor = {Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}, publisher = {Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title = {{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}, year = {2006}, } @article{17979, author = {Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, issn = {0925-7721}, journal = {Computational Geometry}, pages = {197--214}, title = {{Geometric spanners with applications in wireless networks}}, doi = {10.1016/j.comgeo.2006.02.001}, year = {2006}, } @phdthesis{18972, author = {Damerow, Valentina}, isbn = {3-939350-09-5}, title = {{Average and Smoothed Complexity of Geometric Structures}}, year = {2006}, } @inproceedings{19691, author = {Briest, Patrick and Gunia, Christian}, booktitle = {Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)}, title = {{Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels}}, year = {2006}, } @inproceedings{17619, author = {Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, booktitle = {New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium}, pages = {225--234}, publisher = {Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title = {{Directional Communication in Mobile Ad Hoc Networks}}, year = {2006}, } @inproceedings{19932, abstract = {#hniid 2484}, author = {Kortenjan, Michael and Schomaker, Gunnar}, booktitle = {4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, title = {{Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}}, doi = {10.1145/1108590.1108608}, year = {2006}, } @inbook{16472, author = {Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, booktitle = {LATIN 2006: Theoretical Informatics}, isbn = {9783540327554}, issn = {0302-9743}, title = {{De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}}, doi = {10.1007/11682462_34}, year = {2006}, } @book{17475, author = {Monien, Burkhard and Meyer auf der Heide, Friedhelm}, isbn = {978-3-939350-00-2}, publisher = {Heinz Nixdorf Institut}, title = {{New trends in parallel and distributed computing}}, volume = {181}, year = {2006}, } @inbook{17987, author = {Meer, Klaus and Ziegler, Martin}, booktitle = {Logical Approaches to Computational Barriers}, isbn = {9783540354666}, issn = {0302-9743}, title = {{Uncomputability Below the Real Halting Problem}}, doi = {10.1007/11780342_39}, year = {2006}, } @inproceedings{18745, author = {Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, title = {{Counting Triangles in Data Streams}}, year = {2006}, } @phdthesis{18973, author = {Frahling, Gereon}, isbn = {978-3-942647-09-0}, title = {{Algorithms for Dynamic Geometric Data Streams}}, year = {2006}, } @inproceedings{19870, author = {Brinkmann, A. and Effert, S. and Heidebuer, M. and Vodisek, M.}, booktitle = {5th International Conference on Networking (ICN)}, isbn = {0769525520}, title = {{Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}}, doi = {10.1109/icniconsmcl.2006.182}, year = {2006}, } @inbook{17988, author = {Köhler, Sven and Schindelhauer, Christian and Ziegler, Martin}, booktitle = {Fundamentals of Computation Theory}, isbn = {9783540281931}, issn = {0302-9743}, title = {{On Approximating Real-World Halting Problems}}, doi = {10.1007/11537311_40}, year = {2005}, } @inproceedings{18366, author = {Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan, Kiran and Laroque, Christoph}, booktitle = {Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005}, pages = {267--270}, title = {{Methods to lead the user to significant processes in a 3D material flow simulation}}, year = {2005}, } @article{17414, abstract = {Nowadays companies operate in a difficult environment: the dynamics of innovations increase and product life cycles become shorter. Furthermore products and the corresponding manufacturing processes get more and more complex. Therefore, companies need new methods for the planning of manufacturing systems. One promising approach in this context is digital factory/virtual productionthe modeling and analysis of computer models of the planned factory with the objective to reduce time and costs. For the modeling and analysis various simulation methods and programs have been developed. They are a highly valuable support for planning and visualizing the manufacturing system. But there is one major disadvantage: only experienced and long trained experts are able to operate with these programs. The graphical user interface is very complex and not intuitive to use. This results in an extensive and error-prone modeling of complex simulation models and a time-consuming interpretation of the simulation results. To overcome these weak points, intuitive and understandable manmachine interfaces like augmented and virtual reality can be used. This paper describes the architecture of a system which uses the technologies of augmented and virtual reality to support the planning process of complex manufacturing systems. The proposed system assists the user in modeling, the validation of the simulation model, and the subsequent optimization of the production system. A general application of the VR- and AR-technologies and of the simulation is realized by the development of appropriate linking and integration mechanisms. For the visualization of the arising 3D-data within the VR- and AR-environments, a dedicated 3D-rendering library is used.}, author = {Dangelmaier, Wilhelm and Fischer, Matthias and Gausemeier, Jürgen and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt}, issn = {0166-3615}, journal = {Computers in Industry}, pages = {371--383}, title = {{Virtual and augmented reality support for discrete manufacturing system simulation}}, doi = {10.1016/j.compind.2005.01.007}, year = {2005}, } @inproceedings{18450, author = {Oesterdiekhoff, Brigitte}, booktitle = {IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}, title = {{Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices}}, year = {2005}, } @inproceedings{18917, abstract = {The page migration problem is one of subproblems of data management in networks. It occurs

in a distributed network of processors sharing one indivisible memory page of size D. During runtime,

the processors access a unit of data from the page, and the system is allowed to migrate the page

between the processors. The problem is to compute (on-line) a schedule of page movements

to minimize the total communication cost.

The Dynamic Page Migration problem is an extension to the page migration.

It attempts to model the network dynamics, occurring, for example, in mobile networks.

However, the pace of changes is restricted, i.e. the distances between processors can

change only by a constant per round.

The movement of the nodes induce changes in the communication cost between each pair of nodes,

which is proportional to the distance between them raised to some power $alpha$.

This is typical for mobile wireless networks, where nodes can move with a constant speed,

and the cost of communication is measured in terms of energy used for sending the data.

Thus, by setting $alpha$ equal to the propagation exponent of the medium,

cost minimization becomes minimizing the total energy consumption in the system.

However, as proven in citedynamic-page-migration, if both network mobility and

request sequence are created by an adversary, then the competitive ratio is polynomially large in D and

in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we

consider a scenario in which the network mobility is adversarial, but the requests are

generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,

and prove that it is O(1)-competitive, on expectation and with high probability.}, author = {Bienkowski, Marcin}, booktitle = {Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, location = {Las Vegas, Nevada, USA}, pages = {270--278}, publisher = {ACM Press, NY, USA}, title = {{Dynamic Page Migration with Stochastic Requests}}, year = {2005}, } @inproceedings{18912, abstract = {We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).}, author = {Bienkowski, Marcin and Korzeniowski, Miroslaw}, booktitle = {Proc. of the European Conference in Parallel Processing (Euro-Par)}, isbn = {9783540287001}, issn = {0302-9743}, title = {{Dynamic Page Migration Under Brownian Motion}}, doi = {10.1007/11549468_105}, year = {2005}, } @inproceedings{18924, abstract = {Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need.}, author = {Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, booktitle = {Proceedings of the 4th International Conference on Networking}, isbn = {9783540253396}, issn = {0302-9743}, pages = {413--420}, publisher = {Springer}, title = {{Cube Connected Cycles Based Bluetooth Scatternet Formation}}, doi = {10.1007/978-3-540-31956-6_49}, volume = {3420}, year = {2005}, } @inproceedings{19871, abstract = {Data has become the most valuable asset for many companies; loosing important data can cause companies to fail quite immediately. The protection of data inside storage systems is mostly achieved by using a RAID scheme that adds redundant data to user data, enabling recovery from single or multiple disk failures. This protection against data loss in case of a disk failure can be achieved either by dedicated hardware or a software RAID solution.

One major advantage of software RAID is that it comes for free as a built-in functionality in many operating systems like Linux or Microsoft Windows. The drawback of the built-in functionality is that it is not suited to run in multiple server environments; synchronization and recovery processes can be corrupted if more than a single server is allowed to access a software RAID volume.

In this paper, we present an enhancement for the Linux md-driver that enables a consistent usage of RAID in multiple server environments. Based on the V:DRIVE virtualization environment, RAID volumes can be consistently synchronized and recovered even in distributed environments. Besides the architectural concepts, we present measurements that indicate the viability of this enhanced, distributed version of md.}, author = {Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, booktitle = {In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, pages = {81 -- 88}, title = {{Distributed MD}}, year = {2005}, } @inproceedings{19890, author = {Klein, Jan and Zachmann, Gabriel}, booktitle = {Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005)}, pages = {163--170}, title = {{Interpolation Search for Point Cloud Intersection}}, doi = {10.1145/1186223.1186329}, year = {2005}, } @inproceedings{19888, author = {Klein, Jan and Zachmann, Gabriel}, booktitle = {ACM SIGGRAPH 2005 Posters on - SIGGRAPH '05}, title = {{The expected running time of hierarchical collision detection}}, doi = {10.1145/1186954.1187087}, year = {2005}, } @article{15058, author = {Ziegler, Martin}, issn = {0304-3975}, journal = {Theoretical Computer Science}, pages = {14--26}, title = {{Stability versus speed in a computable algebraic model}}, doi = {10.1016/j.tcs.2005.09.053}, year = {2005}, } @inproceedings{17112, author = {Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}, booktitle = {Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}, publisher = {Technische Universiteit Eindhoven}, title = {{Average case complexity of Voronoi diagrams of n sites from the unit cube}}, year = {2005}, } @inproceedings{17415, author = {Fischer, Matthias and Mueck, B. and Mahajan, K. and Kortenjan, M. and Laroque, C. and Dangelmaier, W.}, booktitle = {Proceedings of the Winter Simulation Conference}, isbn = {0780395190}, title = {{Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations}}, doi = {10.1109/wsc.2005.1574470}, year = {2005}, } @inbook{17989, author = {Meer, Klaus and Ziegler, Martin}, booktitle = {Fundamentals of Computation Theory}, isbn = {9783540281931}, issn = {0302-9743}, title = {{An Explicit Solution to Post’s Problem over the Reals}}, doi = {10.1007/11537311_41}, year = {2005}, } @inproceedings{18280, abstract = {The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f:R->R:

*) non-deterministic computation;

*) relativized computation, specifically given access to oracles like 0' or 0'';

*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.

It turns out that, among these approaches, only the first one provides the required power.}, author = {Ziegler, Martin}, booktitle = {Proc. CiE 2005: New Computational Paradigms}, isbn = {9783540261797}, issn = {0302-9743}, pages = {562--571}, publisher = {Springer}, title = {{Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}}, doi = {10.1007/11494645_68}, volume = {3526}, year = {2005}, } @inproceedings{18449, author = {Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte}, booktitle = {IEEE International Conference on Industrial Informatics (INDIN)}, title = {{ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario}}, year = {2005}, } @article{18855, abstract = {We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries. Read More: https://epubs.siam.org/doi/10.1137/S0097539703435297 }, author = {Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}, issn = {0097-5397}, journal = {SIAM Journal on Computing}, number = {1}, pages = {91--109}, title = {{Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}}, doi = {10.1137/s0097539703435297}, volume = {35}, year = {2005}, } @inproceedings{18867, abstract = {Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.

We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.}, author = {Frahling, Gereon and Krokowski, Jens}, booktitle = {Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, isbn = {9783540291183}, issn = {0302-9743}, pages = {758--769}, publisher = {Springer}, title = {{Online Occlusion Culling}}, doi = {10.1007/11561071_67}, volume = {3669}, year = {2005}, } @inproceedings{18925, abstract = {The dynamic page migration problem citedynamic-page-migration is defined in

a distributed network of $n$ mobile nodes sharing one indivisible memory page

of size $D$. During runtime, the nodes can both access a unit of data from

the page and move with a constant speed, thus changing the costs of communication.

The problem is to compute

to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.

We prove that it achieves an (up to a constant factor) optimal competitive ratio

$O(n cdot sqrtD)$. We show that the randomization of this algorithm

improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).

This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.

We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.}, author = {Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, booktitle = {Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, isbn = {9783540249986}, issn = {0302-9743}, pages = {365--376}, title = {{Improved Algorithms for Dynamic Page Migration}}, doi = {10.1007/978-3-540-31856-9_30}, year = {2005}, } @inproceedings{19827, abstract = {We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled

The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.

For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.

While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear

combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.}, author = {Rührup, S. and Schindelhauer, C.}, booktitle = {19th IEEE International Parallel and Distributed Processing Symposium}, isbn = {0769523129}, pages = {248}, title = {{Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}}, doi = {10.1109/ipdps.2005.147}, year = {2005}, } @inproceedings{19872, abstract = {Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in closed loop approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tools architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tools architecture.}, author = {Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}, booktitle = {In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, pages = {1--8}, title = {{An integrated Architecture for Business Intelligence support from Application down to Storage}}, year = {2005}, } @inbook{16468, author = {Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, booktitle = {Peer-to-Peer Systems IV}, isbn = {9783540290681}, issn = {0302-9743}, title = {{Dynamic Load Balancing in Distributed Hash Tables}}, doi = {10.1007/11558989_20}, year = {2005}, } @proceedings{17113, editor = {Leonardi, Stefano and Meyer auf der Heide, Friedhelm and Wagner, Dorothea}, location = {Schloss Dagstuhl, Germany}, title = {{Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}}, volume = {05361}, year = {2005}, } @inproceedings{16470, abstract = {We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library. }, author = {Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, booktitle = {Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, isbn = {9783540341413}, issn = {0302-9743}, pages = {801--808}, title = {{A Web Computing Environment for Parallel Algorithms in Java}}, doi = {10.1007/11752578_96}, year = {2005}, } @inproceedings{19835, abstract = {The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with

variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.

In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.

Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.}, author = {Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, booktitle = {Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}, isbn = {9783540291329}, issn = {0302-9743}, pages = {244--257}, title = {{Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}}, doi = {10.1007/11561354_21}, volume = {3738}, year = {2005}, } @inproceedings{19912, author = {Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, booktitle = {Proceedings of the 4th International Conference on Networking}, isbn = {9783540253389}, issn = {0302-9743}, pages = {800--810}, title = {{Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}}, doi = {10.1007/978-3-540-31957-3_90}, volume = {3421}, year = {2005}, } @inbook{16469, author = {Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, booktitle = {Mathematical Foundations of Computer Science 2005}, isbn = {9783540287025}, issn = {0302-9743}, title = {{Page Migration in Dynamic Networks}}, doi = {10.1007/11549345_1}, year = {2005}, } @article{18282, author = {Ziegler, Martin}, issn = {0020-7748}, journal = {International Journal of Theoretical Physics}, number = {11}, pages = {2059--2071}, title = {{Computational Power of Infinite Quantum Parallelism}}, doi = {10.1007/s10773-005-8984-0}, volume = {44}, year = {2005}, } @article{18763, abstract = {Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs . We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension , then the property has an efficient tester. We apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size. Our framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties.}, author = {Czumaj, Artur and Sohler, Christian}, issn = {0097-5397}, journal = {SIAM Journal on Computing}, number = {3}, pages = {580--615}, title = {{Abstract Combinatorial Programs and Efficient Property Testers}}, doi = {10.1137/s009753970444199x}, volume = {34}, year = {2005}, } @inproceedings{18768, author = {Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, booktitle = {Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, isbn = {9783540275800}, issn = {0302-9743}, pages = {866--877}, title = {{Facility Location in Sublinear Time}}, doi = {10.1007/11523468_70}, year = {2005}, } @inproceedings{18787, abstract = {A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points (a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly(ɛ −1, log m, log ∆) space and update time per insert/delete operation for constant k and dimension d. Having a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log(1/ɛ)/ɛ) d−1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1/ɛ) O(1))) time. For MaxST and average distance we require poly(log n, ɛ −1) time and for MaxWM we require O(n 3) time to do this.}, author = {Sohler, Christian and Frahling, Gereon}, booktitle = {Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}, pages = {209--217}, title = {{Coresets in Dynamic Geometric Data Streams}}, year = {2005}, } @inproceedings{18915, abstract = {We present a simple two-person Bucket Game, based on throwing balls into buckets, and we

discuss possible players' strategies.

We use these strategies to create an approximation algorithm for a generalization of

the well known Set Cover problem, where we need to cover each element by at least $k$ sets.

Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration

problem achieving the optimal competitive ratio against an oblivious adversary.}, author = {Bienkowski, Marcin and Byrka, Jarosław}, booktitle = {Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, isbn = {9783540291183}, issn = {0302-9743}, pages = {815--826}, publisher = {Springer }, title = {{Bucket Game with Applications to Set Multicover and Dynamic Page Migration}}, doi = {10.1007/11561071_72}, volume = {3669}, year = {2005}, }