Thanks for the reply. Somehow my message was not going to this list. So I took that time to dig more and read lamport's paper. There he gives the how to break the tie just as you guys said. I was following Tannenbaum's book and this was not mentioned. Hence was quite confused. :)
On Tue, Apr 13, 2010 at 10:06 PM, David-Sarah Hopwood < [email protected]> wrote: > nascent mind wrote: > > Hi all, > > > > I am reading up on totally ordered multicasting and I find that all > > processes have the same message order in its queue. Does this work on > > concurrent messages or messages having the same timestamp? > > It's easy to ensure that distinct messages effectively cannot have the > same timestamp, by having some rule for breaking ties -- for example by > a lexicographic ordering of (timestamp, sending server, message contents). > > -- > David-Sarah Hopwood ⚥ http://davidsarah.livejournal.com > > > _______________________________________________ > p2p-hackers mailing list > [email protected] > http://lists.zooko.com/mailman/listinfo/p2p-hackers > >
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
