CN110445574A - A kind of optical network transmission method and system based on hypergraph structure - Google Patents

Abstract

Embodiments of the present invention provide an optical network transmission method and system based on a hypergraph structure. The method includes constructing a transmission node model based on a hypergraph structure, calculating the shortest path of an in-out node pair from a traffic in-node to a traffic out-node, and constructing a path set based on the shortest path; if the input traffic rate of the in-out node pair is not greater than the In the path set, for a link with the smallest available bandwidth in any single path, the single path is recorded, and a transmission path corresponding to the single path is established. The embodiment of the present invention establishes the transmission node model based on the hypergraph theory, finds the shortest path for the transmission and output nodes, and multiplexes the transmission link based on the wavelength division multiplexing technology, and then demonstrates the proposed routing strategy based on the parallel path routing algorithm. The model network topology has excellent network topology characteristics such as small diameter, low blocking rate, and short forwarding delay.

Description

Optical network transmission method and system based on hypergraph structure

technical field

The invention relates to the technical field of optical networks, in particular to an optical network transmission method and system based on a hypergraph structure.

Background technique

After entering the 21st century, the annual growth rate of network bandwidth demand is as high as 50-100%. In recent years, Automatic Switching Optical Network (ASON) has been extensively researched as a new-generation optical network technology for high-speed, large-capacity, and ultra-long-distance transmission. Among them, the main research object of ASON is to improve network bandwidth and transmission rate.

However, due to the increasingly stable transmission medium and transmission mode, the improvement of research results is very limited, especially in the case of a large number of network nodes, the performance improvement of optical network is not obvious, and the forwarding delay is still high. A large number of studies have shown that the performance of optical networks depends largely on its topology, because different topologies may lead to performance differences, so topology is the key to studying the performance of optical networks. There is no doubt that the fastest way to interconnect the network is the fully connected structure, which has the characteristics of high throughput, high reliability, and low delay. The diameter between each pair of nodes is 1. However, because it is based on the connection of all nodes, it causes huge network maintenance costs for large-scale networks. At the same time, as the number of nodes increases, the utilization rate of the entire network decreases exponentially. Therefore, it will not be widely used in practical large-scale network structures.

In view of the above problems, it is necessary to propose an optical transmission method with high transmission efficiency and low blocking rate.

Contents of the invention

Embodiments of the present invention provide an optical network transmission method and system based on a hypergraph structure, which are used to solve the problems of complex optical transmission network topology, low bandwidth utilization, and high forwarding delay in the prior art.

In the first aspect, an embodiment of the present invention provides an optical network transmission method based on a hypergraph structure, including:

Constructing a transmission node model based on the hypergraph structure, calculating the shortest path from the flow in-node to the flow-out node, and constructing a path set based on the shortest path in and out;

If the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, record the single path, and establish a transmission path corresponding to the single path.

Wherein, the construction of the transmission node model based on the hypergraph structure specifically includes:

Using the transmission node in the optical transmission as a vertex of the hypergraph, an orthogonal hypergraph H(V, Z) is constructed, where V is a vertex set and Z is a hyperedge set;

The number of vertices in the orthogonal hypergraph H(V, Z) is set to d ⁿ , and the dimension is set to n, then the total number of hyperedges is n*d ^n-1 .

Wherein, the calculation of the shortest path from the traffic ingress node to the traffic egress node ingress and egress node pair, and constructing a path set based on the shortest path specifically includes:

Calculate the shortest path between a single edge node pair in the transmission node model, if the shortest path exists, put the shortest path into the path set, otherwise stop the calculation;

Retaining the in-out node pair, deleting the remaining nodes in the shortest path, and the links adjacent to the remaining nodes;

The calculation of the shortest paths between other single pairs of edge nodes is performed repeatedly until the path set is obtained.

Wherein, the input flow rate specifically includes:

Wherein, set S=(1, 2, 3, ... N) to represent all the in-out node pairs of the flow-in nodes and the flow-out nodes, P _s represents the set of paths, s represents a single in-out node pair, r _s represents the input traffic rate, p represents a single path in the path set, and x _sp represents the traffic sent by the in-out node pair on the label switched path LSP (p∈P _s ).

Wherein, the link with the smallest available bandwidth in any single path includes the following constraints:

y _sp = min{y _sl };

Wherein, l represents a link in any single path, y _sp represents the available bandwidth of node pair s on the single path p, and y _sl represents the available bandwidth of a single in-out node pair s on a single transmission link l.

Wherein, the y _sl specifically includes:

Among them, C represents the total bandwidth on a single transmission link l, i represents the other in-out node pairs on the transmission link l except for the in-out node pair _s , and x _ip represents the Describe the flow sent by the ingress and egress node to i.

Wherein, receiving the input flow rate and establishing the transmission path include the following restrictions:

y _sp ≥ r _s .

In a second aspect, an embodiment of the present invention provides an optical network transmission system based on a hypergraph structure, including:

Constructing a calculation module for constructing a transmission node model based on a hypergraph structure, calculating the shortest path of an in-out node pair from a flow-in node to a flow-out node, and constructing a path set based on the shortest path;

A judging receiving module, configured to record the single path if the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, and establish a link corresponding to the single path transfer path.

In a third aspect, an embodiment of the present invention provides an electronic device, including:

A memory, a processor, and a computer program stored on the memory and operable on the processor. When the processor executes the program, any one of the steps of the optical network transmission method based on the hypergraph structure is implemented.

In a fourth aspect, an embodiment of the present invention provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the optical network based on a hypergraph structure described in any item is implemented. The steps of the transfer method.

An optical network transmission method and system based on a hypergraph structure provided by an embodiment of the present invention, establishes a transmission node model based on the hypergraph theory, finds the shortest path for transmission and output nodes, and performs transmission link based on wavelength division multiplexing technology Multiplexing, and then the routing strategy based on the parallel path routing algorithm demonstrates that the proposed model network topology has excellent network topology characteristics such as small diameter, low blocking rate, and short forwarding delay.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description These are some embodiments of the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic diagram of a hypergraph structure provided by an embodiment of the present invention;

2 is a schematic diagram of an ASON model based on a hypergraph structure provided by an embodiment of the present invention;

FIG. 3 is a flowchart of an optical network transmission method based on a hypergraph structure provided by an embodiment of the present invention;

Fig. 4 is the comparison chart of the blocking rate (single hop) based on the parallel path routing algorithm provided by the embodiment of the present invention;

FIG. 5 is a structural diagram of an optical transmission system based on a hypergraph structure provided by an embodiment of the present invention;

FIG. 6 is a structural block diagram of an electronic device provided by an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

In the prior art, there are problems of low optical transmission bandwidth utilization, complex network topology, low bandwidth utilization, and high forwarding delay. The embodiment of the present invention proposes an optical network transmission method based on a hypergraph structure.

Since the fully connected structure is based on the connection of all nodes, it causes huge network maintenance costs for large-scale networks. At the same time, as the number of nodes increases, the utilization rate of the entire network decreases exponentially. Therefore, it will not be widely used in the actual large-scale network structure, and with the development of science and technology, a new technology - Wavelength Division Multiplexing (WDM for short) appears in the optical network. The study found that the combination of fully connected structure and WDM can better solve this problem. In optical fiber communication, WDM is a technology that multiplexes multiple optical carrier signals onto one optical fiber using different wavelengths (ie, color numbers). Since multimode optical fiber communication can multiplex hundreds of wavelengths at the same time, abundant wavelength resources fully satisfy the network topology model proposed by the embodiments of the present invention.

In hypergraph theory, a hyperedge connects multiple nodes, and the distance of all nodes in the same hyperedge can be regarded as 1, which is the same principle as WDM. On this basis, combining hypergraph theory with WDM technology, a hypergraph optical network model is proposed. First introduce the hypergraph theory, as follows:

Let X={x ₁ ,x ₂ ,x ₃ ,...,x _n } be a finite set. A hypergraph H={E ₁ ,E ₂ ,E ₃ ,…,E _m } on X is a finite subset cluster on X, such that:

