Method for displaying transportation capacity network, and electronic device and computer-readable medium

Abstract

Provided in the present disclosure is a method for displaying a transportation capacity network. The method comprises: acquiring transportation capacity information of a transportation capacity network, wherein the transportation capacity network comprises nodes and links connected between the nodes, and the transportation capacity information comprises geographic positions of the nodes and topology of the links; acquiring a geographic map; and on the basis of the transportation capacity information and the geographic map, determining a transportation capacity map, wherein the transportation capacity map comprises map nodes which are located on the geographic map and correspond to the nodes, and map links corresponding to the links. On the geographic map, the map nodes are located at geographic positions of nodes corresponding to the map nodes, and the map links are located between map nodes corresponding to nodes connected to links corresponding to the map links. Further provided in the present disclosure are an electronic device and a computer-readable medium.

Description

Method, electronic device, and computer-readable medium for displaying capacity network

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202311683916.7 filed with the China Patent Office on December 7, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0003] The present disclosure relates to, but is not limited to, the field of capacity network technology. Background Art

[0004] The transportation capacity network is the basis of computing-network integrated scheduling.

[0005] However, the various capacity information of the capacity network cannot be presented intuitively, so users cannot easily obtain capacity information, and therefore cannot efficiently control the capacity network.

[0006] Summary of the Invention

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

[0008] In a first aspect, an embodiment of the present disclosure provides a method for displaying a capacity network, comprising: obtaining capacity information of a capacity network; the capacity network comprises nodes and links connected between the nodes, and the capacity information comprises the geographical locations of the nodes and the topology of the links; obtaining a geographic map; determining a capacity map based on the capacity information and the geographic map; the capacity map comprises map nodes corresponding to the nodes located on the geographic map, and map links corresponding to the links; on the geographic map, the map nodes are located at the geographical locations of their corresponding nodes, and the map links are located between the map nodes corresponding to the nodes connected to their corresponding links.

[0009] In a second aspect, an embodiment of the present disclosure provides an electronic device comprising 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, any one of the capacity network display methods of the embodiment of the present disclosure is implemented.

[0010] In a third aspect, an embodiment of the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements any one of the capacity network display methods of the embodiments of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] FIG1 is a flow chart of a method for displaying a transport network according to an embodiment of the present disclosure;

[0012] FIG2 is a block diagram of an electronic device according to an embodiment of the present disclosure;

[0013] FIG3 is a block diagram of a computer-readable medium according to an embodiment of the present disclosure;

[0014] FIG4 is a schematic diagram of a capacity map in a method for displaying a capacity network provided by an embodiment of the present disclosure;

[0015] FIG5 is a flow chart of another method for displaying a transport network according to an embodiment of the present disclosure;

[0016] FIG6 is a schematic diagram of a capacity map in another capacity network display method provided by an embodiment of the present disclosure;

[0017] FIG7 is a schematic diagram of the time delay of some inter-node links in another method for displaying a capacity network provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0018] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, the method, electronic device, and computer-readable medium for displaying a capacity network provided by an embodiment of the present disclosure are described in detail below with reference to the accompanying drawings.

[0019] The present disclosure will be described more fully hereinafter with reference to the accompanying drawings, but 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. Rather, these embodiments are provided so that the present disclosure will be thorough and complete and will fully understand the scope of the present disclosure to those skilled in the art.

[0020] 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 of the present disclosure. The above and other features and advantages will become more apparent to those skilled in the art by describing the detailed embodiments with reference to the accompanying drawings.

[0021] The present disclosure may be described with reference to plan views and / or cross-sectional views by way of ideal schematic views of the present disclosure. Therefore, the exemplary illustrations may be modified according to manufacturing techniques and / or tolerances.

[0022] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0023] The terms used in this disclosure are only used to describe specific embodiments and are not intended to limit the disclosure. As used in this disclosure, the term "and / or" includes any and all combinations of one or more related enumerated items. As used in this disclosure, the singular forms "a" and "the" are also intended to include plural forms, unless the context clearly indicates otherwise. As used in this disclosure, the terms "comprising" and "made of" specify the presence of the 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 groups thereof.

[0024] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meanings as those commonly understood by those skilled in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless expressly defined in this disclosure.

[0025] The present disclosure is not limited to the embodiments shown in the drawings, but includes modifications of 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 limiting.

[0026] In recent years, global data traffic has exploded, and emerging services represented by video and streaming services have developed rapidly, making dynamic, high-bandwidth, and high-quality data services the main body of network traffic and driving the evolution of networks towards packetization.

