Abstract
Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and Quality of Service Requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks. The prediction of these problems in real time is quite difficult, making the effectiveness of “traditional” methodologies based on analytical models questionable. This article proposed and evaluates a QoS routing policy in packets topology and irregular traffic of communications network called K-shortest paths Q-Routing. The technique used for the evaluation signals of reinforcement is Q-learning. Compared to standard Q-Routing, the exploration of paths is limited to K best non loop paths in term of hops number (number of routers in a path) leading to a substantial reduction of convergence time. Moreover, each router uses an on line learning module to optimize the path in terms of average packet delivery time. The performance of the proposed algorithm is evaluated experimentally with OPNET simulator for different levels of load and compared to Q-Routing algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolopoulos, G., Guerin, R., Kamat, S., Orda, A., Przygienda, T., Williams, D.: QoS Routing Mechanisms and OSPF Extensions, RFC (December 1998)
Sutton, R.S., Barto, A.G.: Reinforcement Learning. MIT Press, Cambridge (1997)
Eppstein, D.: Finding the K Shortest Paths. SLAM J. Computing 28, 652–673 (1999)
Hsu, C., Hui, J.Y.: Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks. In: Proceedings of IEEE NY/NJ Regional Control Conference (August 1994)
Boyan, J.A., Littman, M.L.: Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach. In: Cowan, Tesauro, Alspector (eds.) Advances in Neural Information Processing Systems, vol. 6 (1994)
Kumar, S., Miikkualainen, R.: Dual reinforcement Q-routing: an on-queue adaptive routing algorithm. In: Proceedings of Neural Networks in Engineering (1997)
Nevers, J.E., Leitao, M.J., Almeida, L.B.: Neural Networks in B-ISDN Flow Control: ATM Traffic Prediction or Network Modeling. IEEE Com. Magazine (October 1995)
Martins, E.Q.V., Pascoal, M.M.B., Santos, J.L.E.: The K Shortest Paths Problem, Research Report, CISUC (June 1998)
Apostolopoulos, G., Guerin, R., Tripathi, S.K.: Quality of Service Routing: A Performance Perspective. In: SIGCOMM 1998, Vancouver, BC (September 1998)
Malkin, G.: RIP version2: Carrying Additional Information, RFC 1388 RFC (1993)
J. Yanxia, N. Ioanis, and G. Pawel, “ Multiple path QoS Routing” Proc. Int. Conf. Communications (ICC2001), IEEE, Jun 2001, pp. 2583–2587
Costa, L.H.M.K., Fdida, S., Duarte, O.C.M.B.: A Scalable Algorithm for Link-state QoS-based Routing with Three Metrics. In: Proc. of IEEE ICC 2001, Helsink, Filand (2001)
Watkins, C.J., Dayan, P.: Q-Learning. Machine Learning 8, 279–292 (1989)
Jacobson, V.: Congestion Avoidance of Network Traffic, Computer Communication. Review 18(4), 314–329 (1988)
Feng, W., Kandlur, D., Saha, D., Shin, K.: Understanding TCP Dynamics in an Integrated Services Internet. In: NOSSDAV (1997)
Shenker, S., Partridge, C., Guerin, R.: Specification of guaranteed quality of service, RFC2212 (Septembre 1997)
Turner, J.: New directions in communications (or which way to the information age). IEEE Communications Magazine 24(10) (1986)
Zhang, L., Deering, S., Estrin, D.: RSVP: A New Resource ReSerVation Protocol. IEEE Network 7(5), 8–18 (1993)
Bernet, Y.: Requirements of Diff-serv Boundary Routers. IETF Internet Draft (1998)
Nichols, K., Blake, S.: Differentiated Services Operational Model and Definitions. IETF Internet Draft (1998)
Moy, J.: OSPF Version 2, RFC2328, IETF (1998)
Kumar, S., Miikkualainen, R.: Confidence-based Q-routing: an on-queue adaptive routing algorithm. In: Proceedings of Neural Networks in Engineering (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoceini, S., Mellouk, A., Amirat, Y. (2005). K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)