If a hypergraph H={E ₁ ,E ₂ ,E ₃ ,…,E _m } also satisfies the following formula, then H is called a simple hypergraph (or "Sperner cluster"):

The elements x ₁ , x ₂ , x ₃ , ..., x _n in the set X are called vertices, and the sets E ₁ , E ₂ , E ₃ , ..., E _m are the edges of the hypergraph. A simple graph is a simple hypergraph where each edge connects 2 vertices. According to the definition of a hypergraph, compared with a simple graph, the edges connecting vertices can be regarded as a ring of vertices, and the vertices in the same ring are directly connected. The basic difference between a hypergraph and a graph is that there can be any number of vertices in a hypergraph ring, whereas a simple graph ring can have only two vertices.

Design the ASON transmission node model based on the above hypergraph theory, as follows:

^dn -hypergraph network can be modeled as a set of orthogonal hypergraphs H(V,Z), where V is the set of vertices and Z is the set of hyperedges. There are d ⁿ vertices in H(V,Z), and each vertex has a unique integer address from 0 to d ⁿ –1. The encoding method uses Gray codes to model the dimensionality. The advantage of this type of modeling is that it avoids network state errors or typos. Since the codes of adjacent nodes marked with Gray code are only one bit different, when the address of a node in the network is wrong, the address correction can be performed by comparing the codes of adjacent nodes.

The integer address of each vertex can be thought of as a "coordinate vector" of n elements in base d, where the elements correspond to the coordinates of the vertex in n-dimensional Euclidean space. By definition, there are ⁿ dimensions in a dn-hypergraph, and there are dn ^-1 hyperedges aligned in each dimension, and there are n·dn ^-1 hyperedges in total. We define the base d as the number of d vertices aligned along a certain dimension; the dimension n is the degree of n-dimensional Euclidean space, then the total number of nodes N=d ⁿ , and the total hyperedge m=nd ^n-1 .

FIG. 1 is a schematic diagram of a hypergraph structure provided by an embodiment of the present invention. As shown in FIG. 1 , it is an example of a hypergraph structure with base d=4 and dimension n=2. The model of the embodiment of the present invention is not limited to this example.

It can be seen that the structural feature of the hypergraph is that, on the same dimension, the nodes in the hyperedge exist in the form of full connections. Define the distance between nodes within an edge to be 1, and the distance between disjoint points on both sides to be 2. On this basis, the three-dimensional mathematical model of ASON is established. Fig. 2 is the ASON model schematic diagram based on hypergraph structure that the embodiment of the present invention provides, as shown in Fig. 2, with the base d=5 of an ASON model, dimension n=3, node n=125, hyperedge m=75 An example is given, and the model of the embodiment of the present invention is not limited to this example. As the basic unit of the ASON model, the three adjacent hyperedges are orthogonal to each other, so there are only two relationships: orthogonal relationship and parallel relationship.

Furthermore, in order to ensure that the load of the entire network tends to be balanced, reduce the pressure of a single path and the bandwidth requirements of links, and simultaneously distribute services to multiple paths, this paper uses a parallel path routing algorithm (Parallel-path-basedBandwidth Algorithm, hereinafter referred to as PPBA) Investigate performance differences between general network models and hypergraph-structured models.

Fig. 3 is a flow chart of an optical network transmission method based on a hypergraph structure provided by an embodiment of the present invention, as shown in Fig. 3 , including:

S1, constructing a transmission node model based on the hypergraph structure, calculating the shortest path from the traffic ingress node to the traffic egress node, and constructing a path set based on the shortest ingress and egress path;

S2. If the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, record the single path, and establish a transmission path corresponding to the single path.

Specifically, first build a complete transmission node model based on the hypergraph structure, define the ingress node and egress node of traffic transmission, and the edge node pairs in the model, calculate the shortest path from the traffic ingress node to the traffic egress node, and divide the ingress and egress nodes that meet the conditions The shortest path establishes a path set, and then calculates the input traffic rate from the traffic ingress node to the traffic egress node, and compares it with the available bandwidth of a single link. If the input traffic rate of the ingress and egress node pair is not greater than that in the path set, any single path If the link with the smallest available bandwidth is used, the single path is recorded, and the single transmission path can be successfully established.

