Reinforcing probabilistic selective Quality of Service routes in dynamic irregular networks

Computer Communications

Volumn 31, Issue 11, 2008, Pages 2706-2715

  Mellouk, Abdelhamid ^a   Hoceïni, Saïd ^a   Cheurfa, Mustapha ^a  

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

Author keywords

Dynamic irregular networks; Multipath routing; Q routing; Quality of Service based routing; Reinforcement learning

Indexed keywords

AD HOC NETWORKS; ADAPTIVE ALGORITHMS; BOOLEAN FUNCTIONS; DISTRIBUTION FUNCTIONS; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; LEARNING ALGORITHMS; LOADS (FORCES); MATHEMATICAL PROGRAMMING; NETWORK ROUTING; PROBABILITY; PROBABILITY DISTRIBUTIONS; QUALITY CONTROL; QUALITY OF SERVICE; REINFORCEMENT; REINFORCEMENT LEARNING; ROUTERS; STANDARDS; SYSTEMS ENGINEERING; TELECOMMUNICATION NETWORKS;

(R ,S ,S) POLICY; BANDWIDTH REQUIREMENTS; COMMUNICATION NETWORKS; CUMULATIVE COST; DYNAMIC STATES; EFFICIENT ROUTING; ELSEVIER (CO); END TO END DELAY (EED); GUARANTEED QUALITY; HIGH SPEED INTERNET; HOP COUNT; INFORMATION PACKETS; INTER-ARRIVAL TIMES; IRREGULAR NETWORKS; LINK COSTS; LOAD BALANCING; LOAD LEVELLING; MULTIMEDIA APPLICATIONS; NEURO-DYNAMIC PROGRAMMING (NDP); NUMERICA L RESULTS; OPNET SIMULATOR; OPTIMAL PATHS; PACKET ROUTING; PATH PROBABILITY; Q-ROUTING; ROUTING POLICIES; STATISTICAL DISTRIBUTIONS; TRAFFIC PATTERNS;

ROUTING ALGORITHMS;

EID: 45849102777     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.03.010     Document Type: Article

References (18)

1. Adamovic L., and Collier M. A new traffic engineering approach for IP networks. Proc. CSNDSP (2004) 351-358
2. W. Stallings, MPLS, Internet Protocol Journal 4 (2001) 34-46.
3. In: Strassner J. (Ed). Policy-based network management: Solutions for the next generation (2003), Morgan-Kaufmann
4. In: Welzl M. (Ed). Scalable performance signalling and congestion avoidance (2003), Kluwer Academic Publishers
5. Zhi L., and Mohapatra P. QRON: QoS-aware routing in overlay networks. IEEE J. Selected Areas in Commun. 22 1 (2004) 22-40
6. Dorigo M., and Stüzle T. Ant colony optimization (2004), MIT Press
7. T.E. Gelenbe, R. Lent, Z. Xu, Networking with cognitive packets, Proc. ICANN 2002, Madrid, Spain, August 27-30, 2002, pp. 259-264.
8. A. Mellouk, S. Hoceïni, Reinforcing state-dependent N best quality of service routes in communication networks, in: Proceedings of IEEE HPSR, New York, USA, May 2007.
9. Varadarajan S., and Ramakrishnan N. Reinforcement reachables routes. Comput. Netw. 43 3 (2003) 389-416
10. Chang Y.-H., Ho T., and Kaelbling L.P. Mobilized ad-hoc networks: a reinforcement learning approach. NIPS (2003)
11. Mellouk A., Hoceïni S., and Amirat Y. Adaptive quality of service based routing approaches: development of a neuro dynamic state dependent reinforcement learning algorithm. Wiley Int. J. Commun. Systems (2006)
12. S. Hoceïni, Reinforcement learning technique for an adaptive routing in telecommunication networks in the case of irregular traffic, Ph. D Thesis, LISSI/SCTIC Lab, Paris XII-Val de Marne University, November 2004.
13. Sutton R.S., and Barto A.G. Reinforcement learning (1997), MIT Press
14. Boyan J.A., and Littman M.L. Packet routing in dynamically changing networks: A reinforcement learning approach, Advances in Neural Information Processing Systems 6 (1994), Morgan Kaufman, San Francisco, CA pp. 671-678
15. S. Kumar, R. Miikkualainen, Confidence based dual reinforcement Q-routing: An adaptive online network routing algorithm, Proc. of the sixteenth International Joint Conference on Artificial IntelligenceT (IJCAI-99, Sweden, Stockholm), San Francisco, CA: Kaufmann, 1999, pp. 758-763.
16. Wang Z., and Crowcroft J. QoS routing for supporting resource reservation. IEEE J. Selected Areas Commun. vol. 14 no. 7 (1996) 1228-1234
17. Eppstein D. Finding the K shortest paths. SLAM J. Computing 28:0 (1999) 652-673
18. E.Q.V. Martins, M.M.B. Pascal, J.L.E. Santos, The K shortest paths problem, Research Report, CISUC 1998.