dc.contributor.author Kleinberg, Jon M. en_US dc.date.accessioned 2007-04-23T16:29:33Z dc.date.available 2007-04-23T16:29:33Z dc.date.issued 1993-05 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1350 en_US dc.identifier.uri https://hdl.handle.net/1813/6120 dc.description.abstract We consider the class of balancing algorithms for two servers. Such algorithms have appeared in a number of the early papers on this problem; they are so named because they seek to "balance" the distance travelled evenly among the servers. In this paper, we show a universal lower bound on the competitive ratio of any balancing algorithm for two servers. The lower bound is equal to (5 + $\sqrt{7}$)/2 ($\sim$ 3.82), and consequently shows that no optimal on-line algorithm for two servers can be expressed as a balancing algorithm. en_US dc.format.extent 555083 bytes dc.format.extent 126524 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title A Lower Bound for Two-Server Balancing Algorithms en_US dc.type technical report en_US
﻿