The embodiment of the present invention establishes the transmission node model based on the hypergraph theory, finds the shortest path for the transmission and output nodes, and multiplexes the transmission link based on the wavelength division multiplexing technology, and then demonstrates the proposed routing strategy based on the parallel path routing algorithm. The model network topology has excellent network topology characteristics such as small diameter, low blocking rate, and short forwarding delay.

On the basis of the above embodiments, the construction of the transmission node model based on the hypergraph structure specifically includes:

Using the transmission node in the optical transmission as a vertex of the hypergraph, an orthogonal hypergraph H(V, Z) is constructed, where V is a vertex set and Z is a hyperedge set;

The number of vertices in the orthogonal hypergraph H(V, Z) is set to d ⁿ , and the dimension is set to n, then the total number of hyperedges is n*d ^n-1 .

The above-mentioned process of constructing the transmission node model has been discussed in detail in the design of ASON transmission node model based on hypergraph theory, and will not be repeated here.

Further, the calculation of the shortest path from the traffic ingress node to the traffic egress node ingress and egress node pair, and constructing a path set based on the shortest path specifically includes:

Calculate the shortest path between a single edge node pair in the transmission node model, if the shortest path exists, put the shortest path into the path set, otherwise stop the calculation;

Retaining the in-out node pair, deleting the remaining nodes in the shortest path, and the links adjacent to the remaining nodes;

The calculation of the shortest paths between other single pairs of edge nodes is performed repeatedly until the path set is obtained.

Specifically, the path is precomputed for each edge node pair first, and the process is as follows:

(1) Find the shortest path between a single edge node pair in the transmission node model, if it exists, put it into the path set, and perform the next step (2), otherwise terminate the algorithm;

(2) Remove the entry-exit node pair corresponding to the shortest path in the above-mentioned transmission node model, retain the entry-exit node pair described in step (1), delete the remaining nodes of the path, and the links adjacent to these nodes, and return to step ( 1), repeat the operation until the path set is obtained.

On the basis of the above embodiments, the input flow rate specifically includes:

Wherein, set S=(1, 2, 3, ... N) to represent all the in-out node pairs of the flow-in nodes and the flow-out nodes, P _s represents the set of paths, s represents a single in-out node pair, r _s represents the input traffic rate, p represents a single path in the path set, and x _sp represents the traffic sent by the in-out node pair on the label switched path LSP (p∈P _s ).

On the basis of the above embodiments, the link with the smallest available bandwidth in any single path includes the following constraints:

y _sp = min{y _sl };

Wherein, l represents a link in any single path, y _sp represents the available bandwidth of the node pair s on the single path p, and y _sl represents the available bandwidth of a single in-out node pair s on a single transmission link l.

Further, the y _sl specifically includes:

Among them, C represents the total bandwidth on a single transmission link l, i represents the other in-out node pairs on the transmission link l except for the in-out node pair _s , and x _ip represents the Describe the flow sent by the ingress and egress node to i.

Wherein, receiving the input flow rate and establishing the transmission path include the following restrictions:

y _sp ≥ r _s .

That is, for a single in-out node pair s, find a constraint route of a path p to satisfy the condition.

Furthermore, since PPBA is a parallel path algorithm that uses multiple paths instead of a single path to transmit traffic, the following theorem is introduced to constrain and verify the single path traffic bandwidth:

For a single-path constrained routing network with traffic requiring bandwidth r, the blocking probability is:

And for the PPBA incompatible node parallel path network, the blocking rate probability is:

For example, if the capacity of each link is 150Mbit/s, the available bandwidth on the link is a random variable that obeys the normal distribution N:

Assuming that the expected bandwidth is μ=80Mbit/s, and the shape parameter σ ² =400, it is ensured that the available bandwidth is distributed within the range of 150Mbit/s.

