CN107426101B - Quantum cluster fragment transmission method based on layering - Google Patents
Quantum cluster fragment transmission method based on layering Download PDFInfo
- Publication number
- CN107426101B CN107426101B CN201710670487.8A CN201710670487A CN107426101B CN 107426101 B CN107426101 B CN 107426101B CN 201710670487 A CN201710670487 A CN 201710670487A CN 107426101 B CN107426101 B CN 107426101B
- Authority
- CN
- China
- Prior art keywords
- quantum
- router
- cluster
- fragmented
- fragment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- 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/74—Address processing for routing
-
- 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
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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/26—Route discovery packet
-
- 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/46—Cluster building
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
In a quantum communication network, a data transmission scheme based on quantum clusters can effectively save the transmission time of data between metropolitan area networks and the consumption of entangled resources. However, the quantum router has a limited length of quantum clusters that can be stored and forwarded due to its performance limitation, and the metropolitan area network and the wide area network have very large data volumes, which results in that a large number of quantum clusters cannot be forwarded due to the length limitation problem and can only transmit data in the form of quantum packets. In order to solve the above problems, the present invention provides a quantum cluster fragmentation transmission scheme, which decomposes a quantum cluster that cannot be directly stored and forwarded by a quantum router into a plurality of fragmentation quantum clusters with shorter lengths that can be directly stored and forwarded by the router through fragmentation to complete data transmission, and can complete data transmission of quantum packets with less entanglement resources and less transmission time, thereby having better practical application value.
Description
Technical Field
The invention discloses a quantum cluster fragment transmission method based on layering, and belongs to the field of quantum internet communication.
Background
The document "a quantum packet transmission scheme and performance analysis based on hierarchy" proposes a quantum packet transmission scheme based on a quantum network hierarchy structure for a large-scale quantum communication network, and can further reduce the transmission time and entanglement resources of quantum packet information in the quantum communication network. However, in an actual quantum internet, the core device for completing routing, storing and forwarding is a quantum router, and when a quantum data transmission scheme is researched, the limitation of the performance of the quantum router itself should be fully considered; the quantum router takes quantum packets or quantum packet clusters as basic routing units, and needs to store the arriving quantum packets or quantum packet clusters into a receiving cache and wait for processing; however, the cache of the quantum router is limited, and if each quantum packet or quantum cluster after aggregation of the quantum packets is too long, the quantum packet or quantum cluster may not enter the cache and be directly discarded, which may increase the packet loss rate and negatively affect the performance and working efficiency of the quantum router. Therefore, in practical engineering applications, the quantum router defines a maximum forwarding length for the packets or packet clusters that can be forwarded, and once the length of the quantum packets or quantum packet clusters exceeds the upper limit, the quantum router directly discards the packets or the quantum packet clusters without forwarding the packets or the quantum packet clusters. The quantum cluster data transmission scheme proposed in the document "a hierarchical quantum packet transmission scheme and performance analysis" does not consider the limit of a quantum router on the forwarding length of a quantum cluster, and if the length of the aggregated quantum cluster is too large, the quantum cluster is directly discarded, resulting in data loss.
In order to solve the above problems, the present patent proposes a quantum cluster fragment transmission method based on layering, which can further save the consumption of entangled resources while ensuring the correct transmission of data.
Disclosure of Invention
In the classical internet, the network scale is huge, and in order to effectively manage the huge user host in the internet, the networks of different levels in the internet are divided into a local area network, a metropolitan area network and a wide area network according to the coverage ranges of the networks of different levels. With the continuous development and application of quantum communication technology, the introduction of quantum communication technology into the traditional internet to realize data transmission will be a development direction in the future. The document "a hierarchical quantum packet transmission scheme and performance analysis" divides the quantum internet into a quantum local area network, a quantum metropolitan area network, and a quantum wide area network according to the coverage area based on the classical internet structure, as shown in fig. 1. In the document "a hierarchical quantum packet transmission scheme and performance analysis", it is pointed out that a quantum metropolitan area network is used to receive and forward quantum packets transmitted by its managed lower-level local area network, and a quantum wide area network is used to receive and forward quantum packets or quantum clusters transmitted by its managed lower-level metropolitan area network. The quantum packet message format and the quantum cluster message format are given in the document "a quantum packet transmission scheme and performance analysis based on layering".
The quantum cluster is formed by aggregating quantum packets according to destination addresses and then carrying out route forwarding. The load length among quantum clusters is the sum of all quantum packet lengths during aggregation. However, because the quantum router can forward the quantum packets or quantum packet clusters with limited length, if quantum packets of the same network destination address are aggregated without limit, the length of the generated quantum cluster may exceed the upper limit that the quantum router can handle, and once the length exceeds the upper limit, the quantum cluster will be directly discarded by the quantum router.
In order to effectively solve the problem, the patent provides a fragmentation quantum cluster message format on the basis of a quantum cluster message format, and the specific content of fields contained in the message format is shown in figure 2. The fragment quantum cluster message comprises a destination address field, a service flow category field, a load length field, a mark field, a fragment offset field, an identification field and an effective data field, wherein the destination address field, the service flow category field, the load length field, the mark field, the fragment offset field and the identification field are header fields of the fragment quantum cluster message, and the specific meanings of the fields are as follows:
(1) destination address: the destination address of the quantum cluster is fragmented, and 64 bits of quantum bits are included;
(2) traffic class: comprises 2 quantum bits which can be used for distinguishing quantum groups, quantum clusters and fragment quantum clusters;
(3) the load length is the effective data length in the fragmented quantum cluster and is calculated according to the packet data length of each quantum contained in the fragmented quantum cluster obtained after fragmentation;
(4) marking: 1 quantum bit, and 2-bit binary address coding can be realized by adopting a dense coding mode. When the 2-bit binary address is coded to 00, the data is represented to be allowed to be fragmented and is the last fragment of the whole data; when the 2-bit binary address code is 01, the data is represented to be allowed to be fragmented, and data fragmentation is carried out later; when the 2-bit binary address code is 10, it indicates that fragmentation is not allowed; when the 2-bit binary address is encoded as 11, it is meaningless;
(5) sheet offset: 7 qubits, the slice offset indicating the relative position of a data slice among the original data after a longer data slice, and the length of each slice being an integer multiple of 8 bytes;
(6) marking: at a sending end, when the length of the aggregated quantum cluster is too large, the aggregated quantum cluster can be divided into a plurality of fragmented messages according to a fragmented quantum cluster format, and each fragmented message is allocated with a same message identifier; when the receiving end receives the fragment messages, the receiving end can determine which fragment messages belong to the same long message according to the identification field, and the fragment messages are effectively recombined;
(7) valid data: after the fragmentation, each quantum grouping data contained in the fragmented quantum cluster;
the specific encoding and decoding steps of the flag field are as follows:
step 1, a metropolitan area network router B generates a corresponding quantum entanglement pair aiming at header zone bit information of a fragment quantum cluster message to be sent by the router B, one of the quantum entanglement pairs is reserved for the router B, the other quantum entanglement pair is sent to a next-hop router, and the initially prepared entanglement state is assumed to be
；
Step 2, the metropolitan area network router B realizes the coding of two classic bits of the zone bit by executing different unitary transformations on the quantum bit held by the router B, and the specific coding process is as follows: if the flag bit classical bit information to be transmitted by the MAN router B is 00, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 01, the MAN router holds the flag bit classical bit informationQubit execution unitary transformation
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 10, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 11, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
；
step 3, the metropolitan area network router B sends the coded entangled particles held by the metropolitan area network router B to the next-hop router C, and then the next-hop router uses the Bell base to carry out joint measurement, if the measurement result is that
If yes, the classical bit information of the two zone bits obtained by the router C is 00; if the measurement result is
If yes, the classical bit information of the two zone bits obtained by the router C is 01; if the measurement result is
Then router C obtains two flag bits classical bitsThe information is 10; if the measurement result is
If so, the classical bit information of the two zone bits obtained by the router C is 11; the quantum router can read the header information contained in the fragmented quantum clustering message by performing joint measurement.
The transmission scheme of quantum packet and quantum cluster data is given in detail in the document "a quantum packet transmission scheme and performance analysis based on layering", however, once the length of the aggregated quantum cluster exceeds the upper limit that the quantum router can handle, the quantum cluster is directly discarded by the quantum router, and a large amount of quantum packets are lost. In order to effectively solve the problem, the patent provides a fragment quantum cluster data transmission method on the basis; the quantum data sequence is obtained by aggregating the quantum packets to be sent according to the destination address. If the length of the obtained quantum data sequence can meet the limit of the quantum router on the effective data length of the message, the quantum data sequence is used as effective data and is packaged into a quantum cluster message according to a quantum cluster message format, and then the effective data sequence is directly stored and forwarded through the router; if the length of the obtained quantum data sequence can not meet the limit of the quantum router on the effective data length of the message, the obtained quantum data sequence is decomposed into a plurality of short fragment quantum cluster messages which can be directly stored and forwarded by the router through fragmentation according to the fragment quantum cluster message format to complete data transmission; and finally, the metro network router corresponding to the destination address is reached after the quantum cluster fragmentation message obtained after the quantum cluster message is fragmented is stored and forwarded by the quantum router, and then the metro network router performs message recombination on the received fragmented quantum cluster message to obtain the original quantum packet message. And finally, the metropolitan area network router forwards the received original quantum packet message to the local area network where the receiving end is located.
Assuming that a certain metropolitan area network router receives m quantum packets sent from a local area network within time T, assuming that the maximum effective data length that each quantum router can process is a, the specific steps of fragmented quantum cluster aggregation and reassembly are as follows:
step 1, setting a hardware timer T, supposing that a certain metropolitan area network router receives m quantity sub-packets before the timer T is overtime, adding the m quantity sub-packets into a set QS, and setting an initial value of i as 1;
step 2, a quantum group is taken out from the set QS, the quantum group is represented by QT, and the group QT is added into the set QiIf the set QS is not empty, step 3 is performed;
step 3, taking out the next quantum group from the set QS, the quantum group is represented by QN, if the network addresses corresponding to the destination addresses of QN and QT are the same, adding QT into the set QiPerforming the following steps; if the network addresses corresponding to the destination addresses of the QN and the QT are different, adding the packet QN into the set QSS;
step 4, if the set QS is not empty, executing step 2; if the set QS is empty, then step 5 is executed;
step 5, if the set QSS is empty, executing step 6; if the set QSS is not empty, adding all elements in the set QSS into the set QS, adding 1 to the value of i, and executing the step 2;
step 6, setting the value of v as i, and finally obtaining v sets Qj, 1≤j≤v；
Step 7, aiming at each set QjThe quantum packets contained in (1) complete aggregation;
in step 7, the method specifically comprises the following steps:
step 71, assume set QjContains x quantity sub-packets, then calculates the total length of x quantity sub-packets, denoted by H; if H is less than or equal to A, x quantum packets can be directly merged to be used as effective data, and the corresponding quantum cluster head is added according to a quantum cluster message format given in the document 'a hierarchical-based quantum packet transmission scheme and performance analysis', and the effective data is packaged into a quantum cluster message and then sent out; if H is present>A, executing step 72;
step 72, because the router has limitation on the length of the forwarded quantum packet or quantum packet cluster, in the fragmentation process, each timeThe effective data length of each fragment quantum cluster is equal to or less than A; combining x quantum packets to obtain a large quantum data sequence with length H
；
Step 73, taking out the first A quantum bits from the obtained quantum data sequence, adding the first A quantum bits to the corresponding fragment quantum cluster header to obtain a fragment quantum cluster, subtracting 1 from the value of k, and executing step 74;
step 74, if k is larger than 1, subtracting 1 from the value of k, and repeatedly executing step 73; if k =1, taking out the rest quantum bits in the quantum data sequence, and adding the rest quantum bits to the corresponding fragment quantum cluster header to obtain a fragment quantum cluster; if k =0, quantum cluster fragmentation is finished, finally k fragmented quantum clusters can be obtained, the effective data length of the first k-1 fragment is equal to A, and the effective data length of the kth fragment is equal to or smaller than A, so that the forwarding efficiency of the quantum router can be effectively improved. The value of the slice offset field for each slice quantum cluster is shown in fig. 3. The setting of the mark field is that the MF bit in the first k-1 fragment quantum cluster is 1, and the MF bit of the kth fragment quantum cluster is 0;
and step 75, adding corresponding fragment quantum cluster headers to the fragmented data according to the fragment quantum cluster message format to obtain a complete fragment quantum cluster, wherein in the transmission process of the fragment quantum cluster message, header information of the fragment quantum cluster message is transmitted based on an intensive coding principle, and effective data information of the fragment quantum cluster message is transmitted based on an invisible transmission principle. After routing forwarding is performed on the fragmented quantum clusters for multiple times, the fragmented quantum clusters reach the last hop metropolitan area network router D. On the quantum router D, the fragmented quantum clusters are recombined. The quantum router obtains an identification field in the head of each fragmented quantum cluster through analysis, fragmented quantum cluster messages belonging to the same quantum cluster can be found through the identification field, and then effective data information obtained after the fragmented quantum cluster messages are reordered is a quantum data sequence sent by a sending end according to a fragment offset field in the fragmented quantum cluster messages;
and step 76, aiming at the quantum data sequence obtained after the recombination, the quantum router D obtains the header information of each quantum packet through measurement, recovers the header information of the quantum packet in a dense coding mode, and forwards the recovered quantum packet to each local area network router according to a destination address route by a quantum packet transmission method proposed in the literature, namely a hierarchical-based quantum packet transmission scheme and performance analysis.
Drawings
Fig. 1 is a quantum internet topology, fig. 2 is a quantum cluster fragmentation message format, and fig. 3 is a quantum cluster fragmentation process.
Detailed Description
The patent provides a quantum cluster message format based on the quantum cluster message format, and the specific content of fields contained in the message format is shown in figure 2. The fragment quantum cluster message comprises a destination address field, a service flow category field, a load length field, a mark field, a fragment offset field, an identification field and an effective data field, wherein the destination address field, the service flow category field, the load length field, the mark field, the fragment offset field and the identification field are header fields of the fragment quantum cluster message.
The transmission scheme of quantum packet and quantum cluster data is given in detail in the document "a quantum packet transmission scheme and performance analysis based on layering", however, once the length of the aggregated quantum cluster exceeds the upper limit that the quantum router can handle, the quantum cluster is directly discarded by the quantum router, and a large amount of quantum packets are lost. In order to effectively solve the problem, the patent provides a fragment quantum cluster data transmission method on the basis.
The transmission scheme of quantum packet and quantum cluster data is given in detail in the document "a quantum packet transmission scheme and performance analysis based on layering", however, once the length of the aggregated quantum cluster exceeds the upper limit that the quantum router can handle, the quantum cluster is directly discarded by the quantum router, and a large amount of quantum packets are lost. In order to effectively solve the problem, the patent provides a fragment quantum cluster data transmission method on the basis; the quantum data sequence is obtained by aggregating the quantum packets to be sent according to the destination address. If the length of the obtained quantum data sequence can meet the limit of the quantum router on the effective data length of the message, the quantum data sequence is used as effective data and is packaged into a quantum cluster message according to a quantum cluster message format, and then the effective data sequence is directly stored and forwarded through the router; if the length of the obtained quantum data sequence can not meet the limit of the quantum router on the effective data length of the message, the obtained quantum data sequence is decomposed into a plurality of short fragment quantum cluster messages which can be directly stored and forwarded by the router through fragmentation according to the fragment quantum cluster message format to complete data transmission; and finally, the metro network router corresponding to the destination address is reached after the quantum cluster fragmentation message obtained after the quantum cluster message is fragmented is stored and forwarded by the quantum router, and then the metro network router performs message recombination on the received fragmented quantum cluster message to obtain the original quantum packet message. And finally, the metropolitan area network router forwards the received original quantum packet message to the local area network where the receiving end is located.
Claims (2)
1. A quantum cluster fragmentation transmission method based on layering comprises the steps of aggregating quantum packets to be sent according to destination addresses to obtain a quantum data sequence; if the length of the obtained quantum data sequence can meet the limit of the quantum router on the effective data length of the message, the quantum data sequence is used as effective data and is packaged into a quantum cluster message according to a quantum cluster message format, and then the effective data sequence is directly stored and forwarded through the router; if the length of the obtained quantum data sequence can not meet the limit of the quantum router on the effective data length of the message, the obtained quantum data sequence is decomposed into a plurality of short fragment quantum cluster messages which can be directly stored and forwarded by the router through fragmentation according to the fragment quantum cluster message format to complete data transmission; after quantum cluster fragment messages obtained after the quantum cluster messages are fragmented are stored and forwarded through a quantum router, a metropolitan area network router corresponding to a destination address is finally achieved, and then the received fragment quantum cluster messages are subjected to message recombination through the metropolitan area network router to obtain original quantum packet messages; finally, the metropolitan area network router forwards the received original quantum packet message to a local area network where a receiving end is located; the described quantum cluster fragment transmission method based on layering comprises the following steps:
step 11, assuming that the maximum effective data length that each quantum router can process is A, setting a hardware timer T, assuming that a certain metropolitan area network router receives m quantum packets before the timer T is overtime, adding the m quantum packets into a set QS, and setting an initial value of i to be 1;
step 12 of extracting a quantum packet, indicated by QT, from the set QS, adding the packet QT to the set QiIf the set QS is not empty, step 13 is executed;
step 13, taking out the next quantum group from the set QS, the quantum group is represented by QN, if the network addresses corresponding to the destination addresses of QN and QT are the same, adding QT into the set QiPerforming the following steps; if the network addresses corresponding to the destination addresses of the QN and the QT are different, adding the packet QN into the set QSS;
step 14, if the set QS is not empty, executing step 12; if the set QS is empty, then step 15 is executed;
step 15, if the set QSS is empty, executing step 16; if the set QSS is not empty, adding all elements in the set QSS into the set QS, adding 1 to the value of i, and executing the step 12;
step 16, setting the value of v as i, and finally obtaining v sets Qj, 1≤j≤v；
Step 17, for each set QjThe quantum packets contained in (1) complete aggregation;
in step 17, the method specifically comprises the following steps:
step 171, assume set QjContains x quantity sub-packets, then calculates the total length of x quantity sub-packets, denoted by H; if H is less than or equal to A, x quantum groups can be directly combined to be used as effective data, corresponding quantum cluster heads are added according to the quantum cluster message format, and the effective data is sealedThe quantum cluster messages are sent out after being assembled; if H is present>A, go to step 172;
step 172, because the router has a limit on the length of the forwarded quantum packet or quantum packet cluster, in the fragmentation process, the effective data length of each fragmented quantum cluster is equal to or less than a; combining x quantum packets to obtain a large quantum data sequence with length H
；
Step 173, extracting the first a quantum bits from the obtained quantum data sequence, adding the corresponding fragmentation quantum cluster header to obtain a fragmentation quantum cluster, subtracting 1 from the value of k, and executing step 174;
step 174, if k >1, subtracting 1 from the value of k, and repeating step 173; if k =1, taking out the rest quantum bits in the quantum data sequence, and adding the rest quantum bits to the corresponding fragment quantum cluster header to obtain a fragment quantum cluster; if k =0, quantum cluster fragmentation is finished, finally k fragmented quantum clusters can be obtained, the effective data length of the first k-1 fragment is equal to A, and the effective data length of the kth fragment is equal to or smaller than A, so that the forwarding efficiency of the quantum router can be effectively improved; the setting of the mark field is that the MF bit in the first k-1 fragment quantum cluster is 1, and the MF bit of the kth fragment quantum cluster is 0;
step 175, adding the fragmented data to a corresponding fragmented quantum cluster header according to a fragmented quantum cluster message format to obtain a complete fragmented quantum cluster, wherein in the transmission process of the fragmented quantum cluster message, header information of the fragmented quantum cluster message is transmitted based on an intensive coding principle, and effective data information of the fragmented quantum cluster message is transmitted based on an invisible transmission principle; after routing forwarding is carried out on the fragment quantum clusters for multiple times, the fragment quantum clusters reach a last hop metropolitan area network router D; recombining the fragment quantum clusters on a quantum router D; the quantum router obtains an identification field in the head of each fragmented quantum cluster through analysis, fragmented quantum cluster messages belonging to the same quantum cluster can be found through the identification field, and then effective data information obtained after the fragmented quantum cluster messages are reordered is a quantum data sequence sent by a sending end according to a fragment offset field in the fragmented quantum cluster messages;
and step 176, aiming at the quantum data sequence obtained after the recombination, the quantum router D obtains the header information of each quantum packet through measurement, recovers the header information of the quantum packet in a dense coding mode, and forwards the recovered quantum packet to each local area network router according to a destination address route according to a quantum packet transmission method.
2. The quantum cluster fragmentation transmission method based on layering according to claim 1, characterized in that: the fragment quantum cluster message comprises a destination address field, a service flow category field, a load length field, a mark field, a fragment offset field, an identification field and an effective data field, and the specific meanings of the fields are as follows:
(1) destination address: the destination address of the quantum cluster is fragmented, and 64 bits of quantum bits are included;
(2) traffic class: comprises 2 quantum bits which can be used for distinguishing quantum groups, quantum clusters and fragment quantum clusters;
(3) the load length is the effective data length in the fragmented quantum cluster and is calculated according to the packet data length of each quantum contained in the fragmented quantum cluster obtained after fragmentation;
(4) marking: 1 quantum bit, and 2-bit binary address coding can be realized by adopting a dense coding mode; when the 2-bit binary address is coded to 00, the data is represented to be allowed to be fragmented and is the last fragment of the whole data; when the 2-bit binary address code is 01, the data is represented to be allowed to be fragmented, and data fragmentation is carried out later; when the 2-bit binary address code is 10, it indicates that fragmentation is not allowed; when the 2-bit binary address is encoded as 11, it is meaningless;
(5) sheet offset: 7 qubits, the slice offset indicating the relative position of a data slice among the original data after a longer data slice, and the length of each slice being an integer multiple of 8 bytes;
(6) marking: at a sending end, when the length of the aggregated quantum cluster is too large, the aggregated quantum cluster can be divided into a plurality of fragmented messages according to a fragmented quantum cluster format, and each fragmented message is allocated with a same message identifier; when the receiving end receives the fragment messages, the receiving end can determine which fragment messages belong to the same long message according to the identification field, and the fragment messages are effectively recombined;
(7) valid data: after the fragmentation, each quantum grouping data contained in the fragmented quantum cluster;
the specific encoding and decoding steps of the flag field are as follows:
step 21, the metropolitan area network router B generates a corresponding quantum entanglement pair according to the header flag bit information of the fragmented quantum cluster message to be sent, one of the quantum entanglement pairs is reserved for itself, the other quantum entanglement pair is sent to the next-hop router, and it is assumed that the initially prepared entanglement state is the entanglement state
；
Step 22, the metropolitan area network router B implements two classic bit codes of the zone bit by performing different unitary transformations on the qubits held by the router B, and the specific coding process is as follows: if the flag bit classical bit information to be transmitted by the MAN router B is 00, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 01, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 10, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
(ii) a If the flag bit classical bit information to be transmitted by the MAN router B is 11, the unitary transformation is carried out on the quantum bit held by the router B
The entangled state of the qubit becomes:
；
step 23, the metropolitan area network router B sends the coded entangled particles held by the metropolitan area network router B to the next-hop router C, and then the next-hop router uses the Bell basis to carry out joint measurement, if the measurement result is that the coded entangled particles are contained in the next-hop router C, the next-hop router uses the Bell basis to carry out joint measurement
If yes, the classical bit information of the two zone bits obtained by the router C is 00; if the measurement result is
If yes, the classical bit information of the two zone bits obtained by the router C is 01; if the measurement result is
If so, the classical bit information of the two zone bits obtained by the router C is 10; if the measurement result is
Then the router C obtains classical bit information of two zone bits as11; the quantum router can read the header information contained in the fragmented quantum clustering message by performing joint measurement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710670487.8A CN107426101B (en) | 2017-08-08 | 2017-08-08 | Quantum cluster fragment transmission method based on layering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710670487.8A CN107426101B (en) | 2017-08-08 | 2017-08-08 | Quantum cluster fragment transmission method based on layering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107426101A CN107426101A (en) | 2017-12-01 |
| CN107426101B true CN107426101B (en) | 2020-05-05 |
Family
ID=60436721
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710670487.8A Expired - Fee Related CN107426101B (en) | 2017-08-08 | 2017-08-08 | Quantum cluster fragment transmission method based on layering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107426101B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109218020B (en) * | 2018-10-22 | 2021-05-28 | 苏州大学张家港工业技术研究院 | Invisible transmission method based on unknown parameter four-bit cluster state |
| CN109462547B (en) * | 2018-11-13 | 2021-03-12 | 国科量子通信网络有限公司 | Path selection method and device based on quantum metropolitan area communication network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102014067A (en) * | 2010-12-14 | 2011-04-13 | 北京星网锐捷网络技术有限公司 | Message fragment sending method, device and network equipment |
| CN103905180A (en) * | 2014-04-21 | 2014-07-02 | 西安电子科技大学 | Method for enabling classical application to have access to quantum communication network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7853011B2 (en) * | 2005-05-13 | 2010-12-14 | Ciena Corporation | Methods and apparatus for monitoring the integrity of a quantum channel supporting multi-quanta pulse transmission |
-
2017
- 2017-08-08 CN CN201710670487.8A patent/CN107426101B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102014067A (en) * | 2010-12-14 | 2011-04-13 | 北京星网锐捷网络技术有限公司 | Message fragment sending method, device and network equipment |
| CN103905180A (en) * | 2014-04-21 | 2014-07-02 | 西安电子科技大学 | Method for enabling classical application to have access to quantum communication network |
Non-Patent Citations (2)
| Title |
|---|
| "Quantum Communication for Wireless Wide-Area Networks";Sheng-Tzong Cheng等;《IEEE》;20050731;全文 * |
| "量子通信中的分组传输策略研究";王林飞;《万方数据库》;20170406;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107426101A (en) | 2017-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101446805B1 (en) | Group communication system and method in a mobile ad-hoc network | |
| Zhao et al. | On analyzing and improving COPE performance | |
| CN105556916B (en) | The information statistical method and device of network flow | |
| CN105338570B (en) | Wireless sensor network data source tracing method based on pseudo-random sequence | |
| CN102487306B (en) | Wireless mesh network coding method | |
| CN105163354B (en) | A kind of data stream time delay guarantee strategies using at network coding opportunity between convection current | |
| CN107426101B (en) | Quantum cluster fragment transmission method based on layering | |
| Vellambi et al. | Reliable and efficient message delivery in delay tolerant networks using rateless codes | |
| CN114050994A (en) | SRv 6-based network telemetry method | |
| CN105187326B (en) | A kind of network code in double bounce wireless network topology structure intercepts management method | |
| CN102970235B (en) | Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network | |
| Liu et al. | NCoS: A framework for realizing network coding over software-defined network | |
| Rohrer et al. | Implementation of epidemic routing with ip convergence layer in ns-3 | |
| CN101800629B (en) | Network coding method of code efficiency perception | |
| KR101210078B1 (en) | Method and system for transferring contents based on multi-source multicast | |
| CN108337176A (en) | A kind of message processing method and device | |
| CN101217489B (en) | Router with network encoding function and networking method based on network coding | |
| CN102916761B (en) | Coding and decoding method, related devices and related communication system | |
| Shen et al. | Edge learning based green content distribution for information-centric Internet of Things | |
| Ning et al. | A novel localised network coding-based overhearing strategy | |
| Wang et al. | Research on TEEN with network coding | |
| Dinesh et al. | Ultimate Video Spreading With Qos over Wireless Network Using Selective Repeat Algorithm | |
| Jin et al. | Random linear network coding with cooperating in wireless sensor network | |
| Younus et al. | Video Delivery Based on Random Linear Network Coding | |
| Ning et al. | A novel approach of network coding in wireless networks overhearing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200505 Termination date: 20210808 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |