scholarly journals Performance Analysis and Optimal Allocation of Layered Defense M/M/N Queueing Systems

2016 ◽  
Vol 2016 ◽  
pp. 1-21 ◽  
Author(s):  
Longyue Li ◽  
Fuxian Liu ◽  
Guangzheng Long ◽  
Huizhen Zhao ◽  
Yingying Mei

One important mission of strategic defense is to develop an integrated layered Ballistic Missile Defense System (BMDS). Motivated by the queueing theory, we presented a work for the representation, modeling, performance simulation, and channels optimal allocation of the layered BMDS M/M/N queueing systems. Firstly, in order to simulate the process of defense and to study the Defense Effectiveness (DE), we modeled and simulated the M/M/N queueing system of layered BMDS. Specifically, we proposed the M/M/N/N and M/M/N/C queueing model for short defense depth and long defense depth, respectively; single target channel and multiple target channels were distinguished in each model. Secondly, we considered the problem of assigning limited target channels to incoming targets, we illustrated how to allocate channels for achieving the best DE, and we also proposed a novel and robust search algorithm for obtaining the minimum channel requirements across a set of neighborhoods. Simultaneously, we presented examples of optimal allocation problems under different constraints. Thirdly, several simulation examples verified the effectiveness of the proposed queueing models. This work may help to understand the rules of queueing process and to provide optimal configuration suggestions for defense decision-making.

2002 ◽  
Vol 96 (4) ◽  
pp. 879-880
Author(s):  
David Goldfischer

As Michael O'Hanlon concludes in his excellent contribution to Rockets' Red Glare: “We should…get used to the debate over ballistic missile defenses. It has been around a long time, and no final resolution is imminent” (p. 132). In one sense, a review of these three recent books makes clear that many analysts had grown a bit too used to positioning themselves in terms of the 1972 ABM Treaty. Preoccupied with arguments over whether the treaty should be preserved, modified, or rewritten in light of a changing strategic and technological context, no one seemed to have anticipated that President George W. Bush would simply withdraw from it, invoking Article XV's provision that either party could withdraw if “extraordinary events related to the subject matter of this Treaty have jeopardized its supreme interests.” Even many strategic defense supporters who deemed the treaty obsolete (as Robert Joseph persuasively maintains in his contribution to Rockets' Red Glare) generally believed that it should only—and would only—be scrapped if negotiations over U.S.-proposed changes broke down. (“The Bush Administration,” surmises O'Hanlon, “will surely try very hard to amend it before going to such an extreme”) (p. 112). In the event, the president's team disavowed even the word “negotiation,” saying they were willing only to “consult” the Russians regarding the treaty's impending demise.


1999 ◽  
Author(s):  
Peter J. Stafford ◽  
Kniceley Jr. ◽  
Monteith Roger L. ◽  
Kimbrell Gregory E. ◽  
Jones Thomas W. ◽  
...  

2003 ◽  
Author(s):  
James B. Michael ◽  
Philip E. Pace ◽  
Man-Tak Shing ◽  
Murali Tummala ◽  
Joel Babbitt

2020 ◽  
Vol 15 (1) ◽  
pp. 143-156
Author(s):  
Jean-François Biasse ◽  
Benjamin Pring

AbstractIn this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems) of reducing a portion of the polynomial overhead contributed by the implementation cost of quantum oracles and can be used to provide either strict improvements or advantageous trade-offs in circuit-complexity. Our results indicate that it is possible for quantum oracles for certain single-target preimage search problems to reduce the quantum circuit-size from $O\left(2^{n/2}\cdot mC\right)$ (where C originates from the cost of implementing the quantum oracle) to $O(2^{n/2} \cdot m\sqrt{C})$ without the use of quantum ram, whilst also slightly reducing the number of required qubits.This framework captures a previous optimisation of Grover’s algorithm using preprocessing [21] applied to cryptanalysis, providing new asymptotic analysis. We additionally provide insights and asymptotic improvements on recent cryptanalysis [16] of SIKE [14] via Grover’s algorithm, demonstrating that the speedup applies to this attack and impacting upon quantum security estimates [16] incorporated into the SIKE specification [14].


Sign in / Sign up

Export Citation Format

Share Document