Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2016
Conversational intelligence analysis
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 42, Pages 1–6https://doi.org/10.1145/2833312.2849568Social networks foster the development of social sensing to gather data about situations in the environment. Making sense of this information is, however, a challenge because the process is not linear and additional sensed information may be needed to ...
- research-articleJanuary 2016
Entity reconciliation in a multi-camera network
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 41, Pages 1–6https://doi.org/10.1145/2833312.2849566Location traces are becoming fairly abundant with the introduction of various mobile devices such as smartphones, in-car navigation units, and video cameras. Each individual type of device generates different features about a mobile entity along with ...
- research-articleJanuary 2016
Distributed communication in bare-bones wireless networks
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 1, Pages 1–10https://doi.org/10.1145/2833312.2833454We consider wireless networks in which the effects of interference are determined by the SINR model. We address the question of structuring distributed communication when stations have very limited individual capabilities. In particular, nodes do not ...
- short-paperJanuary 2016
Debunking the myth that tight packing is energy conserving
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 20, Pages 1–4https://doi.org/10.1145/2833312.2833447Energy takes about half the operational expenses of data centers making energy conservation a critical goal. Fine-grained control over frequency of processors aids in reducing power at the cost of performance degradation. Placing tasks on servers is ...
- short-paperJanuary 2016
A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 8, Pages 1–4https://doi.org/10.1145/2833312.2833444Leader election is a key service for many dependable distributed systems. It eases the consistent management of replicas in current highly available computing scenarios. This paper presents a new leader election algorithm for crash-recovery and omission ...
- research-articleJanuary 2016
Compact routing messages in self-healing trees
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 23, Pages 1–10https://doi.org/10.1145/2833312.2833328Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact ...
- research-articleJanuary 2016
On perfectly secret message transmission in digraphs tolerating dual failures
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 29, Pages 1–10https://doi.org/10.1145/2833312.2833327Consider a synchronous distributed network which is partly controlled by an adversary. In a Perfectly Secret Message Transmission(PSMT) protocol, the sender S wishes to transmit a message to the receiver R such that the adversary learns nothing about ...
- research-articleJanuary 2016
String matching query verification on cloud-hosted databases
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 17, Pages 1–10https://doi.org/10.1145/2833312.2833326Database query verification schemes attempt to provide authenticity, completeness, and freshness guarantees for queries executed on untrusted cloud servers. A number of such schemes currently exist in the literature, allowing query verification for ...
- research-articleJanuary 2016
Shared-object system equilibria: delay and throughput analysis
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 30, Pages 1–10https://doi.org/10.1145/2833312.2833325We consider shared-object systems that require their threads to fulfill the system jobs by first acquiring sequentially the objects needed for the jobs and then holding on to them until the job completion. Such systems are in the core of a variety of ...
- research-articleJanuary 2016
Fast consensus under eventually stabilizing message adversaries
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 7, Pages 1–10https://doi.org/10.1145/2833312.2833323This paper1 is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting ...
- research-articleJanuary 2016
STIC-D: algorithmic techniques for efficient parallel pagerank computation on real-world graphs
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 15, Pages 1–10https://doi.org/10.1145/2833312.2833322Computing metrics on nodes of a graph is an essential step in understanding the properties of the graph. Pagerank is one such metric that is popular and is being used to measure the importance of nodes in not only web graphs but also in social networks, ...
- research-articleJanuary 2016
Tight self-stabilizing mobile byzantine-tolerant atomic register
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 6, Pages 1–10https://doi.org/10.1145/2833312.2833320This paper proposes the first implementation of a self-stabilizing atomic register that is tolerant to both Mobile Byzantine Agents and transient failures. The register is maintained by n servers and our algorithm tolerates (i) any number of transient ...
- research-articleJanuary 2016
Evacuating two robots from multiple unknown exits in a circle
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 28, Pages 1–8https://doi.org/10.1145/2833312.2833318Distributed on a unit circle are k exits. Two autonomous mobile robots are placed on the circle. Each robot has a maximum speed of 1 and the robots can communicate wirelessly. The robots have a map of the domain, including exits, but do not have ...
- research-articleJanuary 2016
Retricoin: Bitcoin based on compact proofs of retrievability
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 14, Pages 1–10https://doi.org/10.1145/2833312.2833317Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In ...
- research-articleJanuary 2016
Group mutual exclusion in linear time and space
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 22, Pages 1–10https://doi.org/10.1145/2833312.2833316We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served. Both our algorithms use only simple read and write ...
- research-articleJanuary 2016
Local checkability, no strings attached
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 21, Pages 1–10https://doi.org/10.1145/2833312.2833315In this work we study local checkability of network properties like s-t reachability, or whether the network is acyclic or contains a cycle. A structural property S of a graph G is locally checkable, if there is a prover-and-verifier pair (P, V) as ...
- research-articleJanuary 2016
D8-tree: a de-normalized approach for multidimensional data analysis on key-value databases
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 18, Pages 1–10https://doi.org/10.1145/2833312.2833314The shift to more parallel and distributed computer architectures changed how data is managed consequently giving birth to a new generation of software products, namely NoSQL. These products offer a scalable and reliable solution for "Big Data", but ...
- research-articleJanuary 2016
Modular randomized byzantine k-set agreement in asynchronous message-passing systems
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingJanuary 2016, Article No.: 5, Pages 1–10https://doi.org/10.1145/2833312.2833313k-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of n processes, where up to t may commit failures, let us assume that each process proposes a value. The problem consists in defining an algorithm such that ...