Distributed Computing and Networking
-
Distributed Computing and Networking: 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009, Proceedings
By Vijay Garg, Roger Wattenhofer, Kishore KothapalliStrategies. A distributed database system (DDBS) is a system consisting of data items stored in a set of sites S1, S2, S3,..., SN and communicate by message passing via underlying communication network. Replicated data in such systems ...
-
Distributed Computing and Networking: 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, Proceedings
By Shrisha RaoScalable and Distributed Mechanisms for Integrated Scheduling and Replication in Data Grids Anirban Chakrabarti and Shubhashis Sengupta Software ... Therefore, integration of data replication and scheduling strategies is important.
-
Distributed Computing and Networking: 11th International Conference, ICDCN 2010, Kolkata, India, January 3-6, 2010, Proceedings
By Jie Wu, Krishna Kant, Sriram V. PemmarajuDirectory advertisement and service request intervals are set at once and twice, respectively, ... We first report the performance with varied node mobility and then we discuss the effect node failure rates on the performance.
-
Distributed Computing and Networking: 15th International Conference, ICDCN 2014, Coimbatore, India, January 4-7, 2014, Proceedings
By Kishore Kothapalli, Mainak Chatterjee, Sergio RajsbaumFor two stateful valid quorums of messages, Q and Q, we say that Q knows Q, writing Q→ Q, if (1) Q is a quorum of Paxos messages, and some replica first sent a message in Q and then a message in Q, or (2) Q is a stateful valid quorum ...
-
Distributed Computing and Networking: 11th International Conference, ICDCN 2010, Kolkata, India, January 3-6, 2010, Proceedings
By Jie Wu, Krishna Kant, Sriram V. PemmarajuSince this paper deals only with mobile sink based non-real-time data collection, we discuss literature specifically for that mode of operation. 2.1 Single-Hop (k = 1) The primary research problem in.
-
Distributed Computing and Networking: 14th International Conference, ICDCN 2013, Mumbai, India, January 3-6, 2013. Proceedings
By Michel Raynal, Rudrapatna K. Shyamasundar, Davide FreyTree Connectivity Augmentation Problem (TCA) Instance: Complete undirected graph G = (V, E), weight function c(e) e Z", We e E, a spanning tree T = (V, E1) of G rooted at some node r € V, ...