Transport capacity network display method, electronic equipment and computer readable medium

Abstract

The invention provides a transport capacity network display method. The method comprises the following steps: acquiring transport capacity information of a transport capacity network; the transport capacity network comprises nodes and links connected between the nodes, and the transport capacity information comprises geographic positions of the nodes and topologies of the links; acquiring a geographic map; determining a transport capacity map according to the transport capacity information and the geographic map; the transport capacity map comprises map nodes located on the geographic map and corresponding to the nodes, and map links corresponding to the links; on the geographic map, the map nodes are located at the geographic positions of the corresponding nodes, and the link nodes are located between the map nodes corresponding to the nodes connected with the corresponding links. The invention further provides electronic equipment and a computer readable medium.

Description

Technical Field

[0001] The present disclosure relates to the technical field of transportation capacity networks, and particularly to a method for displaying a transportation capacity network, an electronic device, and a computer-readable medium. Background Art

[0002] The transportation capacity network is the basis for the integrated scheduling of computing and networks.

[0003] However, various transportation capacity information of the transportation capacity network cannot be visually presented, so users cannot conveniently obtain the transportation capacity information, and thus cannot efficiently control the transportation capacity network. Summary of the Invention

[0004] The present disclosure provides a method for displaying a transportation capacity network, an electronic device, and a computer-readable medium.

[0005] In a first aspect, an embodiment of the present disclosure provides a method for displaying a transportation capacity network, which includes:

[0006] Obtain the transportation capacity information of the transportation capacity network; the transportation capacity network includes nodes and links connected between the nodes, and the transportation capacity information includes the geographical locations of the nodes and the topologies of the links;

[0007] Obtain a geographical map;

[0008] According to the transportation capacity information and the geographical map, determine a transportation capacity map; the transportation capacity map includes map nodes corresponding to the nodes located on the geographical map, and map links corresponding to the links; on the geographical map, the map nodes are located at the geographical locations of their corresponding nodes, and the link nodes are located between the map nodes corresponding to the nodes to which their corresponding links are connected.

[0009] In a second aspect, an embodiment of the present disclosure provides an electronic device, which includes a memory and a processor; the memory stores a computer program executable by the processor, and when the computer program is executed by the processor, it implements any one of the methods for displaying a transportation capacity network in the embodiments of the present disclosure.

[0010] In a third aspect, an embodiment of the present disclosure provides a computer-readable medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements any one of the methods for displaying a transportation capacity network in the embodiments of the present disclosure.

[0011] In the embodiments of the present disclosure, the transport capacity information of the transport capacity network is combined with a geographical map to obtain a transport capacity map. The transport capacity map can visually present various transport capacity information such as nodes and links of the transport capacity network on the geographical map, realizing the visualization of key transport capacity factors, facilitating users to understand (monitor, perceive, master, etc.) the transport capacity information, meeting the user's needs, so that users can efficiently control the transport capacity network based on the transport capacity map (such as determining network resource bottlenecks, scheduling according to transport capacity information, etc.), providing strong support for the calculation-network fusion scheduling. Description of the Drawings

[0012] In the drawings of the embodiments of the present disclosure:

[0013] Figure 1 It is a schematic flowchart of a method for displaying a transport capacity network provided by an embodiment of the present disclosure;

[0014] Figure 2 It is a block diagram of the composition of an electronic device provided by an embodiment of the present disclosure;

[0015] Figure 3 It is a block diagram of the composition of a computer-readable medium provided by an embodiment of the present disclosure;

[0016] Figure 4 It is a schematic diagram of a transport capacity map in a method for displaying a transport capacity network provided by an embodiment of the present disclosure;

[0017] Figure 5 It is a schematic flowchart of another method for displaying a transport capacity network provided by an embodiment of the present disclosure;

[0018] Figure 6 It is a schematic diagram of a transport capacity map in another method for displaying a transport capacity network provided by an embodiment of the present disclosure;

[0019] Figure 7 It is a schematic diagram of the delay of the link between some nodes in another method for displaying a transport capacity network provided by an embodiment of the present disclosure. Detailed Embodiments

[0020] To enable those skilled in the art to better understand the technical solutions of the present disclosure, the following will describe in detail the method for displaying a transport capacity network, the electronic device, and the computer-readable medium provided by the embodiments of the present disclosure with reference to the accompanying drawings.

[0021] In the following, the present disclosure will be described more fully with reference to the accompanying drawings. However, the illustrated embodiments may be embodied in different forms, and the present disclosure should not be construed as limited to the embodiments set forth below. On the contrary, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the present disclosure to those skilled in the art.

[0022] The accompanying drawings of the embodiments of the present disclosure are used to provide a further understanding of the embodiments of the present disclosure, and constitute a part of the specification. Together with the detailed embodiments, they are used to explain the present disclosure and do not constitute a limitation to the present disclosure. By describing the detailed embodiments with reference to the accompanying drawings, the above and other features and advantages will become more obvious to those skilled in the art.

[0023] The present disclosure may be described with reference to the plan views and / or cross-sectional views by means of the ideal schematic diagrams of the present disclosure. Therefore, the example illustrations may be modified according to the manufacturing technology and / or tolerances.

[0024] Without conflict, the embodiments of the present disclosure and the features in the embodiments may be combined with each other.

[0025] The terms used in the present disclosure are only used to describe specific embodiments and are not intended to limit the present disclosure. As used in the present disclosure, the term "and / or" includes any and all combinations of one or more related listed items. As used in the present disclosure, the singular forms "a" and "the" are also intended to include the plural forms unless the context clearly indicates otherwise. As used in the present disclosure, the terms "comprising", "made of...", specify the presence of the described features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or their groups.

[0026] Unless otherwise defined, the meanings of all terms (including technical and scientific terms) used in the present disclosure are the same as those commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in common dictionaries should be interpreted as having a meaning consistent with their meaning in the relevant art and the context of the present disclosure, and will not be interpreted as having an idealized or overly formal meaning unless the present disclosure clearly defines so.

[0027] The present disclosure is not limited to the embodiments shown in the drawings, but includes modifications to the configurations formed based on the manufacturing process. Therefore, the regions illustrated in the drawings have schematic properties, and the shapes of the regions shown in the drawings illustrate the specific shapes of the regions of the elements, but are not intended to be restrictive.

[0028] In recent years, the global data traffic has grown explosively, and emerging services represented by video and streaming media services have developed rapidly, making dynamic, high-bandwidth, and high-quality data services the main body of network traffic and driving the network to evolve towards packetization.

