Show simple item record

dc.contributor.authorCarlyle, W. Matthew
dc.contributor.authorHenderson, Shane G.
dc.contributor.authorSzechtman, Roberto
dc.date2011
dc.date.accessioned2014-01-09T22:23:14Z
dc.date.available2014-01-09T22:23:14Z
dc.date.issued2011
dc.identifier.citationCarlyle, W.M., Henderson, S.G. and Szechtman, R., 2011, "Allocating Capacity in Parallel Queues to Improve Their Resilience to Deliberate Attack," Naval Research Logistics, 58(8), pp. 731-742.
dc.identifier.urihttp://hdl.handle.net/10945/38209
dc.descriptionNaval Research Logistics, 58(8), pp. 731-742.en_US
dc.description.abstractWe develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well-informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst-case disruptions. We formulate this problem as a three-level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero-one random-outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers.en_US
dc.rightsdefined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleAllocating Capacity in Parallel Queues to Improve Their Resilience to Deliberate Attacken_US
dc.typePaperen_US
dc.contributor.departmentOperations Research (OR)
dc.subject.authorattacker defender problemsen_US
dc.subject.authorsequential gameen_US
dc.subject.authorqueueing theoryen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record