Bandwidth and key allocation method for dynamic traffic and related apparatus

Abstract

The application provides a bandwidth and key allocation method for dynamic services and related equipment, which comprises the following steps: after receiving a communication request of a dynamic service, a candidate communication path set is calculated according to the source and sink nodes of service attribute information carried by the communication request; the amount of bandwidth required by the dynamic service at each moment in the transmission process of an optical transport network is determined according to the service attribute information; the amount of bandwidth supply at each moment in the transmission process is determined according to the dynamic change requirement of the dynamic service; the amount of quantum key is determined according to the required bandwidth; the problem of unbalanced allocation of dynamic service bandwidth and key resources is solved; if there is a candidate communication path in the candidate communication path set that meets the above-mentioned amount of bandwidth and the amount of quantum key, the dynamic service is deployed in the candidate communication path, the transmission of the dynamic service is completed, and the balance between dynamic service requirement and static resource utilization is realized.

Description

Technical Field

[0001] This application relates to the field of optical network communication technology, and in particular to a bandwidth and key allocation method and related apparatus for dynamic services. Background Technology

[0002] In optical transport networks, an optical path needs to be established before service transmission and dismantled after service transmission is completed. Both the establishment and dismantling of optical paths rely on signaling. The data plane and control plane are vulnerable to network attacks; encryption can effectively reduce the negative impact of network attacks, and quantum key distribution (QKD) technology can ensure secure key exchange.

[0003] For dynamic services, the provision of bandwidth and key resources is determined by peak demand, resulting in significant resource waste. The introduction of Optical Service Unit (OSU) technology can ensure lossless bandwidth adjustment. Meanwhile, to ensure data security, key resources used for data encryption need to be updated periodically. While frequent bandwidth adjustments can improve bandwidth utilization, they consume key resources used for encrypted signaling. Therefore, it is crucial to provide bandwidth and key resources to dynamic services on demand. Summary of the Invention

[0004] In view of this, the purpose of this application is to propose a bandwidth and key allocation method and related apparatus for dynamic services.

[0005] To achieve the above objectives, the first aspect of this application provides a bandwidth and key allocation method for dynamic services, comprising:

[0006] In response to receiving a communication request from a dynamic service, read the service attribute information carried in the communication request;

[0007] A set of candidate communication paths is calculated based on the source and destination nodes in the business attribute information.

[0008] The amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network is determined based on the service attribute information.

[0009] The number of quantum keys required by the dynamic service at each moment is determined based on the amount of bandwidth required at each moment.

[0010] In response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each moment and the amount of quantum keys required at each moment, the dynamic service is deployed in the candidate communication path.

[0011] A second aspect of this application provides a bandwidth and key allocation apparatus for dynamic services, comprising:

[0012] The receiving module is configured to read the service attribute information carried in the communication request in response to receiving a communication request from a dynamic service;

[0013] The calculation module is configured to calculate a set of candidate communication paths based on the source and destination nodes in the business attribute information;

[0014] The first determining module is configured to determine the amount of bandwidth required by the dynamic service at each moment during the transmission process of the optical transport network based on the service attribute information.

[0015] The second determining module is configured to determine the number of quantum keys that the dynamic service needs to consume at each moment based on the amount of bandwidth required at each moment;

[0016] The deployment module is configured to deploy the dynamic service in the candidate communication path in response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each time and the amount of quantum keys required at each time.

[0017] A third aspect of this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the method described above when executing the computer program.

[0018] As can be seen from the above, the bandwidth and key allocation method and related equipment for dynamic services provided in this application, after receiving a communication request for a dynamic service, calculates a set of candidate communication paths based on the source and destination nodes of the service attribute information carried in the communication request. Based on the service attribute information, it determines the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network. This achieves the determination of the bandwidth supply at each moment during transmission based on the dynamic changes in the demand of the dynamic service. Then, it determines the number of quantum keys based on the required bandwidth, solving the problem of imbalance between bandwidth and key resource allocation for dynamic services. If a candidate communication path exists in the set of candidate communication paths that satisfies the above-mentioned bandwidth and quantum key requirements, the dynamic service is deployed in that candidate communication path to complete the transmission of the dynamic service, thereby achieving a balance between dynamic service demands and static resource utilization. Attached Figure Description

[0019] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0020] Figure 1 This is a diagram of a quantum key distribution architecture based on a software-defined optical network, according to an embodiment of this application.

[0021] Figure 2 This is a schematic diagram illustrating the working principle of QKD in an embodiment of this application;

[0022] Figure 3(a) is a schematic diagram of the service bandwidth and bandwidth consumption of an embodiment of this application;

[0023] Figure 3(b) is a schematic diagram of the service bandwidth and key consumption of an embodiment of this application;

[0024] Figure 4(a) is a schematic diagram of the on-demand allocation of service bandwidth and bandwidth consumption in an embodiment of this application;

[0025] Figure 4(b) is a schematic diagram of the on-demand allocation of service bandwidth and key consumption in an embodiment of this application;

[0026] Figure 5 This is a flowchart illustrating the bandwidth and key allocation method for dynamic services according to an embodiment of this application.

[0027] Figure 6 This is a schematic diagram of the original service bandwidth and service bandwidth re-integration of the first dynamic service in an embodiment of this application.

