Novel traffic engineering for reservation services network

We propose a heuristic routing and reservation algorithm for networks providing reservation services. Important requirements of a reservation service network are to increase network resource utilization, to provide routes satisfying specified levels of quality of service (QoS), and to minimize service interruption under the situation that it is difficult to tell exactly when, how many, and what kinds of requests will arrive in the future. To satisfy these requirements, our proposal includes the following key ideas. First, it calculates rerouting targets only when a newly requested path competes with paths in service or reserved for future use, and reroutes competing path routes, or the rerouting targets, if necessary. Additionally, rerouting is executed so as to satisfy userspsila QoS demands. This ensures that the userspsila QoS demands are satisfied, network resource utilization is increased, and changes to path routes that are in service are minimized. Our algorithm can be adopted for advance reservation requests as well as immediate ones. Numerical results indicate rerouting only a few paths improves the request acceptance success rate by 50% o compared to the do-nothing approach.