On the basis of the above-mentioned embodiments, the relationship between the required bandwidth and the blocking rate in the graph-structured and hypergraph-structured optical networks is simulated and compared using the PPBA algorithm. Take the hypergraph structured optical network model with base d=3, dimension n=3, node number N=3 ³ =27, and hyperedge number m=27 as an example, as shown in FIG. 4 .

It can be concluded that when the PPBA algorithm is used, compared with the graph structure, the hypergraph structure can not only greatly reduce the blocking rate, but also expand the acceptable bandwidth range. This is because the hypergraph structure adopts the full connection of the WDM structure. A link with a cardinality of 3 can multiplex a path, which is equivalent to adding a set of backup links, so the hypergraph structure can support more traffic loads.

FIG. 5 is a structural diagram of an optical network transmission system based on a hypergraph structure provided by an embodiment of the present invention. As shown in FIG. 5 , it includes: a building calculation module 51 and a judgment receiving module 52; wherein:

The construction calculation module 51 is used to construct the transmission node model based on the hypergraph structure, calculates the shortest path of the in-out node pair from the flow-in node to the flow-out node, and constructs a path set based on the shortest path; the judging receiving module 52 is used to determine if the in-out node If the input traffic rate of the pair is not greater than the available bandwidth of the smallest link in any single path in the path set, record the single path, and establish a transmission path corresponding to the single path.

Specifically, the construction calculation module 51 first constructs a complete transmission node model based on the hypergraph structure, defines the entry node and exit node of traffic transmission, and the edge node pairs in the model, and calculates the shortest path from the traffic entry node to the traffic exit node, Establish a path set with the shortest inbound and outbound paths that meet the conditions, and then calculate the input flow rate from the flow ingress node to the flow outflow node by the judgment receiving module 52, and compare it with the available bandwidth of any single link. greater than the link with the smallest available bandwidth in any single path in the path set, record the single path, and then the single transmission path can be successfully established.

The system provided by the embodiment of the present invention is used to execute the above corresponding method, and its specific implementation mode is consistent with that of the method, and the involved algorithm flow is the same as that of the corresponding method, and will not be repeated here.

The embodiment of the present invention is based on the wavelength division multiplexing (WDM) technology, and uses the hypergraph theory to connect all nodes of the same optical fiber channel to the same hyperedge, thereby reducing the network diameter and increasing the bisection bandwidth. Then the network blocking rate based on hypergraph structure and PPBA algorithm is studied, and it is found that hypergraph structure can effectively reduce congestion, and its flexible scalability makes hypergraph structure very suitable for optical network.

FIG. 6 illustrates a schematic diagram of the physical structure of an electronic device. As shown in FIG. 6, the electronic device may include: a processor (processor) 610, a communication interface (Communications Interface) 620, a memory (memory) 630 and a communication bus 640, Wherein, the processor 610 , the communication interface 620 , and the memory 630 communicate with each other through the communication bus 640 . The processor 610 may call the logical instructions in the memory 630 to perform the following method: construct a transmission node model based on the hypergraph structure, calculate the shortest path of the in-out node pair from the flow-in node to the flow-out node, and construct a path set based on the shortest path; If the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, record the single path, and establish a transmission path corresponding to the single path.

In addition, the logic instructions in the above-mentioned memory 630 may be implemented in the form of software functional units and when sold or used as an independent product, may be stored in a computer-readable storage medium. Based on this understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes. .

On the other hand, an embodiment of the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the transmission method provided by the above-mentioned embodiments is implemented, for example, including : Construct a transmission node model based on the hypergraph structure, calculate the shortest path of the in-out node pair from the traffic in-node to the out-flow node, and construct a path set based on the shortest path; if the input traffic rate of the in-out node pair is not greater than the path set , for the link with the smallest available bandwidth in any single path, the single path is recorded, and the transmission path corresponding to the single path is established.

The device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed to multiple network elements. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. It can be understood and implemented by those skilled in the art without any creative efforts.

