P. D. MacKenzie, "A lower bound for order preserving broadcast in the postal model," Manuscript, University of Texas at Austin, December 1992.  Home/Search   Document Details and Download   Summary   Related Articles

....approximation. When d = de 1, the performance of the algorithm is within a factor of max f2; de 1g of optimal time. In this case, for m log n log(de 1) the running time of the algorithm is within a factor of 3 of the optimal time, independent of . Finally, it was recently shown in [13] that the family of algorithms collectively denoted by Algorithm DTREE is within a multiplicative factor of 7 of optimal time, over the whole range of n, m, and , when considering order preserving broadcast. This was shown by considering several ranges of n, m, and , choosing an appropriate ....

....near optimal algorithms for broadcasting multiple messages in the postal model [2] These algorithms, however, are more complicated, make more restrictive assumptions about the level of synchronism of the system, and do not preserve the order of the messages. In addition, it was recently shown [13] that Algorithm DTREE is within a multiplicative factor of optimal time for order preserving broadcast. It would be interesting either to develop improved event driven algorithms that preserve the order of messages or to improve the lower bound for such situations. This paper explores the ....

P. D. MacKenzie, "A lower bound for order preserving broadcast in the postal model," Manuscript, University of Texas at Austin, December 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC