Monica Dixit

Learn More
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(More)
Distributed protocols executing in uncertain environments, like the Internet, had better adapt dynamically to environment changes in order to preserve 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(More)
Algorithms for solving distributed system problems, such as consensus, often use timeouts as a mean to achieve progress, even if encapsulated in failure detection services. They are designed in a way that safety is always preserved despite timeouts being too small or too large. A “reasonable” timeout value is usually selected, such that the run-time(More)
Unreliable failure detectors are a fundamental building block in the design of reliable distributed systems. But unreliability must be bounded, despite the uncertainties affecting the timeliness of communication. This is why it is important to reason in terms of the quality of service (QoS) of failure detectors, both in their specification and evaluation.(More)
Distributed protocols executing in uncertain environments, like the Internet, had better adapt dynamically to environment changes in order to preserve QoS. In a previous work, it was shown that QoS adaptation should be dependable, if correctness of protocol properties is to be maintained. In this paper we provide concrete strategies and methodologies to(More)
Distributed applications executing in probabilistic environments, like the Internet, often need to make timing assumptions, for instance about the maximum message delay or the round-trip delay. In the case of adaptive systems these bounds should be computed at run-time, using probabilistic or other more or less ad hoc approaches, typically with the(More)
When network delays are unstable and susceptible to network contention, such as in wireless environments, it becomes important to dynamically adapt timeout values in order to address performance concerns. In this paper we discuss the problem of transforming static timeout-based protocols into protocols that dynamically select timeout values for improved(More)
Algorithms for solving distributed systems problems often use timeouts as a means to achieve progress. They are designed in a way that safety is always preserved despite timeouts being too small or too large. A conservatively large static timeout value is usually selected, such that the overall system performance is acceptable in the normal case. This(More)
The main objectives of WP2 are to define a resilient architecture and to develop a range of middleware solutions (i.e. algorithms, protocols, services) for resilience to be applied in the design of highly available, reliable and trustworthy networking solutions. This deliverable presents the HIDENETS resilient architecture (final version), which extends and(More)