Switching White Papers
Semi-Oblivious Routing: Lower Bounds
Overview This paper initiates the study of semi-oblivious routing; a relaxation of oblivious routing which is first introduced by Racke 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.
| Publisher | Cornell University | File Format | |
|---|---|---|---|
| Date Published | January 2008 | ||
| Format | White Papers | ||
| Topics | |||



