Empirical probability based QoS routing

Abstract

We study the quality-of-service (QoS) schemes that make routing decisions based on empirical resource availability probability information. These empirical probability based routing schemes offer better performance than the traditional schemes that make routing decisions based on resource availability information when the global network state information is imprecise. We investigate variations of empirical probability based QoS routing, present a number of schemes to explicitly maintain the resource availability probability information, and evaluate the performance of the routing schemes. We conclude that the performance of empirical probability based routing is insensitive to the frequency of probability information updates and that empirical probability based routing can achieve good performance without introducing excessive overheads.