Abstract:We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in ⍀( ͌ Ᏸm) and O( ͌ Ᏸᏸm), where m is the number of links in the network, Ᏸ is the maximum ratio, over all requests, of the length of the longest path for the request to the length of the shortest path for the request, and ᏸ is the ratio of the max… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.