[0027] A transport network (such as an all-optical transport network) is a high-quality transmission network built through end-to-end connectivity. It connects various users (such as businesses and homes) downstream and cloud computing power upstream, providing deterministic transport and computing power with ultra-high reliability, ultra-low latency, ultra-large bandwidth, ubiquitous connectivity, and intelligent management and control. Therefore, a high-quality transport network with ultra-large bandwidth, ultra-low latency, massive connections, and the ability to carry multiple services is key to achieving data transmission, providing strong transport support and high-quality transport solutions for computing-network convergence scheduling.

[0028] Due to the rapid growth in users' demand for transport networks, the requirements for the feasibility and reliability of transport networks are also becoming increasingly higher. Therefore, users often need to obtain relevant information (capacity information) about the transport network's connection topology, bandwidth, latency, and other transport capabilities, and use this information to match computing resources, optimize network paths, perform business scheduling, and make comprehensive decisions.

[0029] However, the amount of capacity information in the capacity network is huge, and the forms are diverse and the relationships are complex. Therefore, the capacity information is difficult to be presented to users intuitively, and users find it difficult to effectively obtain and understand the capacity information, and thus cannot achieve efficient control of the capacity network.

[0030] In a first aspect, an embodiment of the present disclosure provides a method for displaying a transportation network.

[0031] Among them, the transportation network is a data transmission network composed of nodes and links connecting the nodes to transmit information.

[0032] Exemplarily, the capacity network can be any type of network, such as the types of capacity networks including but not limited to OTN (Optical Transport Network), SPN (Slicing Packet Network), IP (Internet Protocol) network, etc.

[0033] For example, the embodiments of the present disclosure do not limit the nature of the capacity network. For example, the nature of the capacity network may include but is not limited to a convergence network, a provincial cloud private network, a backbone cloud private network, etc.

[0034] Nodes include computing nodes with data processing capabilities (computing resources), management nodes for management, user nodes with business needs, etc. For example, a node can be an electronic device, such as a personal computer (PC), a server, a mobile device, a user equipment (UE), etc.

[0035] When a user node has business to process, it can send a business request to the management node. The management node will dispatch multiple computing nodes to process the above business according to the business request and plan the business route. Various information is transmitted through the link during the processing process. Therefore, computing network integrated scheduling can be achieved through the transportation network.

[0036] The embodiments of the present disclosure are used to display (display, present) relevant information of the capacity network to the user in a specific manner, so that the user can control the capacity network based on this information.

[0037] The embodiments of the present disclosure may be implemented by an electronic device having data collection and processing capabilities, and the electronic device may be, for example, a management server on the network side, or a client terminal on the user side, etc., and its form is not limited here.

[0038] 1 , the method for displaying a capacity network according to an embodiment of the present disclosure may include S101 to S103 .

[0039] S101. Acquire transport capacity information of the transport capacity network.

[0040] Among them, the capacity network includes nodes and links connecting the nodes, and the capacity information includes the geographical location of the nodes and the topology of the links.

[0041] S102: Obtain a geographical map.

[0042] S103: Determine a transportation capacity map based on the transportation capacity information and the geographical map.

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

[0044] In the disclosed embodiment, various information (capacity information) in the capacity network is first obtained. The capacity information includes the geographical location of each node in the capacity network, such as whether a node is in a certain province, city, or district, or the longitude and latitude coordinate values ​​of a node; and the capacity information also includes the topology of each link in the capacity network (including optical layer links, electrical layer links, etc.), that is, information about which two nodes each link is connected between.

[0045] At the same time, the embodiment of the present disclosure also needs to obtain geographic map data, such as GIS (Geographic Information System) map data. The geographic map includes geographic structure information of each geographic location, such as a certain geographic location is a certain city, a certain geographic location is a certain river, a certain geographic location is a certain mountain, etc.

[0046] Furthermore, the embodiment of the present disclosure continues to derive a "capacity map" based on the above capacity information and geographical map. The capacity map includes a geographical map (such as a GIS map) and other relevant information of the capacity network is marked on the geographical map.

[0047] Referring to Figure 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.

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

[0049] 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.

[0050] 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. In this way, 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 and network integrated scheduling.

[0051] 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.

[0052] 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 the node, topology of the link), other additional information, such as node attribute information about the node and link attribute information about the link.

[0053] 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.

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

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

[0056] In some embodiments, the node attribute information includes at least one of the following attributes of the node: node type, node identification, node address, computing power resources, available computing power resources, and computing power resource utilization.

[0057] In some embodiments, 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, delay, and physical length.