[0028] Figure 7 This is a network topology diagram of an embodiment of this application;

[0029] Figure 8 This is a schematic diagram illustrating the service bandwidth re-integration based on the key update cycle in an embodiment of this application.

[0030] Figure 9 This is a schematic diagram of the bandwidth and key allocation device for dynamic services according to an embodiment of this application;

[0031] Figure 10 This is a schematic diagram of the hardware structure of an electronic device according to an embodiment of this application. Detailed Implementation

[0032] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0033] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0034] As described in the background section, in an optical transport network, an optical path needs to be established before service transmission and dismantled after service transmission is completed. Both the establishment and dismantling of the optical path rely on signaling. When the service bandwidth changes, signaling is also required to adjust the optical path bandwidth. Figure 1 This diagram illustrates a quantum key distribution architecture based on a software-defined optical network (SDON). It primarily comprises four planes: the infrastructure plane, the QKD plane, the control plane, and the application plane. The infrastructure plane includes an Optical Transport Network (OTN) and a Data Communication Network (DCN). The OTN includes multiple Optical Cross-connects (OXCs), and the DCN includes multiple Encryption Signaling Nodes (ESNs). Service data is transmitted in the OTN, while control information (such as signaling) is transmitted in the DCN. The QKD plane provides keys for the DCN and OTN in the infrastructure layer and includes multiple Quantum Communication Nodes (QCNs). The control plane includes a controller that controls the transmission of service data, control information, and key distribution in the QKD layer. Service requests are generated by the application plane; users generate service requests through the application plane and send them to the controller in the control plane. The controller deploys service transmission paths in the OTN and signaling transmission paths in the DCN according to service requests, and uses the quantum key generated by the control QKD plane to encrypt service data and signaling. Encryption can effectively reduce the negative impact of network attacks, and quantum key distribution technology can ensure secure key exchange.

[0035] Figure 2 A schematic diagram of the QKD working principle is shown, such as Figure 2 As shown, the basic components of QKD are a QKD terminal (comprising a transmitter and a receiver) and a QKD channel connecting them. A QKD terminal, often called a QKD device, encapsulates the hardware and software for implementing QKD within a defined security framework. A QKD channel typically consists of a quantum channel and a classical channel. Classical channels can be further categorized into synchronization channels and negotiation channels based on their functionality. The quantum channel transmits quantum signals, which are composed of quantum states encoded with classical information. The classical channel transmits classical signals to achieve synchronization and key negotiation between the transmitter and receiver. If an eavesdropper intercepts a portion of the quantum states in the quantum channel, these states will not be used for key distribution because the receiver will not receive them. Furthermore, the eavesdropper might measure and copy these quantum states and send them to the receiver, but the no-cloning theorem guarantees that the copied quantum states will inevitably be altered, resulting in significant errors. Therefore, any potential eavesdropping on the QKD process can be detected. A QKD transmitter and receiver connected via a QKD channel can execute a set of procedures according to a specific QKD protocol to establish a shared symmetric key between them. The quantum key distribution transmitter encrypts the plaintext using the symmetric key and transmits it through a classical channel. The quantum key distribution receiver decrypts the received encrypted ciphertext using the symmetric key to obtain the plaintext, thus achieving encrypted transmission of the plaintext.

[0036] Traditionally, bandwidth and key resources are supplied based on the maximum bandwidth and key quantity required by the service. For dynamic bandwidth services, supplying bandwidth based on the maximum required amount leads to huge bandwidth consumption, as shown in Figure 3(a). The service bandwidth changes in real time, but the actual bandwidth consumption remains at the maximum bandwidth, resulting in unnecessary waste of bandwidth resources. For services with higher security levels, the key quantity requirement is larger and the key update cycle is shorter. Supplying keys based on the maximum required amount leads to huge key consumption, as shown in Figure 3(b). The service bandwidth changes in real time, and the corresponding key requirement also changes in real time, but the actual key consumption remains at the maximum key requirement, resulting in unnecessary waste of key resources. Bandwidth and key resources are very valuable; meaningless consumption leads to increased network resource consumption and increased service congestion rates. In view of this, this application proposes a bandwidth and key allocation method for dynamic services. By allocating bandwidth and keys on demand, a balance is achieved between dynamic service requirements and static resource utilization. By implementing the bandwidth and key allocation method provided in this application, unnecessary bandwidth and key consumption is reduced. As shown in Figure 4(a), bandwidth consumption is allocated according to the real-time changing service bandwidth. As shown in Figure 4(b), key consumption is allocated according to the real-time changing service bandwidth.

[0037] The embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0038] Figure 5 This illustrates a bandwidth and key allocation method for dynamic services, such as... Figure 5 As shown, the method includes the following steps:

[0039] Step 502: In response to receiving a communication request for a dynamic service, read the service attribute information carried in the communication request.

[0040] Specifically, dynamic services can include online games, data backup between data centers, or user migration to the cloud. Users generate communication requests through the application plane and send them to the controller in the control plane. The controller reads the communication requests, which typically carry service attribute information. This service attribute information includes, but is not limited to, service type, source and destination node information, and security level information.

[0041] Step 504: Calculate the candidate communication path set based on the source and destination nodes in the business attribute information.