[0029] A transport capacity network (such as an all-optical transport capacity network) is a high-quality transmission network constructed through end-to-end connections. It can be connected to various users (such as enterprises and households) at the lower end and to cloud computing power at the upper end, so as to provide deterministic transport capacity and computing power with ultra-high reliability, ultra-low latency, ultra-large bandwidth, ubiquitous connection, and intelligent control. Thus, a high-quality transport capacity network with ultra-large bandwidth, ultra-low latency, massive connections, and multi-service bearing is the key to realizing data transmission, providing strong transport capacity support and high-quality bearing solutions for computing network fusion scheduling.

[0030] Due to the rapid growth of users' demand for transport capacity networks, the requirements for the considerability, reliability, etc. of transport capacity networks are also getting higher and higher. As a result, users often need to obtain relevant information (transport capacity information) about transport capacity capabilities such as the connection topology, bandwidth, and latency of transport capacity networks, and accordingly perform computing power resource matching, network path optimization, service scheduling, comprehensive decision-making, etc.

[0031] However, the data volume of the transport capacity information of the transport capacity network is extremely large, and the forms are diverse and the relationships are complex. Therefore, it is very difficult to visually present the transport capacity information to users, and it is difficult for users to effectively obtain and understand the transport capacity information. Furthermore, it is impossible to achieve efficient control of the transport capacity network.

[0032] In a first aspect, embodiments of the present disclosure provide a method for displaying a transport capacity network.

[0033] Among them, the transport capacity network is a data transmission network composed of nodes and links connecting between the nodes to transmit information.

[0034] Specifically, the transport capacity network can be any type of network. For example, the types of transport capacity networks include but are not limited to OTN (Optical Transport Network), SPN (Slicing Packet Network), IP (Internet Protocol) network, etc.

[0035] Specifically, embodiments of the present disclosure do not limit the specific nature of the transport capacity network either. For example, the nature of the transport capacity network can include but is not limited to a convergence network, a provincial cloud private network, a backbone cloud private network, etc.

[0036] Among them, the nodes include computing power nodes with data processing capabilities (computing power resources), management nodes for management, user nodes with business requirements, etc.

[0037] When a user node has a service to process, it can send a service request to the management node. The management node schedules multiple computing power nodes to process the above service according to the service request and plans the service route, and various information is transmitted through the link during the processing; thus, computing network fusion scheduling can be realized through the transport capacity network.

[0038] The embodiments of the present disclosure are used to display (present, show) relevant information of the transportation capacity network to users in a specific manner, so that users can control the transportation capacity network according to this information.

[0039] Among them, the embodiments of the present disclosure can be implemented by an electronic device with data collection and processing capabilities. The electronic device can specifically be a management server on the network side, or other forms such as a customer terminal on the user side, and the specific form thereof is not limited herein.

[0040] Referring to Figure 1 , the method for displaying the transportation capacity network in the embodiments of the present disclosure includes:

[0041] S101. Obtain the transportation capacity information of the transportation capacity network.

[0042] Among them, the transportation capacity network includes nodes and links connected between the nodes, and the transportation capacity information includes the geographical locations of the nodes and the topologies of the links.

[0043] S102. Obtain a geographical map.

[0044] S103. Determine a transportation capacity map according to the transportation capacity information and the geographical map.

[0045] Among them, the transportation capacity map includes map nodes corresponding to the nodes located on the geographical map, and map links corresponding to the links; on the geographical map, the map nodes are located at the geographical locations of their corresponding nodes, and the link nodes are located between the map nodes corresponding to the nodes connected by their corresponding links.

[0046] In the embodiments of the present disclosure, various information (transportation capacity information) in the transportation capacity network is first obtained. The transportation capacity information includes the geographical locations of the nodes in the transportation capacity network, such as a certain node is in a certain district of a certain city in a certain province, or the longitude and latitude coordinate values of a certain node, etc.; and the transportation capacity information also includes the topologies of the links in the transportation capacity network (including optical layer links, electrical layer links, etc.), that is, the information on which two nodes each link is connected between.

[0047] At the same time, the embodiments of the present disclosure also need to obtain data of the geographical map, for example, data of a GIS (Geographic Information System) map. The geographical map includes geographical structure information of each geographical location, such as a certain geographical location is a certain city, a certain geographical location is a certain river, a certain geographical location is a certain mountain, etc.

[0048] Furthermore, the embodiments of the present disclosure continue to obtain a "transportation capacity map" according to the above transportation capacity information and geographical map. The transportation capacity map includes a geographical map (such as a GIS map), and other relevant information of the transportation capacity network is marked on the geographical map.

[0049] Referring toFigure 4 In the capacity map, the information marked on the geographical map includes at least map nodes and map links, that is, at the geographical location of the node, there is a corresponding mark (map node) on the geographical map; and for the nodes connected by links, the corresponding connections (map links) are also marked between the map nodes on the geographical map.

[0050] The above capacity map can be displayed, so it is equivalent to realizing the "visualization" of the capacity information of the capacity network.

[0051] Therefore, by viewing the capacity map, users can directly know the geographical locations of nodes in the capacity network, which nodes are connected, etc., that is, they can intuitively understand the structure and information (topology) of the capacity network, so that they can effectively schedule and control the capacity network.

[0052] In the disclosed embodiment, the capacity information of the capacity network is combined with the geographic map to obtain a capacity map. The capacity map can intuitively present various capacity information such as nodes and links of the capacity network on the geographic map, realize the visualization of key capacity factors, and facilitate users to understand (monitor, perceive, master, etc.) capacity information to meet user needs. Therefore, users can efficiently control the capacity network based on the capacity map (such as determining network resource bottlenecks, scheduling according to capacity information, etc.), providing strong support for computing-network integrated scheduling.

[0053] In some embodiments, the capacity information also includes node attribute information of the nodes and link attribute information of the links; the capacity map also includes node attribute information and link attribute information.

[0054] As one method of an embodiment of the present disclosure, the capacity information used to generate the capacity map may include, in addition to the most basic information (geographical location of nodes, topology of links), other additional information, specifically node attribute information about nodes and link attribute information about links.

[0055] Therefore, the capacity map generated based on the above information also includes node attribute information and link attribute information, so that based on this information, the capacity map can achieve richer and more diverse functions.

[0056] For example, some node attribute information and link attribute information may also be displayed to allow users to understand the information of the transport network in more detail.

[0057] For another example, further calculations may be performed based on the above node attribute information and link attribute information to achieve richer functions.

[0058] In some embodiments, the node attribute information includes at least one of the following attributes of the node: node type, node identifier, node address, computing power resources, available computing power resources, computing power resource utilization rate;

