DRwp F : A Fault Tolerant Distributed Routing Calculi
نویسندگان
چکیده
منابع مشابه
DRω/πF : A Fault Tolerant Distributed Routing Calculi
We design a new language DRπ F in which we extend the language DRπ to handle node failure during communication. We have extended the reduction semantics of DRπ . For handling the node failure we describe two tables at router: One is routing table contains name mapping for forward travel of messages and other is a database of all active nodes at any router. Further we discuss the new node creati...
متن کاملDistributed Fault-tolerant Routing in a Hypercube
A ABSTRACT connected hypercube containing faulty nodes/links is called an injured hypercube, f whereas a hypercube without faulty components is called a healthy hypercube. To allow non-aulty nodes in an injured hypercube to communicate with one another, each hypercube node has to be equipped with enough information so as to make correct routing decisions, and 1 y c update the information whenev...
متن کاملFault-tolerant Distributed Systems
Distributed systems have two key advantages: they increase the quality of our interaction with computers and the quantity of resources available to us. The quality increases as components of a distributed system hide failures from users and render a service more reliable (safer from loss) andmore available (less downtime). Increases in quantity, such as computational power and storage capacity,...
متن کاملFault Tolerant Distributed Computing
The Clouds storage management system supports the object and action primitives provided by the Clouds kernel. Particularly, the storage manager is concerned with mapping object data into virtual memory and providing action and crash recovery for recoverable objects. This document presents some of the technical details in the testbed implementation of the storage manager. The storage manager's g...
متن کاملFault-tolerant distributed algorithms
The following thesis contains several results regarding communication complexity of two basic distributed problems: gossiping and consensus. Gossiping is a problem of exchanging initial knowledge between all processes. Consensus is a problem of making a common decision by all processes. The thesis consist of two parts. First part is devoted to the gossiping problem, analyzed in three different ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/4973-7239