Abstract.Network Quality of Service (QoS) criteria of interest include conventional metrics such as throughput, delay, loss, and jitter, as well as new QoS criteria based on power utilization, reliability and security. Variable and adaptive routing have again become of interest in networking because of the increasing importance of mobile ad-hoc networks. In this paper we develop a probability model of adaptive routing algorithms which use the expected QoS to select paths in the network. Our objective is not to analyze QoS, but rather to design randomized routing policies which can improve QoS. We define QoS metrics as non-negative random variables associated with network paths which satisfy a sub-additivity condition along each path. We define the QoS of a path, under some routing policy, as the expected value of a non-decreasing measurable function of the QoS metric. We discuss sensitive and insensitive QoS metrics, the latter being dependent on the routing policy which is used. We describe routing policies simply as probabilistic choices among all possible paths from some source to some given destination. Incremental routing policies are defined as those which can be derived from independent decisions taken at certain points (or nodes) along paths. Sensible routing policies are then introduced: they take decisions based simply on the QoS of each available path. Sensible policies, which make decisions based on the QoS of the paths, are introduced. We prove that the routing probability of a sensible policy can always be uniquely obtained. A hierarchy of m-sensible probabilistic routing policies is then introduced. A 0-sensible policy is simply a random choice of routes with equal probability, while a 1-sensible policy selects a path with a probability which is inversely proportional to the (expected) QoS of the path. We prove that an m + 1-sensible policy provides better QoS on the average than an m-sensible policy, if the QoS metric is insensitive. We also show that under certain conditions, the same result also holds for sensitive QoS metrics.
[1]
Anoop Ghanwani,et al.
Block loss reduction in ATM networks
,
1996,
Comput. Commun..
[2]
Erol Gelenbe,et al.
G-Networks with resets
,
2002
.
[3]
Srihari Nelakuditi,et al.
A localized adaptive proportioning approach to QoS routing
,
2002
.
[4]
Dimitri P. Bertsekas,et al.
Data Networks
,
1986
.
[5]
Erol Gelenbe,et al.
Towards Networks with Cognitive Packets
,
2001
.
[6]
Zhi-Hong Mao,et al.
Function approximation with spiked random networks
,
1999,
IEEE Trans. Neural Networks.
[7]
Erol Gelenbe,et al.
Measurement and performance of a cognitive packet network
,
2001,
Comput. Networks.
[8]
Hamid Ahmadi,et al.
Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks
,
1991,
IEEE J. Sel. Areas Commun..
[9]
Alexandre Proutière,et al.
Insensitivity in processor-sharing networks
,
2002,
Perform. Evaluation.
[10]
Mostafa Ammar,et al.
QoS routing for anycast communications: motivation and an architecture for DiffServ networks
,
2002,
IEEE Commun. Mag..
[11]
François Baccelli,et al.
Impact of TCP-like congestion control on the throughput of multicast groups
,
2002,
TNET.
[12]
Daniel Minoli,et al.
Delivering Voice over IP Networks
,
1998
.
[13]
Erol Gelenbe,et al.
A diffusion cell loss estimate for ATM with multiclass bursty traffic
,
1995,
Modelling and Evaluation of ATM Networks.
[14]
Klara Nahrstedt,et al.
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
,
1998,
IEEE Netw..
[15]
Ren-Hung Hwang,et al.
Granularity of QoS Routing in MPLS Networks
,
2001,
IWQoS.
[16]
Ying-Dar Lin,et al.
QoS routing granularity in MPLS networks
,
2002,
IEEE Commun. Mag..
[17]
T. V. Lakshman,et al.
Restorable dynamic quality of service routing
,
2002
.
[18]
Erol Gelenbe,et al.
Cognitive packet networks: QoS and performance
,
2002,
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.