Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Enabling QoS adaptation decisions for Internet applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on high-performance protocol architectures
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Evidence for long-tailed distributions in the internet
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On the Quality of Service of Failure Detectors
IEEE Transactions on Computers
Specification, Mapping and Control for QoS Adaptation
Real-Time Systems
The Timely Computing Base Model and Architecture
IEEE Transactions on Computers
A Dynamic Replica Selection Algorithm for Tolerating Timing Faults
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
On the Distribution of Round-Trip Delays in TCP/IP Networks
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Experimental Evaluation of the QoS of Failure Detectors on Wide Area Network
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Measurements of In-Motion 802.11 Networking
WMCSA '06 Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications
Identifying MMORPG bots: a traffic analysis approach
Proceedings of the 2006 ACM SIGCHI international conference on Advances in computer entertainment technology
Self-star Properties in Complex Information Systems: Conceptual and Practical Foundations (Lecture Notes in Computer Science)
Hidden problems of asynchronous proactive recovery
HotDep'07 Proceedings of the 3rd workshop on on Hot Topics in System Dependability
A framework for dependable QoS adaptation in probabilistic environments
Proceedings of the 2008 ACM symposium on Applied computing
Loss and Delay Measurements of Internet Backbones
Computer Communications
Adaptare-FD: A Dependability-Oriented Adaptive Failure Detector
SRDS '10 Proceedings of the 2010 29th IEEE Symposium on Reliable Distributed Systems
Measurement and analysis of single-hop delay on an IP backbone network
IEEE Journal on Selected Areas in Communications
Timeout-based adaptive consensus: improving performance through adaptation
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Distributed protocols executing in uncertain environments, like the Internet or ambient computing systems, should dynamically adapt to environment changes in order to preserve Quality of Service (QoS). In earlier work, it was shown that QoS adaptation should be dependable, if correctness of protocol properties is to be maintained. More recently, some ideas concerning specific strategies and methodologies for improving QoS adaptation have been proposed. In this article we describe Adaptare, a complete framework for dependable QoS adaptation. We assume that during its lifetime, a system alternates periods where its temporal behavior is well characterized, with transition periods during which a variation of the environment conditions occurs. Our method is based on the following: if the environment is generically characterized in analytical terms, and we can detect the alternation of these stable and transient phases, we can improve the effectiveness and dependability of QoS adaptation. To prove our point we provide detailed evaluation results of the proposed solutions. Our evaluation is based on synthetic data flows generated from probabilistic distributions, as well as on real data traces collected in various Internet-based environments. We compare our solution with other approaches and we show that Adaptare, albeit more complex, is very effective, allowing protocols to adapt to the available resources in a dependable way.