730 research outputs found
Asynchronous neighborhood task synchronization
Faults are likely to occur in distributed systems. The motivation for designing self-stabilizing system is to be able to automatically recover from a faulty state. As per Dijkstra\u27s definition, a system is self-stabilizing if it converges to a desired state from an arbitrary state in a finite number of steps. The paradigm of self-stabilization is considered to be the most unified approach to designing fault-tolerant systems. Any type of faults, e.g., transient, process crashes and restart, link failures and recoveries, and byzantine faults, can be handled by a self-stabilizing system; Many applications in distributed systems involve multiple phases. Solving these applications require some degree of synchronization of phases. In this thesis research, we introduce a new problem, called asynchronous neighborhood task synchronization ( NTS ). In this problem, processes execute infinite instances of tasks, where a task consists of a set of steps. There are several requirements for this problem. Simultaneous execution of steps by the neighbors is allowed only if the steps are different. Every neighborhood is synchronized in the sense that all neighboring processes execute the same instance of a task. Although the NTS problem is applicable in nonfaulty environments, it is more challenging to solve this problem considering various types of faults. In this research, we will present a self-stabilizing solution to the NTS problem. The proposed solution is space optimal, fault containing, fully localized, and fully distributed. One of the most desirable properties of our algorithm is that it works under any (including unfair) daemon. We will discuss various applications of the NTS problem
Collision avoidance for Delay_Req messages in broadcast media
The time accuracy of the Precision Time Protocol deteriorates in consequence to Delay req/Delay resp session collisions common for applications using shared broadcast media. In this paper we propose a protocol that coordinates Delay_req/Delay_resp sessions with minimum changes to the original PTP protocol. Simulations illustrate protocol’s operation and demonstrate significant reduction of session collisions
Efficient Computation of Distance Sketches in Distributed Networks
Distance computation is one of the most fundamental primitives used in
communication networks. The cost of effectively and accurately computing
pairwise network distances can become prohibitive in large-scale networks such
as the Internet and Peer-to-Peer (P2P) networks. To negotiate the rising need
for very efficient distance computation, approximation techniques for numerous
variants of this question have recently received significant attention in the
literature. The goal is to preprocess the graph and store a small amount of
information such that whenever a query for any pairwise distance is issued, the
distance can be well approximated (i.e., with small stretch) very quickly in an
online fashion. Specifically, the pre-processing (usually) involves storing a
small sketch with each node, such that at query time only the sketches of the
concerned nodes need to be looked up to compute the approximate distance. In
this paper, we present the first theoretical study of distance sketches derived
from distance oracles in a distributed network. We first present a fast
distributed algorithm for computing approximate distance sketches, based on a
distributed implementation of the distance oracle scheme of [Thorup-Zwick, JACM
2005]. We also show how to modify this basic construction to achieve different
tradeoffs between the number of pairs for which the distance estimate is
accurate and other parameters. These tradeoffs can then be combined to give an
efficient construction of small sketches with provable average-case as well as
worst-case performance. Our algorithms use only small-sized messages and hence
are suitable for bandwidth-constrained networks, and can be used in various
networking applications such as topology discovery and construction, token
management, load balancing, monitoring overlays, and several other problems in
distributed algorithms.Comment: 18 page
A Survey on Fault Tolerance Techniques for Wireless Vehicular Networks
Future intelligent transportation systems (ITS) hold the promise of supporting the operation of safety-critical applications, such as cooperative self-driving cars. For that purpose, the communications among vehicles and with the road-side infrastructure will need to fulfil the strict real-time guarantees and challenging dependability requirements. These safety requisites are particularly important in wireless vehicular networks, where road traffic presents several threats to human life. This paper presents a systematic survey on fault tolerance techniques in the area of vehicular communications. The work provides a literature review of publications in journals and conferences proceedings, available through a set of different search databases (IEEE Xplore, Web of Science, Scopus and ScienceDirect). A systematic method, based on the preferred reporting items for systematic reviews and meta-analyses (PRISMA) Statement was conducted in order to identify the relevant papers for this survey. After that, the selected articles were analysed and categorised according to the type of redundancy, corresponding to three main groups (temporal, spatial and information redundancy). Finally, a comparison of the core features among the different solutions is presented, together with a brief discussion regarding the main drawbacks of the existing solutions, as well as the necessary steps to provide an integrated fault-tolerant approach to the future vehicular communications systems
- …