Through the above description of the implementations, those skilled in the art can clearly understand that each implementation can be implemented by means of software plus a necessary general hardware platform, and of course also by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products can be stored in computer-readable storage media, such as ROM/RAM, magnetic discs, optical discs, etc., including several instructions to make a computer device (which may be a personal computer, server, or network device, etc.) execute the methods described in various embodiments or some parts of the embodiments.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be Modifications are made to the technical solutions described in the foregoing embodiments, or equivalent replacements are made to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims (10)

1. a kind of optical network transmission method based on hypergraph structure, it is characterized in that, comprising: Constructing a transmission node model based on the hypergraph structure, calculating the shortest path of the in-out node pair from the flow-in node to the flow-out node, and constructing a path set based on the shortest path; If the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, record the single path, and establish a transmission path corresponding to the single path. 2. a kind of optical network transmission method based on hypergraph structure according to claim 1, is characterized in that, described construction transmission node model based on hypergraph structure, specifically comprises: Using the transmission node in the optical transmission as a vertex of the hypergraph, an orthogonal hypergraph H(V, Z) is constructed, where V is a vertex set and Z is a hyperedge set; The number of vertices in the orthogonal hypergraph H(V, Z) is set to d ⁿ , and the dimension is set to n, then the total number of hyperedges is n*d ^n-1 . 3. A kind of optical network transmission method based on hypergraph structure according to claim 1, it is characterized in that, described calculation traffic ingress node to the ingress and egress node of flow egress node is to the shortest path, builds path set based on described shortest path , including: Calculate the shortest path between a single edge node pair in the transmission node model, if the shortest path exists, put the shortest path into the path set, otherwise stop the calculation; Retaining the in-out node pair, deleting the remaining nodes in the shortest path, and the links adjacent to the remaining nodes; The calculation of the shortest paths between other single pairs of edge nodes is performed repeatedly until the path set is obtained. 4. A kind of optical network transmission method based on hypergraph structure according to claim 1, is characterized in that, described input traffic rate, specifically comprises: Wherein, set S=(1, 2, 3, ... N) to represent all the in-out node pairs of the flow-in nodes and the flow-out nodes, P _s represents the set of paths, s represents a single in-out node pair, r _s represents the input traffic rate, p represents a single path in the path set, and x _sp represents the traffic sent by the in-out node pair on the label switched path LSP (p∈P _s ). 5. a kind of optical network transmission method based on hypergraph structure according to claim 4, is characterized in that, the link with minimum available bandwidth in described any single path, comprises following restriction condition: y _sp = min{y _sl }; Wherein, l represents a link in any single path, y _sp represents the available bandwidth of the node pair s on the single path p, and y _sl represents the available bandwidth of a single in-out node pair s on a single transmission link l. 6. a kind of optical network transmission method based on hypergraph structure according to claim 5, is characterized in that, described _ysl specifically comprises: Among them, C represents the total bandwidth on a single transmission link l, i represents the other in-out node pairs on the transmission link l except for the in-out node pair _s , and x _ip represents the Describe the flow sent by the ingress and egress node to i. 7. a kind of optical network transmission method based on hypergraph structure according to claim 5, is characterized in that, receiving described input traffic rate, setting up transmission path comprises following restriction condition: y _sp ≥ r _s . 8. An optical network transmission system based on a hypergraph structure, characterized in that, comprising: Constructing a calculation module for constructing a transmission node model based on a hypergraph structure, calculating the shortest path of an in-out node pair from a flow-in node to a flow-out node, and constructing a path set based on the shortest path; A judging receiving module, configured to record the single path if the input traffic rate of the entry-exit node pair is not greater than the link with the smallest available bandwidth in any single path in the path set, and establish a link corresponding to the single path transfer path. 9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and operable on the processor, wherein the processor implements any of claims 1 to 7 when executing the program. The steps of an optical network transmission method based on a hypergraph structure described in the item. 10. A non-transitory computer-readable storage medium on which a computer program is stored, characterized in that, when the computer program is executed by a processor, a hypergraph-based structure as described in any one of claims 1 to 7 is implemented. The steps of the optical network transmission method.