Scheme to Find k Disjoint Paths in Multi-Cost

Leepila, Ruchaneeya; Oki, Eiji; Kishi, Naoto

doi:10.1109/icc.2011.5962477

Cited by 5 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed method utilizes different coefficients for the entangled connections of a shortest main path P and shortest replacement path P , which distinction defines the problem of finding nodedisjoint paths of a multi-level entangled quantum network. Particularly, this problem is analogous to a min-sum (minimize the sum of costs of connection paths) problem [14][15][16][17] in a multi-cost network, which is an NP-complete problem [14,16]. Note that similar to the determination of a shortest main path P, the replacement path P is also determined by our decentralized routing A in a base-graph.…”

Section: Quantum Memory Failuresmentioning

confidence: 99%

Adaptive routing for quantum memory failures in the quantum Internet

Gyöngyösi

Imre

2019

Quantum Inf Process

View full text Add to dashboard Cite

We define an adaptive routing method for the management of quantum memory failures in the quantum Internet. In the quantum Internet, the entangled quantum states are stored in the local quantum memories of the quantum nodes. A quantum memory failure in a particular quantum node can destroy several entangled connections in the entangled network. A quantum memory failure event makes the immediate and efficient determination of shortest replacement paths an emerging issue in a quantum Internet scenario. The replacement paths omit those nodes that are affected by the quantum memory failure to provide a seamless network transmission. In the proposed solution, the shortest paths are determined by a base-graph, which contains all information about the overlay quantum network. The method provides efficient adaptive routing in quantum memory failure scenarios of the quantum Internet. The results can be straightforwardly applied in practical quantum networks, including long-distance quantum communications.2. The proposed algorithm determines shortest node-disjoint replacement paths in the entangled network structure of the quantum Internet, and minimizes the number of losable entangled contacts in a main-path.3. The shortest node-disjoint replacement paths in the entangled quantum network are determined in a decentralized manner with high computational efficiency.This paper is organized as follows. In Section 2, we characterize the problem and the impacts of a quantum memory failure scenario in an entangled quantum network. In Section 3, we discuss the determination of shortest node-disjoint replacement paths and evaluate the complexity of the method. A performance evaluation is included in Section 4. Finally, Section 5 concludes the paper. Supplementary material is included in the Appendix.

show abstract

Section: Quantum Memory Failuresmentioning

confidence: 99%

Adaptive routing for quantum memory failures in the quantum Internet

Gyöngyösi

Imre

2019

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…The entangled connections have several relevant attributes, the most important of which are the fidelity of entanglement and the entanglement throughput. The throughput of an entangled connection is measured as the number of entangled states per second at a given fidelity, which provides a useful metric on the basis of which further relevant metrics can be built.Here we define measures to characterize the ratio of accessible quantum entanglement in case of complex network failures [65][66][67][68] in the quantum Internet. A complex network failure models a network situation in which a set of quantum nodes and a set of entangled connections become unavailable because of an (unknown) reason.…”

mentioning

confidence: 99%

Entanglement accessibility measures for the quantum Internet

Gyöngyösi

Imre

2020

Quantum Inf Process

View full text Add to dashboard Cite

