{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:02:56Z","timestamp":1768341776795,"version":"3.49.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"crossref","award":["W911NF-13-1-0421 and W911NF-13-1-0317"],"award-info":[{"award-number":["W911NF-13-1-0421 and W911NF-13-1-0317"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-15-1-2007 and N00014-13-1-0703"],"award-info":[{"award-number":["N00014-15-1-2007 and N00014-13-1-0703"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2017,1,31]]},"abstract":"<jats:p>\n                    An important component of the cyber-defense mechanism is the adequate staffing levels of its cybersecurity analyst workforce and their optimal assignment to sensors for investigating the dynamic alert traffic. The ever-increasing cybersecurity threats faced by today\u2019s digital systems require a strong cyber-defense mechanism that is both reactive in its response to mitigate the known risk and proactive in being prepared for handling the unknown risks. In order to be proactive for handling the unknown risks, the above workforce must be scheduled dynamically so the system is adaptive to meet the day-to-day stochastic demands on its workforce (both size and expertise mix). The stochastic demands on the workforce stem from the varying alert generation and their significance rate, which causes an uncertainty for the cybersecurity analyst scheduler that is attempting to schedule analysts for work and allocate sensors to analysts. Sensor data are analyzed by automatic processing systems, and alerts are generated. A portion of these alerts is categorized to be\n                    <jats:italic toggle=\"yes\">significant<\/jats:italic>\n                    , which requires thorough examination by a cybersecurity analyst. Risk, in this article, is defined as the percentage of\n                    <jats:italic toggle=\"yes\">significant<\/jats:italic>\n                    alerts that are not thoroughly analyzed by analysts. In order to minimize risk, it is imperative that the cyber-defense system accurately estimates the future significant alert generation rate and dynamically schedules its workforce to meet the stochastic workload demand to analyze them. The article presents a reinforcement learning-based stochastic dynamic programming optimization model that incorporates the above estimates of future alert rates and responds by dynamically scheduling cybersecurity analysts to minimize risk (i.e., maximize\n                    <jats:italic toggle=\"yes\">significant<\/jats:italic>\n                    alert coverage by analysts) and maintain the risk under a pre-determined upper bound. The article tests the dynamic optimization model and compares the results to an integer programming model that optimizes the static staffing needs based on a daily-average alert generation rate with no estimation of future alert rates (static workforce model). Results indicate that over a finite planning horizon, the learning-based optimization model, through a dynamic (on-call) workforce in addition to the static workforce, (a) is capable of balancing risk between days and reducing overall risk better than the static model, (b) is scalable and capable of identifying the quantity and the right mix of analyst expertise in an organization, and (c) is able to determine their dynamic (on-call) schedule and their sensor-to-analyst allocation in order to maintain risk below a given upper bound. Several meta-principles are presented, which are derived from the optimization model, and they further serve as guiding principles for hiring and scheduling cybersecurity analysts. Days-off scheduling was performed to determine analyst weekly work schedules that met the cybersecurity system\u2019s workforce constraints and requirements.\n                  <\/jats:p>","DOI":"10.1145\/2882969","type":"journal-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T09:27:29Z","timestamp":1469525249000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Dynamic Scheduling of Cybersecurity Analysts for Minimizing Risk Using Reinforcement Learning"],"prefix":"10.1145","volume":"8","author":[{"given":"Rajesh","family":"Ganesan","sequence":"first","affiliation":[{"name":"George Mason University, Fairfax, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Shah","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Cam","sequence":"additional","affiliation":[{"name":"Army Research Laboratory, Adelphi, Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.33"},{"key":"e_1_2_2_2_1","unstructured":"J. P. Anderson. 1980. Computer Security Threat Monitoring and Surveillance. Technical Report. James P. Anderson Co. Fort Washington PA."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(00)00087-7"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/572582"},{"key":"e_1_2_2_5_1","volume-title":"Dynamic Programming","author":"Bellman R.","unstructured":"R. Bellman. 1957. Dynamic Programming. Princeton University Press, Princeton NJ."},{"key":"e_1_2_2_6_1","volume-title":"Applied Integer Programming","author":"Chen Der-San","unstructured":"Der-San Chen, Robert G. Batson, and Yu Dang. 2010. Applied Integer Programming. Wiley, New York, NY."},{"key":"e_1_2_2_7_1","volume-title":"DON Cyber Crime Handbook. Dept. of Navy","author":"Chief Information Officer CIO","unstructured":"CIO Chief Information Officer. 2008. DON Cyber Crime Handbook. Dept. of Navy, Washington, DC."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10010"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.232894"},{"key":"e_1_2_2_10_1","volume-title":"Intrusion Detection Systems. Advances in Information Security","volume":"38","author":"Pietro Roberto Di","unstructured":"Roberto Di Pietro and Luigi V. Mancini (Eds.). 2008. Intrusion Detection Systems. Advances in Information Security, Vol. 38. Springer, Berlin."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CyberSecurity.2012.31"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882969"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/940813"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027315016892"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/42805"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.3.295"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/560709"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","unstructured":"M. Ovelgonne V. S. Subrahmanian T. Dumitras and A. Prakash. 2015. Global Cyber-Vulnerability Report. Springer Berlin.","DOI":"10.5555\/2875149"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2004.12.003"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"e_1_2_2_21_1","volume-title":"Planning and Scheduling in Manufacturing and Services","author":"Pinedo Michael","unstructured":"Michael Pinedo. 2009. Planning and Scheduling in Manufacturing and Services. Springer, New York, NY."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1324761"},{"key":"e_1_2_2_23_1","volume-title":"Markov Decision Processes","author":"Puterman M. L.","unstructured":"M. L. Puterman. 1994. Markov Decision Processes. Wiley Interscience, New York, NY."},{"key":"e_1_2_2_24_1","unstructured":"J. Reis and N. Mamede. 2002. Multi-Agent Dynamic Scheduling and Re-Scheduling with Global Temporal Constraints. Kluwer Academic Publishers Amsterdam."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.25"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","unstructured":"R. Sutton and A. G. Barto. 1998. In Reinforcement Learning. The MIT Press Cambridge MA.","DOI":"10.5555\/551283"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"El-Ghazali Talbi. 2009. Metaheuristics. Wiley-Interscience New York NY.","DOI":"10.1002\/9780470496916"},{"key":"e_1_2_2_28_1","volume-title":"Operations Research","author":"Winston Wayne","unstructured":"Wayne Winston. 2003. Operations Research. Cengage Learning, New York, NY."},{"key":"e_1_2_2_29_1","volume-title":"Linear Multivariable Control: A Geometric Approach","author":"Wonham W.","unstructured":"W. Wonham. 1979. Linear Multivariable Control: A Geometric Approach. Faller-Verlag."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5545\/sv-jme.2011.029"},{"key":"e_1_2_2_31_1","volume-title":"The Strategies of a World-Class Cybersecurity Operations Center","author":"Zimmerman Carson","unstructured":"Carson Zimmerman. 2014. The Strategies of a World-Class Cybersecurity Operations Center. The MITRE Corporation, McLean, VA."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882969","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882969","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:29:23Z","timestamp":1763458163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,31]]}},"alternative-id":["10.1145\/2882969"],"URL":"https:\/\/doi.org\/10.1145\/2882969","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2015-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-07-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}