[0042] Specifically, based on the source and destination node information, multiple paths can be calculated, with the source node as the starting point and the destination node as the ending point. Each path also includes multiple intermediate nodes, and a link is formed between every two nodes. Thus, each path includes multiple links. The calculated multiple paths are combined into a candidate communication path set.

[0043] Step 506: Determine the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network (OTN) based on the service attribute information. The service attribute information includes the bandwidth consumption at each moment during service transmission or the total data volume during transmission; the bandwidth consumption and total data volume are positively correlated. Based on the changing bandwidth consumption of the dynamic service, a preset strategy is used to allocate suitable bandwidth to the dynamic service, i.e., determine the amount of bandwidth required by the dynamic service at each moment during transmission over the OTN.

[0044] Step 508: Determine the number of quantum keys required for the dynamic service at each moment based on the bandwidth required at each moment. According to the optical path establishment and dismantling process in OTN and the OSU bandwidth adjustment process, establishing and dismantling an optical path each requires one key, increasing bandwidth requires two keys, and decreasing bandwidth requires one key. Based on the bandwidth consumption requirements at each moment during the entire transmission process of the dynamic service, calculate the number of quantum keys required at each moment.

[0045] Step 510: In response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each moment and the amount of quantum keys required at each moment, the dynamic service is deployed in the candidate communication paths.

[0046] Specifically, if there exists a candidate communication path set that can meet the bandwidth consumption and key consumption required during dynamic service transmission, it indicates that the dynamic service can be transmitted in that path. The controller then deploys the dynamic service in that candidate communication path to complete the transmission of the dynamic service.

[0047] Based on steps 502 to 510 above, a communication request for a dynamic service is received. A set of candidate communication paths is calculated based on the source and destination nodes according to the service attribute information carried in the communication request. The amount of bandwidth required by the dynamic service at each moment during transmission in the Optical Transport Network (OTN) is determined based on the service attribute information. This realizes the determination of the bandwidth supply at each moment during transmission based on the dynamic changes in the demand of the dynamic service. Then, the number of quantum keys is determined based on the required bandwidth, which solves the problem of imbalance between bandwidth and key resource allocation for dynamic services. If there is a candidate communication path in the set of candidate communication paths that meets the above bandwidth and quantum key requirements, the dynamic service is deployed in that candidate communication path to complete the transmission of the dynamic service, thereby achieving a balance between dynamic service demand and static resource utilization.

[0048] In some embodiments, calculating the candidate communication path set based on the source and destination nodes in the service attribute information includes: obtaining the candidate communication path set using the K-shortest path algorithm based on the source and destination nodes.

[0049] Specifically, the K-shortest path algorithm can be divided into two parts. The first part calculates the first shortest path P(1), and then calculates the other K-1 shortest paths based on this. When calculating P(i+1), all nodes on P(i) except the terminal node are considered as deviation nodes, and the shortest path from each deviation node to the terminal node is calculated. This path is then concatenated with the paths from the starting node to the deviation nodes on the previous P(i) to form candidate paths, thereby obtaining the shortest deviation path. The K-shortest path algorithm can be used to calculate the candidate communication path set. In other embodiments, other path algorithms can be used to calculate the candidate communication path set, which will not be elaborated on here.

[0050] In some embodiments, the dynamic service includes a first dynamic service; determining the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network based on the service attribute information includes:

[0051] The amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network is determined based on the original service bandwidth requirement in the service attribute information of the first dynamic service and the preset bandwidth adjustment strategy. The original service bandwidth requirement changes in real time.

[0052] Specifically, the first dynamic service is a Quality Guaranteed (QG) service. QG services are semi-permanent, and their bandwidth and key requirements are time-varying. A preset bandwidth strategy can be a pre-defined bandwidth threshold, which can be determined based on the bandwidth fluctuations of the dynamic service. Once the bandwidth threshold is determined, if the current bandwidth demand exceeds or falls below the threshold, adjustments to bandwidth allocation (increasing or decreasing bandwidth allocation) are required. In this embodiment, it is assumed that the service bandwidth is always dynamically changing. If the allocated bandwidth is directly adjusted according to the required dynamic bandwidth, excessive signaling is needed to adjust the bandwidth, and signaling encryption consumes key resources. Therefore, setting a bandwidth threshold can effectively reduce the amount of signaling used for bandwidth adjustment, and also reduce the key resources consumed by encrypted signaling.

[0053] In some embodiments, determining the amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network based on the original service bandwidth in the service attribute information of the first dynamic service and a preset bandwidth adjustment strategy includes:

[0054] The amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network is determined based on the bandwidth change between two adjacent moments in the original service bandwidth and a preset change threshold.