[0059] The link attribute information includes at least one of the following attributes of the link: link type, link identifier, total bandwidth, available bandwidth, bandwidth utilization rate, delay, physical length.

[0060] Exemplarily, the above node attribute information specifically includes, but is not limited to, the node type of the node (such as computing power node, network node, virtual node, user node, management node, etc., and again such as the group, customer, etc. to which the node belongs), node identifier (such as the ID of the node, etc.), node address (such as the IP address of the node, etc.), computing power resources (such as CPU, memory, storage, etc.), available computing power resources (such as the currently idle and available computing power resources of the node, etc.), computing power resource utilization rate, etc.

[0061] Exemplarily, the above link attribute information specifically includes, but is not limited to, the link type of the link (such as optical layer link, electrical layer link, etc.), link identifier (such as the ID of the link, etc.), total bandwidth (such as the theoretical maximum bandwidth, etc.), available bandwidth (such as the currently idle and available bandwidth of the link, etc.), bandwidth utilization rate, delay (such as actual delay, theoretical delay, optical layer delay, electrical layer delay, etc.), physical length (such as the actual length of the physical line of the link, such as fiber optic length, lead length, etc.).

[0062] It should be understood that the above-listed are only some examples of node attribute information and link attribute information, and the content of node attribute information and link attribute information is not limited to this.

[0063] For example, the node attribute information may further include the user information of the node (such as the information of the tenant or enterprise to which it belongs), port information (such as how many ports, the type of the port, the optoelectronic conversion time of the port, the bandwidth of the port, etc.), service information (the service being processed), etc.

[0064] Again, the link attribute information may further include the port information linked to it on the node, transmission error rate, service information (what service data to transmit), etc.

[0065] It should be understood that the transportation capacity information may also include other information in addition to the node attribute information and the link attribute information, such as the information of the user (such as enterprise) in the transportation capacity network, service information, etc.

[0066] In short, as long as it is a key transportation capacity factor related to the attributes of the transportation capacity network and that the user may need to know, it can be added to the transportation capacity map as transportation capacity information.

[0067] It should be understood that the specific acquisition methods of the transportation capacity information are diverse.

[0068] For example, the transport capacity information can be set by the user (such as the ID of the set node).

[0069] For another example, it can also be to obtain the nominal information of various network elements (nodes, links) (such as the nominal bandwidth) as the transport capacity information.

[0070] For another example, it can also be to periodically test the performance of network elements (such as the actual bandwidth), as the transport capacity information and continuously update it.

[0071] For another example, it can also be to actually perform a test (such as through the management server control) to obtain the real-time performance of the network element (such as the current delay) when the corresponding information is needed, as the transport capacity information.

[0072] In some embodiments, referring to Figure 5 , after determining the transport capacity map (S103) according to the transport capacity information and the geographical map, it further includes:

[0073] S104A. Display at least part of the information of the transport capacity map.

[0074] Among them, the information displayed in the transport capacity map includes: the current area of the geographical map, at least part of the map nodes in the current area, and at least part of the map links in the current area.

[0075] As a way of the embodiments of the present disclosure, after obtaining the transport capacity map, at least part of the information in the transport capacity map can be further "displayed" for the user to view.

[0076] Among them, referring to Figure 4 , when the user views a specific area (current area) of the transport capacity map, the content displayed in the transport capacity map at least includes the part of the geographical map located in the current area, and at least part of the map nodes and map links in the current area.

[0077] It should be understood that when the transport capacity map further includes other information (such as node attribute information, link attribute information, and information further calculated through these information), the other information can also be "displayed".

[0078] It should be understood that the specific display methods of other information are diverse.

[0079] For example, referring to Figure 6 , for the link attribute information, the corresponding data can be marked next to the corresponding map link ( Figure 6 takes marking the delay and bandwidth utilization as an example).

[0080] For another example, the attribute information can also be displayed in a table form at a specific position.

[0081] For another example, it is also possible to display the map links or nodes corresponding to different attribute information in different ways (such as different colors and thicknesses), so as to indirectly represent their attribute information, etc.

[0082] For another example, other information can be continuously displayed by default.

[0083] For another example, other information can also be displayed when clicking on the corresponding network element or hovering the mouse over it.

[0084] For another example, other information can also be displayed according to the instructions (requests) input by the user.

[0085] For another example, it is also possible that other information is automatically displayed when certain conditions are met, such as being displayed when the latency of the link exceeds a predetermined threshold as an "alarm".

[0086] In short, the display methods of the information on the transport capacity map are diverse.

[0087] For example, various network elements in the transport capacity network can report data such as latency, bandwidth, optical power, and bit error rate to the management server in real time through various performance tasks.

[0088] Or, it can also be a command query actively issued by the management server. Then, the network element senses the network factor network data in real time and gives it to each equipment manufacturer. The computing and network transport capacity management center of each equipment manufacturer selects an in-computing network scheduling plan, obtains various resource data and service establishment request data, etc., and gives the data to the computing and network transport capacity management center to calculate the enterprise access node and computing power request intention, calculate the routing information, and then report it to the management server.

[0089] Correspondingly, the electronic device may include an initialization module and a transport capacity overview module.

[0090] Among them, the initialization module is used to obtain all the information required to generate the transport capacity map (transport capacity information, including but not limited to network elements, links, electrical layer services, optical layer services, link resources, latency, basic attributes, bandwidth utilization, etc.), load or generate them from the database and store them in the memory, and then superimpose them on the GIS map (geographical map) and perform automatic updates.

[0091] When the system is initialized, the initialization module starts the following work:

[0092] (1) Query the data of the transport capacity network (including the data of all network element information) from the database, and then store the transport capacity map data into the data configuration file according to the interface provided by the GIS map component, so as to present data such as network elements and groups on the front-end interface of the GIS map.

[0093] (2) Query all optical layer and electrical layer services, generate links (including optical layer links, electrical layer links, etc.), latency, bandwidth utilization, total link bandwidth, available bandwidth, etc. according to service types and service attribute network elements, and return these data to the front end of the GIS map for presentation on the GIS map interface.

[0094] (3) Listen for changes in multi-dimensional topology network elements, groups, services, and resource data, and save the GIS map data file.

[0095] (4) Listen for fiber optic changes, calculate and then store the links and latency in the database.

[0096] (5) Regularly notify of changes to the transportation capacity map, push link node and latency change notifications to the front end, and let the front end update in a timely manner.

[0097] The transportation capacity overview module is used to generate a "displayable" transportation capacity map and display various information on the transportation capacity map as needed, enabling users to monitor and perceive in real time.

