| Vorwort der Tagungsleiter | 5 |
| Organisation | 7 |
| Inhaltsverzeichnis | 9 |
| I Funknetze | 13 |
| Practical Rate-Based Congestion Control for Wireless Mesh Networks | 14 |
| 1 Introduction | 14 |
| 2 Related Work | 15 |
| 3 The Leipzig Wireless Mesh Testbed | 16 |
| 4 The Mesh Adaptive Pacing Scheme | 17 |
| 4.1 Network Load Adaptation | 17 |
| 4.2 The Spatial Reuse Constraint | 18 |
| 4.3 Approximating the Out-of-Interference Delay | 19 |
| 4.4 The MAP Pacing Rate | 22 |
| 5 Comparative Performance Study | 22 |
| 5.1 Wireless Chain Topology | 22 |
| 5.2 Concurrent Flows Topology | 23 |
| 5.3 Random Topology | 24 |
| 6 Conclusion | 25 |
| 7 References | 25 |
| Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks | 27 |
| 1 Introduction | 27 |
| 2 Concepts and Notations | 28 |
| 3 Related Work | 30 |
| 4 Direct Planarization | 30 |
| 4.1 Angle-Based Direct Planarization | 31 |
| 4.2 Delaunay-Based Direct Planarization | 32 |
| 5 Reactive Link Selection | 32 |
| 6 Simulation Studies | 35 |
| 7 Conclusion | 37 |
| References | 38 |
| Preventing Service Discovery Cache Reply Storms in Wireless Mesh Networks | 39 |
| 1 Introduction | 39 |
| 2 Related Work | 40 |
| 3 Message Reply Storm | 41 |
| 4 Message Propagation Strategies | 41 |
| 4.1 Simple Reply Flooding | 42 |
| 4.2 Discarding Duplicates | 42 |
| 4.3 Local Backoff | 43 |
| 4.4 Nearest Nodes Send First (NNSF) | 44 |
| 4.5 Farthest Nodes Send First (FNSF) | 44 |
| 5 Wireless Mesh Testbed | 44 |
| 6 Measurements | 45 |
| 6.1 Detailed Performance Discussion | 46 |
| 7 Conclusion | 48 |
| Acknowledgment | 49 |
| References | 49 |
| II Standardization and Research – How Do These Two Fit Together? | 51 |
| Bringing ICT Research into Standardisation - What Can Standards Bodies Do? | 52 |
| 1 A Brief Introduction | 52 |
| 2 Improving Standards Through Integration of Research Results | 53 |
| 2.1 Motivations and Barriers | 53 |
| 2.2 What SSBs Can Do – Mechanisms to Bridge the Gap Between Research and Standardisation | 55 |
| Adaptation of Processes | 55 |
| Monitoring and Alerting Service | 55 |
| Education and Promotion | 56 |
| Some More Specific Suggestions | 57 |
| 3 Some Comments on Current Practice | 58 |
| 4 Brief Summary and Some Additional Advice | 59 |
| 5 References | 60 |
| III Adaptive Systeme | 61 |
| Query Processing and System-Level Support for Runtime-Adaptive Sensor Networks | 62 |
| 1 Introduction | 62 |
| 2 Distributed Stream Processing | 63 |
| 2.1 A Scenario for Global Query Management | 64 |
| 2.2 Global Queries | 64 |
| 2.3 Query Partitioning and Distribution of Operators | 65 |
| 2.4 Creation of Operator Assemblies | 67 |
| 3 Reprogramming Support | 67 |
| 3.1 Deployment of an Operator Assembly | 68 |
| 3.2 Target Platform | 69 |
| 3.3 Flash Management | 70 |
| 3.4 Creating Binaries and Flash Management | 71 |
| 3.5 Named Memory | 71 |
| 3.6 Application Programming Interface | 72 |
| 4 Conclusion | 72 |
| References | 73 |
| SelfWISE: A Framework for Developing Self-Stabilizing Algorithms | 74 |
| 1 Introduction | 74 |
| 2 Self-Stabilization | 75 |
| 2.1 Definitions and Notations | 76 |
| 2.2 Self-Stabilizing Algorithms for WSNs | 77 |
| 3 Related Work | 78 |
| 4 SelfWISE | 79 |
| 4.1 Overview | 79 |
| 4.2 Language | 81 |
| 4.3 Run-Time Environment | 83 |
| 4.4 First Prototype | 84 |
| 5 Conclusion | 84 |
| References | 85 |
| MASDynamics: Toward Systemic Modeling of Decentralized Agent Coordination | 86 |
| 1 Introduction | 86 |
| 2 Self–Organizing MAS Development | 88 |
| 2.1 Engineering Self–Organization by Decentralized Coordination | 88 |
| 2.2 Providing Decentralized Coordination Mechanisms as Services | 89 |
| 3 Modeling and Reuse of Self–Organizing Dynamics | 90 |
| 3.1 Systemic Modeling Self–Organizing MAS Dynamics | 90 |
| 3.2 MASDynamics: A Coordination Language | 91 |
| 4 Case Study: Supplementing an Allocation Strategy | 94 |
| 5 Conclusions | 96 |
| Acknowledgment | 96 |
| References | 96 |
| IV Service-Oriented Computing | 98 |
| Leveraging the BPEL Event Model to Support QoS-aware Process Execution | 99 |
| 1 Introduction | 99 |
| 2 Basic Concepts | 100 |
| 2.1 Fault Handling in BPEL | 100 |
| 2.2 BPEL Event Model | 101 |
| 2.3 ECA Rules | 102 |
| 3 Approach | 103 |
| 3.1 Detecting QoS Exceptions | 104 |
| 3.2 Recovery Actions | 106 |
| 4 Implementation | 107 |
| 5 Related Work | 108 |
| 6 Summary and Future Work | 109 |
| Acknowledgement | 110 |
| References | 110 |
| Automated Integration of Web Services in BPEL4WS Processes | 111 |
| 1 Introduction | 111 |
| 2 Self-Integration | 112 |
| 3 Automatic Message Transformation for Web Services | 114 |
| 3.1 Semantic Extension of WSDL | 114 |
| 3.2 Semantic Service Discovery | 116 |
| 4 Implementation | 118 |
| 4.1 Performance | 119 |
| 5 Related Work | 120 |
| 6 Conclusions | 121 |
| References | 121 |
| Dynamic Message Routing Using Processes | 123 |
| 1 Introduction | 123 |
| 2 Problem Statement and Motivation | 124 |
| 2.1 SOAP Processing Model | 125 |
| 2.2 Open Issues in SOAP Routing | 126 |
| 2.3 BPEL | 126 |
| 3 Dynamic Message Routing Using Processes | 127 |
| 4 SOAP BPEL Routing (SBR) | 128 |
| 4.1 Header Information | 128 |
| 4.2 Protocol Between Intermediary and Process | 129 |
| 4.3 Detailed Routing Protocol | 129 |
| 4.4 Example Scenario for SBR | 131 |
| 5 Discussion and Future Work | 133 |
| 6 Conclusions | 134 |
| 7 References2 | 134 |
| Abstract User Interfaces for Mobile Processes | 135 |
| 1 Introduction | 135 |
| 2 User Interactions for Mobile Processes: Requirement Analysis | 137 |
| 3 Existing Approaches | 138 |
| 4 A CCT-based Interface Model for Mobile Processes | 139 |
| 4.1 Abstract Interaction Components for User Interfaces | 140 |
| 4.2 Control Flow and Data Flow Components | 141 |
| 5 User Interface Development, Integration and Realisation | 142 |
| 5.1 Modelling Abstract User Interfaces with TERESA | 142 |
| 5.2 Integration with the DEMAC Process Management System | 142 |
| 5.3 Example Application Implementation | 143 |
| 5.4 Prototypical Implementation and Usability Evaluation | 145 |
| 6 Conclusion and Future Work | 145 |
| References | 146 |
| V Leistungsbewertung | 147 |
| A New Service Curve Model to Deal with Non-FIFO Systems | 148 |
| 1 Introduction | 148 |
| 1.1 Motivation | 148 |
| 1.2 Related Work | 149 |
| 2 Preliminaries on Network Calculus | 150 |
| 3 Why Conventional Network Calculus Does Not Work Well for Non-FIFO Systems | 151 |
| 3.1 Using Service Curves (SC) for Non-FIFO Systems | 152 |
| 3.2 Using Strict Service Curves (S2C) for Non-FIFO Systems | 153 |
| 4 Introducing a New Service Curve Model: Sufficiently Strict Service Curve | 154 |
| 5 NumericalExperiments | 157 |
| 5.1 Comparison of Different Service Curve Models | 157 |
| 5.2 FIFO vs. Non-FIFO Delay Bounds | 157 |
| 6 Conclusion | 158 |
| Acknowledgements | 159 |
| References | 159 |
| Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems | 160 |
| 1 Introduction | 160 |
| 2 Probabilistic Latency Bounds in Content-Based Publish/Subscribe | 161 |
| 3 Adaptation to Probabilistic Latency Requirements | 163 |
| 3.1 Reactive and Proactive Adaptations | 164 |
| 3.2 Algorithm Properties | 165 |
| 4 Cluster Management | 166 |
| 5 Evaluation | 167 |
| 5.1 Algorithm Convergence | 168 |
| 5.2 Algorithm Stability | 169 |
| 6 Related Work | 169 |
| 7 Conclusion | 170 |
| 8 Acknowledgment | 171 |
| References | 171 |
| Traffic, Structure and Locality Characteristics of the Web’s Most Popular Services’ Home Pages | 172 |
| 1 Introduction | 172 |
| 1.1 Evolution of Web Applications | 172 |
| 1.2 Related Work | 173 |
| 1.3 Overview of the Paper | 174 |
| 2 Measurement Method | 174 |
| 3 Home Page Characteristics | 175 |
| 4 Helper Services | 180 |
| 5 Conclusions | 181 |
| References | 182 |
| Seamless Dynamic Reconfiguration of Flow Meters: Requirements and Solutions | 184 |
| 1 Introduction | 184 |
| 2 Overview and Problem Statement | 185 |
| 2.1 Flow Monitoring | 185 |
| 2.2 Requirements in the Security Domain | 186 |
| 2.3 Challenges | 186 |
| 3 Dynamic Reconfiguration | 187 |
| 3.1 Vermont | 187 |
| 3.2 Reconfiguration | 188 |
| 3.3 Situation Awareness | 189 |
| 4 Performance Measurements | 190 |
| 4.1 Test Setup | 190 |
| 4.2 Experiment Description | 191 |
| 4.3 Further Issues | 191 |
| 4.4 Results and Discussion | 192 |
| 5 Conclusion | 194 |
| Acknowledgments | 195 |
| References | 195 |
| VI Sicherheit | 196 |
| Towards the Design of Unexploitable Construction Mechanisms for Multiple-Tree Based P2P Streaming Systems | 197 |
| 1 Introduction | 197 |
| 2 Attacks Against P2P Streaming Topologies | 198 |
| 3 Requirements for Manipulation-Proof Construction Mechanisms | 201 |
| 3.1 Distribution of Topology Information | 201 |
| 3.2 Locality of Repair Mechanisms | 201 |
| 3.3 Initiative of Repair Actions | 202 |
| 3.4 Decision Process for Node Promotion and Degradation | 203 |
| 3.5 Reliability Estimation Via Long-Term Service | 203 |
| 3.6 Bootstrapping Joining Nodes | 204 |
| 4 A Brief Discussion of Existing Systems | 204 |
| 5 A Push-Based Streaming System Utilizing a Manipulation Resistant Topology Repair Mechanism | 205 |
| 6 Experiments | 205 |
| 7 Conclusions | 208 |
| Acknowledgements | 208 |
| References | 208 |
| Turning the Tables: Using Wireless Communication Against an Attacker | 209 |
| 1 Introduction | 209 |
| 2 Unpredictability of Signal Propagation | 210 |
| 3 Authentication Primitives | 212 |
| 4 WSN Under Attack – A Real-World Analysis | 213 |
| 4.1 AttackerModel and Countermeasures | 214 |
| 4.2 Impact of an Injection Attack | 215 |
| 5 Related Work | 218 |
| 6 Conclusion | 219 |
| References | 219 |
| Evaluation of Attack Countermeasures to Improve the DoS Robustness of RSerPool Systems by Simulations and Measurements | 221 |
| 1 Introduction and Scope | 221 |
| 2 The RSerPool Architecture | 222 |
| 3 Quantifying an RSerPool System | 223 |
| 4 SystemSetup | 224 |
| 5 The Impact of an Attacker | 225 |
| 5.1 An Attacker Masquerading as Pool Element | 225 |
| 5.2 An Attacker Masquerading as Pool User | 226 |
| 6 Applying Attack Countermeasures | 227 |
| 6.1 Countermeasures Against Pool Element Attacks | 227 |
| 6.2 Countermeasures Against Pool User Attacks | 228 |
| 7 Conclusions | 231 |
| References | 231 |
| Towards a Generic Backup and Recovery Infrastructure for the German D-Grid Initiative | 233 |
| 1 Introduction | 233 |
| 2 Design of a Backup and Recovery Infrastructure for Grid Environments | 234 |
| 2.1 Requirements Analysis | 235 |
| 2.2 Pull- vs. Push-Based Backup and Recovery | 235 |
| 2.3 User- vs. Node-Based Backup and Recovery | 236 |
| 2.4 Incremental, Differential, and Full Backup | 237 |
| 2.5 File Permissions | 238 |
| 2.6 Architectural Blueprint | 238 |
| 2.7 Backup | 239 |
| 3 Implementation Issues | 240 |
| 3.1 Selection of Appropriate Technologies | 240 |
| 3.2 Accessing the Backup and Recovery Service | 241 |
| 3.3 Submission of a Backup Job | 241 |
| 4 Related Work | 242 |
| 5 Conclusions | 243 |
| Acknowledgements | 243 |
| References | 243 |
| From Modelling to Execution of Enterprise Integration Scenarios: The GENIUS Tool | 245 |
| 1 Introduction | 245 |
| 2 Modelling of EAI Scenarios | 247 |
| 2.1 Parameterized EAI Patterns | 247 |
| 2.2 Model-Driven Development of Executable EAI Scenarios | 248 |
| 3 GENIUS – A Tool for Modelling Executable EAI Scenarios | 249 |
| 3.1 Features of GENIUS | 249 |
| 3.2 Architecture and Extension Mechanism | 250 |
| 3.3 Guarantee of Proper Configuration of Parameterized EAI Patterns | 251 |
| 3.4 Generation Algorithm | 251 |
| 4 Scenario: Developing an Integration Solution | 252 |
| 4.1 Loan Broker Scenario with Parameterized EAI Pattern | 252 |
| 4.2 Generated BPEL Code | 253 |
| 5 Conclusion and Future Work | 255 |
| 6 References3 | 256 |
| Pluggable Authorization and Distributed Enforcement with pam_xacml | 257 |
| 1 Introduction | 257 |
| 2 Related Work | 258 |
| 3 Pluggable Authorization with XACML | 259 |
| 3.1 pam_xacml for Unmodified Applications That Support PAM | 260 |
| 3.2 Applications with Authorization Interface | 261 |
| 4 Experiments on Distributed Authorization | 262 |
| 4.1 Reference Scenario with Consecutive Authorization Decisions | 263 |
| 4.2 Measurements | 264 |
| 4.3 Impact of Propagation Delay | 265 |
| 5 Conclusion | 266 |
| References | 267 |
| VII Kurzbeiträge | 269 |
| Enhancing Application Layer Multicast Solutions by Wireless Underlay Support | 270 |
| 1 Introduction | 270 |
| 2 Nice | 271 |
| 3 NICE-WLI Protocol Design | 271 |
| 3.1 Gateway Nodes | 272 |
| 3.2 Protocol Operation | 272 |
| 3.3 Data Dissemination | 273 |
| 4 Evaluation | 274 |
| 5 Conclusion and Outlook | 275 |
| References | 275 |
| Strombasierte Struktur-Validierung von simple content in XML-Dokumenten | 276 |
| 1 Einleitung | 276 |
| 2 Validierung | 277 |
| 3 Validierung im Detail | 278 |
| 3.1 Repr¨asentation der Strukturdefinition | 279 |
| 3.2 Kontrollelemente | 280 |
| 3.3 pull-Operationen f¨ur simple content | 280 |
| 4 Evaluation | 281 |
| 5 Ausblick | 281 |
| Literaturverzeichnis | 281 |
| CLIO – A Cross-Layer Information Service for Overlay Network Optimization | 282 |
| 1 Introduction | 282 |
| 2 Challenges and State of the Art | 282 |
| 3 CLIO – A Cross-Layer Information Service for Overlays | 284 |
| 3.1 Inner Workings | 285 |
| 3.2 Data Representation and Generic Interface | 285 |
| 4 Discussion and Conclusion | 286 |
| References | 287 |
| Improving TCP’s Robustness to Packet Reordering | 288 |
| 1 Motivation | 288 |
| 2 Related Work | 289 |
| 3 Algorithm | 290 |
| 4 Implementation | 291 |
| 5 Conclusion and Future Work | 292 |
| References | 293 |
| Banishing Patch-Cables from LAN Parties | 294 |
| 1 Introduction | 294 |
| 2 Ad-hoc P2P Multicast as a Patch-Cable Substitute | 295 |
| 3 Scenario Modelling | 296 |
| 4 Simulation Results | 297 |
| 5 Summary and Conclusion | 298 |
| References | 299 |
| A Middleware for the Controlled Information Exchange Between Online Games and Internet Applications | 300 |
| 1. Introduction | 300 |
| 2. Related Work | 301 |
| 3. Virtual Context Based Services | 302 |
| 3.1 Virtual Parameters and Virtual Context | 302 |
| 3.2 VCBS Middleware Architecture | 302 |
| 4. Usage Scenarios | 304 |
| 5. Summary | 304 |
| 6. References | 305 |
| Re-sequencing Buffer Occupancy of a Concurrent Multipath Transmission Mechanism for Transport System Virtualization | 306 |
| 1 Introduction | 306 |
| 2 Transport System Virtualization | 307 |
| 3 Implementing TSV Using Concurrent Multipath Transfer in Advanced Routing Overlays | 307 |
| 4 Re-sequencing Buffer Occupancy in Concurrent Multipath Transport | 308 |
| 4.1 Impact of Type of Delay Distribution | 309 |
| 4.2 Path Selection Criteria | 310 |
| 5 Conclusion | 311 |
| References | 311 |
| Designing a Decentralized Traffic Information System – AutoNomos | 312 |
| 1 Introduction | 312 |
| 2 Related Work | 313 |
| 3 AutoNomos Architecture | 313 |
| 3.1 Hovering Data Clouds | 314 |
| 3.2 Organic Information Complexes | 314 |
| 3.3 Data Dissemination Protocol AutoCast | 316 |
| 3.4 Software Architecture | 316 |
| 4 Conclusion and Future Work | 317 |
| References | 318 |
| VIII Preisträger | 319 |
| UMTS Radio Network Planning: Mastering Cell Coupling for Capacity Optimization | 320 |
| Stochastic Packet Loss Model to Evaluate QoE Impairments | 321 |
| References | 321 |
| Unsynchronized Energy-Efficient Medium Access Control and Routing in Wireless Sensor Networks | 322 |
| Novel Network Architecture for Optical Burst Transport | 323 |
| Lightweight Authentication for HIP | 324 |
| References | 324 |
| Author Index | 325 |
