CN111654442B - Dynamic service grooming processing method and device in elastic optical network - Google Patents

Dynamic service grooming processing method and device in elastic optical network Download PDF

Info

Publication number
CN111654442B
CN111654442B CN202010313767.5A CN202010313767A CN111654442B CN 111654442 B CN111654442 B CN 111654442B CN 202010313767 A CN202010313767 A CN 202010313767A CN 111654442 B CN111654442 B CN 111654442B
Authority
CN
China
Prior art keywords
service request
virtual
current service
virtual link
current
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.)
Active
Application number
CN202010313767.5A
Other languages
Chinese (zh)
Other versions
CN111654442A (en
Inventor
张琦
刘博�
赵毅
陶滢
田清华
田凤
曹桂兴
沈宇飞
张伟
陈东
王拥军
杨雷静
钱晋希
刘乃金
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
China Academy of Space Technology CAST
Original Assignee
Beijing University of Posts and Telecommunications
China Academy of Space Technology CAST
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications, China Academy of Space Technology CAST filed Critical Beijing University of Posts and Telecommunications
Priority to CN202010313767.5A priority Critical patent/CN111654442B/en
Publication of CN111654442A publication Critical patent/CN111654442A/en
Application granted granted Critical
Publication of CN111654442B publication Critical patent/CN111654442B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/12—Shortest path evaluation
    • 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/30—Routing of multiclass traffic
    • 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/302—Route determination based on requested QoS

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the invention provides a dynamic service grooming processing method and a device in an elastic optical network, wherein the method comprises the following steps: establishing a virtual network topological structure, and initializing a network busy state value; receiving service requests and taking the service requests as sub-service requests, converging the sub-service requests which have the same source and destination nodes and meet the conditions into a current service request, and carrying out weight and bandwidth marking on the sub-service requests; updating a network busy state value based on the network state of the current virtual network topological structure, and judging whether the current service request belongs to a high-priority service request; if yes, determining a virtual link for the current service request by using a first service grooming strategy; if not, determining a virtual link for the current service request by using a second service grooming strategy; and carrying out routing and spectrum allocation on the determined virtual links in the physical network topology. The invention can intelligently dredge service requests with different requirements based on the network state, and improve the service dredging performance.

Description

Dynamic service grooming processing method and device in elastic optical network
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for dynamic traffic grooming processing in an elastic optical network.
Background
An EON (Elastic Optical Networks) network is used as an emerging and promising Optical network architecture in an Optical fiber communication system, and the flexible fine granularity of the frequency spectrum greatly improves the transmission capacity and transmission rate of a traditional WDM (Wavelength Division Multiplexing) network. Elastic optical networks are widely used in the field of communication technology, for example, in satellite communication. In practice, because the satellite communication service has a large capacity and a long transmission distance, and the resources on each satellite node are limited, the requirements on the volume and the weight of the communication equipment are very strict, so that the data service needs to use the same transmitter and receiver as much as possible in the transmission process of each satellite node to meet the requirements on the volume and the weight of the communication equipment and save the resources on the satellite nodes. Meanwhile, as the elastic optical network can realize more refined resource division, after the communication starts, the fragment resources which cannot be utilized continuously appear in the network, so that the effective traffic dispersion and the corresponding operation are carried out on the data request in the elastic optical network.
The existing processing method for dynamic traffic grooming in the elastic optical network comprises the following steps: firstly, establishing a virtual network topological structure corresponding to a physical network topological structure, wherein the virtual network topological structure is the mapping of the physical network topological structure in a virtual network, then, when a service request is received, according to a source node and a destination node carried in the service request, K shortest paths corresponding to the source node and the destination node carried in the current service request are calculated in the virtual network topological structure by using a K shortest path algorithm, and whether an established virtual link which is coincident with the K shortest paths can route the current service request or not is judged in a virtual link established by the virtual network topological structure, if so, the established virtual link is directly used for routing the current service request, and meanwhile, the network resource state in the virtual network topological structure is updated; if not, based on the K shortest paths obtained by the calculation, a new virtual link capable of routing the current service request is established, the newly established virtual link is used for routing the current service request, the newly established virtual link is added into the virtual network topology structure, meanwhile, the network resource state in the virtual network topology structure is updated, and finally, the virtual link routing the current service request is routed into the corresponding physical network topology structure, so that the dynamic grooming of the service request is realized.
However, the inventor finds that, in the existing processing method for dynamic traffic grooming in the resilient optical network, based on the virtual network topology mapped by the physical network topology, an arriving traffic request is groomed preferentially to an established virtual link (the virtual link is a link in use) in the virtual network topology, and the virtual link may not be the shortest path for the arriving traffic request. In addition, although the existing traffic grooming method has a good effect on improving the blocking rate performance of the network, the existing traffic grooming method does not consider the type of the traffic request, in practice, different types of traffic requests have different requirements on the link performance and different influences on the traffic grooming capability of the network, and particularly for satellite communication, the differences of the service types, sizes, delay sensitivity, transmission rates and other requirements of the traffic requests by different functional satellite nodes are large, so that the existing traffic grooming method cannot meet the traffic requests with different requirements and influences on the traffic grooming performance.
Disclosure of Invention
Embodiments of the present invention provide a method and an apparatus for dynamic traffic grooming processing in an elastic optical network, so as to groom various service requests with different requirements and improve performance of traffic grooming. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present invention provides a method for dynamic traffic grooming in an elastic optical network, where the method includes:
establishing virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network, and initializing a network busy state value, wherein the physical network topological structure comprises: the network busy state values are used for representing the busy state of the current network in the established virtual network topology structure;
receiving a service request, wherein the service request comprises a source node initiated by service data and a destination node reached by the service data;
the service request is used as a sub-service request, and the sub-service requests which have the same source node and destination node and meet the first preset condition are converged into a current service request;
marking the weight and the required bandwidth of each sub-service request in the current service request based on the attribute information of each sub-service request in the current service request;
updating the network busy state value based on the network state of the current virtual network topology;
judging whether the current service request belongs to a high-priority service request or not based on the weight of each sub-service request in the current service request and a current threshold parameter, wherein the current threshold parameter is increased along with the increase of a network busy state value;
if the current service request belongs to a service request with high priority, determining a virtual link of a route for the current service request by using a preset first service grooming strategy;
if the current service request does not belong to the service request with high priority, determining a virtual link of a route for the current service request by using a preset second service grooming strategy;
routing and spectrum allocation are performed on the determined virtual links in the physical network topology.
Optionally, the step of determining a routed virtual link for the current service request by using a preset first traffic breakout policy includes:
in the virtual network topology structure, a first shortest path corresponding to the current service request is calculated according to a source node and a destination node of the current service request by using a preset shortest path calculation method;
in a virtual link established by a virtual network topological structure, calculating a second shortest path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset path calculation method;
judging whether a path which is overlapped with the first shortest path exists in the second shortest path;
if so, marking the first shortest path as a shortest path to be routed;
if not, creating a virtual link corresponding to the first shortest path in the virtual network topology structure, connecting the virtual link corresponding to the first shortest path into the virtual network topology structure, updating the virtual network topology structure, and marking the first shortest path as a shortest path to be routed;
judging whether the shortest path to be routed can route the current service request;
if the shortest path to be routed can route the current service request, determining a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request, and in the virtual network topology structure, using the determined virtual link to route the current service request and updating the remaining resources in the virtual network topology structure;
if the shortest path to be routed can not route the current service request, judging whether a path capable of routing the current service request exists in the second shortest path;
if so, marking the path capable of routing the current service request as the shortest path to be routed of the current service request, determining a virtual link corresponding to the shortest path to be routed as the virtual link for routing the current service request, and in the virtual network topology structure, routing the current service request by using the determined virtual link and updating the residual resources in the virtual network topology structure;
and if not, using a preset third service grooming strategy to determine a routed virtual link for the current service request.
Optionally, the step of determining a routed virtual link for the current service request after changing the modulation format by using a preset third traffic grooming policy includes:
segmenting the current business request based on the weight and the required bandwidth of each sub business request marked in the current business request and the residual resources of the shortest path to be routed and the second shortest path to obtain a plurality of sections of business requests;
in the virtual network topology structure, traversing each segment of service request aiming at the shortest path to be routed and the second shortest path, and judging whether the current segment of service request can be routed or not;
if the current service request can be routed, determining a virtual link corresponding to a path capable of routing the current service request as a virtual link for routing the current service request;
if the current service request cannot be routed, calculating a standby path corresponding to the current service request in the virtual network topology structure by using a preset path calculation method according to a source node and a destination node of the current service request, creating a virtual link corresponding to the standby path in the virtual network topology structure, connecting the virtual link corresponding to the standby path to the virtual network topology structure, updating the virtual network topology structure, and determining the virtual link corresponding to the standby path as a virtual link for routing the current service request;
and in the virtual network topology structure, using the virtual link of the current service request to route the current service request and update the residual resources in the virtual network topology structure.
Optionally, the step of determining a routed virtual link for the current service request by using a preset second service breakout policy includes:
when the network busy state value meets a second preset condition, determining a virtual link of a route for the current service request by using a preset fourth service grooming strategy;
when the network busy state value meets a third preset condition, determining a virtual link of a route for the current service request by using a preset fifth service grooming strategy;
and when the network busy state value meets a fourth preset condition, determining a virtual link of a route for the current service request by using a preset sixth service grooming strategy.
Optionally, the step of determining a routed virtual link for the current service request by using a preset fourth service breakout policy includes:
in the virtual link established by the virtual network topological structure, calculating a second shortest path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset path calculation method;
judging whether the second shortest path can route the current service request;
if the second shortest path can route the current service request, marking the second shortest path as a path to be routed;
if the second shortest path cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link into the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
and determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, the step of determining a routed virtual link for the current service request by using a preset fifth service breakout policy includes:
calculating the available link utilization rate corresponding to each virtual link between the source node and the destination node pair according to the source node and the destination node of the current service request in the virtual links established by the virtual network topology structure;
marking a path corresponding to a virtual link with the highest available link utilization rate as a path to be routed in the established virtual links;
if each virtual link cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
and determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, the step of determining a routed virtual link for the current service request by using a preset sixth service breakout policy includes:
in the virtual links established by the virtual network topology structure, calculating the link idle rate corresponding to each virtual link between the source node and the destination node pair according to the source node and the destination node of the current service request;
traversing each virtual link according to the sequence of the link idle rate from high to low, and judging whether the currently traversed virtual link can route the current service request;
if the currently traversed virtual link can route the current service request, marking a path corresponding to the currently traversed virtual link as a path to be routed;
if each virtual link cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
and determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, the step of creating a new virtual link for the current service request includes:
in the virtual network topology structure, a preset shortest path calculation method is used for calculating a third shortest path corresponding to the current service request according to a source node and a destination node of the current service request;
and in the virtual network topology structure, creating a virtual link corresponding to the third shortest path.
Optionally, the network state of the current virtual network topology includes: network traffic in the current virtual network topology, link blocking rate in the current virtual network topology, used link idle rate in the current virtual network topology, used link utilization in the current virtual network topology, and used link fragmentation rate in the current virtual network topology; the step of updating the network busy state value based on the network state of the current virtual network topology structure comprises the following steps:
and taking at least one of the network flow in the current virtual network topological structure in the network state of the current virtual network topological structure, the used link blocking rate in the current virtual network topological structure, the used link idle rate in the current virtual network topological structure, the used link utilization rate in the current virtual network topological structure and the used link fragment rate in the current virtual network topological structure as input, and obtaining an updated network busy state value by using a fuzzy logic control method.
In a second aspect, an embodiment of the present invention provides a dynamic traffic grooming processing apparatus in an elastic optical network, where the apparatus includes: the system comprises an establishing module, a judging module and a judging module, wherein the establishing module is used for establishing a virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network and initializing a network busy state value, and the physical network topological structure comprises: the network busy state values are used for representing the busy state of the current network in the established virtual network topology structure; a receiving module, configured to receive a service request, where the service request includes a source node where service data originates and a destination node where the service data arrives; the convergence module is used for taking the service request as a sub-service request and converging the sub-service requests which have the same source node and destination node and meet a first preset condition into a current service request; a marking module, configured to mark, based on attribute information of each sub-service request in the current service request, a weight and a required bandwidth for each sub-service request in the current service request; the updating module is used for updating the network busy state value based on the network state of the current virtual network topology structure; the judging module is used for judging whether the current service request belongs to a high-priority service request or not based on the weight of each sub-service request in the current service request and a current threshold parameter, and the current threshold parameter is increased along with the increase of the network busy state value; a first determining module, configured to determine, when the determining module determines that the current service request belongs to a service request with a high priority, a virtual link of a route for the current service request by using a preset first service breakout policy; a second determining module, configured to determine, when the determining module determines that the current service request does not belong to a service request with a high priority, a virtual link of a route for the current service request by using a preset second service breakout policy; and the traffic grooming module is used for carrying out routing and spectrum allocation on the determined virtual link in the physical network topological structure.
In a third aspect, an embodiment of the present invention further provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete mutual communication through the communication bus;
a memory for storing a computer program;
the processor is configured to implement the method steps of the dynamic traffic grooming processing method in the elastic optical network according to the first aspect when executing the program stored in the memory.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where instructions are stored in the computer-readable storage medium, and when the instructions are executed on a computer, the computer is enabled to execute the method steps of the dynamic traffic grooming processing method in an elastic optical network according to the first aspect.
The method and the device for dynamic traffic grooming processing in the elastic optical network converge the service requests which have the same source node and the same destination node and meet the preset condition into one service request, eliminate the protection interval between the services with the same source address and the same destination address, save the frequency spectrum resources in the network, avoid calculating paths for the service requests with the same source node and the same destination node for multiple times, and reduce the routing times. Moreover, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, use different service grooming strategies for the service requests with different priorities, realize efficient intelligent service grooming for various service requests with different requirements in different network states, and improve the service grooming performance in the elastic optical network. Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a dynamic traffic grooming processing method in an elastic optical network according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a network topology according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of a first implementation of a traffic grooming policy according to an embodiment of the present invention;
fig. 4 is a flowchart illustrating a second implementation manner of a traffic grooming policy according to an embodiment of the present invention;
fig. 5 is a flowchart illustrating a third implementation manner of a traffic grooming policy according to an embodiment of the present invention;
fig. 6 is a flowchart illustrating a fourth implementation manner of a traffic grooming policy according to an embodiment of the present invention;
fig. 7 is a flowchart illustrating a fifth implementation manner of a traffic grooming policy according to an embodiment of the present invention;
fig. 8 is a flowchart illustrating a sixth implementation manner of a traffic grooming policy according to an embodiment of the present invention;
fig. 9 is a schematic flowchart of an implementation of creating a virtual link according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of a dynamic traffic grooming processing device in an elastic optical network according to an embodiment of the present invention;
fig. 11 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to solve the problem that the determined virtual link cannot meet various service requests with different requirements and affect the service grooming performance in the conventional dynamic service grooming processing method in the elastic optical network, an embodiment of the present invention provides a dynamic service grooming processing method in an elastic optical network, where the method may include:
establishing virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network, and initializing a network busy state value, wherein the physical network topological structure comprises: the system comprises a plurality of satellite nodes, a plurality of satellite nodes and a plurality of satellite nodes, wherein the network busy state values are used for representing the busy state of the current network in the established virtual network topology structure;
receiving a service request, wherein the service request comprises a source node initiated by service data and a destination node reached by the service data;
the service request is used as a sub-service request, and the sub-service requests which have the same source node and destination node and meet the first preset condition are converged into a current service request;
marking the weight and the required bandwidth of each sub-service request in the current service request based on the attribute information of each sub-service request in the current service request;
updating a network busy state value based on the network state of the current virtual network topology;
judging whether the current service request belongs to a high-priority service request or not based on the weight of each sub-service request in the current service request and the current threshold parameter, wherein the current threshold parameter is increased along with the increase of a network busy state value;
if the current service request belongs to a service request with high priority, a preset first service grooming strategy is used for determining a virtual link of a route for the current service request;
if the current service request does not belong to the service request with high priority, a preset second service grooming strategy is used for determining a virtual link of a route for the current service request;
and carrying out routing and spectrum allocation on the determined virtual links in the physical network topology.
The dynamic service grooming processing method in the elastic optical network, provided by the embodiment of the present invention, converges service requests that have the same source node and destination node and meet the preset condition into one service request, and eliminates the protection interval between services with the same source and destination addresses, thereby not only saving spectrum resources in the network, but also avoiding multiple route calculation of the service requests with the same source node and destination node, and reducing the routing times. Moreover, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, use different service grooming strategies for the service requests with different priorities, realize efficient intelligent service grooming for various service requests with different requirements in different network states, and improve the service grooming performance in the elastic optical network.
First, a method for dynamic traffic grooming processing in an elastic optical network according to an embodiment of the present invention is described below. As shown in fig. 1, fig. 1 is a schematic flow chart of a dynamic traffic grooming processing method in an elastic optical network according to an embodiment of the present invention, where the method may include:
s101, establishing virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network, and initializing a network busy state value.
In the embodiment of the present invention, a virtual network topology structure mapping corresponding to a preset physical network topology structure may be established in a virtual network by using a network virtualization technology, where the physical network topology structure may include: a plurality of satellite nodes, wherein each satellite node may have a different functionality.
Exemplarily, as shown in fig. 2, fig. 2 is a schematic diagram of a network topology provided by an embodiment of the present invention, in fig. 2, a lower layer is shown as a physical network topology, and an upper layer is shown as a virtual network topology, where the physical network topology may be formed by satellite nodes such as communication satellites, formation satellites, navigation satellites, earth observation satellites, service enhancement satellites, and a satellite backbone network with different functions.
In the embodiment of the invention, the virtual network topological structure is the mapping of the physical network topological structure in the virtual network, so the number of nodes in the virtual network topological structure and the link resource of the network are completely consistent with the actual physical network topological structure. Specifically, a virtual network topology structure mapping corresponding to a preset physical network topology structure may be established in a virtual network by using the existing network virtualization technology, and the mapping process is not specifically limited in the present application.
In the embodiment of the invention, a network busy state value can be initialized aiming at the established virtual network topological structure, and the network busy state value is used for representing the busy state of the current network in the established virtual network topological structure. Illustratively, the network busy status value may be initialized to 0 or 1, or a or b, etc.
S102, receiving a service request.
In the embodiment of the present invention, the received service request may include a source node where the service data originates, a destination node where the service data arrives, and a service type, a required bandwidth, a size, and the like of the service request. The transmission distance, transmission rate, delay sensitivity, required bandwidth and the like required by the service request contained in the service request constitute attribute information of the service request.
S103, the service request is used as a sub-service request, and the sub-service requests which have the same source node and destination node and meet the first preset condition are converged into the current service request.
In the embodiment of the present invention, each received service request may be regarded as a sub-service request, each sub-service request has corresponding attribute information, and then sub-service requests satisfying a first preset condition, which have the same source node and destination node, are aggregated into one service request, that is, a current service request.
For example, the sub-service requests having the same source node and destination node received within a preset time period may be aggregated, where the preset time period may be 10 seconds, 30 seconds, or 50 seconds, etc.; or when the received sub-service requests having the same source node and destination node reach a preset service length, the sub-service requests may be aggregated, where the preset service length may be set to 100MHz, 500MHz, or 1GHz, and of course, a person skilled in the art may set a preset time period and a preset service length according to an actual state of the network.
In the embodiment of the invention, a plurality of sub-service requests can be used as one service request after aggregation, so that the guard interval between services is eliminated, network resources can be saved, meanwhile, the service requests with the same source node and destination node are prevented from calculating paths for a plurality of times in the service dredging process, and the routing times can be reduced.
And S104, marking the weight and the required bandwidth of each sub-service request in the current service request based on the attribute information of each sub-service request in the current service request.
When the sub-service requests with the same source node and destination node are converged, each sub-service request can be marked with the weight and the required bandwidth based on the attribute information such as the service type, the transmission distance, the transmission rate, the delay sensitivity, the required bandwidth and the like corresponding to each sub-service request. For example, the weight of each sub-service request may be marked according to the transmission distance and the delay sensitivity of the sub-service request, when the transmission distance of the sub-service request is longer and the requirement on the delay sensitivity is higher, the weight corresponding to the sub-service request is correspondingly greater, and the weight may be represented by a value, for example: 3, 5, 8, etc., may also be represented using characters such as: a, b, c, etc. Of course, in the embodiment of the present invention, only the transmission distance and the delay sensitivity information of the sub-service request are used to mark the weight of the sub-service request as an example for description, in practical applications, other attribute information of the sub-service request may also be used to mark the weight of the sub-service request and the required bandwidth, which all fall within the protection scope of the present invention, and the embodiments of the present invention are not exemplified herein.
And S105, updating a network busy state value based on the network state of the current virtual network topology structure.
In the embodiment of the invention, after the service request is received, the network busy state value can be updated according to the network state of the current virtual network topology structure. Wherein, the network state of the current virtual network topology may include: network flow in the current virtual network topology structure, a used link blocking rate in the current virtual network topology structure, a used link idle rate in the current virtual network topology structure, a used link utilization rate in the current virtual network topology structure, a used link fragment rate in the current virtual network topology structure, and the like.
As an optional implementation manner of the embodiment of the present invention, at least one of a network flow in the current virtual network topology in the network state of the current virtual network topology, a used link blocking rate in the current virtual network topology, a used link idle rate in the current virtual network topology, a used link utilization rate in the current virtual network topology, and a used link fragmentation rate in the current virtual network topology may be used as an input, and an updated network busy state value may be obtained by using a fuzzy logic control method.
For example, at least one of the network traffic, the used link blocking rate, the used link idle rate, the used link utilization rate, the used link fragmentation rate, and the like in the current virtual network topology may be not more than three as inputs, and then an updated network busy state value may be obtained by using a fuzzy logic control method.
For example, the network traffic and the used link blocking rate in the current virtual network topology may be used as inputs, where the network traffic in the current virtual network topology may be calculated using the following expression:
Figure BDA0002458676340000101
where E represents the network traffic in the current virtual network topology, tCRepresenting the current time, teRepresents the end time of the current service, T represents the service request time set,
Figure BDA0002458676340000102
and the network flow required by the current service corresponding to the end time of the current service from the current time is shown.
The used link blocking rate in the current virtual network topology can be calculated using the following expression:
Figure BDA0002458676340000111
the NBR represents the used link blocking rate in the current virtual network topology structure, i represents the ith used link, k represents the total number of the used links, r represents the service request refused, q represents the total number of the used links, andihrepresents the ith link high priority traffic request quantity, qrhRepresenting the amount of high priority traffic rejection, qilIndicating the low priority traffic request quantity, q, of the ith linkrlThe value range of NBR is0-1. Then, an updated network busy state value is obtained by using a fuzzy logic control method, and a fuzzy rule 1 shown in the following table 1 may be set in the fuzzy logic control method:
table 1 fuzzy rule 1
Figure BDA0002458676340000112
Among them, I (Idle), PI (Part-Idle), NI (Not Idle ), M (Medium, Medium), NB (Not Busy), B (Busy ), TB (to Busy). The value of each of the fuzzy rules ranges between 0-1.
For example, the network traffic and the used link idle rate in the current virtual network topology may be used as inputs, where the used link idle rate in the current virtual network topology may be calculated using the following expression:
Figure BDA0002458676340000113
wherein ULIR represents the used link idle rate in the current virtual network topology, fiDenotes the total number of resources on the ith used link, k denotes the total number of used links, fimIndicating the resource occupied by the mth service on the ith used link, N indicating the service quantity on each link, NgThe service protection interval is represented, and the value range is 0-1.
Then, an updated network busy state value is obtained by using a fuzzy logic control method, and a fuzzy rule 2 shown in the following table 2 may be set in the fuzzy logic control method:
table 2 fuzzy rule 2
Figure BDA0002458676340000114
Among them, VB (Very busy), NB (Not busy), K (Keep), NI (Not idle), VI (Very idle).
Of course, in the embodiment of the present invention, only the two kinds of network state information are taken as inputs, and the updated network busy state value is obtained by using the fuzzy logic control method, in practical applications, other state values in the network state of the current virtual network topology may also be used, and arbitrarily combined or weighted and combined as inputs, and then, the updated network busy state value is obtained by using the fuzzy logic control method, which all fall within the protection scope of the present invention.
Referring to fig. 1, S106 determines whether the current service request belongs to a service request with a high priority based on the weight of each sub-service request in the current service request and the current threshold parameter.
In the embodiment of the invention, the weight of each sub-service request in the current service request is marked, so that the weight of the current service request can be determined according to the weight of each sub-service request. For example, the weight of the current service request may be the sum of the weights of each sub-service request in the current service request. Then, according to the weight of the current service request and the current threshold parameter, judging whether the current service request belongs to a service request with high priority, wherein the current threshold parameter can be increased along with the increase of the network busy state value and decreased along with the decrease of the network busy state value. Further, the current threshold parameter may be a sum of a preset initial threshold value and a network busy state value. Illustratively, the weight is represented by a numerical value, and when the network is idle, the preset initial threshold parameter can be set to be 4, or 5, or 6, and when the network is busy, the preset initial threshold parameter can be set to be 7, or 8, or 9, etc.; alternatively, the preset initial threshold parameter may also be represented by characters, and the current threshold parameter may be represented as: and P is W + Q, wherein P represents a current threshold parameter, W represents a preset initial threshold parameter, Q represents a network busy state value, Q is positive and represents that the network busy state value is increased, and Q is negative and represents that the network busy state value is decreased.
S107, if the current service request belongs to the service request with high priority, a preset first service grooming strategy is used for determining a virtual link of the route for the current service request.
And when the weight of the current service request is greater than the current threshold parameter, indicating that the current service request belongs to a service request with high priority, and determining a virtual link of a route for the current service request by using a preset first service grooming strategy. The first traffic grooming policy may be: the specific embodiment is described in detail below, and the specific embodiment is preferably based on the shortest path of the current service request in the virtual network topology to determine a routed virtual link for the current service request.
And S108, if the current service request does not belong to the service request with high priority, determining a virtual link of the route for the current service request by using a preset second service grooming strategy.
And when the weight of the current service request is not greater than the current threshold parameter, indicating that the current service request does not belong to the service request with high priority, and determining a virtual link of the route for the current service request by using a preset second service grooming strategy. The second traffic grooming policy may be: according to the busy state value of the network, different traffic grooming strategies are used to determine the routed virtual link for the current traffic request, and the specific implementation mode is described in detail below.
And S109, routing and spectrum allocation are carried out on the determined virtual links in a physical network topological structure.
After determining the virtual link of the route for the current service request, performing route and spectrum allocation on the determined virtual link in a physical network topology structure to realize dynamic service grooming of the current service request.
The dynamic service grooming processing method in the elastic optical network, provided by the embodiment of the present invention, converges service requests that have the same source node and destination node and meet the preset condition into one service request, and eliminates the protection interval between services with the same source and destination addresses, thereby not only saving spectrum resources in the network, but also avoiding multiple route calculation of the service requests with the same source node and destination node, and reducing the routing times. Moreover, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, use different service grooming strategies for the service requests with different priorities, realize efficient intelligent service grooming for various service requests with different requirements in different network states, and improve the service grooming performance in the elastic optical network.
As an optional implementation manner of the embodiment of the present invention, in the step S107, an implementation manner of determining a routed virtual link for the current service request by using a preset first traffic grooming policy may refer to fig. 3, where the implementation manner may include:
s201, in a virtual network topological structure, a first shortest path corresponding to a current service request is calculated according to a source node and a destination node of the current service request by using a preset shortest path calculation method.
In the embodiment of the invention, in the whole virtual network topology structure, according to the source node and the destination node of the current service request, a preset shortest path calculation method Dijkstra can be used for calculating the first shortest path corresponding to the current service request.
S202, in the virtual link established by the virtual network topology structure, a preset path calculation method is used for calculating a second shortest path corresponding to the current service request according to the source node and the destination node of the current service request.
In the embodiment of the invention, in the virtual link established by the virtual network topology structure, a second shortest path corresponding to the current service request is calculated by using a K shortest path algorithm of a preset path calculation method according to the source node and the destination node of the current service request. Specifically, when the algorithm is set, a person skilled in the art may set K according to actual needs, and then the calculated second shortest path may be: the current service requests K shortest paths in the virtual links established by the virtual network topology structure, and the value of K is an integer greater than 1.
As an optional implementation manner in the embodiment of the present invention, in the entire virtual network topology, K shortest paths corresponding to the current service request may be calculated by using a preset path calculation method K shortest path algorithm according to the source node and the destination node of the current service request. And then, selecting the shortest one of the K shortest paths obtained by calculation as a first shortest path, and selecting a path corresponding to a virtual link established in the virtual network topology structure in the K shortest paths as a second shortest path.
S203, judging whether a path overlapped with the first shortest path exists in the second shortest paths.
And S204, if so, marking the first shortest path as the shortest path to be routed.
When there is a path overlapping with the first shortest path in the second shortest path, that is, for the current service request, the second shortest path overlaps with the shortest path in the virtual links established in the virtual network topology in the entire virtual network topology, and the overlapping shortest path is the actual shortest path of the current service request, then the overlapping shortest path is marked as the shortest path to be routed, and a new virtual link does not need to be created.
S205, if not, creating a virtual link corresponding to the first shortest path in the virtual network topology structure, connecting the virtual link corresponding to the first shortest path to the virtual network topology structure, updating the virtual network topology structure, and marking the first shortest path as the shortest path to be routed.
When there is no path overlapping with the first shortest path in the second shortest path, it indicates that, for the current service request, the first shortest path calculated in the entire virtual network topology is an actual shortest path, and the second shortest path calculated in the virtual links established in the virtual network topology is not an actual shortest path, and at this time, a virtual link corresponding to the actual shortest path needs to be created, that is, in the virtual network topology, a virtual link corresponding to the first shortest path is created, and the virtual link corresponding to the created first shortest path is connected to the virtual network topology, and the virtual network topology is updated at the same time, and then the first shortest path is marked as a shortest path to be routed.
S206, judging whether the shortest path to be routed can route the current service request.
The method for determining whether the shortest path to be routed can route the current service request may be determining whether the remaining spectrum resources of the virtual link corresponding to the shortest path to be routed in the virtual network topology are greater than or equal to the spectrum resources required by the current service request. If yes, the shortest path to be routed can route the current service request, and if not, the shortest path to be routed cannot route the current service request.
S207, if the shortest path to be routed can route the current service request, determining a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request, and in the virtual network topology structure, using the determined virtual link to route the current service request and updating the residual resources in the virtual network topology structure.
When the shortest path to be routed can route the current service request, that is, the remaining spectrum resource of the virtual link corresponding to the shortest path to be routed is greater than or equal to the spectrum resource required by the current service request, at this time, the virtual link corresponding to the shortest path to be routed is determined as the virtual link for routing the current service request. And meanwhile, in the virtual network topology structure, the determined virtual link is used for routing the current service request and updating the residual resources in the virtual network topology structure.
S208, if the shortest path to be routed can not route the current service request, judging whether a path capable of routing the current service request exists in the second shortest path.
In the embodiment of the present invention, when the shortest path to be routed cannot route the current service request, it may be determined whether there is a path capable of routing the current service request in a second shortest path calculated in a virtual link established in the virtual network topology structure, except the shortest path to be routed.
S209, if yes, marking the path capable of routing the current service request as the shortest path to be routed of the current service request, determining the virtual link corresponding to the shortest path to be routed as the virtual link for routing the current service request, and in the virtual network topology structure, using the determined virtual link to route the current service request and updating the residual resources in the virtual network topology structure.
If the remaining spectrum resources of the virtual link corresponding to the path in the second shortest path except the shortest path to be routed are judged to be larger than or equal to the spectrum resources required by the current service request, the path is marked as the shortest path to be routed of the current service request, and the virtual link corresponding to the shortest path to be routed is determined as the virtual link for routing the current service request. And meanwhile, in the virtual network topology structure, the determined virtual link is used for routing the current service request and updating the residual resources in the virtual network topology structure.
S210, if not, using a preset third service grooming strategy to determine a routed virtual link for the current service request.
And if the fact that the residual frequency spectrum resources of the virtual link corresponding to the path in the second shortest path except the shortest path to be routed are not larger than or equal to the frequency spectrum resources required by the current service request is judged, using a preset third service grooming strategy to determine the routed virtual link for the current service request. The third traffic grooming policy may be: the present service request is segmented according to a preset segmentation policy, and a virtual link of a route is determined for each segmented service request, and a specific implementation manner is described in detail below.
The dynamic service grooming processing method in the elastic optical network, provided by the embodiment of the present invention, converges service requests that have the same source node and destination node and meet the preset condition into one service request, and eliminates the protection interval between services with the same source and destination addresses, thereby not only saving spectrum resources in the network, but also avoiding multiple route calculation of the service requests with the same source node and destination node, and reducing the routing times. In addition, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, preferentially select the shortest path in the whole virtual network topology structure for routing aiming at the service request with high priority, ensure that the transmission performance of the service corresponding to the service request with high priority is not influenced by service grooming, and improve the priority processing capacity of the network on the service with high priority.
As an optional implementation manner of the embodiment of the present invention, in the step S210, an implementation manner of determining a routed virtual link for the current service request by using a preset third traffic grooming policy may refer to fig. 4, where the implementation manner may include:
s301, based on the weight and the required bandwidth of each sub-service request marked in the current service request and the remaining resources of the shortest path to be routed and the second shortest path, segmenting the current service request to obtain a plurality of segments of service requests.
In the embodiment of the present invention, the current traffic request may be segmented based on the weight and the required bandwidth of each sub-traffic request marked in the current traffic request, and the remaining resources of the shortest path to be routed and the second shortest path, where the shortest path to be routed and the second shortest path may overlap or may not overlap.
Illustratively, the current service request is segmented according to the remaining resources of the shortest path to be routed and the second shortest path, and the principle that the remaining resources are larger than or equal to the size of the resources corresponding to the segmented service needs to be satisfied. Specifically, the current service request includes a sub-service request a with a weight of a, a required bandwidth of 100MHz, a sub-service request B with a weight of B, a required bandwidth of 300MHz, a sub-service request C with a weight of C, a required bandwidth of 1GHz, wherein, the weight parameter a > b > c, when there are two second shortest paths, one of which is 400MHz residual resource, the other is 600MHz residual resource, the residual resource of the shortest path to be routed is also 400MHz, and the shortest path to be routed and one of the second shortest paths are overlapped, the current service request can be divided into 2 sections, the first section comprises sub-service requests A and B, the shortest path to be routed is used for routing, the second section comprises a sub-service request C, and at the moment, a path with the remaining resources of 600MHz cannot route the service request of the section due to insufficient resources, and a link needs to be reestablished for routing; when two second shortest paths exist, wherein one residual resource is 500MHz, the other residual resource is 1GHz, the residual resource of the shortest path to be routed is 400MHz, and any one of the shortest path to be routed and the second shortest path is not overlapped, the current service request is divided into 2 sections, the first section comprises sub-service requests A and B, the shortest path to be routed is used for routing, the second section comprises sub-service request C, and the path with the residual resource of 1GHz in the second shortest path is used for routing. Of course, the above examples of the embodiments of the present invention are merely introduced to facilitate understanding of the present invention, and are not to be construed as limiting the embodiments of the present invention.
S302, in the virtual network topology structure, traversing each segment of service request aiming at the shortest path to be routed and the second shortest path, and judging whether the current segment of service request can be routed or not.
After the current service request is segmented, in the virtual network topology structure, because the shortest path to be routed and the second shortest path have already created corresponding virtual links, each segment of service request is traversed aiming at the shortest path to be routed and the second shortest path, and whether the current segment of service request can be routed or not is judged.
S303, if the current service request can be routed, determining the virtual link corresponding to the path capable of routing the current service request as the virtual link for routing the current service request.
S304, if the current service request can not be routed, in the virtual network topology structure, a preset path calculation method is used, a standby path corresponding to the current service request is calculated according to a source node and a destination node of the current service request, a virtual link corresponding to the standby path is created in the virtual network topology structure, the virtual link corresponding to the standby path is connected to the virtual network topology structure, the virtual network topology structure is updated, and the virtual link corresponding to the standby path is determined as the virtual link for routing the current service request.
When the current service request cannot be routed, in the virtual network topology structure, according to the source node and the destination node of the current service request, a preset path calculation method is used to calculate a backup path corresponding to the current service request, and the calculated backup path may be a second shortest path other than the first shortest path and the second shortest path, or may be multiple paths. The preset path calculation method may be a K shortest path algorithm, and the specific calculation process may refer to the implementation process of calculating the second shortest path, which is not described herein again in the embodiments of the present invention.
And in the virtual network topology structure, creating a virtual link corresponding to the calculated standby path capable of routing the current segment of service request, simultaneously connecting the virtual link corresponding to the standby path to the virtual network topology structure, updating the virtual network topology structure, and determining the virtual link corresponding to the standby path as the virtual link for routing the current segment of service request.
S305, in the virtual network topology structure, the virtual link of the current service request is used for routing the current service request, and the residual resources in the virtual network topology structure are updated.
When traversing each segmented service request, determining a routed virtual link for each current service request, then, in a virtual network topology structure, using the virtual link of the current service request to route the current service request, and updating the remaining resources in the virtual network topology structure.
In the embodiment of the invention, aiming at the large bandwidth service which can not be routed by the determined shortest path, a segmented grooming strategy is used, and the large bandwidth service is groomed by utilizing the cooperation of a plurality of satellite nodes, so that the service grooming performance in the elastic optical network is improved.
As an optional implementation manner of the embodiment of the present invention, an implementation manner of determining a routed virtual link for the current service request by using a preset second service breakout policy in step S108 may refer to fig. 5, where the implementation manner may include:
s401, when the network busy state value meets a second preset condition, a preset fourth service grooming strategy is used for determining a virtual link of a route for the current service request.
In the embodiment of the invention, when the network busy state corresponding to the network busy state value is busy, not busy or not idle, the preset fourth service grooming strategy is used for determining the virtual link of the route for the current service request, and the shortest path is selected to route the current service request, so that the link resource is released as soon as possible, and the probability of rejecting the service request is reduced.
S402, when the network busy state value meets a third preset condition, a preset fifth service grooming strategy is used for determining a virtual link of the route for the current service request.
In the embodiment of the invention, when the network busy state corresponding to the network busy state value is idle, partially idle or very idle, the virtual link of the route is determined for the current service request by using the preset fifth service grooming strategy, and the route with high utilization rate of the established link is selected to route the current service request, so that the establishment of the link is reduced, and the service grooming capability of the network is improved.
And S403, when the network busy state value meets a fourth preset condition, determining a virtual link of the route for the current service request by using a preset sixth service grooming strategy.
In the embodiment of the invention, when the network busy state corresponding to the network busy state value is medium, the preset sixth service grooming strategy is used for determining the virtual link of the route for the current service request, and the route with high link idle rate is selected to route the current service request, so as to realize the load balance of the network.
Of course, in the embodiment of the present invention, the virtual link of the route may be determined for the current service request according to the used link utilization rate in the current virtual network topology structure, the used link fragmentation rate in the current virtual network topology structure, and the like, which is not limited in the embodiment of the present invention.
As an optional implementation manner of the embodiment of the present invention, in the step S401, an implementation manner of determining a routed virtual link for the current service request by using a preset fourth service breakout policy may refer to fig. 6, where the implementation manner may include:
s501, in the virtual link established by the virtual network topology structure, a preset path calculation method is used for calculating a second shortest path corresponding to the current service request according to the source node and the destination node of the current service request.
The step can be realized by referring to the description of step S202, and the embodiment of the present invention is not described herein again.
S502, judging whether the second shortest path can route the current service request.
The step can be realized by referring to the description of step S206, and the embodiment of the present invention is not described herein again.
S503, if the second shortest path can route the current service request, marking the second shortest path as a path to be routed.
S504, if the second shortest path can not route the current service request, a new virtual link is created for the current service request, the created new virtual link is connected to the virtual network topological structure, the virtual network topological structure is updated, and a path corresponding to the new virtual link is marked as a path to be routed.
S505, the virtual link corresponding to the path to be routed is determined as the virtual link for routing the current service request, the determined virtual link is used for routing the current service request in the virtual network topology structure, and the residual resources in the virtual network topology structure are updated.
The step can be realized by referring to the description of step S208, and the embodiment of the present invention is not described herein again.
In the embodiment of the invention, the shortest path can be selected from the virtual links established by the virtual network topology structure to route the current service request, so that the link resources are released as soon as possible, and the probability of rejecting the service request is reduced.
As an optional implementation manner of the embodiment of the present invention, in the step S402, an implementation manner of determining a routed virtual link for the current service request by using a preset fifth traffic grooming policy may refer to fig. 7, where the implementation manner may include:
s601, calculating the available link utilization rate corresponding to each virtual link between a source node and a destination node pair according to the source node and the destination node of the current service request in the virtual links established by the virtual network topology structure.
For example, the embodiment of calculating the available link utilization corresponding to each virtual link between the source node and the destination node pair may be: pre-allocating the service corresponding to the current service request to the link, calculating a ratio of the total resources occupied on the virtual link (including the resources occupied by the service corresponding to the current service request) to the total link resources of the virtual link, and taking the calculated ratio as the available link utilization rate corresponding to the virtual link, wherein the value range of the available link utilization rate can be 0-1.
S602, marking the path corresponding to the virtual link with the highest available link utilization rate as the path to be routed in the established virtual links.
In the embodiment of the invention, when calculating the available link utilization rate corresponding to each virtual link in virtual links established by a virtual network topology structure, the service corresponding to the current service request is considered to be pre-distributed to the link, and in the calculation process, the link corresponding to the available link utilization rate larger than 1 can be eliminated, that is, the residual spectrum resource corresponding to the link cannot be eliminated by the virtual link corresponding to the current service request, so that the virtual link corresponding to the calculated available link utilization rate can route the current service request, and at the moment, the path corresponding to the virtual link with the highest available link utilization rate is marked as the path to be routed.
S603, if each virtual link can not route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to a virtual network topological structure, updating the virtual network topological structure, and marking a path corresponding to the new virtual link as a path to be routed.
In the virtual links established by the virtual network topology structure, when each virtual link cannot route the current service request, a new virtual link may be created for the current service request, the created new virtual link is connected to the virtual network topology structure, the virtual network topology structure is updated, and a path corresponding to the new virtual link is marked as a path to be routed.
S604, determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
In the embodiment of the invention, a path with high utilization rate of the established link can be selected from the established virtual links of the virtual network topology structure to route the current service request, so that the establishment of the link is reduced, and the service grooming capability of the network is improved.
As an optional implementation manner of the embodiment of the present invention, in the step S403, an implementation manner of determining a routed virtual link for the current service request by using a preset sixth traffic grooming policy may refer to fig. 8, where the implementation manner may include:
s701, in the virtual links established by the virtual network topology structure, according to the source node and the destination node of the current service request, calculating the link idle rate corresponding to each virtual link between the source node and the destination node pair.
For example, the embodiment of calculating the link idle rate corresponding to each virtual link between the source node and the destination node pair may be: for each virtual link between a source node and a destination node pair, calculating the ratio of the unoccupied resources on the virtual link to the total link resources of the virtual link, and taking the calculated ratio as the link idle rate corresponding to the virtual link.
S702, traversing each virtual link according to the sequence of the link idle rate from high to low, and judging whether the currently traversed virtual link can route the current service request.
The implementation process of judging whether the currently traversed virtual link can route the current service request can refer to the above to judge whether the shortest path to be routed can implement the routing of the current service request.
And S703, if the currently traversed virtual link can route the current service request, marking the path corresponding to the currently traversed virtual link as a path to be routed.
S704, if each virtual link can not route the current service request, a new virtual link is created for the current service request, the created new virtual link is connected to the virtual network topological structure, the virtual network topological structure is updated, and the path corresponding to the new virtual link is marked as a path to be routed.
In the virtual links established by the virtual network topology structure, when each virtual link cannot route the current service request, a new virtual link may be created for the current service request, the created new virtual link is connected to the virtual network topology structure, the virtual network topology structure is updated, and a path corresponding to the new virtual link is marked as a path to be routed.
S705, determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the remaining resources in the virtual network topology structure.
In the embodiment of the invention, a path with high link idle rate can be selected from the established virtual links of the virtual network topology structure to route the current service request, so as to realize the load balance of the network.
In the embodiment of the present invention, in the above steps 504, 603, and 704, in the virtual links established in the virtual network topology structure, when each virtual link cannot route the current service request, a new virtual link may be created for the current service request. As an optional implementation manner of the embodiment of the present invention, as shown in fig. 9, an implementation manner of creating a new virtual link may include:
s801, in the virtual network topology structure, a preset shortest path calculation method is used for calculating a third shortest path corresponding to the current service request according to the source node and the destination node of the current service request.
S802, in the virtual network topology structure, a virtual link corresponding to the third shortest path is created.
The implementation of step S801 may refer to the description of step S201, and the embodiment of the present invention is not described herein again. After the third shortest path corresponding to the current service request is obtained through calculation, whether the third shortest path overlaps with the first shortest path and the second shortest path and a path corresponding to an established virtual link which cannot route the current service request can be judged, if the third shortest path overlaps with the first shortest path and the second shortest path, the third shortest path corresponding to the current service request is recalculated, and if the third shortest path does not overlap with the second shortest path, one shortest path which can route the current service request can be selected from the third shortest paths based on the network state of the current virtual network topology structure, and further a virtual link corresponding to the third shortest path is created in the virtual network topology structure.
The dynamic service grooming processing method in the elastic optical network, provided by the embodiment of the present invention, converges service requests that have the same source node and destination node and meet the preset condition into one service request, and eliminates the protection interval between services with the same source and destination addresses, thereby not only saving spectrum resources in the network, but also avoiding multiple route calculation of the service requests with the same source node and destination node, and reducing the routing times. Moreover, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, use different service grooming strategies for the service requests with different priorities, realize efficient intelligent service grooming for various service requests with different requirements in different network states, and improve the service grooming performance in the elastic optical network.
Corresponding to the foregoing method embodiment, an embodiment of the present invention provides a dynamic traffic grooming processing apparatus in an elastic optical network, and as shown in fig. 10, the apparatus may include:
an establishing module 901, configured to establish a virtual network topology structure mapping corresponding to a preset physical network topology structure in a virtual network, and initialize a network busy state value, where the physical network topology structure includes: and the network busy state value is used for representing the busy state of the current network in the established virtual network topology structure. A receiving module 902, configured to receive a service request, where the service request includes a source node where service data originates and a destination node where the service data arrives. The aggregation module 903 is configured to take the service request as a sub-service request, and aggregate the sub-service requests that have the same source node and destination node and meet the first preset condition into the current service request. A marking module 904, configured to mark, based on the attribute information of each sub-service request in the current service request, a weight and a required bandwidth of each sub-service request in the current service request. An updating module 905, configured to update a network busy state value based on a network state of the current virtual network topology. A judging module 906, configured to judge whether the current service request belongs to a service request with a high priority based on a weight of each sub-service request in the current service request and a current threshold parameter, where the current threshold parameter increases with an increase in a network busy state value. A first determining module 907, configured to determine, when the determining module 906 determines that the current service request belongs to a service request with a high priority, a virtual link of a route for the current service request by using a preset first service breakout policy. A second determining module 908, configured to determine, when the determining module 906 determines that the current service request does not belong to a service request with a high priority, a virtual link of a route for the current service request by using a preset second service breakout policy. A traffic grooming module 909, configured to route and spectrum allocate the determined virtual links in the physical network topology.
The dynamic traffic grooming processing device in the elastic optical network, provided by the embodiment of the present invention, aggregates the service requests that have the same source node and destination node and meet the preset condition into one service request, and eliminates the protection interval between services with the same source and destination addresses, thereby not only saving spectrum resources in the network, but also avoiding multiple paths calculated by the service requests with the same source node and destination node, and reducing the routing times. Moreover, the method and the device can adaptively adjust the service priority decision threshold parameter based on the weight and bandwidth information of each sub-service request in the current service request and the network busy state value updated in time according to the network state of the current virtual network topology structure, so as to adaptively distinguish the priority of the current service request, use different service grooming strategies for the service requests with different priorities, realize efficient intelligent service grooming for various service requests with different requirements in different network states, and improve the service grooming performance in the elastic optical network.
Optionally, the first determining module 907 may include:
and the first calculation submodule is used for calculating a first shortest path corresponding to the current service request according to the source node and the destination node of the current service request by using a preset shortest path calculation method in the virtual network topology structure. And the second calculation submodule is used for calculating a second shortest path corresponding to the current service request according to the source node and the destination node of the current service request by using a preset path calculation method in the virtual link established by the virtual network topology structure. And the first judgment submodule is used for judging whether a path which is overlapped with the first shortest path exists in the second shortest path. And the first marking submodule is used for marking the first shortest path as the shortest path to be routed when the first judging submodule judges that the second shortest path has a path which is overlapped with the first shortest path. And the second marking submodule is used for creating a virtual link corresponding to the first shortest path in the virtual network topological structure when the first judging submodule judges that no path which is overlapped with the first shortest path exists in the second shortest path, connecting the virtual link corresponding to the first shortest path to the virtual network topological structure, updating the virtual network topological structure, and marking the first shortest path as the shortest path to be routed. And the second judgment submodule is used for judging whether the shortest path to be routed can route the current service request. And the first determining submodule is used for determining a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request when the second judging submodule judges that the shortest path to be routed can route the current service request, and routing the current service request by using the determined virtual link in a virtual network topological structure and updating the residual resources in the virtual network topological structure. And the third judging submodule is used for judging whether a path capable of routing the current service request exists in the second shortest path or not when the second judging submodule judges that the shortest path to be routed cannot route the current service request. And the second determining submodule is used for marking the path capable of routing the current service request as the shortest path to be routed of the current service request when the third judging submodule judges that the path capable of routing the current service request exists in the second shortest path, determining a virtual link corresponding to the shortest path to be routed as the virtual link for routing the current service request, and using the determined virtual link to route the current service request in the virtual network topological structure and updating the residual resources in the virtual network topological structure. And the third determining submodule is used for determining a routed virtual link for the current service request by using a preset third service grooming strategy when the third judging submodule judges that no route capable of routing the current service request exists in the second shortest route.
Optionally, when the third determining sub-module determines that there is no route capable of routing the current service request in the second shortest route, the third determining sub-module is specifically configured to:
and segmenting the current service request based on the weight and the required bandwidth of each sub-service request marked in the current service request and the residual resources of the shortest path to be routed and the second shortest path to obtain a plurality of segments of service requests. In the virtual network topology structure, for the shortest path to be routed and the second shortest path, each segment of service request is traversed, and whether the current segment of service request can be routed or not is judged. And if the current service request can be routed, determining a virtual link corresponding to a path capable of routing the current service request as the virtual link for routing the current service request. If the current service request cannot be routed, a preset path calculation method is used in the virtual network topology structure to calculate a standby path corresponding to the current service request according to a source node and a destination node of the current service request, a virtual link corresponding to the standby path is created in the virtual network topology structure, the virtual link corresponding to the standby path is connected to the virtual network topology structure, the virtual network topology structure is updated, and the virtual link corresponding to the standby path is determined as a virtual link for routing the current service request. In the virtual network topology structure, the virtual link of the current service request is used to route the current service request and update the residual resources in the virtual network topology structure.
Optionally, the second determining module 908 may include:
and the fourth determining submodule is used for determining a virtual link of the route for the current service request by using a preset fourth service grooming strategy when the network busy state value meets a second preset condition. And the fifth determining submodule is used for determining a virtual link of the route for the current service request by using a preset fifth service grooming strategy when the network busy state value meets a third preset condition. And the sixth determining submodule is used for determining the virtual link of the route for the current service request by using a preset sixth service grooming strategy when the network busy state value meets a fourth preset condition.
Optionally, when the network busy state value meets a second preset condition, the fourth determining submodule is specifically configured to:
and in the virtual link established by the virtual network topological structure, calculating a second shortest path corresponding to the current service request according to the source node and the destination node of the current service request by using a preset path calculation method. And judging whether the second shortest path can route the current service request. And if the second shortest path can route the current service request, marking the second shortest path as a path to be routed. If the second shortest path can not route the current service request, a new virtual link is created for the current service request, the created new virtual link is connected to the virtual network topology structure, the virtual network topology structure is updated, and a path corresponding to the new virtual link is marked as a path to be routed. And determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, when the network busy state value meets a third preset condition, the fifth determining sub-module is specifically configured to:
and calculating the available link utilization rate corresponding to each virtual link between the source node and the target node pair according to the source node and the target node of the current service request in the virtual links established by the virtual network topology structure. And marking the path corresponding to the virtual link with the highest available link utilization rate as the path to be routed in the established virtual links. If each virtual link can not route the current service request, a new virtual link is created for the current service request, the created new virtual link is connected to the virtual network topology structure, the virtual network topology structure is updated, and the path corresponding to the new virtual link is marked as a path to be routed. And determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, when the network busy state value meets a fourth preset condition, the sixth determining submodule is specifically configured to:
and in the virtual links established by the virtual network topology structure, calculating the link idle rate corresponding to each virtual link between the source node and the destination node according to the source node and the destination node of the current service request. And traversing each virtual link according to the sequence of the link idle rate from high to low, and judging whether the currently traversed virtual link can route the current service request. And if the currently traversed virtual link can route the current service request, marking the path corresponding to the currently traversed virtual link as a path to be routed. If each virtual link can not route the current service request, a new virtual link is created for the current service request, the created new virtual link is connected to the virtual network topology structure, the virtual network topology structure is updated, and the path corresponding to the new virtual link is marked as a path to be routed. And determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
Optionally, the step of creating a new virtual link for the current service request may include:
and in the virtual network topology structure, a preset shortest path calculation method is used for calculating a third shortest path corresponding to the current service request according to the source node and the destination node of the current service request. And in the virtual network topology structure, creating a virtual link corresponding to the third shortest path.
An embodiment of the present invention further provides an electronic device, as shown in fig. 11, including a processor 111, a communication interface 112, a memory 113, and a communication bus 114, where the processor 111, the communication interface 112, and the memory 113 complete mutual communication through the communication bus 114, and the memory 113 is used for storing a computer program;
the processor 111 is configured to implement the steps of the dynamic traffic grooming processing method in the elastic optical network according to the embodiment of the present invention when executing the program stored in the memory 113, so as to achieve the same beneficial effects.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In another embodiment of the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the dynamic traffic grooming processing method in any one of the above elastic optical networks.
In yet another embodiment of the present invention, a computer program product containing instructions is further provided, which when run on a computer, causes the computer to perform the method steps of the dynamic traffic grooming processing method in the elastic optical network according to any one of the above embodiments.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device/electronic apparatus embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and for the relevant points, reference may be made to some descriptions of the method embodiments.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (4)

1. A method for dynamic traffic grooming processing in an elastic optical network, the method comprising:
establishing virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network, and initializing a network busy state value, wherein the physical network topological structure comprises: the network busy state values are used for representing the busy state of the current network in the established virtual network topology structure;
receiving a service request, wherein the service request comprises a source node initiated by service data and a destination node reached by the service data;
the service request is used as a sub-service request, and the sub-service requests which have the same source node and destination node and meet the first preset condition are converged into a current service request;
marking the weight and the required bandwidth of each sub-service request in the current service request based on the attribute information of each sub-service request in the current service request;
updating the network busy state value based on the network state of the current virtual network topology;
judging whether the current service request belongs to a high-priority service request or not based on the weight of each sub-service request in the current service request and a current threshold parameter, wherein the current threshold parameter is increased along with the increase of a network busy state value;
if the current service request belongs to a service request with high priority, determining a virtual link of a route for the current service request by using a preset first service grooming strategy;
if the current service request does not belong to the service request with high priority, determining a virtual link of a route for the current service request by using a preset second service grooming strategy;
routing and spectrum allocation are carried out on the determined virtual links in the physical network topological structure;
wherein, the step of determining the virtual link of the route for the current service request by using the preset first service breakout policy includes:
in the virtual network topology structure, a first shortest path corresponding to the current service request is calculated according to a source node and a destination node of the current service request by using a preset shortest path calculation method;
in a virtual link established by a virtual network topological structure, calculating a second shortest path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset path calculation method;
judging whether a path which is overlapped with the first shortest path exists in the second shortest path;
if so, marking the first shortest path as a shortest path to be routed;
if not, creating a virtual link corresponding to the first shortest path in the virtual network topology structure, connecting the virtual link corresponding to the first shortest path into the virtual network topology structure, updating the virtual network topology structure, and marking the first shortest path as a shortest path to be routed;
judging whether the shortest path to be routed can route the current service request;
if the shortest path to be routed can route the current service request, determining a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request, and in the virtual network topology structure, using the determined virtual link to route the current service request and updating the remaining resources in the virtual network topology structure;
if the shortest path to be routed can not route the current service request, judging whether a path capable of routing the current service request exists in the second shortest path;
if so, marking the path capable of routing the current service request as the shortest path to be routed of the current service request, determining a virtual link corresponding to the shortest path to be routed as the virtual link for routing the current service request, and in the virtual network topology structure, routing the current service request by using the determined virtual link and updating the residual resources in the virtual network topology structure;
if not, using a preset third service grooming strategy to determine a routed virtual link for the current service request;
wherein the step of determining a routed virtual link for the current service request by using a preset third service breakout policy includes:
segmenting the current business request based on the weight and the required bandwidth of each sub business request marked in the current business request and the residual resources of the shortest path to be routed and the second shortest path to obtain a plurality of sections of business requests;
in the virtual network topology structure, traversing each segment of service request aiming at the shortest path to be routed and the second shortest path, and judging whether the current segment of service request can be routed or not;
if the current service request can be routed, determining a virtual link corresponding to a path capable of routing the current service request as a virtual link for routing the current service request;
if the current service request cannot be routed, calculating a standby path corresponding to the current service request in the virtual network topology structure by using a preset path calculation method according to a source node and a destination node of the current service request, creating a virtual link corresponding to the standby path in the virtual network topology structure, connecting the virtual link corresponding to the standby path to the virtual network topology structure, updating the virtual network topology structure, and determining the virtual link corresponding to the standby path as a virtual link for routing the current service request;
in the virtual network topology structure, using the virtual link of the current service request to route the current service request and update the residual resources in the virtual network topology structure;
wherein the step of determining a routed virtual link for the current service request using a preset second service breakout policy includes:
when the network busy state value meets a second preset condition, determining a virtual link of a route for the current service request by using a preset fourth service grooming strategy;
when the network busy state value meets a third preset condition, determining a virtual link of a route for the current service request by using a preset fifth service grooming strategy;
when the network busy state value meets a fourth preset condition, a preset sixth service grooming strategy is used for determining a virtual link of a route for the current service request;
wherein, the step of determining a routed virtual link for the current service request by using a preset fourth service breakout policy includes:
in the virtual link established by the virtual network topological structure, calculating a second shortest path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset path calculation method;
judging whether the second shortest path can route the current service request;
if the second shortest path can route the current service request, marking the second shortest path as a path to be routed;
if the second shortest path cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link into the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
determining the virtual link corresponding to the path to be routed as a virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the remaining resources in the virtual network topology structure;
wherein, the step of determining a routed virtual link for the current service request by using a preset fifth service breakout policy includes:
calculating the available link utilization rate corresponding to each virtual link between the source node and the destination node pair according to the source node and the destination node of the current service request in the virtual links established by the virtual network topology structure;
marking a path corresponding to a virtual link with the highest available link utilization rate as a path to be routed in the established virtual links;
if each virtual link cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
determining the virtual link corresponding to the path to be routed as a virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the remaining resources in the virtual network topology structure;
wherein, the step of determining a routed virtual link for the current service request by using a preset sixth service breakout policy includes:
in the virtual links established by the virtual network topology structure, calculating the link idle rate corresponding to each virtual link between the source node and the destination node pair according to the source node and the destination node of the current service request;
traversing each virtual link according to the sequence of the link idle rate from high to low, and judging whether the currently traversed virtual link can route the current service request;
if the currently traversed virtual link can route the current service request, marking a path corresponding to the currently traversed virtual link as a path to be routed;
if each virtual link cannot route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to the virtual network topology structure, updating the virtual network topology structure, and marking a path corresponding to the new virtual link as a path to be routed;
and determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
2. The method of claim 1, wherein the step of creating a new virtual link for the current service request comprises:
in the virtual network topology structure, a preset shortest path calculation method is used for calculating a third shortest path corresponding to the current service request according to a source node and a destination node of the current service request;
and in the virtual network topology structure, creating a virtual link corresponding to the third shortest path.
3. The method of claim 1, wherein the network state of the current virtual network topology comprises: network traffic in the current virtual network topology, a used link blocking rate in the current virtual network topology, a used link idle rate in the current virtual network topology, a used link utilization rate in the current virtual network topology, and a used link fragmentation rate in the current virtual network topology; the step of updating the network busy state value based on the network state of the current virtual network topology structure comprises the following steps:
and taking at least one of the network flow in the current virtual network topological structure in the network state of the current virtual network topological structure, the link blocking rate in the current virtual network topological structure, the used link idle rate in the current virtual network topological structure, the used link utilization rate in the current virtual network topological structure and the used link fragment rate in the current virtual network topological structure as input, and obtaining an updated network busy state value by using a fuzzy logic control method.
4. A device for dynamic traffic grooming in an elastic optical network, the device comprising:
the system comprises an establishing module, a judging module and a judging module, wherein the establishing module is used for establishing a virtual network topological structure mapping corresponding to a preset physical network topological structure in a virtual network and initializing a network busy state value, and the physical network topological structure comprises: the network busy state values are used for representing the busy state of the current network in the established virtual network topology structure;
a receiving module, configured to receive a service request, where the service request includes a source node where service data originates and a destination node where the service data arrives;
the convergence module is used for taking the service request as a sub-service request and converging the sub-service requests which have the same source node and destination node and meet a first preset condition into a current service request;
a marking module, configured to mark, based on attribute information of each sub-service request in the current service request, a weight and a required bandwidth for each sub-service request in the current service request;
the updating module is used for updating the network busy state value based on the network state of the current virtual network topology structure;
the judging module is used for judging whether the current service request belongs to a high-priority service request or not based on the weight of each sub-service request in the current service request and a current threshold parameter, and the current threshold parameter is increased along with the increase of the network busy state value;
a first determining module, configured to determine, when the determining module determines that the current service request belongs to a service request with a high priority, a virtual link of a route for the current service request by using a preset first service breakout policy;
a second determining module, configured to determine, when the determining module determines that the current service request does not belong to a service request with a high priority, a virtual link of a route for the current service request by using a preset second service breakout policy;
a traffic grooming module, configured to perform routing and spectrum allocation on the determined virtual link in the physical network topology;
wherein the first determining module comprises:
the first calculation submodule is used for calculating a first shortest path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset shortest path calculation method in a virtual network topological structure;
the second calculation submodule is used for calculating a second shortest path corresponding to the current service request according to the source node and the destination node of the current service request by using a preset path calculation method in the virtual link established by the virtual network topological structure;
the first judgment submodule is used for judging whether a path which is overlapped with the first shortest path exists in the second shortest path;
the first marking submodule is used for marking the first shortest path as the shortest path to be routed when the first judging submodule judges that the second shortest path has a path which is overlapped with the first shortest path;
the second marking submodule is used for creating a virtual link corresponding to the first shortest path in the virtual network topological structure when the first judging submodule judges that no path which is overlapped with the first shortest path exists in the second shortest path, connecting the virtual link corresponding to the first shortest path into the virtual network topological structure, updating the virtual network topological structure and marking the first shortest path as the shortest path to be routed;
the second judgment submodule is used for judging whether the shortest path to be routed can route the current service request;
the first determining submodule is used for determining a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request when the second judging submodule judges that the shortest path to be routed can route the current service request, and in a virtual network topological structure, routing the current service request by using the determined virtual link and updating the residual resources in the virtual network topological structure;
the third judging submodule is used for judging whether a path capable of routing the current service request exists in the second shortest path or not when the second judging submodule judges that the shortest path to be routed cannot route the current service request;
a second determining submodule, configured to mark, when the third determining submodule determines that there is a path capable of routing the current service request in the second shortest paths, the path capable of routing the current service request as a shortest path to be routed of the current service request, determine a virtual link corresponding to the shortest path to be routed as a virtual link for routing the current service request, and use the determined virtual link to route the current service request in a virtual network topology structure and update remaining resources in the virtual network topology structure;
a third determining submodule, configured to determine, when the third determining submodule determines that there is no route capable of routing the current service request in the second shortest path, a virtual link of a route for the current service request by using a preset third service breakout policy;
wherein, the third determining submodule, when the third determining submodule determines that there is no route capable of routing the current service request in the second shortest route, is specifically configured to:
segmenting the current service request based on the weight and the required bandwidth of each sub-service request marked in the current service request and the residual resources of the shortest path to be routed and the second shortest path to obtain a plurality of sections of service requests;
in the virtual network topology structure, traversing each segment of service request aiming at the shortest path to be routed and the second shortest path, and judging whether the current segment of service request can be routed or not;
if the current service request can be routed, determining a virtual link corresponding to a path capable of routing the current service request as a virtual link for routing the current service request;
if the current service request cannot be routed, calculating a standby path corresponding to the current service request according to a source node and a destination node of the current service request by using a preset path calculation method in the virtual network topology structure, creating a virtual link corresponding to the standby path in the virtual network topology structure, connecting the virtual link corresponding to the standby path to the virtual network topology structure, updating the virtual network topology structure, and determining the virtual link corresponding to the standby path as a virtual link for routing the current service request;
in the virtual network topology structure, using the virtual link of the current service request to route the current service request and update the residual resources in the virtual network topology structure;
wherein the second determining module comprises:
a fourth determining submodule, configured to determine, when the network busy state value meets a second preset condition, a virtual link of a route for the current service request by using a preset fourth service breakout policy;
a fifth determining submodule, configured to determine a virtual link of a route for the current service request by using a preset fifth traffic grooming policy when the network busy state value satisfies a third preset condition;
a sixth determining submodule, configured to determine, when the network busy state value satisfies a fourth preset condition, a virtual link of a route for the current service request by using a preset sixth service breakout policy;
when the network busy state value meets a second preset condition, the fourth determining submodule is specifically configured to:
in a virtual link established by a virtual network topological structure, calculating a second shortest path corresponding to a current service request according to a source node and a destination node of the current service request by using a preset path calculation method;
judging whether the second shortest path can route the current service request;
if the second shortest path can route the current service request, marking the second shortest path as a path to be routed;
if the second shortest path can not route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to a virtual network topological structure, updating the virtual network topological structure, and marking a path corresponding to the new virtual link as a path to be routed;
determining a virtual link corresponding to a path to be routed as a virtual link for routing a current service request, routing the current service request by using the determined virtual link in a virtual network topology structure, and updating residual resources in the virtual network topology structure;
when the network busy state value meets a third preset condition, the fifth determining submodule is specifically configured to:
calculating the available link utilization rate corresponding to each virtual link between a source node and a destination node pair according to the source node and the destination node of the current service request in the virtual links established by the virtual network topology structure;
marking a path corresponding to a virtual link with the highest available link utilization rate as a path to be routed in the established virtual links;
if each virtual link can not route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to a virtual network topological structure, updating the virtual network topological structure, and marking a path corresponding to the new virtual link as a path to be routed;
determining a virtual link corresponding to a path to be routed as a virtual link for routing a current service request, routing the current service request by using the determined virtual link in a virtual network topology structure, and updating residual resources in the virtual network topology structure;
when the network busy state value meets a fourth preset condition, the sixth determining submodule is specifically configured to:
in the virtual links established by the virtual network topology structure, calculating the link idle rate corresponding to each virtual link between a source node and a destination node pair according to the source node and the destination node of the current service request;
traversing each virtual link according to the sequence of the link idle rate from high to low, and judging whether the currently traversed virtual link can route the current service request;
if the currently traversed virtual link can route the current service request, marking a path corresponding to the currently traversed virtual link as a path to be routed;
if each virtual link can not route the current service request, creating a new virtual link for the current service request, connecting the created new virtual link to a virtual network topological structure, updating the virtual network topological structure, and marking a path corresponding to the new virtual link as a path to be routed;
and determining the virtual link corresponding to the path to be routed as the virtual link for routing the current service request, routing the current service request by using the determined virtual link in the virtual network topology structure, and updating the residual resources in the virtual network topology structure.
CN202010313767.5A 2020-04-20 2020-04-20 Dynamic service grooming processing method and device in elastic optical network Active CN111654442B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010313767.5A CN111654442B (en) 2020-04-20 2020-04-20 Dynamic service grooming processing method and device in elastic optical network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010313767.5A CN111654442B (en) 2020-04-20 2020-04-20 Dynamic service grooming processing method and device in elastic optical network

Publications (2)

Publication Number Publication Date
CN111654442A CN111654442A (en) 2020-09-11
CN111654442B true CN111654442B (en) 2021-03-19

Family

ID=72348515

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010313767.5A Active CN111654442B (en) 2020-04-20 2020-04-20 Dynamic service grooming processing method and device in elastic optical network

Country Status (1)

Country Link
CN (1) CN111654442B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113037424B (en) * 2021-03-12 2023-05-09 广东科学技术职业学院 Channel selection method and device for elastic optical network
CN113692058B (en) * 2021-08-26 2023-09-05 北京邮电大学 Satellite Optical Network Spectrum Allocation Method and System Based on Spectrum Resource Evaluation Set

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ES2401274B1 (en) * 2011-09-30 2014-05-09 Telefónica, S.A. SYSTEM AND METHOD FOR PERFORMING SPECTRUM ASSIGNMENT IN AN OPTICAL NETWORK
US9270513B2 (en) * 2013-01-29 2016-02-23 Zte (Usa) Inc. Method and apparatus for algorithm on flexible square-QAM coherent detection
CN103595495B (en) * 2013-10-27 2016-02-10 西安电子科技大学 Static traffic stream routing and frequency spectrum resource allocation method in elastic optical network
CN104301030A (en) * 2014-09-18 2015-01-21 南京邮电大学 Share protection strategy supporting flow dredging flexible optical network
CN108199959B (en) * 2018-01-30 2020-07-14 重庆邮电大学 Load sensing energy efficiency routing method based on frequency spectrum reservation in elastic optical network
CN110011922B (en) * 2019-04-07 2020-06-05 西安电子科技大学 RSA method adopting service prediction and spectrum conversion in elastic optical network

Also Published As

Publication number Publication date
CN111654442A (en) 2020-09-11

Similar Documents

Publication Publication Date Title
Bahk et al. Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network
US6697334B1 (en) Method for designing a network
CN111654442B (en) Dynamic service grooming processing method and device in elastic optical network
CN107454019B (en) Dynamic bandwidth allocation method, device, equipment and storage medium for software defined network
CN109617810B (en) Data transmission method and device
CN109639575A (en) Route planning method based on link congestion coefficient
CN112583636B (en) Construction method of government network slice, electronic equipment and storage medium
Kamath et al. Routing and admission control in general topology networks with poisson arrivals
CN112953848A (en) Strict priority based traffic supervision method, system and equipment
CN109274589B (en) Service transmission method and device
Yaghoubpour et al. End-to-end delay guaranteed Service Function Chain deployment: A multi-level mapping approach
CN108366015B (en) Route calculation method for software defined network
EP3585013B1 (en) Data transmission method and apparatus
CN111800352B (en) Service function chain deployment method and storage medium based on load balancing
CN107959593B (en) A kind of software defined network mapping method of virtual network
CN109963316B (en) Multipath routing method and equipment for mobile satellite network
Kamboj et al. A policy based framework for quality of service management in software defined networks
Buragohain et al. Quality of Service provisioning in Named Data Networking via PIT entry reservation and PIT replacement policy
US11876705B2 (en) Methods and systems for adaptive stochastic-based load balancing
Chang et al. Efficient hierarchical QoS routing in ATM networks
Hanczewski et al. The model of the queuing system with adaptive traffic
CN111542052B (en) Group trust degree-based data forwarding method and device in Internet of things
Hussain et al. A lightweight fairness-driven AQM for regulating bandwidth utilization in best-effort routers
CN114615155A (en) Method and device for deploying service
WO2017130893A1 (en) Communication system, control device, and communication control method and program

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