[0055] Specifically, Figure 6 The figure shows the original service bandwidth of the first dynamic service and the amount of bandwidth required at each moment after the bandwidth adjustment strategy (service bandwidth reassembly). The horizontal axis represents time in seconds (T), and the vertical axis represents bandwidth in gigabit / second (Gbit / T). The dashed line in the figure represents the original service bandwidth, and the solid line represents the actual allocated bandwidth determined by the bandwidth adjustment strategy. In this embodiment, the bandwidth adjustment strategy is to increase or decrease the bandwidth allocation accordingly when the bandwidth change between two adjacent moments exceeds a change threshold. Figure 6In the 0T-2T time slots, the original service bandwidth value is between 3Gbit / T and 4Gbit / T; therefore, the allocated bandwidth is 4Gbit / T. In the 2T-3T time slots, the original service bandwidth value changes significantly, exceeding 1Gbit / T. Since the change threshold in this embodiment is set to 1Gbit / T, the bandwidth allocation needs to be reduced at time 3T, decreasing from 4Gbit / T to 2Gbit / T. Similarly, at time 8T, the allocated bandwidth value is reduced from 5Gbit / T to 3Gbit / T. In the 5T-6T time slots, the change in original service bandwidth exceeds the change threshold of 1Gbit / T, requiring a corresponding increase in allocated bandwidth. At time 5T, the allocated bandwidth is increased from 2Gbit / T to 5Gbit / T. By determining the corresponding allocated bandwidth based on the original service bandwidth at each time point, the service bandwidth re-integration curve for each time point is finally obtained (solid line in the figure).

[0056] In some embodiments, the method further includes: determining whether the service attribute requirements of the first dynamic service include a key update cycle;

[0057] Since the service attribute requirements of the first dynamic service do not include a key update cycle, the candidate communication paths that satisfy the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service include:

[0058] The remaining bandwidth of each link in the candidate communication path is greater than the maximum bandwidth required during the first dynamic service transmission, and the remaining quantum key quantity of each link at the initial moment is greater than the quantum key quantity required for the first dynamic service transmission.

[0059] Specifically, the service attributes of the first dynamic service include at least the source node, destination node, time-varying bandwidth, time-varying key, security level, and key update cycle. As shown in Table 1 below, the specific service attributes of the first dynamic service include:

[0060] Table 1 Business Attributes Table of the First Dynamic Service

[0061] Serial Number Business Request Source node Dormitory node Business type Security level 1 s1 1 5 QG Absolutely safe

[0062] Service transmission includes absolute security and relative security. Absolute security means that both the initial key request and the update key request can be successfully allocated, while relative security means that both the initial key request and the partial update key request can be successfully allocated. The network topology in this embodiment is as follows: Figure 7 As shown, the system includes 6 nodes and 5 links. The 6 nodes are numbered 1, 2, 3, 4, 5, and 6, and the 5 links are numbered a, b, c, d, and e. Table 2 shows the remaining resource status of each link at different times before the first dynamic service deployment.

[0063] Table 2: Remaining Link Resources (Bandwidth / Key)

[0064]

[0065]

[0066] The original service bandwidth and service bandwidth re-integration curve of the first dynamic service are as follows: Figure 6 As shown. Based on the source and destination nodes of the service, the candidate communication path is calculated to be 1-3-4-5, including links a, c, and d. From Figure 6 As indicated by the dashed line, the maximum bandwidth required for the first dynamic service transmission is 5 Gbit / T, and the remaining bandwidth at each time point in links a, c, and d is greater than 5 Gbit / T. Regarding bandwidth, the service needs to establish an optical path at time 0T, from... Figure 6 As shown in the solid line, bandwidth adjustments are required at times 3T, 5T, and 8T, and the optical path needs to be dismantled at time 10T. Specifically, signaling encryption consumes one key each at times 0T and 10T; at times 3T and 8T, bandwidth decreases, and signaling encryption consumes one key each; at time 5T, bandwidth increases, and signaling encryption consumes two keys. Service key requirements are integrated based on the dynamic key requirements of the service; the service key requirement equals the product of the allocated bandwidth and time. For example, from... Figure 6 As shown by the solid line, the bandwidth within the 0T-1T time slot is 4Gbit / T. Therefore, the key required for service data transmission is 4Gbit / T * 1T = 4. Following this logic, the service key requirements for each time slot can be determined. To ensure service security, the initial key requirements must be met. That is, at the initial moment, the number of quantum keys required for the first dynamic service transmission must meet the key quantity required when the dynamic bandwidth is at its maximum. Figure 6 As shown by the solid line, the maximum dynamic bandwidth is 5 Gbit / T, and the corresponding service key requirement is 5 Gbit / T * 1T = 5. Adding the initial need to establish an optical path, which consumes one quantum key for signaling, the initial key requirement at time 0T is 6. In Table 2, at time 0T, the remaining quantum keys for links a, c, and d are all greater than 6, thus satisfying the initial key requirement. In summary, candidate communication path 1-3-4-5 meets the bandwidth and quantum key requirements for the first dynamic service at each time step, and therefore, the first dynamic service can be deployed in candidate communication path 1-3-4-5.

[0067] In some embodiments, in response to the key update cycle included in the service attribute requirements of the first dynamic service, the candidate communication paths that satisfy the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service include:

[0068] The remaining bandwidth of each link in the candidate communication path is greater than the maximum bandwidth required during the first dynamic service transmission. At the initial moment, the remaining quantum key quantity of each link is greater than the quantum key quantity required for the first dynamic service transmission. Furthermore, in each key update cycle, the remaining quantum key quantity of each link is greater than the quantum key quantity required for the first dynamic service transmission.

[0069] Specifically, the service attributes of the first dynamic service include at least the source node, destination node, time-varying bandwidth, time-varying key, security level, and key update cycle. As shown in Table 3 below, the specific service attributes of the first dynamic service include:

[0070] Table 3. Business Attributes of the First Dynamic Service

