Average-bandwidth delay Q-routing adaptive algorithm

IEEE International Conference on Communications

Volumn , Issue , 2008, Pages 1840-1844

  Hoceini, Said ^a   Mellouk, Abdelhamid ^a   Smail, Bouchra ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Dynamic network; Multi path routing; Q routing; Quality of service based routing; Reinforcement learning; Residual bandwidth; Shortest path routing

Indexed keywords

ADAPTIVE ALGORITHMS; BOOLEAN FUNCTIONS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; MECHANISMS; QUALITY CONTROL; REINFORCEMENT; REINFORCEMENT LEARNING; ROUTING ALGORITHMS; STOCHASTIC MODELS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

DYNAMIC NETWORK; MULTI PATH ROUTING; Q-ROUTING; QUALITY OF SERVICE BASED ROUTING; RESIDUAL BANDWIDTH; SHORTEST-PATH ROUTING;

COMPUTER NETWORKS;

EID: 51249089884     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2008.353     Document Type: Conference Paper

References (18)

1. A. Mellouk, P. Lorenz, A. Boukerche, M.H. Lee, "Impact of Adaptive Quality of Service Based Routing Algorithms in the next generation heterogeneous networks", IEEE Communication Magazine, IEEE Press, vol. 45, no 2, Feb. 2007, pp. 65-66.
2. M. R. Garey, D. S. Jhonson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman, San Francisco, 1979.
3. Kuipers, F. A. and P. Van Mieghem, "Conditions that impact the Complexity of QoS Routing", IEEE/ACM Transaction on Networking, Vol. 13, No. 4, 2005, pp. 717-730.
4. M. Song, S. Sahni, "Approximation Algorithms for Multiconstrained Quality-of-Service Routing, IEEE Transaction on Computers", Vol. 55, No. 8, 2006, pp. 1048-1056.
5. J.M.Jaffe, "Algorithms for Finding Paths with Multiple Constraints", IEEE Networks, Vol. 14, 1984, pp. 95-116.
6. S. Sahni, "Data Structures, Algorithms, and Applications in C++", second Edition, Silicon Press, 2005.
7. T. Korkmaz and M. Krunz, "A randomized Algorithm for Findind a Path Subject to Multiple QoS Requirements", Computer Networks, Vol. 36, 2001, pp. 251-268.
8. A. Mellouk, S. Hoceïni, Reinforcing State-Dependent N Best Quality of Service Routes in Communication Networks, Proc. Of IEEE HPSR, New York, USA, May 2007.
9. S. Varadarajan, N. Ramakrishnan, Reinforcement reachables routes. Computer Networks 43(3), 2003, pp. 389-416.
10. E. Crawley, R. Nair, B. Rajagopalan, H. Sandick, "A Framework for QoS-based Routing in the Internet", RFC2386, IETF, August 1998.
11. Z. Wang and J. Crowcroft, "QoS Routing for Supporting Resource Reservation". In IEEE Journal on Selected Areas in Communications, September 1996
12. D. Subramanian, P. Druschel, and J. Chen. "Ants and reinforcement learning: A case study in routing in dynamic networks". In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, volume 2, pages 832-839, 1997
13. E. Gelenbe, R. Lent, Z. Xu "Towards networks with cognitive packets," Proc. IEEE MASCOTS Conference, ISBN 0-7695-0728-X, pp. 3-12, San Francisco, CA, Aug. 29-Sep. 1, 2000
14. P. Goetz, S. Kumar, R. Miikkulainen, "On-Line Adaptation of a Signal Predistorter through Dual Reinforcement Learning". Proc. Machine Learning. Proceedings of the 13th Annual Conference Bari, Italy, 1996.
15. A. Mellouk, S. Hoceini, M. Cheurfa, "Reinforcing Probabilistic Selective Quality of service Routes in Dynamic Heterogeneous Networks" In Journal of Computer Communication, Elsevier Ed., ISSN: 0140-3664, on line march 2007, to appear, 24 pages, 2007.
16. S. Hoceini, A. Mellouk, Y. Amirat, "K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks", In Lecture Notes in Computer Science, LNCS 3421, Springer-Heidelberg GmbH, Volume 3421, pp 164-172, 2005
17. E Q V Martins, M M B Pascal and J L E Santos, The K shortest paths problem, Research Report, CISUC, June 1998.
18. Manish Jain and Constantinos Dovrolis "Pathload: a measurement tool for end-to-end available bandwidth" In Passive and Active Measurements, Fort Collins, CO, March 2002