Title :
CAM04-3: Optimal Routing Between Alternate Paths With Different Network Transit Delays
Author :
Elhafsi, Essia H. ; Molle, Mart
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of California, Riverside, CA
fDate :
Nov. 27 2006-Dec. 1 2006
Abstract :
We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder of the network transit delay beyond this router are different for the two paths, so a good routing policy can reduce the end-to-end delay by favoring the faster path. Thus, we propose and solve the optimal path-determination problem for a router, which minimizes the average network transit delay for a flow by dynamically assigning each packet to one of the available output ports based on their respective instantaneous queue lengths and on the average network transit delay for the associated path. We assume that all outgoing link speeds at the router are equal, but we generalize the model to allow each output port to serve a link group (such as an optical fiber using WDM) that consists of multiple physical channels running in parallel. By formulating path-selection as a Markov Decision Problem, we show that the optimal algorithm is a threshold-type policy that we call JSQ + b.
Keywords :
Internet; Markov processes; queueing theory; telecommunication network routing; Internet core router; Markov decision problem; end-to-end delay; multiple physical channel; network transit delay; optimal algorithm; optimal path-determination problem; optimal routing; queue length; threshold-type policy; Communications Society; Computer science; IP networks; Optical fiber networks; Optical fibers; Peer to peer computing; Routing; Telecommunication traffic; Traffic control; Wavelength division multiplexing;
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2006.26