@MISC{_greedyon-line, author = {}, title = {GREEDY ON-LINE FILE TRANSFER ROUTING*}, year = {} }

Share

OpenURL

Abstract

ABSTRACT We study the performance of a simple greedy on-linealgorithm for routing large file transfers in a network. The goal of the algorithm is to minimize network con-gestion. We show that the competitive ratio of the greedy algorithm is O \Gamma L min \Phi \Lambda * , I\Psi log(nI)\Delta where Lis the length of the longest path assigned to a file transfer, \Lambda * is the ratio of the maximum to minimum filelength, I is a lower bound on the overlap of optimalpaths, and n is the number of nodes in the network.We also show that this upper bound is close to being tight when L is small by proving that the competitiveratio is \Omega \Gamma L + log \Gamma nL- L\Delta \Delta.