Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
01 January 2002
In this paper, we consider the problem of efficient dynamic routing of restorable conenctions when backup sharing is not allowed. Our objective is to be able to route as many connections as possible for one-at-a-time arrivals and no knowledge of future arrivals. Since sharing cannot be used for achieving efficiency, the goal is to achieve efficiency by improved path selection.