{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T06:51:40Z","timestamp":1753685500298,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Celtic and EUREKA initiative IPNQSIS"},{"name":"Visiting Professorship Award from the University of Paris Est Creteil"},{"DOI":"10.13039\/501100004904","name":"Direction G\u00e9n\u00e9rale de la Comp\u00e9titivit\u00e9, de l'Industrie et des Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004904","id-type":"DOI","asserted-by":"publisher"}]},{"name":"District of Columbia NASA Space Grant"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:p>This article proposes a state-dependent routing algorithm based on a global optimization cost function whose parameters are learned from the real-time state of the network with no a priori model. The proposed approach samples, estimates, and builds the model of pertinent and important aspects of the network environment such as type of traffic, QoS policies, resources, etc. It is based on the trial\/error paradigm combined with swarm-adaptive approaches. The global system uses a model that combines both a stochastic planned prenavigation for the exploration phase with a deterministic approach for the backward phase. We conducted a performance analysis of the proposed algorithm using OPNET based on several topologies such as the Nippon telephone and telegraph network. The simulation results obtained demonstrate substantial performance improvements over traditional routing approaches as well as the benefits of learning approaches for networks with dynamically changing traffic.<\/jats:p>","DOI":"10.1145\/2451248.2451254","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T13:04:26Z","timestamp":1366722266000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A state-dependent time evolving multi-constraint routing algorithm"],"prefix":"10.1145","volume":"8","author":[{"given":"Abdelhamid","family":"Mellouk","sequence":"first","affiliation":[{"name":"University of Paris\u2014Est Creteil Val de Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said","family":"Hoceini","sequence":"additional","affiliation":[{"name":"University of Paris\u2014Est Creteil Val de Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sherali","family":"Zeadally","sequence":"additional","affiliation":[{"name":"University of the District of Columbia, U.S."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,4,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1152934.1152937"},{"volume-title":"Proceedings of the IEEE International Conference on Communications (ICC'09)","author":"Baguenine F.","key":"e_1_2_1_2_1","unstructured":"Baguenine , F. and Mellouk , A . 2009. QoS swarm state dependent routing for irregular traffic in telecommunication networks . In Proceedings of the IEEE International Conference on Communications (ICC'09) . 1482--1486. Baguenine, F. and Mellouk, A. 2009. QoS swarm state dependent routing for irregular traffic in telecommunication networks. In Proceedings of the IEEE International Conference on Communications (ICC'09). 1482--1486."},{"key":"e_1_2_1_3_1","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advanced Lectures on Machine Learning","author":"Bottou L.","unstructured":"Bottou , L. 2004. Stochastic Learning , Advanced Lectures on Machine Learning . Lecture Notes in Artificial Intelligence , vol. 3176 ., Springer , 146--168. Bottou, L. 2004. Stochastic Learning, Advanced Lectures on Machine Learning. Lecture Notes in Artificial Intelligence, vol. 3176., Springer, 146--168."},{"volume-title":"Proceedings of the 7th Conference on Advances in Neural Information Processing Systems 6 (NIPS'94)","author":"Boyan J. A.","key":"e_1_2_1_4_1","unstructured":"Boyan , J. A. and Littman , M. L . 1994. Packet routing in dynamically changing networks: A reinforcement learning approach . In Proceedings of the 7th Conference on Advances in Neural Information Processing Systems 6 (NIPS'94) . J. D. Cowan, G. Tesauro and J. Alspector, Eds., Morgan Kaufmann, San Fransisco, CA, 671--678. Boyan, J. A. and Littman, M. L. 1994. Packet routing in dynamically changing networks: A reinforcement learning approach. In Proceedings of the 7th Conference on Advances in Neural Information Processing Systems 6 (NIPS'94). J. D. Cowan, G. Tesauro and J. Alspector, Eds., Morgan Kaufmann, San Fransisco, CA, 671--678."},{"key":"e_1_2_1_5_1","unstructured":"Chakeres I. and Perkins C. 2009. Dynamic manet on-demand (dymo) routing draft-ietf-manet-dymo-17 dynamic manet on-demand (dymo) routing draft-ietf-manet-dymo-17. Internet Engineering Task Force. http:\/\/tools.ietf.org\/html\/draft-ietf-manet-dymo-17  Chakeres I. and Perkins C. 2009. Dynamic manet on-demand (dymo) routing draft-ietf-manet-dymo-17 dynamic manet on-demand (dymo) routing draft-ietf-manet-dymo-17. Internet Engineering Task Force. http:\/\/tools.ietf.org\/html\/draft-ietf-manet-dymo-17"},{"volume-title":"Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). 1125--1130","author":"Correia S.","key":"e_1_2_1_6_1","unstructured":"Correia , S. , Junior , J. , and Cherkaoui , O . 2011. Mobility-Aware ant colony optimization routing for vehicular ad hoc networks . In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). 1125--1130 . Correia, S., Junior, J., and Cherkaoui, O. 2011. Mobility-Aware ant colony optimization routing for vehicular ad hoc networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). 1125--1130."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.530"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1062"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186778.1186782"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Dorigo M. and Stuzle T. 2004. Ant Colony Optimization. MIT Press Cambridge MA.   Dorigo M. and Stuzle T. 2004. Ant Colony Optimization. MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"},{"volume-title":"Advances in Biologically Inspired Information Systems - Models, Methods, and Tools, Studies in Computational Intelligence (SCI)","author":"Dressler F.","key":"e_1_2_1_12_1","unstructured":"Dressler , F. 2007. Self-Organized network security facilities based on bio-inspired promoters and inhibitors . In Advances in Biologically Inspired Information Systems - Models, Methods, and Tools, Studies in Computational Intelligence (SCI) . F. Dressler and I. Carreras, Eds., Vol. 69 , 81--98. Dressler, F. 2007. Self-Organized network security facilities based on bio-inspired promoters and inhibitors. In Advances in Biologically Inspired Information Systems - Models, Methods, and Tools, Studies in Computational Intelligence (SCI). F. Dressler and I. Carreras, Eds., Vol. 69, 81--98."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5621985"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_2_1_16_1","unstructured":"Garey M. R. and Jhonson D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman San Francisco CA.   Garey M. R. and Jhonson D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman San Francisco CA."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2004.03.009"},{"volume-title":"Proceedings of the 13th Annual Conference on Machine Learning.","author":"Goetz P.","key":"e_1_2_1_18_1","unstructured":"Goetz , P. , Kumar , S. , and Miikkulainen , R . 1996. On-Line adaptation of a signal predistorter through dual reinforcement learning . In Proceedings of the 13th Annual Conference on Machine Learning. Goetz, P., Kumar, S., and Miikkulainen, R. 1996. On-Line adaptation of a signal predistorter through dual reinforcement learning. In Proceedings of the 13th Annual Conference on Machine Learning."},{"volume-title":"Neural Networks- A Comprehensive Foundation","author":"Haykin S.","key":"e_1_2_1_19_1","unstructured":"Haykin , S. 1998. Neural Networks- A Comprehensive Foundation . Macmillan College Publishing Company . Haykin, S. 1998. Neural Networks- A Comprehensive Foundation. Macmillan College Publishing Company."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0321030"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622748"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852882"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315843.1315878"},{"volume-title":"Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN'07)","author":"Leibnitz K.","key":"e_1_2_1_24_1","unstructured":"Leibnitz , K. , Wakamiya , N. , and Murata , M . 2007. A bio-inspired robust routing protocol for mobile ad hoc networks . In Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN'07) . 321--326. Leibnitz, K., Wakamiya, N., and Murata, M. 2007. A bio-inspired robust routing protocol for mobile ad hoc networks. In Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN'07). 321--326."},{"volume-title":"Proceedings of the Passive and Active Measurements Workshop. 14--25","author":"Manish J.","key":"e_1_2_1_25_1","unstructured":"Manish , J. and Dovrolis , C . 2002. Pathload: A measurement tool for end-to-end available bandwidth . In Proceedings of the Passive and Active Measurements Workshop. 14--25 . Manish, J. and Dovrolis, C. 2002. Pathload: A measurement tool for end-to-end available bandwidth. In Proceedings of the Passive and Active Measurements Workshop. 14--25."},{"volume-title":"Proceedings of the 17th IEEE International Conference on Telecommunication (ICT). 748--754","author":"Martins J.","key":"e_1_2_1_26_1","unstructured":"Martins , J. , Correia , S. , and Celestino , J . 2010. Ant-DYMO: A bio-inspired algorithm for manets . In Proceedings of the 17th IEEE International Conference on Telecommunication (ICT). 748--754 . Martins, J., Correia, S., and Celestino, J. 2010. Ant-DYMO: A bio-inspired algorithm for manets. In Proceedings of the 17th IEEE International Conference on Telecommunication (ICT). 748--754."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2009.05.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.071211.110741"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0967-0661(98)00206-8"},{"volume-title":"Proceedings of the Passive and Active Measurement Workshop.","author":"Ribeiro V. J.","key":"e_1_2_1_30_1","unstructured":"Ribeiro , V. J. , Riedi , R. H. , Baraniuk , R. G. , Navratil , J. , and Cottrell , L . 2003. PathChirp: Efficient available bandwidth estimation for network paths . In Proceedings of the Passive and Active Measurement Workshop. Ribeiro, V. J., Riedi, R. H., Baraniuk, R. G., Navratil, J., and Cottrell, L. 2003. PathChirp: Efficient available bandwidth estimation for network paths. In Proceedings of the Passive and Active Measurement Workshop."},{"key":"e_1_2_1_31_1","volume-title":"Data Structures, Algorithms, and Applications in C&plus;&plus;","author":"Sahni S.","unstructured":"Sahni , S. 2005. Data Structures, Algorithms, and Applications in C&plus;&plus; , 2 nd ed. Silicon Press . Sahni, S. 2005. Data Structures, Algorithms, and Applications in C&plus;&plus;, 2nd ed. Silicon Press.","edition":"2"},{"volume-title":"Proceedings of the 9th IEEE Malaysia International Conference on Communications (MICC). 305--309","author":"Saleem K.","key":"e_1_2_1_32_1","unstructured":"Saleem , K. , Fisal , N. , Hafizah , S. , Kamilah , S. , and Rashid , R . 2009. Biological inspired self-optimized routing algorithm for wireless sensor networks . In Proceedings of the 9th IEEE Malaysia International Conference on Communications (MICC). 305--309 . Saleem, K., Fisal, N., Hafizah, S., Kamilah, S., and Rashid, R. 2009. Biological inspired self-optimized routing algorithm for wireless sensor networks. In Proceedings of the 9th IEEE Malaysia International Conference on Communications (MICC). 305--309."},{"key":"e_1_2_1_33_1","unstructured":"Sutton R. S. and Barto A. G. 1997. Reinforcement Learning. MIT Press.   Sutton R. S. and Barto A. G. 1997. Reinforcement Learning. MIT Press."},{"volume-title":"Foundations of the Theory of Learning Systems","author":"Tsypkin Y.","key":"e_1_2_1_34_1","unstructured":"Tsypkin , Y. 1973. Foundations of the Theory of Learning Systems . Academic Press , New York . Tsypkin, Y. 1973. Foundations of the Theory of Learning Systems. Academic Press, New York."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2009.0826"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM'95)","volume":"3","author":"Wang Z.","unstructured":"Wang , Z. and Crowcroft , J . 1995. Bandwidth-Delay based routing algorithms . In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM'95) . Vol. 3 , 2129--2133. Wang, Z. and Crowcroft, J. 1995. Bandwidth-Delay based routing algorithms. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM'95). Vol. 3, 2129--2133."},{"volume-title":"Routing of multipoint connections","author":"Waxman B. M.","key":"e_1_2_1_37_1","unstructured":"Waxman , B. M. 1991. Routing of multipoint connections . In Broadband Switching, C. Chas, V. K. Konangi, and M. Sreetharan, Eds., IEEE Computer Society Press , Los Alamitos, CA , 347--352. Waxman, B. M. 1991. Routing of multipoint connections. In Broadband Switching, C. Chas, V. K. Konangi, and M. Sreetharan, Eds., IEEE Computer Society Press, Los Alamitos, CA, 347--352."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068034"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2451248.2451254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2451248.2451254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:41Z","timestamp":1750282601000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2451248.2451254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["10.1145\/2451248.2451254"],"URL":"https:\/\/doi.org\/10.1145\/2451248.2451254","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2013,4]]},"assertion":[{"value":"2011-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-04-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}