38254762
Update-Efficient Data Structures for Dynamic IP Router Tables
11020739
Jigsaw Texture Synthesis
Texture synthesis aims to seamlessly extend a sample texture. This can be achieved by reproducing the texture's recognisable patterns along with minimising the occurrences of undesirable image characteristics such as disjoint image features. Presently, patch-based methods have consistently produced the most impressive results. These methods involve aligning and stitching texture patches together. However, image inconsistencies exist when image features are misaligned; they are either fused together or abruptly cut off. Our method minimises the occurrences of these anomalies by using image edges to align patches and redefine their boundaries to preserve texture features. This implementation requires little to no user-defined variables or iterations and can be practically scalable given some pre-computation.
16977816
Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements
Databases have been mandated as the chosen platform to develop automated control systems for environments where the state of the system changes rapidly and actions need to be taken with timing constraints, for example, stock trading, air traffic control, network management, and process control to name a few. Input data in such systems come from sensors distributed throughout the physical environment being monitored. As the system state changes rapidly, the sensors report information fast and with high volumes. Control decisions in such systems are highly dependent on the accuracy and timeliness of such recorded sensor-reported data. In this paper we suggest ways to algorithmically maintain the accuracy and timeliness of sensor data by enforcing two properties termedrecency andtemporal consistency. Simultaneously, our algorithms also attempt to satisfyquality of service requirements on response times of queries submitted in such systems. The performance of these algorithms is validated through an extensive simulation.
2213436
MANDATE: MAnaging Networks Using DAtabase TEchnology
There has been a growing demand for the development of tools to manage enterprise communication networks. A management information database is the heart of a network management system-it provides the interface between all functions of the network management system and, therefore, has to provide sophisticated functionality allied with high performance. The authors introduce the design of MANDATE (MAnaging Networks using DAtabase TEchnology), a proposed database system for effectively supporting the management of large enterprise networks. The MANDATE design makes a conscious attempt to take advantage of the special characteristics of network data and transactions, and of advances in database technology, to efficiently derive some of the required management functionality. >
1427545
Self-stabilizing mutual exclusion using unfair distributed scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges infinite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. All existing probabilistic self-stabilizing mutual exclusion algorithms designed to work under an unfair distributed scheduler suffer from the following common drawback: Once stabilized, there exists no upper bound of time between two executions of the critical section at a given node. We present the first probabilistic self-stabilizing algorithm that guarantees such a bound (O(n/sup 3/), where n is the network size) while working using an unfair distributed scheduler. As the scheduling adversary gets weaker the bound gets better. Our algorithm works in an anonymous unidirectional ring of any size and has a O(n/sup 3/) expected stabilization time.
60197858
Self-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most commonly used in parallel architectures in which messages are sent in small fragments, called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g., memory corruption or communication hazards) for a given protocol. Self-stabilization guarantees that the network recovers to a correct behavior in a finite amount of time, without the need for human intervention. Self-stabilization also guarantees the safety property, meaning that once the network is in a legitimate state, it will remain there until another fault occurs.
This paper presents the first self-stabilizing network algorithm in the wormhole routing model, using the unidirectional ring topology. Our solution benefits from wormhole routing by providing high throughput and low latency, and from self-stabilization by ensuring automatic resilience to all possible transient failures.
205481178
Stabilizing mobile philosophers
We present a self-stabilizing solution to a new version of the dining philosophers problem. We call this problem mobile philosophers problem because the philosophers can move around a logical ring formed out of a dynamic network.