Bacciottini et al., 2023 - Google Patents

REDiP: Ranked Entanglement Distribution Protocol for the Quantum Internet

Bacciottini et al., 2023

View PDF
Document ID
7558949194400391064
Author
Bacciottini L
Lenzini L
Mingozzi E
Anastasi G
Publication year
Publication venue
IEEE Open Journal of the Communications Society

External Links

Snippet

The distribution of entangled qubit pairs to end nodes is the key requirement of a quantum network to enable qubit state transmission through quantum teleportation. Existing protocols for entanglement distribution fix a specific swapping order on the involved quantum …
Continue reading at ieeexplore.ieee.org (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks

Similar Documents

Publication Publication Date Title
Kozlowski et al. Designing a quantum network protocol
Dutta et al. On the complexity of information spreading in dynamic networks
Van Meter et al. Recursive quantum repeater networks
CN110380844A (en) A kind of quantum key delivering method, equipment and storage medium
Jaumard et al. Efficient spectrum utilization in large scale RWA problems
Huang et al. Topology design in time-evolving delay-tolerant networks with unreliable links
WO2024067886A1 (en) Flexible ethernet-based power communication service resource allocation method and apparatus
CN114006694A (en) Quantum key processing method and device, electronic equipment and storage medium
Luo et al. Inter-datacenter bulk transfers: Trends and challenges
CN111385198A (en) Path determining method, device and communication system
Sharma et al. Routing and scheduling for 1+ 1 protected DetNet flows
Bacciottini et al. REDiP: Ranked Entanglement Distribution Protocol for the Quantum Internet
Wu Network coding for multicasting
Adler et al. Scheduling time-constrained communication in linear networks
Din et al. Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks
Pouryousef et al. Quantum network planning for utility maximization
Aringhieri et al. Comparing metaheuristic algorithms for sonet network design problems
Bacciottini et al. A configurable protocol for quantum entanglement distribution to end nodes
Shi et al. Concurrent Entanglement Routing for Quantum Networks: Model and Designs
Gan et al. A routing framework for quantum entanglements with heterogeneous duration
Su et al. Synthesizing fault-tolerant schedule for time-triggered network without hot backup
Nguyen et al. Maximizing entanglement routing rate in quantum networks: Approximation algorithms
Zeng et al. Entanglement Routing over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements
CN105591773B (en) Method, device and system for concurrent processing of service creation and increment discovery
Huang et al. Socially-aware concurrent entanglement routing with path decomposition in quantum networks