[0071] Serial Number Business Request Source node Dormitory node Business type Security level Key update cycle 1 s1 1 5 QG Absolutely safe 2T

[0072] In this embodiment, the only difference between Table 3 and Table 1 is the addition of a 2T key update period; all other conditions remain the same. The candidate path nodes calculated based on the service source and destination nodes are still 1-3-4-5. The remaining resource status of each link at different times is shown in Table 2. The original service bandwidth and service bandwidth re-integration curve of the first dynamic service are shown in... Figure 6 As shown. Service key requirements are integrated based on the dynamic key requirements of the service. The service key requirement is equal to the product of the allocated bandwidth and time. Given that the service attributes of the first dynamic service include a key update cycle, it is necessary to integrate the number of quantum keys required within each key update cycle. Figure 8The diagram illustrates the service bandwidth allocation at various points in time during the key update cycle, i.e., a schematic diagram of the service bandwidth re-integration curve. Based on the key update cycle, the first dynamic service transmission duration is divided into five cycles: 0-2T, 2T-4T, 4T-6T, 6T-8T, and 8T-10T. The key requirement calculation method is the same as in the previous embodiment. In the 0-2T cycle, the key requirement is 4Gbit / T*2T = 8. However, the initial key requirement must meet the key requirement at the maximum bandwidth. The transmission cycle at the maximum bandwidth is 6T-8T, and the key requirement is 5Gbit / T*2T = 10. Therefore, the key requirement in the 0-2T cycle is also 10. Similarly, the key requirements in the 0T-2T, 2T-4T, 4T-6T, 6T-8T, and 8T-10T cycles are 10, 6, 7, 10, and 6, respectively. In the aforementioned embodiment, candidate communication path 1-3-4-5 already satisfies the requirement that the remaining bandwidth of each link in all included links is greater than the maximum bandwidth required during the transmission of the first dynamic service, and that the remaining quantum key quantity of each link at the initial moment is greater than the quantum key quantity required for the transmission of the first dynamic service. It is only necessary to determine whether the remaining quantum key quantity of each link in each key update cycle is greater than the quantum key quantity required for the transmission of the first dynamic service. As can be seen from Table 2, in each key update cycle, the remaining quantum key quantity of the links satisfies the quantum key quantities required for the transmission of the first dynamic service: 10, 6, 7, 10, and 6. Therefore, candidate communication path 1-3-4-5 satisfies the bandwidth required for the first dynamic service at each moment and the quantum key quantity consumed at each moment, and the first dynamic service can be deployed in candidate communication path 1-3-4-5.

[0073] It should be noted that if the remaining quantum key data in the link cannot meet the key demand in each key update cycle, the security level of the first dynamic service will be reduced. After the security level is reduced, only the initial key required at the initial moment will be allocated, and the key demand in subsequent key update cycles will not be allocated.

[0074] The first dynamic service is deployed in candidate communication paths 1-3-4-5, and the remaining resources of each link after the first dynamic service is completed are shown in Table 4.

[0075] Table 4: Remaining Link Resources (Bandwidth / Key) After Deployment of the First Dynamic Service

[0076] 0 T 2T 3T 4T 5T 6T 7T 8T 9T 10T a 10 / 9 4 / 10 5 / 3 5 / 6 7 / 5 7 / 10 3 / 5 5 / 10 3 / 8 6 / 10 6 / 14 b 10 / 30 5 / 7 5 / 10 5 / 10 6 / 10 6 / 10 0 / 13 4 / 5 4 / 10 c 10 / 29 4 / 10 5 / 3 5 / 6 7 / 5 7 / 10 3 / 8 3 / 10 3 / 8 6 / 10 6 / 14 d 10 / 9 4 / 10 5 / 3 5 / 6 7 / 5 7 / 10 3 / 5 3 / 10 3 / 8 6 / 10 6 / 14 e 10 / 30 5 / 7 5 / 10 5 / 10 6 / 10 6 / 10 0 / 13 4 / 5 4 / 10

[0077] Referring to both Tables 2 and 4, at time 2T, the resource quantity of link a in Table 2 is 9 / 9, and the resource quantity of link a in Table 4 is 5 / 3. From... Figure 8As can be seen, the bandwidth occupied at time 2T is 4Gbit / T, therefore, the bandwidth remaining amount changes from 9 to 4. Simultaneously, a key update is required at time 2T. The key required after the update is the same as the key consumed within the 2T-4T period, which is 6. Therefore, the key remaining amount changes from 9 to 3. The calculation method for resource remaining amounts at other times is the same, and will not be elaborated here.

[0078] In some embodiments, the dynamic service includes a second dynamic service; determining the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network based on the service attribute information includes:

[0079] Traverse each candidate communication path in the candidate communication path set, determine the target candidate communication path in the candidate communication path set based on the total data transmission volume and data transmission deadline contained in the service attribute information of the second dynamic service, and determine the amount of bandwidth required by the second dynamic service at each moment during the transmission process of the target candidate communication path.

[0080] Specifically, the second dynamic service is a Quality Tolerant (QT) service, which requires the transmission of a certain amount of data within a given time period. Table 5 shows the service attribute table for the second dynamic service.

[0081] Table 5. Business Attributes of the Second Dynamic Service

[0082] Serial Number Business Request Source node Dormitory node Business type Total data volume Deadline Security level 2 s2 2 6 QT 32 8T Absolutely safe

[0083] In this embodiment, the second dynamic service arrives after the first dynamic service. The second dynamic service is deployed only after the first dynamic service is deployed. Therefore, the remaining resource status of each link before the deployment of the second dynamic service is as shown in Table 4. The candidate communication path calculated based on the service source and destination nodes is 2-3-4-6, which includes links b, c, and e. Based on the total data volume and deadline in Table 5, and the remaining resource status of each link in Table 4, it is determined whether candidate communication path 2-3-4-6 is the target candidate communication path, that is, whether candidate communication path 2-3-4-6 can meet the transmission requirements of the second dynamic service and whether the total data volume of 32 Gbit / T can be transmitted before time 8T. By observing the remaining bandwidth of each link at each time point in Table 4, the amount of data to be transmitted in each time slot is determined. Since the remaining bandwidth of link c is the least at time T, with a remaining bandwidth value of 4 Gbit / T, the maximum amount of data to be transmitted in time slots 0-T is 4 Gbit / T. Similarly, the maximum amount of data to be transmitted in time slots T-3T is 5 Gbit / T, in time slots 3T-5T is 6 Gbit / T, and in time slots 6T-8T is 3 Gbit / T. The cumulative amount of data transmitted before time 8T is 32 Gbit / T, which meets the transmission requirements of the second dynamic service. Therefore, candidate communication path 2-3-4-6 is the target candidate communication path, and the second dynamic service can be deployed in the target candidate communication path. If the candidate communication path does not meet the transmission requirements of the second dynamic service, the task deployment will fail. It should be noted that in time slots 5T-6T, since the remaining bandwidth of link b is 0 at time 6T, data cannot be transmitted in time slots 5T-6T.

[0084] In some embodiments, the method further includes: determining whether the second dynamic service needs to be transmitted multiple times based on the amount of bandwidth required by the second dynamic service at each moment during the transmission of the target candidate communication path;

[0085] In response to the fact that the second dynamic service does not require multiple transmissions, the candidate communication path that satisfies the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service includes: at the initial moment of the second dynamic service transmission, the remaining number of quantum keys in each link of all links included in the target candidate communication path is greater than the number of quantum keys required for the second dynamic service transmission.

[0086] In response to the second dynamic service requiring multiple transmissions, the candidate communication path that satisfies the amount of bandwidth required at each moment of the dynamic service and the number of quantum keys consumed at each moment includes: at the initial moment of each transmission in the multiple transmissions, the number of remaining quantum keys in each link of all links included in the target candidate communication path is greater than the number of quantum keys required for the transmission of the second dynamic service, and at each moment of each transmission, the number of remaining quantum keys in each link is greater than the maximum number of quantum keys required for the transmission of the second dynamic service in that transmission.

[0087] Specifically, multiple transmissions refer to the situation where, during the transmission of the second dynamic service within the same path, there is a moment when the bandwidth of a certain link is zero. If so, the optical path needs to be dismantled and re-established when the bandwidth is no longer zero. As determined in the previous embodiment regarding the transmission of the second dynamic service in each time slot, data cannot be transmitted in the 5T-6T time slot before the deadline of 8T. Therefore, the second dynamic service is transmitted in two separate transmissions.

[0088] When the second dynamic service does not require multiple transmissions, at the initial transmission time, if the number of remaining quantum keys in each link of the target candidate communication path is greater than the number of quantum keys required for the transmission of the second dynamic service, the second dynamic service can be deployed in the target candidate communication path. Assuming in the aforementioned embodiment, data can be output normally within the 5T-6T time slot, meaning the second dynamic service does not require multiple transmissions, to ensure service security, the initial key requirement must be met. The initial key requirement must meet the key quantity required when the dynamic bandwidth is at its maximum. The bandwidth occupied by the data transmitted within the 3T-5T time slot is 6Gbit / T, which is the maximum bandwidth in the entire transmission process. At this time, the key requirement is 6Gbit / T * 2T = 10. Adding the 1 key consumed at time 0T for establishing the optical path, the total number of keys consumed at time 0T is 11. In Table 4, the remaining key quantities for each link (b, c, e) at time 0T are all greater than 11.

[0089] When the second dynamic service requires multiple transmissions, in this embodiment, the second dynamic service needs to be transmitted in two stages. The first transmission occurs from time slot 0T to 5T, and the second transmission occurs from time slot 5T to 8T. Based on the data transmission volume within each time slot, it can be determined that the second dynamic service needs to establish an optical path at time slots 0T and 6T, consuming one quantum key each time. The bandwidth occupied during time slots 0T-1T is 4Gbit / T, and during time slots 1T-3T it is 5Gbit / T. The bandwidth increases at time slot 1T, therefore consuming two quantum keys at time slot T. The bandwidth occupied during time slots 3T-5T is 6Gbit / T. The bandwidth increases at time slot 3T, therefore consuming two quantum keys at time slot 3T. Data cannot be transmitted during time slots 5T-6T, and the optical path needs to be dismantled at time slot 5T, consuming one quantum key. After the transmission is completed, the optical path needs to be dismantled at time slot 8T, consuming one quantum key. Since the second dynamic service is transmitted in two stages, the key required for this transmission needs to be allocated before each transmission. Within the 0T-5T time slots, the total number of quantum keys required for data transmission is 4Gbit / T*1T + 5Gbit / T*2T + 6Gbit / T*2T = 26. Establishing an optical path at time 0T consumes 1 key; therefore, the number of keys to be allocated at time 0T is 27. Similarly, the number of quantum keys to be allocated at time 6T is 3Gbit / T*2T + 1 = 7. Table 4 shows that the remaining key quantity for each link at times 0T and 6T satisfies the required key quantity for this transmission. During this second dynamic service transmission, 27 keys were consumed at time 0T, 2 keys at time 1T, 2 keys at time 3T, 1 key at time 5T, 7 keys at time 6T, and 1 key at time 8T. The remaining resource status of each link after the second dynamic service transmission is completed is shown in Table 5.

[0090] Table 5. Remaining Link Resources (Bandwidth / Key) After Deployment of the Second Dynamic Service

[0091]

[0092]

[0093] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.

[0094] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0095] This application also provides a bandwidth and key allocation device for dynamic services.

[0096] refer to Figure 9 The bandwidth and key allocation device for dynamic services includes:

[0097] The receiving module 902 is configured to read the service attribute information carried in the communication request in response to receiving a communication request for a dynamic service;

[0098] The calculation module 904 is configured to calculate a set of candidate communication paths based on the source and destination nodes in the service attribute information;

[0099] The first determining module 906 is configured to determine the amount of bandwidth required by the dynamic service at each moment during the transmission process of the optical transport network based on the service attribute information.

[0100] The second determining module 908 is configured to determine the number of quantum keys that the dynamic service needs to consume at each moment based on the amount of bandwidth required at each moment;

[0101] Deployment module 910 is configured to deploy the dynamic service in the candidate communication path in response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each time and the amount of quantum keys required at each time.

[0102] In some embodiments, the calculation module 904 is further configured to obtain the candidate communication path set based on the source and destination nodes using the K-shortest path algorithm.

[0103] In some embodiments, the dynamic service includes a first dynamic service; the first determining module 906 is further configured to determine the amount of bandwidth required by the first dynamic service at each moment during transmission in the optical transport network based on the original service bandwidth requirement in the service attribute information of the first dynamic service and a preset bandwidth adjustment strategy, wherein the original service bandwidth requirement changes in real time.

[0104] In some embodiments, the first determining module 906 is further configured to determine the amount of bandwidth required by the first dynamic service at each moment during transmission in the optical transport network based on the bandwidth change between two adjacent moments in the original service bandwidth and a preset change threshold.

[0105] In some embodiments, it is determined whether the service attribute requirements of the first dynamic service include a key update cycle;

[0106] Since the service attribute requirement of the first dynamic service does not include a key update cycle, the beam module 910 is further configured such that the remaining bandwidth of each link in all links included in the candidate communication path is greater than the maximum bandwidth required during the transmission of the first dynamic service, and the remaining quantum key of each link at the initial moment is greater than the quantum key required for the transmission of the first dynamic service.

[0107] In some embodiments, in response to the key update cycle being included in the service attribute requirements of the first dynamic service, the deployment module 910 is further configured such that the remaining bandwidth of each link in all links included in the candidate communication path is greater than the maximum bandwidth required during the transmission of the first dynamic service, the remaining quantum key of each link is greater than the number of quantum keys required for the transmission of the first dynamic service at the initial moment, and the remaining quantum key of each link is greater than the number of quantum keys required for the transmission of the first dynamic service in each key update cycle.

[0108] In some embodiments, the dynamic service includes a second dynamic service; the first determining module 906 is further configured to traverse each candidate communication path in the candidate communication path set, determine a target candidate communication path in the candidate communication path set according to the total data transmission amount and data transmission deadline contained in the service attribute information of the second dynamic service, and the amount of bandwidth required by the second dynamic service at each moment during the transmission process of the target candidate communication path.

[0109] In some embodiments, it is determined whether the second dynamic service needs to be transmitted multiple times based on the amount of bandwidth required by the second dynamic service at each moment during the transmission of the target candidate communication path.

[0110] In response to the fact that the second dynamic service does not require multiple transmissions, the deployment module 910 is further configured such that at the initial moment of the second dynamic service transmission, the number of remaining quantum keys in each of all links in the target candidate communication path is greater than the number of quantum keys required for the second dynamic service transmission.

[0111] In response to the requirement of multiple transmissions for the second dynamic service, the deployment module 910 is further configured such that at the initial moment of each transmission in the multiple transmissions, the number of remaining quantum keys in each link of all links included in the target candidate communication path is greater than the number of quantum keys required for the transmission of the second dynamic service, and at each moment during each transmission, the number of remaining quantum keys in each link is greater than the maximum number of quantum keys required for the transmission of the second dynamic service during that transmission.

[0112] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.

[0113] The apparatus described above is used to implement the bandwidth and key allocation method for dynamic services in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0114] This application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the bandwidth and key allocation method for dynamic services as described in any of the preceding embodiments.

[0115] Figure 10 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0116] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0117] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0118] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0119] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0120] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0121] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0122] The electronic devices described above are used to implement the corresponding bandwidth and key allocation methods for dynamic services in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0123] This application also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the bandwidth and key allocation method for dynamic services as described in any of the above embodiments.

[0124] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0125] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the bandwidth and key allocation method for dynamic services as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0126] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0127] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0128] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0129] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A bandwidth and key allocation method for dynamic services, characterized in that, include: In response to receiving a communication request from a dynamic service, read the service attribute information carried in the communication request; A set of candidate communication paths is calculated based on the source and destination nodes in the business attribute information. The amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network is determined based on the service attribute information. The number of quantum keys required by the dynamic service at each moment is determined based on the amount of bandwidth required at each moment, including: determining the number of quantum keys required by the dynamic service at each moment based on the establishment and teardown of the optical path and the increase and decrease of bandwidth during the entire transmission process. In response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each moment and the amount of quantum keys required at each moment, the dynamic service is deployed in the candidate communication path.

2. The method according to claim 1, characterized in that, The step of calculating the candidate communication path set based on the source and destination nodes in the service attribute information includes: The candidate communication path set is obtained by using the K-shortest path algorithm based on the source and destination nodes.

3. The method according to claim 1, characterized in that, The dynamic service includes a first dynamic service; determining the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network based on the service attribute information includes: The amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network is determined based on the original service bandwidth requirement in the service attribute information of the first dynamic service and the preset bandwidth adjustment strategy. The original service bandwidth requirement changes in real time.

4. The method according to claim 3, characterized in that, The step of determining the amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network based on the original service bandwidth in the service attribute information of the first dynamic service and a preset bandwidth adjustment strategy includes: The amount of bandwidth required by the first dynamic service at each moment during transmission over the optical transport network is determined based on the bandwidth change between two adjacent moments in the original service bandwidth and a preset change threshold.

5. The method according to claim 3, characterized in that, Also includes: Determine whether the business attribute requirements of the first dynamic service include a key update cycle; Since the service attribute requirements of the first dynamic service do not include a key update cycle, the candidate communication paths that satisfy the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service include: The remaining bandwidth of each link in the candidate communication path is greater than the maximum bandwidth required during the first dynamic service transmission, and the remaining quantum key quantity of each link at the initial moment is greater than the quantum key quantity required for the first dynamic service transmission.

6. The method according to claim 5, characterized in that, Also includes: In response to the key update cycle included in the service attribute requirements of the first dynamic service, the candidate communication paths that satisfy the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service include: The remaining bandwidth of each link in the candidate communication path is greater than the maximum bandwidth required during the first dynamic service transmission. At the initial moment, the remaining quantum key quantity of each link is greater than the quantum key quantity required for the first dynamic service transmission. Furthermore, in each key update cycle, the remaining quantum key quantity of each link is greater than the quantum key quantity required for the first dynamic service transmission.

7. The method according to claim 1, characterized in that, The dynamic service includes a second dynamic service; determining the amount of bandwidth required by the dynamic service at each moment during transmission over the optical transport network based on the service attribute information includes: Traverse each candidate communication path in the candidate communication path set, determine the target candidate communication path in the candidate communication path set based on the total data transmission volume and data transmission deadline contained in the service attribute information of the second dynamic service, and determine the amount of bandwidth required by the second dynamic service at each moment during the transmission process of the target candidate communication path.

8. The method according to claim 7, characterized in that, Also includes: The determination of whether the second dynamic service needs to be transmitted multiple times is based on the amount of bandwidth required by the second dynamic service at each moment during the transmission of the second dynamic service in the target candidate communication path. Since the second dynamic service does not require multiple transmissions, the candidate communication paths that satisfy the amount of bandwidth required at each moment and the amount of quantum keys consumed at each moment of the dynamic service include: At the initial moment of the second dynamic service transmission, the number of remaining quantum keys in each of the links contained in the target candidate communication path is greater than the number of quantum keys required for the second dynamic service transmission. In response to the second dynamic service requiring multiple transmissions, the candidate communication paths that satisfy the bandwidth required at each moment and the quantum key consumption at each moment of the dynamic service include: At the initial moment of each of the multiple transmissions, the number of remaining quantum keys in each link of the target candidate communication path is greater than the number of quantum keys required for the second dynamic service transmission, and the number of remaining quantum keys in each link at each moment during each transmission is greater than the maximum number of quantum keys required for the second dynamic service transmission during that transmission.

9. A bandwidth and key allocation device for dynamic services, characterized in that, include: The receiving module is configured to read the service attribute information carried in the communication request in response to receiving a communication request from a dynamic service; The calculation module is configured to calculate a set of candidate communication paths based on the source and destination nodes in the business attribute information; The first determining module is configured to determine the amount of bandwidth required by the dynamic service at each moment during the transmission process of the optical transport network based on the service attribute information. The second determining module is configured to determine the number of quantum keys that the dynamic service needs to consume at each moment based on the amount of bandwidth required at each moment, including: determining the number of quantum keys that the dynamic service needs to consume at each moment based on the establishment and teardown of the optical path and the increase and decrease of bandwidth during the entire transmission process. The deployment module is configured to deploy the dynamic service in the candidate communication path in response to the existence of candidate communication paths in the candidate communication path set that satisfy the amount of bandwidth required for the dynamic service at each time and the amount of quantum keys required at each time.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 8.

Images