[0058] Exemplarily, the above node attribute information may include but is not limited to the node type (such as computing power node, network node, virtual node, user node, management node, etc., and the group or client to which the node belongs), node identification (such as node ID, etc.), node address (such as node IP address, etc.), computing power resources (such as CPU, memory, storage, etc.), available computing power resources (such as the node's currently idle and available computing power resources, etc.), computing power resource utilization, etc.

[0059] Exemplarily, the above link attribute information may include but is not limited to the link type of the link (such as optical layer link, electrical layer link, etc.), link identification (such as link ID, etc.), total bandwidth (such as theoretical maximum bandwidth, etc.), available bandwidth (such as the currently idle bandwidth available in the link, etc.), bandwidth utilization, 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 optical fiber length, lead length, etc.).

[0060] It should be understood that the above examples are only some of the node attribute information and link attribute information, and the content of the node attribute information and link attribute information is not limited thereto.

[0061] For example, node attribute information may also include user information of the node (such as information about the tenant or enterprise to which it belongs), port information (such as the number of ports, port type, port photoelectric conversion time, port bandwidth, etc.), business information (business being processed), etc.

[0062] For another example, the link attribute information may also include the port information of the link on the node, the transmission bit error rate, the service information (what service data is to be transmitted), etc.

[0063] It should be understood that capacity information may also include other information besides node attribute information and link attribute information, such as information about users (such as enterprises) in the capacity network, business information, etc.

[0064] In short, any key capacity factors related to the properties of the capacity network that users may need to know can be added to the capacity map as capacity information.

[0065] It should be understood that there are various ways to obtain capacity information.

[0066] For example, the capacity information may be set by the user (such as setting the ID of the node).

[0067] For another example, the nominal information of various network elements (nodes, links) (such as nominal bandwidth) may be obtained as capacity information.

[0068] For another example, the performance of network elements (such as actual bandwidth) may be tested periodically and used as capacity information and continuously updated.

[0069] For another example, when corresponding information is needed, actual testing may be performed (eg, through control by a management server) to obtain the real-time performance of the network element (eg, current latency) as capacity information.

[0070] In some embodiments, referring to FIG. 5 , after determining the capacity map according to the capacity information and the geographical map ( S103 ), the method further includes: S104A, displaying at least part of the capacity map information.

[0071] The information displayed in the capacity map includes: the current area of ​​the geographical map, at least some of the map nodes in the current area, and at least some of the map links in the current area.

[0072] As one method of an embodiment of the present disclosure, after obtaining the capacity map, at least part of the information in the capacity map can be further "displayed" for users to view.

[0073] 4 , when a user views a specific area (current area) of the capacity map, the content displayed in the capacity map includes at least the geographic map portion located in the current area, and at least some of the map nodes and map links in the current area.

[0074] It should be understood that when the capacity map also includes other information (such as node attribute information, link attribute information, and information further calculated based on this information), other information can also be "displayed".

[0075] It should be understood that other information can be displayed in various ways.

[0076] For example, referring to FIG6 , for link attribute information, corresponding data may be marked next to the corresponding map link ( FIG6 takes delay and bandwidth utilization as an example).

[0077] For another example, the attribute information may also be displayed in a table format at a specific location.

[0078] For another example, map links or nodes corresponding to different attribute information may be displayed in different ways (such as different colors or different thicknesses) to indirectly represent their attribute information.

[0079] For another example, other information may be displayed continuously by default.

[0080] For another example, other information may also be displayed when the corresponding network element is clicked or the mouse is hovered over it.

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

[0082] For another example, other information may be automatically displayed when certain conditions are met, such as when the link delay exceeds a predetermined threshold, as an "alarm."

[0083] In short, there are various ways to display information on the capacity map.

[0084] For example, various network elements in the transport 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.

[0085] Alternatively, it can be a command query actively issued by the management server, and then the network element perceives the network factor network data in real time to each equipment vendor, and the computing network capacity management center of each equipment vendor selects the network scheduling plan, obtains various resource data and business establishment request data, etc., and gives the data to the computing network 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.

[0086] Accordingly, the electronic device may include an initialization module and a capacity overview module.

[0087] Among them, the initialization module is used to obtain all the information required to generate the capacity map (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 them from the database or generate and store them in memory, and then superimpose them on the GIS map (geographic map) and automatically update them.

[0088] When the system is initialized, the initialization module starts to do the following:

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

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

[0091] (3) Monitor changes in multi-dimensional topology network elements, groups, services, and resource data, and save GIS map data files.

[0092] (4) Monitor fiber changes, calculate and store links and delays.

[0093] (5) Regularly notify the capacity map of changes, push notifications of link node and delay changes to the front end, and the front end will update it in time.

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

[0095] For example, the capacity overview module configures the basic attributes of the computing power node (name, type, GIS coordinates, etc.), as well as the connection relationship between the computing power node and other nodes (which can also be obtained through batch import or other means), counts and displays the utilization rate of computing power nodes, calculated businesses, calculated ports, corporate tenant information, etc., and then displays a GIS-based capacity map, allowing users to quickly obtain capacity resource information.

[0096] For example, the Capacity Overview module can display the following:

[0097] (1) Network Overview - Latency Query View

[0098] When entering the "Latency Query View" interface, the capacity overview module displays the nodes in the capacity map on the GIS map based on the above loaded and generated data, that is, displays map nodes, such as computing power nodes, network nodes, etc., displays the links between nodes (and the delay of the links), etc., that is, displays map links, such as optical layer links (and the delay of optical layer links), or displays electrical layer links (and the delay of electrical layer links), etc.

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

[0100] Among them, the various nodes, links, delays, etc. displayed above can be automatically updated.

[0101] Among them, users can also modify various capacity information. For example, users can right-click on the computing power node to perform "computing power node property editing" to modify the name, longitude, latitude, type, etc. of the computing power node, so that the corresponding map node will be automatically relocated to the set longitude and latitude on the capacity map and display the set properties.

[0102] The user can also configure the type of link displayed above, such as clicking a switch button to choose to display electrical layer links or optical layer links.

[0103] When displaying the optical layer link, users can intuitively see the delay information of each OTS (Optical Time Slice Switching) / OPS (Optical Packet Switching) segment.

[0104] When displaying the optical layer link, users can view the corresponding ODU (Optical Channel Data Unit) service and the ODU service service layer optical layer service delay and topology, including the service name of the ODU service, A endpoint (first endpoint), Z endpoint (last endpoint), total bandwidth, available bandwidth, bandwidth utilization, and the delay and topology of the working and protection optical layer links.

[0105] When the type of displayed link changes, the type of corresponding displayed delay may also change, that is, the electrical layer delay may be displayed when the electrical layer link is displayed, and the optical layer delay may be displayed when the optical layer link is displayed.

[0106] The user may also configure the delay displayed above. For example, when the user selects the delay setting option, a window may pop up, and the delay displayed in the window may include options such as measured value, estimated value, measured value / estimated value, etc.

[0107] The delays displayed above are in various forms. For example, according to the acquisition method, they can be divided into measured delay, estimated delay, measured / estimated delay, etc.; and according to the corresponding links, they can be divided into electrical layer link delay, optical layer link delay, etc.; and 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, maximum, etc.).

[0108] The measured latency can be obtained by periodically and proactively querying the network management system. The backend then returns the query results to the frontend. If the fiber length changes, the backend also proactively reports the latency value, which is updated upon notification from the frontend. Calculation methods for the measured latency include, but are not limited to, the following: Measured latency = t / 2; where t is the time (in micrometers) from the time the detection light source is emitted from service point A to the time it returns to point A.

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

[0110] Among them, the delay of the electrical layer link can be obtained by: obtaining the AZ node (service head and tail node) of the electrical layer link, obtaining the electrical layer service of the corresponding AZ according to the AZ node, and then querying the delay value of each electrical branch service, including estimated delay and measured delay.

[0111] The specific method for obtaining the delay of the optical layer link is as follows: obtain the AZ node of the OTS (Optical Time Slice Switching) / OPS (Optical Packet Switching) link, OPS obtains the OTS / OPS service of the corresponding AZ based on the AZ node, and then queries the estimated delay value of each OTS / OPS service. The OTS / OPS link delay = the minimum value of the delay of the OTS / OPS service of the same AZ.

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

[0113] When entering the "Bandwidth Query View" interface, the capacity overview module can load network elements and link information on the GIS map, locate node and link coordinates, and display icons such as nodes and links. It also displays the bandwidth utilization of the electrical layer service link on each link (excluding the bandwidth utilization between the computing power node and the calculation node).

[0114] Among them, the capacity overview module can also display the number of user-side services, bandwidth utilization of incoming ports, link statistics circle charts, etc. on the right side of the map.

[0115] Among them, the capacity overview module can also display the number and proportion of various links on the left side of the map. If the link statistics change, they will be automatically refreshed, or you can refresh them by clicking the refresh button.

[0116] The bandwidth of the latency displayed above can be expressed in various forms, such as link bandwidth utilization, total link bandwidth, and available link bandwidth.

[0117] The calculation methods of bandwidth information include but are not limited to the following:

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

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

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

[0121] The capacity overview module can count the bandwidth utilization of each link and display the links differently according to the different bandwidth utilization, including but not limited to the following methods:

[0122] If the link utilization is less than 50%, the link is displayed in blue;

[0123] When the link utilization is 50% to 70%, the link is displayed in yellow.

[0124] Link utilization is 70% to 80%, and the link is displayed in light red;

[0125] If the link utilization is greater than 80%, the link is displayed in dark red.

[0126] 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 at a certain interval (which can be set). The polling starts when switching to the bandwidth and rate view, and ends when switching to other views.

[0127] The type of link bandwidth displayed above may also be changed according to the type of link displayed, that is, the electrical layer bandwidth may be displayed when an electrical layer link is displayed, and the optical layer bandwidth may be displayed when an optical layer link is displayed.

[0128] It can be seen that according to the embodiment of the present disclosure, users can understand various capacity information such as capacity network topology, latency, bandwidth, etc. in real time on the capacity map, thereby meeting user needs.

[0129] For example, users can view the total number of existing network services, bandwidth utilization of calculated port services, etc. in real time, as well as the names, total bandwidth, bandwidth utilization and number of calculated services of the TOP10 (top 10) bandwidth computing power nodes.

[0130] In some embodiments, referring to FIG. 5 , the link attribute information includes the link delay; after determining the capacity map ( S103 ) based on the capacity information and the geographical map, the method may further include S104B1 and S104B2 .

[0131] S104B1. Receive a capacity circle query request.

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

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

[0134] Among them, the capacity circle includes nodes within the circle and 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 connect the nodes within the circle.

[0135] As one method of the present disclosure, the capacity map can be used to further implement a "capacity circle" function. That is, for a user-defined node (central node), all nodes whose total information transmission delay (shortest path delay) to the central node is less than a predetermined standard (delay threshold) are selected, and these nodes are used to form a "capacity circle."

[0136] Therefore, when the business distribution of the central node is carried out at any one or more nodes within the capacity circle, the latency must meet the requirements; therefore, the capacity circle can help quickly evaluate the network latency coverage capability of the computing power nodes, discover coverage blind spots, and provide effective guidance for users' computing power layout.

[0137] Among them, there are various ways to express the capacity circle.

[0138] For example, referring to FIG. 6 , the nodes of the selected capacity circle can be wrapped with a smooth closed curve, that is, the “capacity circle” can be represented by a curve.

[0139] For another example, a list may be set up to mark the information of all nodes selected into the capacity circle in the list.

[0140] In some embodiments, determining the capacity circle ( S104B2 ) according to the capacity circle query request and the capacity map may include S104B21 to S104B24B.

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

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

[0143] The target node is an unprocessed node with the smallest delay of the corresponding link among all unprocessed nodes directly connected to the current node through a link.

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

[0145] S104B24A: In response to there still being unprocessed nodes, return to the step of selecting a target node from the unprocessed nodes (S104B22).

[0146] S104B24B: In response to the absence of unprocessed nodes, determine that nodes with shortest path delays to the central node less than a delay threshold are in-circle nodes, and determine that links between in-circle nodes are in-circle links.

[0147] As one method of an embodiment of the present disclosure, the shortest path delay from the central node to each node of the capacity network can be calculated based on the topology of the network elements in the capacity map and the delay of each link therein, using a method similar to Dijkstra's algorithm; thereby, all nodes whose shortest path delay is less than the delay threshold can be further selected according to the currently selected delay threshold to add to the capacity circle.

[0148] The Dijkstra algorithm gives the path weight (such as delay) between each point (such as a node), and calculates the shortest path (such as the shortest path delay) from the starting point to the end point when the starting point and the end point are determined.

[0149] The embodiment of the present disclosure takes the central node as the starting point, but does not set a fixed end point. Instead, it processes a node connected to the current node (target node) each time, and regards the processed node as the end point each time, thereby calculating the shortest path delay between it and the central node until the traversal is completed and the processing of all nodes in the transportation network is completed.

[0150] For example, for the capacity network shown in FIG7 , the process of determining the capacity circle can refer to Table 1 below.

[0151] In FIG. 7 , black dots A to F represent nodes, straight lines represent links between nodes, numbers on the straight lines represent link delays (eg, in milliseconds), and A is the central node.

[0152] Table 1. Process of determining the capacity circle

[0153] It can be seen that through the above process, the shortest path delays between the central node A and all other nodes are determined as:

[0154] A: 0ms;

[0155] B: 5ms;

[0156] C: 3ms;

[0157] D: 6ms;

[0158] E: 7ms;

[0159] F: 9ms;

[0160] Then, the nodes in the capacity circle can be determined based on the shortest path delay corresponding to each base point and the required delay threshold:

[0161] For example, assuming the latency threshold is 3000 μs (3 ms), node C can be determined to be included in the capacity circle, that is, the capacity circle includes nodes A and C;

[0162] For example, assuming that the latency threshold is 5500 μs, it can be determined that nodes B and C are included in the capacity circle, that is, the capacity circle includes nodes A, B, and C.

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

[0164] As one embodiment of the present disclosure, the nodes selected into the above capacity circle may have other additional requirements (additional conditions) in addition to the requirement of the shortest path delay; thereby, the nodes that meet the delay conditions but do not meet the additional conditions can be "eliminated".

[0165] For example, an additional condition may require that the link bandwidth be greater than a certain value (bandwidth constraint), such as requiring that the available bandwidth of all links between nodes A and B must be greater than or equal to the bandwidth constraint. If the calculated delay of the path A->B->C->D->Z in the above operation is less than the delay threshold, but the available bandwidth of one link is less than the bandwidth constraint, node Z cannot use the shortest path delay and must recalculate the shortest path delay when all links meet the bandwidth constraint.

[0166] It should be understood that the additional conditions are not limited to bandwidth. They can also be requirements for node computing power, or regulations that certain nodes must be excluded, etc., which will not be described in detail here.

[0167] Among them, the electronic device may have a capacity circle module to realize the capacity circle function.

[0168] The capacity circle module is used to automatically calculate the network or computing power nodes that can be covered with different delay ranges (including electrical layer delay and optical layer delay) with the network node or computing power node as the center (central node), and supports presentation in the form of a capacity circle on the interface. The radius delay value of the capacity circle can be customized, and bandwidth constraints (additional conditions) can be specified.

[0169] Therefore, the 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 their business layout.

[0170] For example, when the "Capacity Circle Interface" is opened, as long as a node is selected as the central node, the capacity circle module will automatically use it as the central node and calculate the shortest path delay from each node to the central node according to the above algorithm; then, based on the delay radius (delay threshold) selected by the user, different capacity circles are determined, such as capacity circles with delay radii of 1000μs, 5000μs, and 20000μs respectively.

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

[0172] The delay used to calculate the capacity circle can be selected from measured values, estimated values, or measured / estimated values. When selecting measured / estimated values, if the link has a measured value, the measured value is used; if the link does not have a measured value, the estimated value is used.

[0173] Among them, the type of nodes in the 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.

[0174] Among them, other additional conditions of the capacity circle such as bandwidth constraint values ​​can also be set.

[0175] The capacity circle can be represented by drawing an irregular, smooth curve closed circle on the GIS map, and rendering a transparent bubble image in the background of the circle.

[0176] Among them, the nodes outside the outermost circle of the delay circle support the display of the delay value from the node to the node of the capacity center on the GIS map. The delay distance from the central network element to other network elements is obtained according to the capacity circle calculation. If the central network element is a computing power node, the delay to the network network element is calculated; if the central network element is a network network element, the delay to the computing power node is calculated, and the delay of the outermost corresponding network element is displayed in the form of bubbles.

[0177] In some embodiments, referring to FIG. 5 , after determining the capacity map according to the capacity information and the geographical map ( S103 ), the method may further include S104C1 and S104C2 .

[0178] S104C1. Receive a capacity matrix query request.

[0179] The capacity matrix query request includes multiple nodes to be queried.

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

[0181] The capacity matrix table includes connection information between multiple query nodes.

[0182] As one method of an embodiment of the present disclosure, when a user wishes to query the connection status 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 rows and columns is the connection information between the row node and the column node (a pair of nodes to be queried).

[0183] Therefore, the capacity matrix table can help users evaluate the application deployment capabilities across nodes. The presentation is intuitive and can support refined capacity resource planning.

[0184] The connection information may be in various forms, for example, it may include the delay and bandwidth between nodes, and may also include other information (such as the number of hops in the path between nodes).

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

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

[0187] 2. Capacity Matrix

[0188] Among them, the electronic device may include a capacity matrix module for realizing the capacity matrix function.

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

[0190] 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 specific items of connection information, such as optimal path delay, suboptimal path delay, optimal path bandwidth, suboptimal path bandwidth, total bandwidth, available bandwidth, etc.

[0191] For example, users can open the capacity map configuration, select and set the maximum number of capacity matrix selection nodes, such as 20; then, the Picklist control displays a list of all current nodes on the left. By clicking, you can select it as the node to be queried and add it to the list on the right. Clicking "OK" saves the currently selected node to be queried.