[0098] Specifically, the transportation capacity overview module configures the basic attributes of computing power nodes (name, type, GIS coordinates, etc.), as well as the connection relationships between computing power nodes and other nodes (which can also be obtained through batch import or other means), and statistically displays the utilization rates of computing power nodes, incoming computing services, incoming computing ports, etc., and enterprise tenant information. Then, it displays the transportation capacity map in GIS map form, allowing users to quickly obtain transportation capacity resource information.

[0099] For example, the transportation capacity overview module can display the following content:

[0100] (1) Network overview - latency query view

[0101] When entering the "latency query view" interface, the transportation capacity overview module displays the nodes in the transportation capacity map on the GIS map based on the data loaded and generated above, that is, it displays the map nodes, such as computing power nodes, network nodes, etc., and displays the links between each node (and the latency of the links), that is, it displays the map links, such as optical layer links (and the latency of optical layer links), or electrical layer links (and the latency of electrical layer links), etc.

[0102] Among them, the transportation capacity overview module can also display routing information, etc. on the right side of the map.

[0103] Among them, various nodes, links, latency, etc. displayed above can be automatically updated.

[0104] Among them, the user can also modify various transport capacity information. For example, the user can right-click on the computing power node to perform "computing power node attribute editing" to modify the name, longitude, latitude, type, etc. of the computing power node. Accordingly, the corresponding map node will be automatically repositioned to the set longitude and latitude on the transport capacity map, and the set attributes will be displayed, etc.

[0105] Among them, the user can also configure the types of the above-displayed links. For example, by clicking the switch button, the user can choose to display the electrical layer link or the optical layer link.

[0106] When the optical layer link is displayed, the user can intuitively see the OTS (Optical Time-Slice Switching) / OPS (Optical Packet Switching) delay information of each segment.

[0107] When the optical layer link is displayed, the user can view the ODU (Optical Channel Data Unit) service corresponding to the electrical layer link, the delay and topology diagram of the ODU service layer optical layer service, including the service name, A-endpoint (head endpoint), Z-endpoint (tail endpoint), total bandwidth, available bandwidth, bandwidth utilization rate, the delay and topology diagram of the working and protection optical layer links, etc.

[0108] Among them, when the type of the displayed link changes, the type of the corresponding displayed delay can also change. That is, the electrical layer delay can be displayed when the electrical layer link is displayed, and the optical layer delay can be displayed when the optical layer link is displayed.

[0109] Among them, the user can also configure the above-displayed delay. For example, when the user selects the delay setting option, a form can pop up, and the form has options such as the measured value, estimated value, measured value / estimated value, etc. of the displayed delay.

[0110] Among them, the specific forms of the above-displayed delay are diverse. For example, according to the acquisition method, it can be divided into measured delay, estimated delay, measured / estimated delay, etc.; according to the corresponding link, it can be divided into electrical layer link delay, optical layer link delay, etc.; when there are multiple services or multiple optical fibers between two nodes, the displayed delay can be the minimum value of multiple delays (of course, it can also be the average value, maximum value, etc.).

[0111] Among them, the measured delay can be obtained by regularly and actively querying the network management. The backend returns the query result to the frontend; if the optical fiber length changes, the backend delay value also needs to be actively reported, and the frontend updates after receiving the notice. The calculation method of the measured delay includes but is not limited to the following method: measured delay = t / 2; where t is the time t (um) from the detection light source sent from point A of the service to the return of point A.

[0112] Among them, the calculation method for estimating the time delay may include but is not limited to the following: physical length of the link (km) * 5.625 (μs / km) + optical - electrical conversion time of the port.

[0113] Among them, the specific method for obtaining the time delay of the electrical - layer link may be: obtain the AZ nodes (service start - end nodes) of the electrical - layer link, obtain the electrical - layer services corresponding to the AZ according to the AZ nodes, and then query the time - delay values of each electrical - branch service, including the estimated time delay and the measured time delay.

[0114] Among them, the specific method for obtaining the time delay of the optical - layer link may be: obtain the AZ nodes of the OTS (Optical Timeslice Switching) / OPS (Optical Packet Switching) link, obtain the OTS / OPS services corresponding to the AZ according to the AZ nodes, and then query the estimated time - delay values of each OTS / OPS service. The OTS / OPS link time delay = the minimum value of the time delays of the OTS / OPS services with the same AZ.

[0115] (2) Network Overview - Bandwidth Query View

[0116] When entering the "Bandwidth Query View" interface, the transportation capacity overview module can load network element and link information on the GIS map, locate the coordinates of nodes and links, and display icons such as nodes and links, and display the bandwidth utilization rate of the electrical - layer service links on each link (the bandwidth utilization rate between the computing - power node and the computing - involved node is not counted).

[0117] Among them, the transportation capacity overview module can also display the number of user - side services, the bandwidth utilization rate of the computing - involved ports, and the link statistical pie chart, etc. on the right side of the map.

[0118] Among them, the transportation capacity overview module can also display the quantity and proportion of various display links on the left side of the map. If the link statistical result changes, it will be automatically refreshed, or it can also be refreshed by clicking the refresh button.

[0119] Among them, the bandwidth forms of the time delay displayed above are diverse, such as link bandwidth utilization rate, total link bandwidth, available link bandwidth, etc.

[0120] The calculation method of the bandwidth information includes but is not limited to the following:

[0121] Link bandwidth utilization rate = (total link bandwidth - available link bandwidth) / total link bandwidth; Link bandwidth availability rate: Link bandwidth availability rate = available link bandwidth / total link bandwidth;

[0122] Total link bandwidth: the smaller value of the total bandwidths of the ports at both ends of the service;

[0123] Link available bandwidth: the smaller value of the available bandwidths of the ports at both ends of the service.

[0124] Among them, the transport capacity overview module can calculate the bandwidth utilization rate of each link and display the links differently according to different bandwidth utilization rates. For example, it includes but is not limited to the following methods:

[0125] When the link utilization rate < 50%, the link is displayed in blue;

[0126] When the link utilization rate is 50% - 70%, the link is displayed in yellow;

[0127] When the link utilization rate is 70% - 80%, the link is displayed in light red;

[0128] When the link utilization rate > 80%, the link is displayed in dark red.

[0129] Among them, when the bandwidth data changes, the link bandwidth data can be automatically updated. The front end polls and initiates a link bandwidth query update every once in a while (which can be set). The polling starts when switching to the bandwidth utilization rate view and ends when switching to other views.

