Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.
Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.
The conventional quantum teleportation schemes enable high-security network communications by establishing end-to-end entangled paths. However, those schemes focus on time synchronization and thus cause lots of idle time. Recent research suggests adopting an opportunistic scheme to forward data qubits as far as it can. However, this scheme lacks security since data qubits may be stored at malicious repeaters, which may peek at, destroy, or fake the data qubits. To this end, we design a new scheme called SOAR that considers trusted repeaters via social networks. Moreover, SOAR promotes the parallelism of swapping processes and thus leads to a less idle time of network resources than the other existing schemes. Furthermore, we design an algorithm called SAGE that can best fit SOAR by linking multiple subpaths via appropriate trusted repeaters to get an ideal path and augmenting least-hop paths to utilize the resources in quantum networks better. Simulation results manifest that SOAR outperforms the other schemes by 54%-89%; SAGE outperforms the other routing algorithms by 50% on average on SOAR.
Quantum teleportation enables high-security communications via quantum entanglement. However, decoherence, signal decay, and environmental interference may cause imperfect entangled pairs with low fidelity. Such entangled pairs may easily generate errors when used to teleport data qubits and cause fatal computation errors on quantum computers. Fortunately, data qubits can be encoded via quantum error correction (QEC) code to recover the detected error to some extent. Nevertheless, letting any repeaters process data qubits is dangerous because malicious repeaters may peep at, destroy, or fake the data qubits. Thus, in this paper, we propose a novel QEC-enabled routing framework MOON facilitated with the concept of social networks (SNs) for quantum networks (QNs). MOON selects only trusted repeaters to process data qubits and exhibits elastic routing with QEC to maximize the throughput without errors. Last, simulation results show that our framework can outperform existing approaches by up to 34% on network throughput without errors.
Quantum teleportation through quantum entanglement over optical fiber channels enables secure communications. However, physical obstacles such as oceans and mountains may block optical fiber channels, and thus quantum networks (QNs) may have multiple disjoint domains. To overcome the issue, in this paper, we first propose a promising framework termed SSR to leverage satellite-based Free-Space Optical (FSO) channels to create inter-domain entangled paths for long-distance requests. Still, FSO channels may be intermittent due to satellite sparsity and atmospheric turbulence. Then, we introduce two algorithms, named RAIN and IDOL, to efficiently utilize FSO channels in SSR. RAIN estimates the existence probability of FSO channels to plan an appropriate inter-domain routing for each request while balancing domain loads. IDOL selects desired intra-domain paths and trusted repeaters for each request to teleport data qubits. Finally, simulation results manifest that SSR runs efficiently and outperforms existing approaches by 31%–57% in throughput.
Due to the unconditional security of quantum communication and flexible and economical implementation of wireless communication, quantum wireless networks (QWNs) have attracted wide attention. Different from fiber-based or satellite-based quantum communication, quantum wireless networks have the characteristics of high dynamics, limited node energy, and quantum resource competition. We have found that the existing quantum wireless network routing protocols suffer from path collision, high energy consumption, and low utilization of quantum resources. In this paper, a more practical and efficient entanglement routing protocol, which can find contention-free paths for concurrent source destination pairs, is proposed. Simulation results show that the proposed protocol can not only greatly improve the throughput and success rate of the network, but also significantly prolong the network lifetime. The research developed by this work may stimulate more investigations of entanglement routing problems in QWNs.
Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.
Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.