Semi-oblivious routing

We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. In semi-oblivious routing like oblivious routing, the algorithm should select only a polynomial number of paths between the source and the sink of each commodity, but unlike oblivious routing, the flow from each source to its sink is not just a scalar multiple of the single-commodity flow; any amount of flow can be sent along each selected path. Semi-oblivious routing has several applications in traffic engineering and VLSI routing. Trivially, any competitive ratio ρ for oblivious routing (includling the polylogarthimic ratio in undirected graphs obtained by R¨acke) also implies competitive ratio ρ for semioblivious routing. In this paper, we focus on lower bounds. We rule out the possibility of O(1) competitive ratio for semi-oblivious routing in undirected graphs by providing a lower bound of Ω( lo...

• Type: Conference
• Year: 2006
• Where: SPAA
• Authors: Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
• Keywords: Competitive Ratio, Distributed And Parallel Computing, Oblivious Routing, Semi-oblivious Routing, SPAA 2006