[0130] Among them, the type of the bandwidth of the link displayed above can also be changed according to the type of the displayed link. That is, the electrical layer bandwidth can be displayed when displaying the electrical layer link, and the optical layer bandwidth can be displayed when displaying the optical layer link.

[0131] It can be seen that according to the embodiments of the present disclosure, users can understand various transport capacity information such as the transport capacity network topology, delay, and bandwidth on the transport capacity map in real time, thereby meeting the user's needs.

[0132] For example, users can view the total number of current network services, the service bandwidth utilization rate of the incoming calculation ports, etc. in real time, and view information such as the names, total bandwidth, bandwidth utilization rate, and incoming calculation service numbers of the top 10 (the first 10) bandwidth calculation power nodes of the incoming calculation bandwidth.

[0133] In some embodiments, referring to Figure 5 , the link attribute information includes the delay of the link; after determining the transport capacity map (S103) according to the transport capacity information and the geographical map, it further includes:

[0134] S104B1. Receive a transport capacity circle query request.

[0135] Among them, the transport capacity circle query request includes a central node and a delay threshold.

[0136] S104B2. Determine the transport capacity circle according to the transport capacity circle query request and the transport capacity map.

[0137] Among them, the transport capacity circle includes the nodes within the circle and the links within the circle. The shortest path delay between the nodes within the circle and the central node is less than the delay threshold, and the links within the circle are connected between the nodes within the circle.

[0138] As a way of an embodiment of the present disclosure, according to the transport capacity map, the "transport capacity circle" function can be further realized. That is, for a certain node (central node) determined by the user, all nodes with the total time delay (shortest path delay) required for information transmission with the central node less than a predetermined standard (delay threshold) are selected, and these nodes are used to form a "transport capacity circle".

[0139] Thus, when the service of the central node is allocated to any one or more nodes within the transport capacity circle, the time delay will necessarily meet the requirements; therefore, the transport capacity circle can help quickly evaluate the network delay coverage ability of computing power nodes, discover coverage blind spots, and provide effective guidance for the computing power layout of users.

[0140] Among them, the specific representation methods of the transport capacity circle are diverse.

[0141] For example, it can be with reference to Figure 6 , and the nodes selected into the transport capacity circle are wrapped with a smooth closed curve, that is, the "transport capacity circle" is represented by a curve.

[0142] For another example, a list can also be set, and the information of all nodes selected into the transport capacity circle is marked in the list.

[0143] In some embodiments, determining the transport capacity circle (S104B2) according to the transport capacity circle query request and the transport capacity map includes:

[0144] S104B21. Determine the central node as the current node, and determine other nodes as unprocessed nodes.

[0145] S104B22. Select a target node from the unprocessed nodes, and delete the target node from the unprocessed nodes.

[0146] Among them, the target node is the unprocessed node with the smallest time delay of the corresponding link among all unprocessed nodes directly connected to the current node through a link.

[0147] S104B23. Determine the shortest path delay between the target node and the central node, and update the current node to the target node.

[0148] S104B24A. In response to the existence of unprocessed nodes, return to the step of selecting a target node from the unprocessed nodes (S104B22).

[0149] S104B24B. In response to the non-existence of unprocessed nodes, determine the nodes with the shortest path delay less than the delay threshold from the central node as the nodes within the circle, and determine the links between the nodes within the circle as the links within the circle.

[0150] As a mode of the embodiments of the present disclosure, specifically, it may be to calculate the shortest path delay from the central node to each node of the transport capacity network by a method approximating the Dijkstra algorithm according to the topology of network elements in the transport capacity map and the delay of each link therein; thus, further according to the currently selected delay threshold, all nodes with the shortest path delay less than the delay threshold can be selected therefrom and added to the transport capacity circle.

[0151] Among them, the Dijkstra algorithm gives the path weights (such as delays) between each point (such as nodes), and calculates the shortest path (such as the shortest path delay) from the starting point to the end point under the condition of determining the starting point and the end point.

[0152] However, in the embodiments of the present disclosure, taking the central node as the starting point, but not setting a fixed end point, instead, each time a node connected to the current node (target node) is processed, and the processed node is regarded as the end point each time, so as to calculate the shortest path delay between it and the central node until all nodes in the transport capacity network are processed.

[0153] For example, for the transport capacity network with reference to Figure 7 its process of determining the transport capacity circle can be referred to Table 1 below.

[0154] Among them, in Figure 7 the black dots A to E represent nodes, the straight lines represent the links between nodes, the numbers on the straight lines represent the delays of the links (such as in units of 1 ms), and A is the central node.

[0155] Table 1. Process of determining the transport capacity circle

[0156]

[0157]

[0158] It can be seen from the above process that the shortest path delays from the central node A to all other nodes are respectively determined as:

[0159] A: 0 ms;

[0160] B: 5 ms;

[0161] C: 3 ms;

[0162] D: 6 ms;

[0163] E: 7 ms;

[0164] F: 9 ms;

[0165] Furthermore, the nodes in the transport capacity circle can be determined according to the shortest path delays corresponding to each base point and the required delay threshold:

[0166] For example, assume that the latency threshold is 3000 μs (3 ms), then it can be determined that node C is selected into the transport capacity circle, that is, the transport capacity circle includes node A and node C;

[0167] For example, assume that the latency threshold is 5500 μs, then it can be determined that node B and node C are selected into the transport capacity circle, that is, the transport capacity circle includes node A, node B, and node C.

[0168] In some embodiments, the transport capacity circle query request further includes additional conditions; the nodes and links within the circle meet the additional conditions.

[0169] As a way of the embodiments of the present disclosure, for the nodes selected into the above transport capacity circle, in addition to the requirement of the shortest path latency, there may be other additional requirements (additional conditions); thus, the nodes that meet the latency conditions but do not meet the additional conditions can be "excluded".

[0170] For example, the additional condition may be that the bandwidth of the link is required to be greater than a certain value (bandwidth constraint), such as all available links between AZ nodes must be >= bandwidth constraint; in the above calculation, if the latency of the path A->B->C->D->Z is calculated to be less than the latency threshold, but the available bandwidth of one of the links < bandwidth constraint, then node Z cannot use this shortest path latency, and the shortest path latency in the case where all links meet the bandwidth constraint needs to be recalculated.

[0171] It should be understood that the additional condition is not limited to bandwidth, and it may also be a requirement for node computing power, or it is stipulated that certain nodes must be excluded, etc., which will not be described in detail here.

[0172] Among them, there may be a transport capacity circle module in the electronic device to implement the transport capacity circle function.

[0173] The transport capacity circle module is used to automatically calculate the network or computing power nodes that can be covered by different latency ranges (including electrical layer latency and optical layer latency) centered on this node (central node) for network nodes or computing power nodes, and support presenting in the form of a transport capacity circle on the interface. The radius latency value of the transport capacity circle can be customized, and at the same time, the bandwidth constraint (additional condition) can be specified.

[0174] Thus, the transport capacity circle module can display the latency coverage information of computing power nodes and network nodes on the interface, evaluate the latency coverage range, and facilitate users to optimize the service layout.

[0175] For example, when opening the "transport capacity circle interface", as long as a certain node is selected as the central node, the transport capacity circle module automatically takes it as the central node and calculates the shortest path latency from each node to this central node according to the above algorithm; then, according to the latency radius (latency threshold) selected by the user, different transport capacity circles are determined, such as transport capacity circles with latency radii of 1000 μs, 5000 μs, and 20000 μs respectively.

[0176] Among them, multiple transport capacity circles with different time delay radii (i.e., transport capacity circles of different levels) can be displayed simultaneously, and the time delay radius of each transport capacity circle can be modified, as long as "Level 1 time delay radius < Level 2 time delay radius < Level 3 time delay radius" is ensured. Among them, the accuracy of the time delay radius can be 1 μs, and the upper limit of the time delay radius can be 65535000 μs.

[0177] Among them, the time delay based on which the transport capacity circle is calculated can be selected as the measured value, the estimated value, the measured value / estimated value, etc. When selecting the measured value / estimated value, if there is a measured value for the link, the measured value is adopted; if there is no measured value for the link, the estimated value is adopted.

[0178] Among them, the type of nodes in the transport capacity circle can also be selected, such as network nodes, computing power nodes (virtual network elements, such as medical cloud, government and enterprise cloud, education cloud), etc.

[0179] Among them, other additional conditions of the transport capacity circle, such as the bandwidth constraint value, can also be set.

[0180] Among them, the representation form of the transport capacity circle can be an irregular, smooth curve closed circle drawn on the GIS map, and a transparent bubble map shadow is rendered in the circle background.

[0181] Among them, the nodes outside the outermost circle of the time delay circle support displaying the time delay value from the node to the node of the transport capacity center on the GIS map. According to the route calculation of the transport capacity circle, the time delay distance from the central network element to other network elements is obtained. For example, if the central network element is a computing power node, the time delay to the network network element is calculated; if the central network element is a network network element, the time delay to the computing power node is calculated, and the time delay of the corresponding outermost network element is displayed in the form of a bubble.

[0182] In some embodiments, referring to Figure 5 , after determining the transport capacity map (S103) according to the transport capacity information and the geographical map, it further includes:

[0183] S104C1. Receive a transport capacity matrix query request.

[0184] Among them, the transport capacity matrix query request includes multiple nodes to be queried.

[0185] S104C2. Determine a transport capacity matrix table according to the transport capacity matrix query request and the transport capacity map.

[0186] Among them, the transport capacity matrix table includes connection information between multiple pairs of nodes to be queried.

[0187] As a way of an embodiment of the present disclosure, when a user hopes to query the connection situation between multiple nodes (nodes to be queried), the connection information between different nodes can also be presented in the form of a table (capacity matrix table), that is, each row of the table corresponds to a node, and each column also corresponds to a node, and the intersection of the row and column is the connection information between the row node and the column node (a pair of nodes to be queried).

[0188] Thus, the capacity matrix table can help users evaluate the application deployment ability across nodes, with an intuitive presentation method, and can support refined capacity resource planning.

[0189] Among them, the specific form of the connection information is diverse. For example, it can include the delay, bandwidth, etc. between nodes, and can also include other information (such as the number of hops of the path between nodes, etc.).

[0190] For example, the capacity matrix table can be in the form of Table 2 below.

[0191] In Table 2, the connection information between two nodes includes four items, which are, from top to bottom, the optimal path delay, the sub-optimal path delay, the optimal path bandwidth, and the sub-optimal path bandwidth.

[0192] Table 2. Capacity matrix table

[0193]

[0194] Among them, the electronic device can include a capacity matrix module for implementing the capacity matrix function.

[0195] For example, the capacity matrix module presents the network capacity status (connection information) such as delay and bandwidth between the nodes (nodes to be queried) selected by the user in the form of a capacity matrix table.

[0196] Among them, the capacity matrix table can be customized by the user. For example, the user can select the nodes to be added, as well as the specific items of the connection information, such as the optimal path delay, the sub-optimal path delay, the optimal path bandwidth, the sub-optimal path bandwidth, the total bandwidth, the available bandwidth, etc.

[0197] For example, the user can open the capacity map configuration and select and set the maximum number of nodes selected for the capacity matrix, such as 20; then, the Picklist control displays the list of all current nodes on the left, and by clicking, they can be selected as nodes to be queried and added to the list on the right, and after clicking "OK", the currently selected nodes to be queried can be saved.

[0198] After that, the transport capacity matrix module can use algorithms such as Dijkstra's algorithm to calculate the optimal path delay, sub-optimal path delay between each pair of query nodes with A node and Z node respectively, and query the optimal path bandwidth, sub-optimal path bandwidth, total bandwidth, available bandwidth, etc. of the query device as the corresponding connection information

[0199] After that, the transport capacity matrix module adds the above data to the transport capacity matrix table and exports the transport capacity matrix table.

[0200] Among them, the data in the transport capacity matrix table can also be displayed differently according to different values.

[0201] For example, for the delay (taking the shortest path delay as the standard), it can be displayed in green when <= 3000 μs, yellow when 3000 - 6000 μs, and red when >= 6000 μs or the value cannot be obtained, etc.

[0202] Among them, the above-mentioned used delay can also be selected as measured value, estimated value, measured value / estimated value, etc.

[0203] In some embodiments, referring to Figure 5 , after determining the transport capacity map (S103) according to the transport capacity information and the geographical map, it further includes:

[0204] S104D1. Receive the calculation query request.

[0205] Among them, the calculation query request includes calculation conditions.

[0206] S104D2. Determine the calculation nodes according to the calculation query request and the transport capacity map.

[0207] Among them, the calculation nodes meet the calculation conditions.

[0208] As a way of the embodiments of the present disclosure, it is also possible to query the nodes that meet the computing power resource conditions according to the conditions (calculation conditions) required by the user and the transport capacity information as the "calculation nodes" for subsequent work; further, the recommended optimal calculation path can be calculated from the calculation nodes.

