{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-deep-recurrent-q-network-towards-self","title":"A Deep Recurrent Q Network towards Self-adapting Distributed Microservices architecture","arxiv_id":"1901.04011","date":"2019-01-13","proceeding":null,"authors":["Basel Magableh"],"abstract":"One desired aspect of microservices architecture is the ability to self-adapt\nits own architecture and behaviour in response to changes in the operational\nenvironment. To achieve the desired high levels of self-adaptability, this\nresearch implements the distributed microservices architectures model, as\ninformed by the MAPE-K model. The proposed architecture employs a multi\nadaptation agents supported by a centralised controller, that can observe the\nenvironment and execute a suitable adaptation action. The adaptation planning\nis managed by a deep recurrent Q-network (DRQN). It is argued that such\nintegration between DRQN and MDP agents in a MAPE-K model offers distributed\nmicroservice architecture with self-adaptability and high levels of\navailability and scalability. Integrating DRQN into the adaptation process\nimproves the effectiveness of the adaptation and reduces any adaptation risks,\nincluding resources over-provisioning and thrashing. The performance of DRQN is\nevaluated against deep Q-learning and policy gradient algorithms including: i)\ndeep q-network (DQN), ii) dulling deep Q-network (DDQN), iii) a policy gradient\nneural network (PGNN), and iv) deep deterministic policy gradient (DDPG). The\nDRQN implementation in this paper manages to outperform the above mentioned\nalgorithms in terms of total reward, less adaptation time, lower error rates,\nplus faster convergence and training times. We strongly believe that DRQN is\nmore suitable for driving the adaptation in distributed services-oriented\narchitecture and offers better performance than other dynamic decision-making\nalgorithms.","url_abs":"http://arxiv.org/abs/1901.04011v2","url_pdf":"http://arxiv.org/pdf/1901.04011v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-deep-recurrent-q-network-towards-self","repo_url":"https://github.com/baselm/cmarl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"q-learning","task_name":"Q-Learning"}],"methods":[{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"baselm/cmarl","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b19b5860a73f2eb3c10b5363580eec22fe44ec46e9f7b8751dbcafa7d351f363","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}