State-path decoupled QoS-based routing framework

We introduce a new "state-path decoupled QoS-based routing framework" (SPD-QRF) in which path computation and the dynamics of network state information along the computed paths are considered in a decoupled manner. Basically, SPD-QRF first makes several (potentially feasible) paths be readily available throughout the network(s) by marking the outgoing links of every router as forward, backward, or neutral towards every destination based on some static information. This can be seen as a generalization of the current Internet routing. Once the direction of every link is determined, end nodes explore the readily available paths using a randomized path discovery strategy. Along the explored paths, end-to-end path-state information is determined by accumulating the locally maintained QoS-related information at the routers. Our simulation results show that similar performance results for finding feasible paths under SPC-QRF can be accomplished by using much simpler and scalable solutions under SPD-QRF.