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.

Further White Paper Details
PublisherCornell University File FormatPDF
Date PublishedJanuary 2008
FormatWhite Papers   
Topics
E4 embraces web 2.0 audience

E4 embraces web 2.0 audience

Case study: How the Channel 4's teen channel put its mind to building a community website... more

Danone on health kick with Itil

Danone on health kick with Itil

Case study: Food company making IT easier to manage more

Cheat Sheet: Cloud computing

Cheat Sheet: Cloud computing

A tech storm is brewing...  more


Quick Sitemap Links: