Network Synchronization with Polylogarithmic Overhead
نویسندگان
چکیده
The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the entire network G(V; E) to participate in each pulse of the synchronization process. As a result, the communication overhead of existing synchro-nizers depends linearly on the number n of the network nodes. This paper presents a novel type of synchronizer, whose overhead is only poly-logarithmically dependent on n. This synchronizer can also be realized with polylog(n) space. This polylog-overhead synchronizer is based on involving only the \relevant" portions of the network in the synchronization process.
منابع مشابه
Location Management Handoff Overhead in Hierarchically Organized Mobile Ad hoc Networks
Control overhead in a mobile ad hoc network may be reduced through hierarchical routing. However, to facilitate packet forwarding in a hierarchically organized network, each datagram must specify the hierarchical address of the destination. Maintaining and acquiring hierarchical addresses represents a location management (LM) problem and incurs control overhead in addition to that of a routing ...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملClustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
-Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the communication overhead incurred by these procedures. Further, there is no published investigation of the overhead associated with the recursive application of clustering algorithms to support hierarchical routing. This p...
متن کاملComputer Network Time Synchronization using a Low Cost GPS Engine
Accurate and reliable time is necessary for financial and legal transactions, transportation, distribution systems, and many other applications. Time synchronization protocols such as NTP (the Network Time Protocol) have kept clocks of such applications synchronized to each other for many years. Nowadays there are many commercial GPS based NTP time server products at the market but they almost ...
متن کاملPrivate Information Retrieval Based On Fully Homomorphic Encryption
We propose a construction of a single database private information retrieval system using fully homomorphic encryption. The construction results in a system with Ω(log2 n) communication complexity, and polylogarithmic computational overhead, in the size of the database. An improved construction is also proposed, which reduces the client’s communication overhead, and leaves open the possibility ...
متن کامل