{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:54:03Z","timestamp":1729662843851,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/glocom.2010.5684253","type":"proceedings-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T16:19:12Z","timestamp":1294676352000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Inductive Routing System Based on QoS Bandwidth Optimization"],"prefix":"10.1109","author":[{"given":"Said","family":"Hoceini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelhamid","family":"Mellouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach","volume":"6","author":"boyan","year":"1994","journal-title":"Advances in neural information processing systems"},{"key":"ref11","article-title":"On-Line Adaptation of a Signal Predistorter through Dual Reinforcement Learning","author":"goetz","year":"1996","journal-title":"Proc Machine Learning Proceedings of the 13th Annual Conference Bari"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2004.03.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1062"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068034"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-31957-3_21","article-title":"K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks","volume":"3421","author":"hoceini","year":"2005","journal-title":"Lecture Notes in Computer Science LNCS 3421"},{"key":"ref16","first-page":"652","article-title":"Finding the K shortest paths","author":"eppstein","year":"1999","journal-title":"SIAM J Computing 28 0"},{"article-title":"Data Structures, Algorithms, and Applications in C++","year":"2005","author":"sahni","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0321030"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1002\/dac.858","article-title":"Adaptive Quality of Service Based Routing Approaches: Development of a Neuro-Dynamic State-Dependent Reinforcement Learning Algorithm","volume":"20","author":"mellouk","year":"2006","journal-title":"International Journal of Communication Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0967-0661(98)00206-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852882"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.03.010"},{"key":"ref5","article-title":"Ant Colony Optimization","author":"dorigo","year":"2004","journal-title":"MIT Press"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72693-7_5"},{"key":"ref7","first-page":"285","article-title":"Bio-Inspired Networking - Self-organizing Networked Embedded Systems","author":"dressler","year":"2008","journal-title":"Organic Computing"},{"key":"ref2","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"garey","year":"1979","journal-title":"Freeman San Francisco"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2007.313396"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1186778.1186782"},{"key":"ref20","article-title":"Pathload: a measurement tool for end-to-end available bandwidth","author":"manish","year":"2002","journal-title":"Passive and Active Measurements Workshop"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-28650-9_7","article-title":"Stochastic Learning","author":"bottou","year":"2004","journal-title":"Advanced Lectures on Machine Learning"},{"key":"ref21","article-title":"PathChirp: Efficient Available Bandwidth Estimation for Network Paths","author":"ribeiro","year":"2003","journal-title":"Passive and Active Measurement Workshop"}],"event":{"name":"GLOBECOM 2010 - 2010 IEEE Global Communications Conference","start":{"date-parts":[[2010,12,6]]},"location":"Miami, FL, USA","end":{"date-parts":[[2010,12,10]]}},"container-title":["2010 IEEE Global Telecommunications Conference GLOBECOM 2010"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5682081\/5683069\/05684253.pdf?arnumber=5684253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:13:01Z","timestamp":1497881581000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5684253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/glocom.2010.5684253","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}