[0192] Afterwards, the capacity matrix module can use Dijkstra algorithm to calculate the optimal path delay and suboptimal path delay between each query node, which are node A and node Z, and query the optimal path bandwidth, suboptimal path bandwidth, total bandwidth, available bandwidth, etc. as the corresponding connection information.

[0193] Afterwards, the capacity matrix module adds the above data to the capacity matrix table and exports the capacity matrix table.

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

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

[0196] The above usage delay can also be selected as measured value, estimated value, measured value / estimated value, etc.

[0197] In some embodiments, referring to FIG. 5 , after determining the capacity map according to the capacity information and the geographical map ( S103 ), the method may further include S104D1 and S104D2 .

[0198] S104D1. Receive a calculation query request.

[0199] The calculation query request includes calculation conditions.

[0200] S104D2. Determine the calculation node based on the calculation query request and the transportation capacity map.

[0201] Among them, the included nodes meet the inclusion conditions.

[0202] As a method of an embodiment of the present disclosure, it is also possible to query nodes that meet the computing resource conditions based on the conditions required by the user (calculation conditions) and capacity information, and use them as "calculation nodes" for subsequent work; further, it is also possible to calculate the recommended optimal calculation path from the calculation nodes.

[0203] Therefore, according to the embodiment of the present disclosure, users can perform flexible multi-factor routing according to their needs, set calculation conditions, and obtain the best matching computing power node to meet various different computing power access requirements.

[0204] Among them, the electronic device may have a calculation evaluation module to realize the calculation function.

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

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

[0207] In some embodiments, the link attribute information includes the physical length of the link; referring to FIG. 5 , after determining the capacity map according to the capacity information and the geographical map ( S103 ), the method may further include S104E1 and S104E2 .

[0208] S104E1. Receive a detour information query request.

[0209] The detour information query request includes the link to be queried.

[0210] S104E2. Determine the detour information of the link to be queried based on the detour information query request and the transportation capacity map.

[0211] The detour information includes a detour coefficient, which represents the relationship between the actual delay of the link and the theoretical delay determined according to the physical length of the link.

[0212] As one method of an embodiment of the present disclosure, detour information of a link may also be calculated, including at least a detour coefficient, which represents the relationship between the actual delay and the theoretical delay of the link, such as the ratio of the actual delay to the theoretical delay.

[0213] The actual delay may be a measured value of the link delay.

[0214] The theoretical delay is calculated based on 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 it can be the actual delay of the link recorded during construction.

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

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

[0217] The optimal routing distance or configuration distance of the road network is the sum of the physical lengths of the links in the path.

[0218] Therefore, users can use the detour analysis data to view the relationship between the actual link delay and the theoretical delay of the entire network (of course, it can also include basic link information, delay, detour coefficient, remarks, optical layer links under electrical layer links, etc.), view the overall link situation, and quickly find the bottleneck location affecting transmission, so as to achieve early prevention and planning.

[0219] The electronic device may have a detour analysis module to implement a detour function.

[0220] Among them, the detour analysis module supports the selection of electrical layer links and displays the electrical layer link delay, as well as displays the optical layer routes and the measured delay values ​​of each optical layer OTS segment. It can also analyze the minimum delay value achievable based on the optical layer topology.

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

[0222] Therefore, the detour analysis module can display the delay detour coefficient results of the electrical layer links of the entire network.

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

[0224] The detour analysis module can perform the following tasks:

[0225] (1) The source node (Source ID) and sink node (Sink ID) of the link are obtained based on the link ID information input by the front end. Combined with the node ID list and service ID list in the memory during initialization, the service ID list information for detour analysis is obtained.

[0226] (2) Generate network elements and links on the GIS map based on the source and destination nodes, node types, and node coordinates of the link information. The detour coefficient information of the link is displayed by displaying the delay detour coefficient result of the electrical layer link, and the queried detour information is returned to the front end.

[0227] (3) For the selected electrical layer link, the link delay detour coefficient is calculated based on the optimal routing distance or configuration distance of the road network. The configuration distance is the shortest distance between GIS coordinates. Based on the service ID and the measured delay data stored in the memory during delay measurement, the current electrical layer link delay value of each service ID is obtained.

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

[0229] Current electrical layer link delay value (us) / (network optimal routing distance or configured distance (km)*5μs / km).

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

[0231] (5) For the selected electrical layer link, the electrical layer delay and the optical layer route and the delay measurement values ​​of each optical layer OTS segment are displayed simultaneously.

[0232] (6) If the link has multiple ODU services, the minimum value of them is taken as the detour and returned to the front end.

