To find feasible paths that satisfy multiple independent quality-of-service (QoS) constraints, the methodology of optimal supervisory control is applied. The network is modelled as a discrete event system (DES) and the penalties of the states and the disabling costs of the events of the DES are assigned considering the given metrics. After introducing the DES and assigning the penalties and the disabling costs, the feasible paths are found using the modified optimal supervisor design algorithm.
References
-
-
1)
-
Cui, Y., Xu, K., Wu, J., Yu, Z., Zhao, Y.: `Multi-constrained routing based on simulated annealing', Proc. IEEE Int. Conf. on Commun. (ICC’03), 2003, p. 1718–1722.
-
2)
-
M.-S. Lee ,
J.-T. Lim
.
On optimal supervisory control with trimness of controlled systems.
Int. J. Syst. Sci.
,
5 ,
661 -
667
-
3)
-
Chen, S., Nahrstedt, K.: `On finding multi-constrained paths', Proc. IEEE Int. Conf. on Commun. (ICC’98), 1998, p. 874–879.
-
4)
-
Song, J., Pung, H., Jacob, L.: `A multi-constrained distributed QoS routing algorithm', Proc. IEEE Int. Conf. on Networks (ICON 2000), 2000, p. 165–171.
-
5)
-
A. Orda ,
A. Sprintson
.
Precomputation schemes for QoS routing.
IEEE/ACM Trans. Netw.
,
4 ,
578 -
591
-
6)
-
X. Yuan
.
Heuristic algorithms for multiconstrained quality-of-service routing.
IEEE/ACM Trans. Netw.
,
2 ,
244 -
256
-
7)
-
P.J. Ramadge ,
W.M. Wonham
.
Supervisory control of a class of discrete event processes.
SIAM J. Control Optim.
,
206 -
230
-
8)
-
C.G. Cassandras ,
S. Lafortune
.
(1999)
Introduction to discrete event systems.
-
9)
-
Z. Wang ,
J. Crowcroft
.
QoS routing for supporting resource reservation.
IEEE J. Sel. Areas Commun.
,
1228 -
1234
-
10)
-
Cui, Y., Xu, K., Wu, J., Xu, M.: `Precomputation for finding paths with two additive weights', Proc. IEEE Int. Conf. on Commun. (ICC’03), 2003, p. 636–640.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20045059
Related content
content/journals/10.1049/ip-com_20045059
pub_keyword,iet_inspecKeyword,pub_concept
6
6