[0209] Thus, according to the embodiments of the present disclosure, the user can perform flexible multi-factor routing calculation as needed, set calculation conditions, and obtain the matching best computing power nodes to meet various different computing power access requirements.

[0210] Among them, the electronic device can have a calculation evaluation module to implement the calculation function.

[0211] The incoming calculation evaluation module can obtain the incoming calculation conditions input by the user (including but not limited to threshold constraints such as computing power resources, latency, bandwidth, utilization rate, etc., and routing constraints such as routing policies), and then screen out the incoming calculation nodes that meet the above conditions from all nodes, further determine the optimal incoming calculation path between the incoming calculation nodes, and present it to the user.

[0212] For example, the incoming calculation evaluation module can present the incoming calculation nodes in the form of a list and display information such as the optimal incoming calculation path routing, latency, and bandwidth.

[0213] In some embodiments, the link attribute information includes the physical length of the link; referring to Figure 5 , after determining the transport capacity map (S103) according to the transport capacity information and the geographical map, it further includes:

[0214] S104E1: Receive a detour information query request.

[0215] Among them, the detour information query request includes the link to be queried.

[0216] S104E2: Determine the detour information of the link to be queried according to the detour information query request and the transport capacity map.

[0217] Among them, the detour information includes a detour coefficient, and the detour coefficient characterizes the relationship between the actual latency of the link and the theoretical latency determined according to the physical length of the link.

[0218] As a way of the embodiment of the present disclosure, the detour information of the link can also be calculated, which at least includes a detour coefficient, and the detour coefficient characterizes the relationship between the actual latency and the theoretical latency of the link, such as the ratio of the actual latency to the theoretical latency.

[0219] Among them, the actual latency can be the measured value of the link latency.

[0220] The theoretical latency is calculated according to the physical length of the link and the theoretical transmission speed of the signal in the link. The physical length can be the straight-line distance between the nodes connected by the link, or the actual latency of the link recorded during construction.

[0221] For example, assuming that the theoretical transmission speed of the signal in the link is 5 μs / km, the calculation method of the detour coefficient includes but is not limited to:

[0222] Detour coefficient = current electrical layer link latency value (μs) / (optimal network routing distance or configured distance (km) * 5 μs / km).

[0223] Among them, the optimal network routing distance or configured distance is the sum of the physical lengths of the links in the path.

[0224] Thus, users can view the relationship between the actual link delay and the theoretical delay of the entire network through the data of detour analysis (which can of course include basic link information, delay, detour coefficient, remarks information, optical layer links under the electrical layer links, etc.), view the overall situation of the links, quickly find the bottleneck positions affecting transmission, and achieve early prevention and planning.

[0225] Among them, the electronic device may have a detour analysis module to implement the detour function.

[0226] Among them, the detour analysis module supports selecting an electrical layer link and displaying the delay of the electrical layer link, as well as displaying the measured delay values of the optical layer routes passed through and each optical layer OTS section, and can also analyze the minimum delay value reachable based on the optical layer topology.

[0227] For the selected electrical layer link, the delay detour coefficient of the link can also be calculated based on the optimal route distance or configured distance of the road network. The calculation method includes but is not limited to: the current electrical layer link delay value (μs) / (the optimal route distance or configured distance of the road network (km) * 5 μs / km).

[0228] Thus, the detour analysis module can display the results of the delay detour coefficients of all electrical layer links in the entire network.

[0229] For example, the detour analysis module can query all electrical layer services, and then obtain all network elements and electrical layer services of the current detour analysis based on the AZ endpoint network elements of the electrical layer services and the transport capacity map; among them, the link data queried by the data loading interface during the initialization of the transport capacity map is stored in the memory, and the detour analysis directly obtains the link information from the memory.

[0230] Among them, the detour analysis module can perform the following tasks, including:

[0231] (1) Obtain the source node (Source ID) and sink node (SinkID) of the link according to the link ID information input by the front end, and combine the node ID list and service ID list in the memory during initialization to obtain the service ID list information for detour analysis.

[0232] (2) Generate network elements and links on the GIS map according to the source, sink nodes and node types of the link information, as well as the node coordinates. The detour coefficient information of the link can view the results of the delay detour coefficients of the electrical layer links, and return the queried detour information to the front end.

[0233] (3) For the selected electrical layer link, calculate the delay detour coefficient of the link based on the optimal route distance or configured distance of the road network. The configured distance takes the shortest distance between GIS coordinates; according to the service ID and the measured delay data stored in the memory during delay measurement, obtain the current electrical layer link delay value of each service ID.

[0234] For example, for the "straight-line detour coefficient", the straight-line distance (the straight-line length of the link) between two nodes can be calculated based on the GIS map, and the time delay corresponding to the theoretical straight-line optical fiber can be calculated based on the straight-line distance. The calculation method can be as follows:

[0235] Current electrical layer link delay value (μs) / (optimal routing distance or configured distance of the road network (km) * 5 μs / km).

[0236] (4) If the network element changes, such as new addition, deletion, coordinate change, or new addition or deletion of ODU services, the backend should monitor the change notification, update the link information, update the link detour coefficient, and send a push message to the frontend for timely update by the frontend.

[0237] (5) For the selected electrical layer link, simultaneously display the electrical layer delay, the optical layer route passed through, and the delay measurement values of each optical layer OTS segment.

[0238] (6) If there are multiple ODU services on the link, take their minimum value as the detour and return it to the frontend.

[0239] (7) The electrical layer link delay value is preferably the measured delay, which can be obtained from the delay view. If there is no measured delay, take the estimated delay.

[0240] (8) Select an electrical layer link on the GIS map, view the delay of an electrical layer link, and view the delay values of each optical layer cross-segment OTS of the optical layer route corresponding to this link; specify an electrical layer link with optical layer OLP (Optical Fiber Line Auto Switch Protection Equipment) protection, and view the working and protection path delays of the optical layer corresponding to the electrical layer link; the working path is displayed in blue, the protection path is displayed in yellow, and the start and end port labels of the link can be displayed when the mouse moves over the optical link.

[0241] (9) Select the electrical layer link, insert a long optical fiber into the corresponding optical layer, which causes the optimal routing result of the optical layer to change. The network calculation center recalculates the delay optimization path, analyzes the optical layer routing conditions before and after the optical fiber is inserted through detour analysis, and displays them on the topology diagram; after the optical fiber is inserted, the original optimal optical layer routing is no longer the optimal routing, and the network calculation center recalculates the optimal routing and displays it on the cloud management platform.

[0242] (10) Through sorting and link information display, confirm the electrical layer links with large detour coefficients. Expand the optical layer links under the electrical layer link, view the overall link situation, and quickly find the bottleneck of the detour coefficient.

