In general, routing is subdivided into two functionalities: routing protocols that keep the network state information up to date and routing algorithms that compute paths based on the information provided by the routing protocols. An excessive overhead prevents the distribution of all resource changes across the network, leadign to stale link-state information. Besides inaccurate information, researchers have also resorted to inexact algorithms, because the general QoS path selection problem is NP-hard. Researchers have strived to optimize on either the two can benefit form eachother.
In this paper we combine QoS protocol algorithm. Our solution guarantees a tunable bouned error margin on the link-state information and provides an exact polynomial-time algorithm for the selection of (mulit-constrained) paths.
|Conference||Conferentie, Beijing, PR China|
|Period||25/10/06 → 27/10/06|
- conference contrib. refereed
- Conf.proc. > 3 pag