Failure detectors were first proposed as an abstraction that makes it possible to solve consensus in asynchronous systems. A failure detector is a distributed oracle that provides information about the state of processes of a distributed system. This work presents a failure detection service based on a gossip strategy. The service was implemented on the JXTA platform. A simulator was also imple...

Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change. This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the follo...

Current trends suggest future software systems will rely on service-discovery protocols to combine and recombine distributed services dynamically in reaction to changing conditions. We investigate the ability of selected designs for service-discovery protocols to support real-time distributed control applications by detecting and recovering from failure of remote services. We model two architec...

One of the main design goals of the Internet is robustness against failures. Normally, this is accomplished by redundancy and dynamic routing protocols that automatically adapt to failures: If a link is unavailable, data packets can generally be sent via alternative paths. An essential requirement for this is a fast mechanism for failure detection, since routing protocols can only start to rero...

The left ventricular ejection fraction (LVEF) test rate is increasingly used as a quality of care indicator for patients with heart failure. Our study produced benchmark LVEF test rates in a Medicare fee-for-service population for consideration by a clinical panel assembled by the Health Care Financing Administration. Our sample consisted of 46,583 beneficiaries admitted to the hospital for hea...

Structured Abstract Purpose: Despite having been widely studied in traditional (bricks-and-mortar) services, the effect of service failures and recovery on customer loyalty has received only limited attention in the context of e-services. Taking the default stance that theory from traditional services will find replication in e-services, this study sets out to empirically test the following set...

Businesses offer complex services to the users, which can’t be provided by a single Web Service. A Composite Web Service provides more complicated function, by composing multiple Web services. A composite service is more susceptible to failure than an atomic service. During the execution of a Composite Web Service, if one Component Service fails or becomes unavailable, the whole Composite Web S...

Grid computing presents a new trend to distributed and Internet computing to coordinate large scale resources sharing and problem solving in dynamic, multi-institutional virtual organizations. Due to the diverse failures and error conditions in the grid environments, developing, deploying, and executing applications over the grid is a challenge, thus dependability is a key factor for grid compu...

Many atomic broadcast algorithms have been published in the last twenty years. Token-based algorithms represent a large class of these algorithms. Interestingly all the token-based atomic broadcast algorithms rely on a group membership service, i.e., none of them uses failure detectors. The paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector ...