Measurement based optimal multi-path routing

Publisher Website
Google Scholar
Abstract
We propose a new architecture fnr efficient network monitoring and measurements in a traditional IP netw,ork. This new architecture enables estahlishmrnt nf niultiple paths (tunnels) hetween source-destination pairs without having to modify the underlying routing prntoeol(s). Based nn the proposed architecture we propose a measurement-based multi-path rmuting algorithni derived from simultaneous perturbation stochastic appmrimution. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, hut rather relies on noky estiniates from nimsurenimts. Using the analytical model presented in the paper we prove the canvergenee of the algorithm to the optimal solution. Simulation results are presented to denionstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing nptimal routing algorithm, MATE, is also provided. a domain without requiring major changes in the infrastruc- ture of IP Networks. and addresses some of the limitations of basic shortest path schemes mentioned earlier. This new architecture does nnt need the traditional IP routers tn be replaced or modified. Rather it requires simple devices (such as PCs or network processors) to be carefully placed inside the intradomain network. creating overlay paths between source- destination (SD) pairs. Furthermore. the architecture allows grudirul deployment of such devices. resulting in improved network performance with the addition of each new device. This provides ISPs with an alternative solution to achieve desired level of performance at potentially much lower costs. We will give a brief description of this architecture in Section IV.