Adaptive proportional routing: a localized QoS routing approach

Abstract

Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and processing overhead on core routers. Furthermore, stale QoS state information causes the performance of these QoS routing schemes to degrade drastically. In order to circumvent these problems, we focus on localized QoS routing schemes where the edge routers make routing decisions using only local information and thus reducing the overhead at core routers. We first describe virtual capacity based routing (vcr), a theoretical scheme based on the notion of virtual capacity of a route. We then propose proportional sticky routing, an easily realizable approximation of vcr and analyze its performance. We demonstrate through extensive simulations that adaptive proportional routing is indeed a viable alternative to the global QoS routing approach.Index Terms-Localized proportional routing, quality-of-service routing.

Research challenges in QoS routing

“…The utilization of probing avoids the staleness of link-state information because the probes gather the most recent state information [32]. Multiple-path routing is able to reduce the impact that stale routing information has on routing performance, when compared to single path routing algorithms, due to its load balancing capability [8] and [30] and [38][39][40][41][42][43].…”

A comparative study of QoS routing schemes that tolerate imprecise state information

“…An extensive survey can be found in [5]. A number of QoS routing schemes that deal with the imprecise state information have been proposed [1], [2], [4], [6], [10], [11]. The impact of the imprecise global network state information on the performance of QoS routing algorithms was studied in [1], [11].…”

“…Chen [4] studied multipath QoS routing, which simultaneously probes multiple paths for each connection request. Nelakuditi [10] proposed localized QoS routing, which computes a set of feasible paths statically and makes routing decisions by selecting a path from the set of feasible paths based on the information maintained locally at each router. In this work, we do not invent new methods to deal with the imprecise global network state information.…”

“…The methods include safety-based routing [2], randomized routing [2], multi-path routing [4], proportional sticky routing (a localized routing scheme) [10], and static multi-path routing. Among these schemes, safety-based routing, randomized routing, and multi-path routing are dynamic schemes that compute feasible paths dynamically based on the current network state information while proportional sticky routing and static multi-path routing do not use the current network state information to make routing decisions.…”

“…Hence, mechanisms must be incorporated into a practical QoS routing algorithm to tolerate the imprecise global network state information and make effective routing decisions in the presence of imprecise state information. A number of QoS routing methods that tolerate imprecise state information have been proposed: safety-based routing [2], randomized routing [2], multi-path routing [4] and localized routing [10]. These techniques were proposed for different purposes.…”