[0243] In the second aspect, referring to Figure 2, an embodiment of the present disclosure provides an electronic device, which includes a memory and a processor; the memory stores a computer program executable by the processor, and when the computer program is executed by the processor, any method for displaying a transportation capacity network in the embodiments of the present disclosure is implemented.

[0244] In a third aspect, referring to Figure 3 , an embodiment of the present disclosure provides a computer-readable medium, on which a computer program is stored, and when the computer program is executed by the processor, any method for displaying a transportation capacity network in the embodiments of the present disclosure is implemented.

[0245] Among them, the processor is a device with data processing capabilities, which includes but is not limited to a central processing unit (CPU), etc.; the memory is a device with data storage capabilities, which includes but is not limited to a random access memory (RAM, more specifically such as SDRAM, DDR, etc.), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a flash memory (FLASH); the I / O interface (read / write interface) is connected between the processor and the memory and can realize the information interaction between the memory and the processor, and it includes but is not limited to a data bus (Bus), etc.

[0246] Those of ordinary skill in the art can understand that all or some of the steps, systems, and functional modules / units in the devices disclosed above can be implemented as software, firmware, hardware, and their appropriate combinations.

[0247] In the hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component can have multiple functions, or one function or step can be executed by several physical components in cooperation.

[0248] Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit (CPU), a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transitory medium). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), flash memory (FLASH), or other magnetic disk storage; compact disc read only memory (CD-ROM), digital versatile disc (DVD), or other optical disc storage; magnetic cassettes, tapes, magnetic disk storage or other magnetic storage; and any other medium that can be used to store the desired information and that can be accessed by a computer. In addition, it is well known to those of ordinary skill in the art that a communication medium typically contains computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and may include any information delivery medium.

[0249] The present disclosure has disclosed example embodiments, and although specific terms have been employed, they are used only and should be construed only as general illustrative meanings and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly stated, features, characteristics, and / or elements described in connection with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in connection with other embodiments. Accordingly, those skilled in the art will understand that various forms and details may be changed without departing from the scope of the present disclosure as set forth by the appended claims.

Claims

1. A method for displaying a transportation capacity network, wherein, it includes: Obtaining the transportation capacity information of the transportation capacity network; The transportation capacity network includes nodes and links connected between the nodes, and the transportation capacity information includes the geographical locations of the nodes and the topology of the links; Obtaining a geographical map; According to the transportation capacity information and the geographical map, determining a transportation capacity map; the transportation capacity map includes map nodes corresponding to the nodes located on the geographical map, and map links corresponding to the links; on the geographical map, the map nodes are located at the geographical locations of their corresponding nodes, and the link nodes are located between the map nodes corresponding to the nodes connected by their corresponding links.

2. The method according to claim 1, wherein, after determining the transportation capacity map according to the transportation capacity information and the geographical map, it further includes: Displaying at least part of the information of the transportation capacity map; wherein, the information displayed in the transportation capacity map includes: the current area of the geographical map, at least part of the map nodes in the current area, and at least part of the map links in the current area.

3. The method according to claim 1 or 2, wherein, the transportation capacity information further includes the node attribute information of the nodes and the link attribute information of the links; the transportation capacity map further includes the node attribute information and the link attribute information.

4. The method according to claim 3, wherein, the node attribute information includes at least one of the following attributes of the node: node type, node identifier, node address, computing power resource, available computing power resource, computing power resource utilization rate; the link attribute information includes at least one of the following attributes of the link: link type, link identifier, total bandwidth, available bandwidth, bandwidth utilization rate, delay, physical length.

5. The method according to claim 3, wherein, the link attribute information includes the delay of the link; after determining the transportation capacity map according to the transportation capacity information and the geographical map, it further includes: Receiving a transportation capacity circle query request; the transportation capacity circle query request includes a central node and a delay threshold; According to the transportation capacity circle query request and the transportation capacity map, determining a transportation capacity circle; the transportation capacity circle includes in-circle nodes and in-circle links, and the shortest path delay between the in-circle nodes and the central node is less than the delay threshold, and the in-circle links are connected between the in-circle nodes.

6. The method according to claim 5, wherein, determining the transportation capacity circle according to the transportation capacity circle query request and the transportation capacity map includes: Determining the central node as the current node and other nodes as unprocessed nodes; Selecting a target node from the unprocessed nodes and deleting the target node from the unprocessed nodes; the target node is the unprocessed node with the minimum delay of the corresponding link among all the unprocessed nodes directly connected to the current node through one link; Determining the shortest path delay between the target node and the central node and updating the current node to the target node; In response to the existence of unprocessed nodes, returning to the step of selecting a target node from the unprocessed nodes; In response to the non - existence of the unprocessed node, determine the nodes whose shortest path delay with the central node is less than the delay threshold as the nodes within the circle, and determine the links between the nodes within the circle as the links within the circle.

7. The method according to claim 5, wherein, the transport capacity circle query request further includes additional conditions; the nodes within the circle and the links within the circle meet the additional conditions.

8. The method according to claim 3, wherein, after determining the transport capacity map according to the transport capacity information and the geographical map, it further includes: Receiving a transport capacity matrix query request; the transport capacity matrix query request includes a plurality of nodes to be queried; Determining a transport capacity matrix table according to the transport capacity matrix query request and the transport capacity map; the transport capacity matrix table includes connection information between multiple pairs of the nodes to be queried.

9. The method according to claim 3, wherein, after determining the transport capacity map according to the transport capacity information and the geographical map, it further includes: Receiving a calculation inclusion query request; the calculation inclusion query request includes calculation inclusion conditions; Determining calculation inclusion nodes according to the calculation inclusion query request and the transport capacity map; the calculation inclusion nodes meet the calculation inclusion conditions.

10. The method according to claim 3, wherein, the link attribute information includes the physical length of the link; after determining the transport capacity map according to the transport capacity information and the geographical map, it further includes: Receiving a detour information query request; the detour information query request includes a link to be queried; Determining the detour information of the link to be queried according to the detour information query request and the transport capacity map; the detour information includes a detour coefficient, and the detour coefficient characterizes the relationship between the actual delay of the link and the theoretical delay determined according to the physical length of the link.

11. An electronic device, which includes a memory and a processor; the memory stores a computer program that can be executed by the processor, and when the computer program is executed by the processor, it implements the method for displaying a transport capacity network according to any one of claims 1 to 10.

12. A computer - readable medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the method for displaying a transport capacity network according to any one of claims 1 to 10.

Images