34174199
Selfish Stabilization
2246201
Code Stabilization
Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of self-stabilization if faults can also affect (i.e., augment) the program code of a system. A code stabilizing system automatically recovers from (almost) arbitrary perturbations of its program code. We prove some lower bounds for code stabilizing systems and argue that code stabilization has many resemblances to the area of integrity management in the domain of security.
11369250
Self-optimizing Peer-to-Peer Networks with Selfish Processes
Request patterns in peer-to-peer networks are not uniform, and the cost of communication depends on the traffic flows among peers. This paper illustrates how processes in an overlay network can use the information about traffic flow pattern and spontaneously adjust the topology to minimize their communication costs. Four different self-optimization protocols are presented. The selfish protocols allow peers to modify their routing tables to suit their individual needs, and are easy to implement, but the improvements are limited. Compared to this, the altruistic protocols that allow peers to adjust the routing tables based on the needs of other processes, promise a better performance. Since selfish peers may not comply, a penalty mechanism is proposed to discourage selfishness.
32010004
Binary Self-Stabilization in Distributed Systems
Abstract Dijkstra introduced the problem of self-stabilization in distributed systems as an interesting exercise for achieving global convergence using local actions. In all the papers dealing with self-stabilizing systems so far, it has been assumed that each component machine of the distributed system has at least three states. This paper illustrates that it is feasible to design a self-stabilizing system with two-state or binary machines at the expense of a larger atomicity.
10257099
An alternative solution to a problem on self-stabilization
Dijkstra [4, 5] introduced the problem of self-stabilization in distributed systems as an interesting exercise for achieving global convergence through local actions. In [4] he presented three solutions to a specific version of the self-stabilization problem, one of which was proved in [6]. This paper presents an alternative solution of his self-stabilization problem with four-state machines.
33976120
Concurrent Reading and Writing with Mobile Agents
This paper presents a method using which a set of reading and writing agents concurrently read and update the global state of the network. In addition to the consistency of the snapshot and the reset states, our protocol preserves the atomicity of the reads and writes, despite the fact these operations are non-blocking. Potential applications include the design of multi-agent protocols for self-stabilization, self-healing and adaptation.
29763170
Fractal image compression: a randomized approach
The fractal image compression is inherently time intensive and thus there is a growing need to increase its speedup. This paper presents a fast encoding scheme where the domain blocks are searched randomly for every range block. An analysis of the basic fractal image compression method has been carried out and on the basis of the analysis a method for image characterization has been proposed. Then a detailed theoretical analysis of this randomized fractal compression scheme has been presented and the results are validated with the experimental ones. The random approach has been found to be quite efficient giving considerable increase in speed-up compared to several other approaches.
6735470
FraNtiC: A Fractal Geometric Framework for Mesh-Based Wireless Access Networks
The design of the access networks of next generation broadband wireless systems requires special attention in the light of changing network characteristics. In this paper, we present a mesh-based distributed radio access network (RAN) framework for future wireless systems. Using short, high bandwidth optical wireless links to interconnect the various network elements, we identify a generic fractal or self similar structure in the network. A mathematical model for the framework is presented and the benefits of its scale-invariant properties on robustness, reliability and flexibility analyzed. We focus on three design parameters - carrier-class network reliability, network exposure due to failure conditions and system cost. The dynamics of these parameters on our proposed architecture are studied and compared against existing access network topologies like tree/ring and square-grid. The generality and recursive nature of our framework lends itself to be applied in interconnecting various heterogeneous broadband wireless access networks of the future
15460911
Polyhedral sampling for multiattribute preference elicitation
A basic requirement for running multiattribute auctions is knowledge of the utility function of the buyer that trades off nonprice attributes against price. We present and study an approach that elicits this preference structure based on a markovian polyhedral sampling scheme called the "Hit-and-Run" algorithm. An advantage of this technique is its relative simplicity - it relies only on matrix algebra as opposed to the use of nonlinear optimization techniques by other methods in the literature. Computational results suggest that this method is fast and accurate.
5608135
Low-power weighted pseudo-random BIST using special scan cells
In this paper, a technique for weighted pseudo-random built-in self-test (BIST) of VLSI circuits is proposed, which uses special scan cells and a new weight selection algorithm to achieve low power dissipation. It is based on weighted pseudo-random scan testing in which only 3 weight values are used - 2 fixed values (0 or 1) and 1 random value (0.5). A new weight selection algorithm is used to select a set of weights that achieves high fault coverage while reducing power. The idea is to minimize power by careful selection of the set of scan cells having fixed values (0 or 1) in order to reduce switching activity. To implement this in hardware, a new scan cell design is proposed that can do scan and capture in the normal mode as well as fixed-bit mode. The new scan cell hardware increases the area of a typical circuit by less than 4%, but reduces power by as much as 96%, as indicated in experiments performed on benchmark circuits.
30827173
Implementation of MPI over HTTP
Message Passing Interface[2] is the de facto standard for multicomputer and cluster message passing;. In this paper we explore a new paradigm of high performance distributed computing by implementing a message passing interface over HTTP[1]. This provides a platform independent implementation of MPI and also develops a base for web based computation to achieve global parallel processing. The conventional approach to message passing is through the use of Parallel Virtual Machine(PVM) or MPI software packages that optimize the communication and the synchronization functions for the message passing paradigm needed in high performance distributed computing environments. However the recent trend in Internet communication has been to use the HTTP for inter-linking information and files across the World Wide Web. The HTTP [1], over the years has matured to be a very efficient tool for communication and is fit enough to warrant consideration as a vehicle for inter-processor communication. The perfor ance of our implementation was compared with the standard MPI implementation over a cluster of workstations connected by a Shared Ethernet network and the results are very encouraging.