Bartolini / Nikoletseas / Sinha Quality of Service in Heterogeneous Networks

6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2009 and 3rd International Workshop on Advanced Architectures and Algorithms for In
1. Auflage 2009
ISBN: 978-3-642-10625-5
Verlag: Springer
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 809 Seiten

This book constitutes the proceedings of two conferences: The 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2009) and the 3rd International ICST Workshop on Advanced Architectures and Algorithms for Internet DElivery and Applications (AAA-IDWEA 2009). QShine is a very successfull series of conferences providing an international forum for the discussion and sharing of new research ideas on the design and implementation of Quality of Service (QoS) in heterogeneous wireless and wireline networks. The 19 papers presented at the conference were selected from 40 paper submissions. In addition to this 25 papers from leading researchers working in related fields are presented. The conference is organized in 11 technical sessions covering IP telephony and multimedia, mesh networks, mobility and heterogeneous wireless networks. AAA-IDEA comprises 7 papers that cover a variety of topics such as architectures and algorithms for content and service delivery, energy-aware networks, QoE in media streaming as well as support for mobile and wireless systems.

Autoren/Hrsg.

Bartolini, Novella

Nikoletseas, Sotiris

Sinha, Prasun

Cardellini, Valeria

Inhaltsverzeichnis

1;Preface;5
2;Organization;6
3;Table of Contents;10
4;QShine 2009 Session I – IP Telephony and Multimedia;16
4.1;QoS Measurement-Based CAC for an IP Telephony System;17
4.1.1;Introduction;17
4.1.2;QOS Problem: CAC;18
4.1.3;Security Considerations;20
4.1.4;System Architecture;20
4.1.4.1;General Scenario Description;20
4.1.4.2;CAC System Operation;21
4.1.4.3;Control Tables;24
4.1.5;Test Platform;25
4.1.5.1;Simulation, Real Environment, or Virtual Emulation;25
4.1.5.2;Test Platform Requirements;26
4.1.5.3;Selection of Virtualization Technology;26
4.1.5.4;Physical Machine Features;26
4.1.5.5;System Implementation in the Test Platform;27
4.1.5.6;System Security;28
4.1.6;Validation and Preliminary Measures;28
4.1.7;Conclusions;31
4.1.8;References;31
4.2;Towards Real-Time Stream Quality Prediction: Predicting Video Stream Quality from Partial Stream Information;34
4.2.1;Introduction;34
4.2.2;Video Stream Characteristics;36
4.2.3;A Methodology for Real-Time Stream Prediction Using Partial Streams;37
4.2.4;Experiments;39
4.2.5;Results;40
4.2.5.1;Assigning Ratings to Partial Streams with Full Stream Training Sets;41
4.2.5.2;Assigning Ratings to Partial Streams with Partial Stream Training Sets;41
4.2.5.3;Discussion;43
4.2.6;Conclusion;45
4.2.7;References;46
4.3;Risk-Aware QoP/QoS Optimization for Multimedia Applications in Wireless Networks;48
4.3.1;Introduction;48
4.3.2;Related Work;50
4.3.3;Risk-Aware Mutli-level QoP and QoS Model;50
4.3.3.1;Multi-level QoP Model;50
4.3.3.2;Multi-level QoS Model;52
4.3.3.3;Risk-Aware Multi-level QoP/QoS Model;53
4.3.4;Generic Risk-Aware Multi-level QoP/QoS Framework;56
4.3.5;Risk-Aware Multi-level QoP/QoS Optimizations Algorithms;57
4.3.5.1;Risk-Aware Multi-level QoP Adjustment Algorithms;58
4.3.5.2;QoS Optimization Algorithms;58
4.3.6;Experimental Studies;60
4.3.6.1;Experiment Setup;60
4.3.6.2;Experimental Results;60
4.3.7;Conclusion;64
4.3.8;References;64
4.4;COCONET: Co-operative Cache Driven Overlay NETwork for p2p Vod Streaming;66
4.4.1;Introduction;66
4.4.2;Related Work;68
4.4.3;Design Principle;69
4.4.3.1;Membership Management;69
4.4.3.2;Co-operative Caching;71
4.4.3.3;Neighborship Management;71
4.4.3.4;Content Distribution Pattern;72
4.4.4;Detailed Protocol;72
4.4.4.1;Protocol for Join/Leave Operation;72
4.4.4.2;Protocol for SegmentMap Exchange;74
4.4.4.3;Protocol for Caching;74
4.4.4.4;Protocol for Retrieving Segments;75
4.4.5;Experimental Evaluation;75
4.4.5.1;Server Load;76
4.4.5.2;Storage Buffer Usage Efficiency;77
4.4.5.3;Load Balancing;78
4.4.5.4;Peer Churn/Departure;79
4.4.5.5;VCR Operations;80
4.4.6;Conclusion;81
4.4.7;References;82
5;QShine 2009 Session II – Multi-hop Wireless Networks;83
5.1;Opportunistic Multipath Routing in Wireless Mesh Networks;84
5.1.1;Introduction;84
5.1.2;Related Work;86
5.1.3;Protocol Description;87
5.1.3.1;Link Quality Estimation;87
5.1.3.2;Load-Aware Path Metric;87
5.1.3.3;Unicast-Based Opportunistic Routing;88
5.1.3.4;Approach One: Source Multipath Routing (WIMOP);88
5.1.3.5;Approach Two: Distributed Opportunistic Multipath Routing (DOMR);90
5.1.4;Evaluation;92
5.1.4.1;Simulation Setup;92
5.1.4.2;Link Quality Estimation;92
5.1.4.3;WIMOP;93
5.1.4.4;DOMR;95
5.1.5;Conclusion;97
5.1.6;References;98
5.2;Gateways Congestion-Aware Design of Multi-radio Wireless Networks;99
5.2.1;Introduction;99
5.2.2;Network Model and Problem Formulation;101
5.2.2.1;Network Model;101
5.2.2.2;Problem Formulation;103
5.2.3;Solution Approach;106
5.2.3.1;Solving Multi Objective Optimization Problem (MOOP);106
5.2.3.2;VMOPSO Algorithm;107
5.2.3.3;Solving the WMN Planning Problem Using VMOPSO;108
5.2.3.4;Complexity Study;111
5.2.4;Experimentations and Results Analysis;111
5.2.4.1;Performance Evaluation;111
5.2.4.2;A Comparison with Related Work;114
5.2.5;Conclusion;115
5.2.6;References;115
5.3;Novel Analytical Delay Model and Burst Assembly Scheme for Wireless Mesh and Optical Burst Switching Convergence;117
5.3.1;Introduction;117
5.3.2;Related Work;119
5.3.3;The Proposed Architecture;120
5.3.3.1;The WMN Part;121
5.3.3.2;The OBS Part;122
5.3.3.3;WMN and OBS Interconnection and Internetworking;122
5.3.4;End-to-End Delay Performance Model;124
5.3.4.1;End-to-End Delay in WMN;124
5.3.4.2;End-to-End Delay in OBS;125
5.3.5;Quality of Service Provisioning;126
5.3.5.1;The Control Bridge;126
5.3.5.2;Adaptive Hybrid Burst Assembly Scheme;127
5.3.6;Numerical Results;129
5.3.7;Conclusion;131
5.3.8;References;132
5.4;Evaluation of a QoS-Aware Protocol with Adaptive Feedback Scheme for Mobile Ad Hoc Networks;133
5.4.1;Introduction;133
5.4.2;Capacity of Ad Hoc Wireless Networks;134
5.4.3;QoS-Aware AODV Protocol with Adaptive Feedback Scheme;135
5.4.3.1;Route Discovery in AQA-AODV;136
5.4.3.2;Estimation of the Available Bandwidth in AQA-AODV;136
5.4.4;Performance Evaluation;137
5.4.4.1;Simulations Results;137
5.4.5;Conclusions;139
5.4.6;References;140
6;QShine 2009 Session III – Query and Coverage Issues in Sensor Networks;141
6.1;Adaptive Data Quality for Persistent Queries in Sensor Networks;142
6.1.1;Introduction;142
6.1.2;Gossip Routing Based AQP;144
6.1.3;Effectiveness of Using Gossip Routing for AQP;147
6.1.3.1;Data Set;148
6.1.3.2;Simulation Setup;148
6.1.4;Data Quality Metrics;150
6.1.5;Adaptive Approximate Querying Protocol for Persistent Queries;151
6.1.5.1;Adaptation Function;151
6.1.6;Evaluation;154
6.1.7;Related Work;156
6.1.8;Conclusion and Future Work;157
6.1.9;References;157
6.2;On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks;159
6.2.1;Introduction;159
6.2.2;System Model;160
6.2.3;Overview of the Proposed Scheme;162
6.2.3.1;Key Ideas;162
6.2.3.2;Framework;163
6.2.4;Detailed Description of the Scheme;164
6.2.4.1;A Special Case: Fixed Coverage Requirement;165
6.2.4.2;General Case: Variable Coverage Requirement;167
6.2.5;Discussions;169
6.2.5.1;Lower Bound of Required Number of Backup Nodes;169
6.2.5.2;Upper Bound of Number of Backup Nodes;170
6.2.5.3;Impact of Node Recharging Time;170
6.2.5.4;Some Practical Issues;170
6.2.6;Performance Evaluation;171
6.2.6.1;Experimental Settings, Metrics and Methodology;171
6.2.6.2;Scenario I: Same Coverage Number for All Areas;172
6.2.6.3;Scenario II: Same Coverage Number Distribution for All Areas;173
6.2.6.4;Variable Distribution of Coverage Numbers;175
6.2.7;Related Work;175
6.2.8;Conclusion;176
6.2.9;References;176
6.3;Variable Density Deployment and Topology Control for the Solution of the Sink-Hole Problem;178
6.3.1;Introduction;178
6.3.2;Related Work;179
6.3.3;Density Requirements in the Presence of Centralized Communications towards the Sink;180
6.3.4;Variable Density Self Deployment of Mobile Sensors;182
6.3.4.1;An Example of the Algorithm Execution;185
6.3.5;Joint Solution to Sensor Deployment, Selective Activation, Self-healing and Dynamic Relocation;185
6.3.5.1;Selective Activation;185
6.3.5.2;Self-healing and Dynamic Relocation;187
6.3.6;On the Use of the Virtual Force Approach for the Deployment over a AoI with Variable Density;188
6.3.7;Simulation Results;189
6.3.8;Conclusions;192
6.3.9;References;192
7;QShine 2009 Session IV – Wireless, Mobility, and Context-Aware Services;194
7.1;iDSRT: Integrated Dynamic Soft Real-Time Architecture for Critical Infrastructure Data Delivery over WLAN;195
7.1.1;Introduction;195
7.1.2;Models and Definitions;197
7.1.2.1;Network Model;197
7.1.2.2;Task Model;198
7.1.3;iDSRTFramework;198
7.1.3.1;Overview Design of iDSRT;198
7.1.3.2;Integrated Middleware Coordination (iCoord);199
7.1.3.3;DSRT (Dynamic Soft Real-Time Scheduler);202
7.1.3.4;iEDF (Implicit Earliest Deadline First Packet Scheduler);202
7.1.4;Implementation;203
7.1.4.1;DSRT Implementation;203
7.1.4.2;iEDF Implementation;205
7.1.5;Evaluation;206
7.1.5.1;Experiment Setup;206
7.1.5.2;Scenarios;206
7.1.5.3;Evaluation Metrics;207
7.1.5.4;Experiment Results;207
7.1.6;Related Work;209
7.1.7;Conclusions;210
7.1.8;References;211
7.2;Cell Breathing Based on Supply-Demand Model in Overlapping WLAN Cells;213
7.2.1;Introduction;213
7.2.2;Related Works;216
7.2.3;Problem Formulation;217
7.2.4;Supply-Demand Model;217
7.2.4.1;Formulations of Demand and Supply Power;217
7.2.4.2;Optimal User Vector Solution;219
7.2.5;Power Assignment Based On SDM;220
7.2.5.1;Continuous and Discrete Power Assignment;220
7.2.5.2;Some Key Parameters;221
7.2.6;SDM Extension;222
7.2.7;Performance Evaluation;223
7.2.8;Conclusion;226
7.2.9;References;226
7.3;Comparative Analysis of QoMIFA and Simple QoS;228
7.3.1;Introduction;228
7.3.2;State of the Art;229
7.3.3;Performance Analysis;232
7.3.3.1;Simulation Scenario;233
7.3.3.2;Resources Reservation Latency;234
7.3.3.3;Number of Dropped Packets;238
7.3.3.4;Number of Best-Effort Packets;239
7.3.4;Conclusion;240
7.3.5;References;241
7.4;Resource-Optimized Quality-Assured Ambiguous Context Mediation in Pervasive Environments;242
7.4.1;Introduction;242
7.4.1.1;Related Work;243
7.4.1.2;Our Contributions;244
7.4.2;ContextModel;244
7.4.2.1;Quality of Context Model;245
7.4.3;Context-Aware Data Fusion;247
7.4.3.1;Dynamic Bayesian Network Based Model;247
7.4.4;Optimal Sensor Parameter Selection;248
7.4.4.1;Problem Explanation;250
7.4.4.2;Results;251
7.4.5;Experimental Components and Evaluation;253
7.4.5.1;Empirical Determination of Context Estimates;253
7.4.5.2;Measurement of QoC Accuracy and Sensor Overheads;253
7.4.5.3;The Benefit of Joint Sensing;255
7.4.6;Conclusion;255
7.4.7;References;256
7.4.8;Appendix;257
8;QShine 2009 Session V – Switches, Systems and the Internet;259
8.1;Fluctuations and Lasting Trends of QoS on Intercontinental Links;260
8.1.1;Introduction;260
8.1.2;Long-Term QoS Changes in Transatlantic Connections;261
8.1.2.1;Transatlantic Cables Deployment;261
8.1.2.2;Lasting Trends in Performance;262
8.1.3;Short-Term Fluctuations in Normal Operation;265
8.1.4;Short-Term Fluctuations in the Case of Cable Fault;266
8.1.4.1;Submarine Cable Faults;266
8.1.4.2;Case Study;267
8.1.5;Conclusions;271
8.1.6;References;272
8.2;Performance-Adaptive Prediction-Based Transport Control over Dedicated Links;274
8.2.1;Introduction;274
8.2.2;Framework of PAPTC Structure;276
8.2.3;Performance Model for Data Receiver;277
8.2.3.1;Packet Processing Issues;277
8.2.3.2;Mathematical Model for Data Receiving Process;278
8.2.3.3;Predicting Bottleneck Processing Rate at the Receiver;280
8.2.4;Rate Control for Data Sender;282
8.2.5;Implementation and Experimental Results;284
8.2.5.1;Types of Acknowledgment;284
8.2.5.2;Experimental Results;284
8.2.6;Conclusion;286
8.2.7;References;287
8.3;Probabilistic Network Loads with Dependencies and the Effect on Queue Sojourn Times;289
8.3.1;Introduction;289
8.3.2;Related Work;290
8.3.3;Motivating Example;292
8.3.4;Problem Statement;293
8.3.5;Independent Jobs;294
8.3.6;Dependencies in Execution Times;295
8.3.6.1;Sources with History;296
8.3.6.2;Synchronized Sources;296
8.3.6.3;Modeling of Dependency;297
8.3.6.4;Simulation of Effect;297
8.3.7;Taking Dependencies into Account;298
8.3.7.1;Probability Bounds and Probability Boxes;298
8.3.7.2;Adaptions to Scheduling Analysis;301
8.3.8;Comparison;301
8.3.8.1;x=3 y=1.0 Example;302
8.3.8.2;x=10 y=0.66 Example;304
8.3.9;Conclusion;304
8.3.10;References;304
8.4;Providing Performance Guarantees for Buffered Crossbar Switches without Speedup;306
8.4.1;Introduction;306
8.4.2;Preliminaries;308
8.4.3;Fair and Localized Asynchronous Packet Scheduling;310
8.4.4;Performance Analysis;313
8.4.4.1;Crosspoint Buffer Size Bound;314
8.4.4.2;Switch Stability;316
8.4.4.3;Delay Guarantees;318
8.4.5;Simulation Results;319
8.4.5.1;Crosspoint Buffer Size;320
8.4.5.2;Throughput;320
8.4.5.3;Jitter;321
8.4.6;Conclusions;322
8.4.7;References;322
9;QShine 2009 Invited Session I – Resource Management in Wireless Networks;324
9.1;Joint Optimization of System Lifetime and Network Performance for Real-Time Wireless Sensor Networks;325
9.1.1;Introduction;325
9.1.2;Related Work;327
9.1.3;Formulation and Modeling;328
9.1.3.1;Supporting Multi-hop RTWSN;328
9.1.3.2;Lifetime Maximization;329
9.1.3.3;Network Utility Maximization;330
9.1.3.4;Joint Network Lifetime Maximization and Utility Maximization;331
9.1.3.5;An Illustrating Example;331
9.1.4;Joint System Lifetime and Network Utility Optimization;333
9.1.5;Distributed Algorithm;335
9.1.6;Performance Evaluations;336
9.1.6.1;Convergence;336
9.1.6.2;Illustrations of Tradeoff between System Lifetime and Network Utility;339
9.1.7;Conclusion and Future Work;339
9.1.8;References;339
9.2;Network-Assisted Radio Resource Management for Cell-Edge Performance Enhancement;342
9.2.1;Introduction;342
9.2.2;Initial User Classification and Metrics;343
9.2.2.1;Computation of User Capacities;343
9.2.2.2;Computation of Throughput;345
9.2.2.3;Initial User Classification;346
9.2.3;Strategy for User Reclassification;347
9.2.3.1;Upward RRC Switch;347
9.2.3.2;Downward RRC Switch;349
9.2.3.3;Simplified Solutions;351
9.2.3.4;Overhead of RRC Switch;352
9.2.4;Simulation Results;353
9.2.5;Conclusion;356
9.2.6;References;356
9.2.7;A Appendix: Proof of Proposition 1;357
9.2.8;B Appendix: Proof of Proposition 3;357
9.3;Malicious or Selfish? Analysis of Carrier Sense Misbehavior in IEEE 802.11 WLAN;359
9.3.1;Introduction;359
9.3.2;Related Work;360
9.3.3;Preliminaries;361
9.3.3.1;IEEE 802.11 DCF Mechanism;361
9.3.3.2;Markov Chain Model for the IEEE 802.11 Exponential BackoffMechanism;362
9.3.4;Performance Analysis with Carrier Sense Misbehavior;363
9.3.4.1;System Descriptions and Assumptions;363
9.3.4.2;Markov Chain Model for the Exponential BackoffMechanism with Carrier Sense Misbehavior;364
9.3.4.3;Saturation Throughput of Heterogeneous IEEE 802.11 WLAN with Carrier Sense Misbehavior;365
9.3.5;Simulation Study;367
9.3.6;Conclusion and Future Work;370
9.3.7;References;370
9.4;Enhanced Bandwidth Allocation for TCP Flows in WiMAX Networks;371
9.4.1;Introduction;371
9.4.2;Problem Statement;373
9.4.2.1;IEEE 802.16 Scheduling Framework;373
9.4.2.2;Bandwidth Request for TCP ACK;374
9.4.3;Modeling TCP Throughput with Bandwidth-Request Process;375
9.4.3.1;Model Derivation;375
9.4.3.2;Model Validation;378
9.4.4;Bidirectional Bandwidth Allocation;380
9.4.4.1;Proactive Bandwidth Allocation;380
9.4.4.2;Hybrid Approach;381
9.4.5;Simulation;382
9.4.5.1;Simulation Setup;382
9.4.5.2;Tradeoff between Performance and Efficiency;383
9.4.5.3;Effect of RTT;384
9.4.5.4;Effect of Packet Loss Rate;385
9.4.6;Conclusion;386
9.4.7;References;387
10;QShine 2009 Invited Session II – Overlay, P2P Networks and Service Oriented Architectures;388
10.1;A Topologically-Aware Overlay Tree for Efficient and Low-Latency Media Streaming;389
10.1.1;Introduction;389
10.1.2;Problem Formulation;390
10.1.2.1;Our System Model;390
10.1.2.2;Approach Overview;392
10.1.3;SystemOverview;392
10.1.3.1;The Musicians Subsystem;393
10.1.3.2;The Spectators Subsystem;393
10.1.3.3;Accomplishing Topology Awareness;395
10.1.3.4;Content Management;396
10.1.3.5;Initial Tree Construction;397
10.1.3.6;Run-Time Optimizations;398
10.1.3.7;Failure Recovery;399
10.1.4;Performance Evaluation;400
10.1.5;Related Work;404
10.1.6;Conclusions;404
10.1.7;References;405
10.2;Similarity Searching in Structured and Unstructured P2P Networks;406
10.2.1;Introduction;406
10.2.2;Multi-Feature Indexing Network;407
10.2.2.1;Modeling Similarity;408
10.2.2.2;Architecture;408
10.2.2.3;Properties;409
10.2.3;Structured Networks;410
10.2.3.1;GHT;410
10.2.3.2;M-Chord;411
10.2.3.3;Scalability Evaluation;412
10.2.4;Unstructured Networks;413
10.2.4.1;Architecture;414
10.2.4.2;Adaptive Query Routing;415
10.2.4.3;Adaptability and Robustness Evaluation;416
10.2.5;Prototype Applications;418
10.2.5.1;Large-Scale Image Search;418
10.2.5.2;Biometric Applications;418
10.2.6;Conclusions;420
10.2.7;References;420
10.3;Network Attack Detection Based on Peer-to-Peer Clustering of SNMP Data;423
10.3.1;Introduction;423
10.3.2;Background on Data Clustering;425
10.3.3;Description of the Proposed Framework;426
10.3.4;Test-Bed Setup and Results;430
10.3.4.1;Results;431
10.3.5;Conclusion;434
10.3.6;References;434
10.4;A Scalable Approach to QoS-Aware Self-adaption in Service-Oriented Architectures;437
10.4.1;Introduction;437
10.4.2;System Architecture;440
10.4.3;SystemModel;442
10.4.3.1;Composite Service Model;442
10.4.3.2;SLA Model;443
10.4.3.3;Service Selection Model;444
10.4.3.4;Service Provisioning Model;445
10.4.4;Optimization Problems;446
10.4.4.1;QoS Metrics;446
10.4.4.2;Second-Layer Problem: Service Selection Optimization;447
10.4.4.3;First-Layer Problem: Service Provisioning Optimization;448
10.4.5;NumericalExperiments;449
10.4.6;Conclusions;452
10.4.7;References;452
11;QShine 2009 Invited Session III – QoS and Power Consumption;454
11.1;Throughput and Energy Efficiency in IEEE 802.11 WLANs: Friends or Foes?;455
11.1.1;Introduction;455
11.1.2;Energy Consumption Analysis;456
11.1.2.1;Model;456
11.1.2.2;Validation;458
11.1.3;Configuration of 802.11;460
11.1.3.1;Throughput Maximization;461
11.1.3.2;Energy Optimization;462
11.1.4;Energy Efficiency vs. Throughput Maximization;463
11.1.5;Conclusions;465
11.1.6;References;466
11.2;On the Effects of Transmit Power Control on the Energy Consumption of WiFi Network Cards;467
11.2.1;Introduction;467
11.2.2;Energy Consumption in WiFi Cards;468
11.2.3;Energy Consumption Measurements;470
11.2.3.1;Methodology;470
11.2.3.2;Impact of Transmit Power;472
11.2.3.3;Impact of Transmit Rate;475
11.2.4;Energy Consumption Components;476
11.2.4.1;Power Amplifier;477
11.2.4.2;RF Front-End and Baseband Processing;478
11.2.4.3;Universal Serial Bus/Host Interface;478
11.2.5;Conclusions;478
11.2.6;References;479
11.3;A Novel Power-Efficient Middleware Scheme for Sensor Grid Applications;480
11.3.1;Introduction;480
11.3.2;Design Issues and Challenges;483
11.3.3;Description of the Proxy-Based Middleware;484
11.3.3.1;System Overview;484
11.3.3.2;Sensor Area;485
11.3.3.3;Scheduler;486
11.3.3.4;Resource Manager;488
11.3.4;Performance Evaluation;490
11.3.4.1;Simulation Results;491
11.3.4.2;Discussion;494
11.3.5;Conclusion;495
11.3.6;References;495
11.4;Supporting VoIP Services in IEEE 802.11e WLANs;497
11.4.1;Introduction;497
11.4.2;TSPEC and EDCA Admission Control for VoIP Services;499
11.4.3;Proposed Solution for Improving Quality of VoIP Services in 802.11e EDCA;500
11.4.3.1;System Model and Assumptions;501
11.4.3.2;Priority Queueing via EDCA Parameter Setting;502
11.4.3.3;Conservative Admission Control for VoIP Services (CAVS);503
11.4.4;Performance Evaluation;509
11.4.5;Conclusion;512
11.4.6;References;512
12;QShine 2009 Invited Session IV – Mobility and QoS Support in Heterogeneous Wireless Mesh Networks;514
12.1;Transparent and Distributed Localization of Mobile Users in Wireless Mesh Networks;515
12.1.1;Introduction;515
12.1.2;Flooding-Based Location Service;517
12.1.3;WMC Localization as a Shared Object in a DHT;519
12.1.3.1;Overview of the Proposed DHT-Based Localization Service;519
12.1.3.2;Service Architecture;520
12.1.3.3;Protocol Specification;521
12.1.4;Evaluation;525
12.1.4.1;Testbed;525
12.1.4.2;Measurement Setup;525
12.1.4.3;UDP Unidirectional Traffic;525
12.1.4.4;ICMP Bidirectional Traffic;528
12.1.4.5;TCP Bidirectional Traffic;529
12.1.5;Conclusion;530
12.1.6;References;530
12.2;Towards QoS Provisioning in a Heterogeneous Carrier-Grade Wireless Mesh Access Networks Using Unidirectional Overlay Cells;532
12.2.1;Introduction;532
12.2.1.1;Overlay Cells;535
12.2.2;Approach: Integration of Unidirectional Technologies;537
12.2.2.1;MPLS;537
12.2.2.2;Monitoring;538
12.2.2.3;Link Layer Message Forwarding;539
12.2.2.4;Path Management Protocol;540
12.2.3;Use Case: Multicast;542
12.2.4;Conclusion and Future Work;544
12.2.5;References;545
12.3;Integration of OMF-Based Testbeds in a Global-Scale Networking Facility;547
12.3.1;Introduction;547
12.3.2;Integration Scenario;548
12.3.3;Implementations Details;549
12.3.3.1;The Sliceip Tool;549
12.3.4;WILE-E Testbed;550
12.3.5;Proof-of-Concept Experiments;552
12.3.5.1;Overhead Analysis;554
12.3.5.2;Redundant Routing in a Slice;555
12.3.6;Conclusions;556
12.3.7;References;557
12.4;A Proportionally Fair Centralized Scheduler Supporting Spatial Minislot Reuse for IEEE 802.16 Mesh Networks;558
12.4.1;Introduction;558
12.4.2;Background and Related Work;559
12.4.3;IEEE 802.16 Reuse-Aware Proportional Fair Scheduling;560
12.4.3.1;Assumptions and Requirements;560
12.4.3.2;Reuse-Aware Proportional Fair Scheduling;561
12.4.3.3;Reuse-Aware Scheduling for IEEE 802.16;563
12.4.3.4;Summary;565
12.4.4;Proof-of-Concept in an IEEE 802.16 Mesh Network;565
12.4.5;Conclusion;568
12.4.6;References;568
13;QShine 2009 Invited Session V – Data and Information Processing and Management in Sensor Networks;569
13.1;Cooperative Training in Wireless Sensor and Actor Networks;570
13.1.1;Introduction;570
13.1.2;TheNetworkModel;571
13.1.3;The Cooperative Corona Training Algorithm;572
13.1.4;Algorithm Properties;574
13.1.5;Experimental Tests;576
13.1.6;Conclusion;582
13.1.7;References;582
13.1.8;Appendix;584
13.2;Multi-Agent Itinerary Planning for Wireless Sensor Networks;585
13.2.1;Introduction;585
13.2.2;Problem Statement;587
13.2.2.1;Motivation;587
13.2.2.2;A Generic Multi-Agent Itinerary Planning Algorithm;588
13.2.3;Proposed MIP Algorithm;589
13.2.4;Performance Evaluation;592
13.2.4.1;Simulation Setting;592
13.2.4.2;Simulation Results;593
13.2.5;Conclusions;597
13.2.6;References;598
13.3;Using Sensor Networks to Measure Intensity in Sporting Activities;599
13.3.1;Introduction;599
13.3.1.1;Requirements and Motivation;600
13.3.1.2;Contribution;601
13.3.2;Wireless Sensor Network Configurations;601
13.3.3;Sensor Web Architecture;602
13.3.3.1;Data Capture;602
13.3.3.2;Profile Component;604
13.3.4;SportsSense System;605
13.3.4.1;Data Enrichment;605
13.3.4.2;Classification;606
13.3.4.3;Cleaning and Normalisation;607
13.3.5;User Queries and Experiments;609
13.3.5.1;Sample Queries;609
13.3.5.2;Query Evaluation;610
13.3.6;Related Research;611
13.3.7;Conclusions;612
13.3.8;References;612
13.4;EBC: A Topology Control Algorithm for Achieving High QoS in Sensor Networks;614
13.4.1;Introduction;614
13.4.2;Related Work;617
13.4.3;Edge Betweenness Centrality: A Novel Topology Control Algorithm for Sensor Networks;618
13.4.4;Gabriel Graph: A State-of-the-Art Topology Control Method for Networks;619
13.4.5;Experimental Evaluation and Analysis;619
13.4.5.1;Simulation Model;619
13.4.5.2;Experimental Results;620
13.4.6;Conclusions and Future Work;624
13.4.7;References;625
13.5;Self-organization and Local Learning Methods for Improving the Applicability and Efficiency of Data-Centric Sensor Networks;628
13.5.1;Introduction;628
13.5.2;Related Works;630
13.5.3;W-Grid;631
13.5.3.1;Generation of Virtual Coordinates;631
13.5.3.2;Formal Model: Network Properties;632
13.5.3.3;Formal Model: Network Generation;634
13.5.3.4;Routing Algorithm;635
13.5.4;W-Grid Data Management;636
13.5.5;Local Learning;637
13.5.6;Experimental Results;638
13.5.6.1;Network Traffic Comparison;639
13.5.7;Conclusions;643
13.5.8;References;644
14;QShine 2009 Invited Session VI – Performance Optimization and Device Heterogeneity in Wireless Networks;645
14.1;Performance Analysis and Cross Layer Optimization for Multimedia Streaming over Wireless Networks;646
14.1.1;Introduction;646
14.1.2;System Model;647
14.1.2.1;System Description;647
14.1.2.2;Packet/MAC Frame Structure;647
14.1.2.3;AMC Transmission Modes and Packet Error Rate;649
14.1.2.4;FSMC Wireless Channel Model;650
14.1.2.5;QoS Criteria and AMC SNR Thresholds;651
14.1.2.6;Queueing Model;651
14.1.3;Performance Analysis for Single Stream Case;652
14.1.3.1;Refined Markov Chain;652
14.1.3.2;Video Frame Error Rate Analysis;654
14.1.3.3;Video Codec Performance Analysis and Optimization;656
14.1.4;Performance Analysis for Multiple Streams Case;656
14.1.5;Numerical Results;658
14.1.6;Conclusions;660
14.1.7;References;660
14.2;Credit-Token Based Inter-cell Radio Resource Management: A Game Theoretic Approach;662
14.2.1;Introduction;662
14.2.2;Spectrum Sharing Scheme;663
14.2.2.1;System Model;663
14.2.2.2;Credit-Token Based Spectrum Sharing Algorithm;663
14.2.3;Game Formulation;666
14.2.4;Graphical Analysis – Two Players with Same Budget;667
14.2.4.1;Traffic Case 1 - $x$_1 $\frac{<}{-}$ $\frac{0}{2}$ and $x$_2 $\frac{<}{-} 0$ - $x$_1;667
14.2.4.2;Traffic Case 2 - $x$_1 $\frac{<}{-}$ $\frac{0}{2}$ and $x$_2 > $0$ - $x$_1;667
14.2.4.3;Traffic Case 3 - $x$_1 > $\fact{0}{2}$ and $x$_2 > $\fact{0}{2}$;668
14.2.5;Mathematical Analysis – $n$ Players;669
14.2.5.1;Extension from Two-Player Game to $n$-Player Game;669
14.2.5.2;$n$-Player Game;671
14.2.6;Properties at Nash Equilibrium;672
14.2.7;Strategy-Proof Mechanism – Max Traffic Declaration;675
14.2.8;Conclusions;676
14.2.9;References;676
14.3;On Using Digital Speech Processing Techniques for Synchronization in Heterogeneous Teleconferencing;678
14.3.1;Introduction;678
14.3.2;Synchronization in Heterogeneous Teleconferencing;680
14.3.2.1;Synchronization Framework;680
14.3.2.2;Challenges;681
14.3.3;Waveform-Based Synchronization;682
14.3.3.1;Basics of Cross Correlation (XCOR);682
14.3.3.2;XCOR Synchronization Module;683
14.3.3.3;Performance Evaluation;683
14.3.4;Cepstrum-Based Synchronization;686
14.3.4.1;Basics of MFCC;686
14.3.4.2;MFCC Synchronization Module;686
14.3.4.3;Performance Evaluation;687
14.3.5;Spectrum-Based Synchronization;689
14.3.5.1;Basis of Spectrogram (SPGM);689
14.3.5.2;SPGM Synchronization Module;690
14.3.5.3;Performance Evaluation;691
14.3.6;Conclusions;692
14.3.7;References;694
14.4;Interference-Free Coexistence among Heterogenous Devices in the 60 GHz Band;695
14.4.1;Introduction;695
14.4.1.1;Multiple Competing Standards;696
14.4.1.2;Challenges – Interference among Heterogenous Devices;697
14.4.2;Case Study: ECMA-387;698
14.4.2.1;Heterogeneous Devices: Three Device Types;699
14.4.2.2;Interoperability;699
14.4.2.3;Coexistence;700
14.4.3;Synchronization Problems for Interoperability and Coexistence;703
14.4.3.1;Case I: AA-BB Pairs;704
14.4.3.2;Case II: AA-AB Pairs;704
14.4.3.3;Case III: AB-BB Pairs;705
14.4.3.4;Case IV: AB-AB Pairs;705
14.4.4;Simulation and Analysis;706
14.4.4.1;System Setup;706
14.4.4.2;Probability Upper Bound;707
14.4.4.3;Simulation Results;708
14.4.5;Conclusions;712
14.4.6;References;712
15;AAA-IDEA 2009 Session I – Networking;714
15.1;Optimisation of Power Consumption in Wired Packet Networks;715
15.1.1;Introduction;715
15.1.1.1;Prior Work on Power in Wired Networks;717
15.1.1.2;Prior Work on Power in Wireless Networks;717
15.1.1.3;Power Minimisation in Clusters of Servers;718
15.1.2;Technical Approach;719
15.1.2.1;Dynamic Network Management for Energy Optimisation;719
15.1.2.2;Design of the EMS;721
15.1.3;Some Preliminary Experiments;722
15.1.4;Conclusions;726
15.1.5;References;726
15.2;Revisiting a QoE Assessment Architecture Six Years Later: Lessons Learned and Remaining Challenges;728
15.2.1;Introduction;728
15.2.2;Original Architecture;729
15.2.3;QoE Measurement;731
15.2.4;System Architecture;732
15.2.5;Remaining Challenges: Cooperation and Scale;734
15.2.6;References;735
15.3;Efficient Authenticated Wireless Roaming via Tunnels;737
15.3.1;Introduction;737
15.3.2;Our Roaming and Accounting Solution;738
15.3.2.1;Protocol Participants and Key Material;739
15.3.2.2;Instances and Protocol Sessions;739
15.3.2.3;Trust Assumptions;739
15.3.2.4;Adversarial Model;740
15.3.2.5;Building Blocks;740
15.3.3;Roaming Protocol (EAWRT);741
15.3.3.1;Correctness of EAWRT;742
15.3.3.2;Security Definitions for EAWRT;743
15.3.3.3;Proof Sketches for the Security of EAWRT;744
15.3.4;Accounting Protocol (WRA);746
15.3.4.1;Correctness of WRA;747
15.3.4.2;Security Definitions for WRA;747
15.3.4.3;Proof Sketch for the Security of WRA;748
15.3.5;EfficiencyofEAWRTandWRA;748
15.3.6;Conclusion;749
15.3.7;References;749
16;AAA-IDEA 2009 Session II – SOA and Web Systems;751
16.1;Towards the Integration of Distributed Transactional Memories in Application Servers’ Clusters;752
16.1.1;Introduction;752
16.1.2;Related Work;754
16.1.3;TheF\'{e}nixEDU System;755
16.1.4;System Architecture;757
16.1.5;TheBFCProtocol;759
16.1.6;Conclusions and Future Work;763
16.1.7;References;765
16.2;Optimizing Distributed Execution of WS-BPEL Processes in Heterogeneous Computing Environments;767
16.2.1;Introduction;767
16.2.2;Related Work;769
16.2.3;Cost Model and Problem Formulation;770
16.2.4;Restricted Workflow Mapping Algorithm;772
16.2.4.1;rRCP Algorithm;773
16.2.5;Performance Evaluation;774
16.2.5.1;Simulation Results;774
16.2.5.2;Experimental Results;778
16.2.6;Conclusion;779
16.2.7;References;779
16.3;Optimal Service Selection Heuristics in Service Oriented Architectures;782
16.3.1;Introduction;782
16.3.2;Problem Formulation;784
16.3.3;Optimal Service Selection;785
16.3.4;Heuristic Service Selection;786
16.3.4.1;Fastest First;787
16.3.4.2;Cheapest First;787
16.3.4.3;hrCliR Algorithm;788
16.3.5;Experiments;789
16.3.5.1;Description of the Experiments;789
16.3.5.2;Results of the Experiments;791
16.3.6;Concluding Remarks;794
16.3.7;References;794
16.4;Feedback-Based Adaptive Resource Control in QoS-Aware SOA Systems with Soft Real-Time Requirements;796
16.4.1;Introduction;796
16.4.2;Background;797
16.4.2.1;Challenges in Real-Time SOA;798
16.4.2.2;Average Performance Guarantees;798
16.4.2.3;Feedback Scheduling;799
16.4.2.4;Scheduling for ART-Constraints;801
16.4.3;Adaptive Resource Scheduling;802
16.4.4;Development Results;803
16.4.5;Conclusions;805
16.4.6;References;806
17;Author Index;808