TY - GEN
T1 - Graded channel reservation with path switching in ultra high capacity networks
AU - Cohen, Reuven
AU - Fazlollahi, Niloofar
AU - Starobinski, David
PY - 2006
Y1 - 2006
N2 - We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify minimum bandwidth and duration requirements for their connections. GCR returns the highest graded path, selected according to a general, multi-criteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. The computational complexity is polynomial in the size of the graph and the number of pending requests. We introduce a number of variants to GCR, including one that that provides the capability to switch between different paths during a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the saturation throughput by as much as 50%.
AB - We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify minimum bandwidth and duration requirements for their connections. GCR returns the highest graded path, selected according to a general, multi-criteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. The computational complexity is polynomial in the size of the graph and the number of pending requests. We introduce a number of variants to GCR, including one that that provides the capability to switch between different paths during a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the saturation throughput by as much as 50%.
UR - http://www.scopus.com/inward/record.url?scp=51749110026&partnerID=8YFLogxK
U2 - 10.1109/BROADNETS.2006.4374422
DO - 10.1109/BROADNETS.2006.4374422
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:51749110026
SN - 1424404258
SN - 9781424404254
T3 - 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006
BT - 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006
T2 - 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006
Y2 - 1 October 2006 through 5 October 2006
ER -