Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Some combinatorial aspects of time-stamp systems
European Journal of Combinatorics
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Keeping track of the latest gossip in a distributed system
Distributed Computing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Determining the currency of data
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
In social media such as facebook, the most popular desire is to learn the news about other people. In this paper, we study the following problem related to information propagation: Suppose that there is a set U of N users in a social network. They meet online from time to time and share information they know about themselves and the other users in the network. Whenever a group g⊂U of users meet, they want to know who has the latest information about every user in U. A naive solution to this problem is to use timestamps. However, there are drawbacks to this scheme including the burden on the users to maintain reliable timestamps and the fact that the timestamps grow unbounded over time. It is natural to ask if it is possible to learn the latest information without using timestamps. We present an efficient method which removes the need to timestamp user information (news). Instead, only the meetings of the groups have to be indexed. Furthermore, we show that this indexing can be performed using a finite set of labels so that each user stores at most O(N2 logN) bits of information. We also show that this bound can be improved in some cases if we have further information on the topology of the network.