We define metrics and measures to characterize the ratio of accessible quantum entanglement for complex network failures in the quantum Internet. A complex network failure models a situation in the quantum Internet in which a set of quantum nodes and a set of entangled connections become unavailable. A complex failure can cover a quantum memory failure, a physical link failure, an eavesdropping activity, or any other random physical failure scenario. Here, we define the terms entanglement accessibility ratio, cumulative probability of entanglement accessibility ratio, probabilistic reduction of entanglement accessibility ratio, domain entanglement accessibility ratio, and occurrence coefficient. The proposed methods can be applied to an arbitrary topology quantum network to extract relevant statistics and to handle the quantum network failure scenarios in the quantum Internet. IntroductionAs quantum computers evolves significantly [1-10], there arises a fundamental need for a communication network that provides unconditionally secure communication and all the network functions of the traditional internet. This network structure is the quantum Internet [11][12][13][14][15]22]. The availability of quantum entanglement is a crucial aspect in any global-scale quantum Internet. The quantum Internet refers to a set of connected heterogeneous quantum communication networks realized by quantum nodes and channels (such as optical fibers or wireless optical quantum channels in the physical layer) [16,[59][60][61][62][63][64]. The quantum Internet also integrates a set of classical auxiliary communication channels to transmit auxiliary classical side-information between the quantum nodes. The quantum Internet is modeled as a global-scale quantum communication network composed of quantum subnetworks and networking components. The core network of the quantum Internet is assumed to be an entangled network structure [15,20,21,24,25,27,28,[39][40][41][42][43][44][45][46][47], which is a communication network in which the quantum nodes are connected by entangled connections. An entangled connection refers to a shared entangled system (i.e., a Bell state for qubit systems to connect two quantum nodes) between the quantum nodes. In an unentangled network structure, the quantum nodes are not necessarily connected by entanglement [16,78], and the communication between the nodes is realized in a point-to-point setting. This setting does not allow quantum communication over arbitrary distances, and an unentangled network structure can mostly be used for establishing a point-to-point quantum key distribution (QKD) [70,103] between the quantum nodes. These short distances can be extended to longer distances by the utilization of free-space quantum channels [15,70]. However, this solution is auxiliary, since it can be used only at some specific points of the unentangled network structure. Therefore, it does not represent an adequate and fundamental answer to the problem of long-distance quantum communication. Consequently, in an unentangl...

show abstract

“…The adaptive search radius mechanism can be added into the end of Step 6 to improve the searching performance. The more details of ATS algorithm can be found in [34][35][36][37][38][39][40][41][42][43][44][45][46][47]. …”

Section: Review Of Ats Algorithmmentioning

confidence: 99%

“…The adaptive Tabu search or ATS method [34][35][36][37][38][39][40][41][42][43][44][45][46][47] is used to design the predictive current controller to minimize %THD ,av of source currents after compensation. The review of the ATS algorithm is described in this section.…”

Section: Review Of Ats Algorithmmentioning

confidence: 99%

“…The conventional predictive current control uses the first-order Lagrange equation to approximate the predicted reference currents. Presently, it is well known that there are many artificial intelligence (AI) techniques to apply for the optimization problems in the engineering researches such as the multiobjective harmony search (MOHS) [29], artificial bee colony (ABC) [30,31], competition particle swarm optimization (CPSO) [32], genetic algorithm (GA) [33], and adaptive Tabu search (ATS) [34][35][36][37][38][39][40][41][42][43][44][45][46][47]. The ATS method is developed by Puangdownreong et al in 2002 [34].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Instantaneous Power Theory with Fourier and Optimal Predictive Controller Design for Shunt Active Power Filter

Tiyarachakun

Areerak

2014

Modelling and Simulation in Engineering

View full text Add to dashboard Cite

This paper presents a novel harmonic identification algorithm of shunt active power filter for balanced and unbalanced three-phase systems based on the instantaneous power theory called instantaneous power theory with Fourier. Moreover, the optimal design of predictive current controller using an artificial intelligence technique called adaptive Tabu search is also proposed in the paper. These enhancements of the identification and current control parts are the aim of the good performance for shunt active power filter. The good results for harmonic mitigation using the proposed ideas in the paper are confirmed by the intensive simulation using SPS in SIMULINK. The simulation results show that the enhanced shunt active power filter can provide the minimum %THD (Total Harmonic Distortion) of source currents and unity power factor after compensation. In addition, the %THD also follows the IEEE Std. 519-1992.

show abstract

Scheme to Find k Disjoint Paths in Multi-Cost

Cited by 5 publications

References 9 publications

Adaptive routing for quantum memory failures in the quantum Internet

Adaptive routing for quantum memory failures in the quantum Internet

Entanglement accessibility measures for the quantum Internet

Instantaneous Power Theory with Fourier and Optimal Predictive Controller Design for Shunt Active Power Filter

Contact Info

Product

Resources

About