[0233] (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, the estimated delay is used.

[0234] (8) Select an electrical layer link on the GIS map to view the delay of the electrical layer link and the delay value of each optical layer span OTS of the optical layer route corresponding to the link; specify an electrical layer link with optical layer OLP (Optical Fiber Line Auto Switch Protection Equipment) protection to view the working and protection path delays of the electrical layer link corresponding to the optical layer; the working path is displayed in blue and the protection path is displayed in yellow. Moving the mouse over the optical link will display the link's head and tail port labels.

[0235] (9) Select the electrical layer link and insert a long optical fiber into the corresponding optical layer, which changes the optimal routing result of the optical layer. The network center recalculates the delay optimization path, analyzes the optical layer routing before and after the optical fiber is inserted, and displays it on the topology map; after the optical fiber is inserted, the original optimal optical layer routing is no longer the optimal routing. The network center recalculates the optimal routing and displays it on the cloud management platform.

[0236] (10) Identify the electrical layer links with large detour coefficients by sorting and displaying link information. Expand the optical layer links under the electrical layer links to view the overall link status and quickly find the bottleneck of the detour coefficient.

[0237] In the second aspect, referring to FIG2 , an embodiment of the present disclosure provides 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, any one of the capacity network display methods of the embodiment of the present disclosure is implemented.

[0238] In a third aspect, referring to FIG3 , an embodiment of the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements any one of the capacity network display methods of the embodiments of the present disclosure.

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

[0240] Those skilled in the art will appreciate that all or some of the steps, systems, and functional modules / units in the apparatus disclosed above may be implemented as software, firmware, hardware, or a suitable combination thereof.

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

[0242] 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 temporary medium). As is well known to those skilled 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 include, but are 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 disk storage; compact disc (CD-ROM), digital versatile disc (DVD) or other optical disc storage; magnetic cassettes, tapes, disk storage or other magnetic storage; any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0243] The present disclosure has disclosed example embodiments, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly indicated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, it will be understood by those skilled in the art that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A method for displaying a transport network, comprising: Obtain capacity information of the transport network; The transport network includes nodes and links connecting the nodes, and the transport information includes the geographical locations of the nodes and the topology of the links; Get geographic maps; A capacity map is determined based on the capacity information and the geographical map; the capacity map includes map nodes corresponding to the nodes and 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 the nodes to which they correspond, and the map links are located between the map nodes corresponding to the nodes connected by the links to which they correspond.

2. The method according to claim 1, wherein: After determining the capacity map according to the capacity information and the geographical map, the method further includes: Display at least part of the information of the capacity map; wherein the information displayed in the 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 transport capacity information also includes node attribute information of the node and link attribute information of the link; The capacity map also 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 resources, available computing power resources, and computing power resource utilization; 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, delay, and physical length.

5. The method according to claim 3, wherein: The link attribute information includes the delay of the link; after determining the capacity map according to the capacity information and the geographical map, further comprising: Receiving a capacity circle query request; the capacity circle query request includes a central node and a delay threshold; A capacity circle is determined according to the capacity circle query request and the capacity map; the capacity circle includes nodes within the circle and 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.

6. The method according to claim 5, wherein: Determining the capacity circle according to the capacity circle query request and the capacity map includes: Determine the central node as the current node, and determine other nodes as unprocessed nodes; Select a target node from the unprocessed nodes and delete the target node from the unprocessed nodes; the target node is an unprocessed node with the smallest delay of the corresponding link among all the unprocessed nodes directly connected to the current node through one of the links; Determine the shortest path delay between the target node and the central node, and update the current node to be the target node; In response to the unprocessed nodes still existing, returning to the step of selecting a target node from the unprocessed nodes; In response to the non-existence of the unprocessed node, nodes whose shortest path delay to the central node is less than the delay threshold are determined as in-circle nodes, and links between the in-circle nodes are determined as in-circle links.

7. The method according to claim 5, wherein: The capacity circle query request also includes additional conditions; The intra-circle nodes and the intra-circle links meet the additional conditions.

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

9. The method according to claim 3, wherein: After determining the capacity map according to the capacity information and the geographical map, the method further includes: receiving a calculation query request; the calculation query request includes a calculation condition; According to the calculation query request and the transport capacity map, a calculation node is determined; the calculation node satisfies the calculation condition.

10. The method according to claim 3, wherein: The link attribute information includes the physical length of the link; After determining the capacity map according to the capacity information and the geographical map, the method further includes: receiving a detour information query request; the detour information query request includes a link to be queried; Determine 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 represents 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 comprising 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, the method for displaying a capacity network as described in any one of claims 1 to 10 is implemented.

12. A computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method for displaying a capacity network as described in any one of claims 1 to 10 is implemented.

Images