#### Filter Results:

#### Publication Year

2007

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—Large-scale storage systems are crucial components in data-intensive applications such as search engine clusters, video-on-demand servers, sensor networks and grid computing. A storage server typically consists of a set of storage devices. In such systems, data layouts may need to be reconfigured over time for load balancing or in the event of system… (More)

The at-most-once problem in shared memory asks for the completion of a number of tasks by a set of independent processors while adhering to " at most once " semantics. At-most-once algorithms are evaluated in terms of effectiveness, which is a measure that expresses the total number of tasks completed at-most-once in the worst case. Motivated by the lack of… (More)

A fundamental problem in distributed computing is the task of cooperatively executing a given set of t tasks by p processors where the communication medium is dynamic and subject to failures. The dynamics of the communication medium lead to groups of processors being disconnected and possibly reconnected during the entire course of the computation. The… (More)

We consider a variant of edge coloring problem, which arises in multi-channel wireless networks. We are given a graph´ÎÎµ, and constraint Ú for each Ú, which is the number of colors that edges incident to Ú can use. In addition, we have a constraint on the number of colors available in the network (denoted as). For a pair of edges incident to a vertex, they… (More)

A node replication attack against a wireless sensor network involves surreptitious efforts by an adversary to insert duplicate sensor nodes into the network while avoiding detection. Due to the lack of tamper-resistant hardware and the low cost of sensor nodes, launching replication attacks takes little effort to carry out. Naturally, detecting these… (More)

- Chadi Kari
- ArXiv
- 2010

In this manuscript, we consider the problems of channel assignment in wireless networks and data migration in heterogeneous storage systems. We show that a soft edge coloring approach to both problems gives rigorous approximation guarantees. In the channel assignment problem arising in wireless networks, we are given a graph G = (V, E), and the number of… (More)

- ‹
- 1
- ›