Message field extension method, device, medium and equipment

Abstract

The application provides a message field extension method, a message field extension device, a computer readable storage medium and an electronic device, and relates to the technical field of communication. The method can be used for indicating the proxy forwarding capability of a target node for all adjacent nodes under the premise that a specified bit is used, further functionally limits a specific field in a second message, so that the specific field is used for indicating the proxy forwarding capability of the target node for part of the adjacent nodes, and functionally limits an extension data structure of the second message, so that the extension data structure is used for indicating proxy forwarding information, so as to realize the proxy forwarding for part of the adjacent nodes and guarantee normal traffic proxy forwarding under any condition.

Description

Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to a message field extension method, a message field extension device, a computer-readable storage medium, and an electronic device. Background Technology

[0002] Currently, in the Open Shortest Path First (OSPF) protocol, the PF bit (bit 0) in the Router Functional Capabilities (TLV) of the opaque Link State Advertisement (LSA) is defined to indicate whether a node has the ability to act as a proxy forwarder for all neighboring nodes.

[0003] However, PF bits can only represent two scenarios: proxy forwarding for all neighboring nodes, or proxy forwarding for no neighboring nodes. If a node only wants to proxy forward for some neighboring nodes and not others, it cannot be achieved using PF bits. Therefore, how to implement proxy forwarding for a subset of neighboring nodes based on OSPF has become a pressing problem to solve.

[0004] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this application, and therefore may include information that does not constitute related technology known to those skilled in the art. Summary of the Invention

[0005] The purpose of this application is to provide a message field extension method, a message field extension device, a computer-readable storage medium, and an electronic device. This method, while specifying bits to indicate the target node's proxy forwarding capability for all adjacent nodes, further limits the function of specific fields in the second message so that these specific fields indicate the target node's proxy forwarding capability for some adjacent nodes. Furthermore, it limits the function of the extended data structure of the second message so that the extended data structure indicates proxy forwarding information, thereby enabling proxy forwarding for some adjacent nodes and ensuring normal traffic proxy forwarding under any circumstances.

[0006] Other features and advantages of this application will become apparent from the following detailed description, or may be learned in part from practice of this application.

[0007] According to one aspect of this application, a message field expansion method is provided, comprising:

[0008] Functionally restrict specific bits in the first message so that the specified bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes;

[0009] Functional limitations are imposed on specific fields in the second message so that these fields can be used to indicate the target node's proxy forwarding capability for some adjacent nodes; wherein the first message and the second message correspond to different structure types;

[0010] The extended data structure of the second message is functionally limited so that it can be used to instruct the agent to forward information.

[0011] According to one aspect of this application, a message field extension device is provided, comprising:

[0012] The first message extension unit is used to functionally limit specific bits in the first message so that the specified bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes.

[0013] The second message extension unit is used to functionally limit specific fields in the second message so that the specific fields can be used to indicate the target node's proxy forwarding capability for some adjacent nodes; wherein the first message and the second message correspond to different structure types;

[0014] The data structure extension unit is used to functionally limit the extended data structure of the second message so that the extended data structure can be used to indicate the agent forwarding information.

[0015] According to one aspect of this application, a computer program product or computer program is provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the steps provided in the various optional implementations described above.

[0016] According to one aspect of this application, a computer-readable storage medium is provided, on which a computer program is stored, wherein the computer program, when executed by a processor, implements the steps of any of the above.

[0017] According to one aspect of this application, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the steps of any of the above via executing the executable instructions.

[0018] The exemplary embodiments of this application may have some or all of the following beneficial effects:

[0019] In the message field extension method provided in an example embodiment of this application, under the premise that a specified bit is used to indicate the proxy forwarding capability of the target node for all adjacent nodes, a specific field in the second message can be further functionally limited so that the specific field is used to indicate the proxy forwarding capability of the target node for some adjacent nodes. Furthermore, the extended data structure of the second message can be functionally limited so that the extended data structure is used to indicate proxy forwarding information, thereby realizing proxy forwarding for some adjacent nodes and ensuring normal traffic proxy forwarding under any circumstances.

[0020] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0021] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application. It is obvious that the drawings described below are merely some embodiments of this application, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0022] Figure 1 A flowchart illustrating a message field expansion method according to an embodiment of this application is shown schematically;

[0023] Figure 2 A schematic diagram of a first message according to an embodiment of this application is shown;

[0024] Figure 3 A schematic diagram of a second message according to an embodiment of this application is shown;

[0025] Figure 4 A flowchart illustrating a message field expansion method according to another embodiment of this application is shown schematically;

[0026] Figure 5 This illustration schematically shows a structural diagram of a message field extension device according to an embodiment of the present application;

[0027] Figure 6 The schematic diagram illustrates the structure of a computer system suitable for implementing the electronic devices of the present application. Detailed Implementation

[0028] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided to make this application more comprehensive and complete, and to fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a full understanding of the embodiments of this application. However, those skilled in the art will recognize that the technical solutions of this application can be practiced with one or more of the specific details omitted, or other methods, components, apparatus, steps, etc., can be employed. In other instances, well-known technical solutions are not shown or described in detail to avoid obscuring various aspects of this application.

[0029] Please see Figure 1 , Figure 1 A schematic flowchart illustrating a message field expansion method according to an embodiment of this application is shown. Figure 1 As shown, the message field expansion method specifically includes the following steps.

[0030] Step S110: Functionally restrict specific bits in the first message so that the specified bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes.

[0031] Step S120: Functionally restrict a specific field in the second message so that the specific field is used to indicate the target node's proxy forwarding capability for some adjacent nodes; wherein the first message and the second message correspond to different structure types.

[0032] Step S130: Functionally limit the extended data structure of the second message so that the extended data structure is used to indicate the agent forwarding information.

[0033] Implementation Figure 1 The method shown can further limit the function of specific fields in the second message, under the premise that the specified bits are used to indicate the proxy forwarding capability of the target node for all neighboring nodes, so that the specific fields are used to indicate the proxy forwarding capability of the target node for some neighboring nodes. Furthermore, the extended data structure of the second message is functionally limited so that the extended data structure is used to indicate proxy forwarding information, so as to realize proxy forwarding for some neighboring nodes and ensure normal traffic proxy forwarding under any circumstances.

[0034] The steps described above in this example implementation will now be explained in more detail.

[0035] In step S110, specific bits in the first message are functionally limited so that the specified bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes.

[0036] Specifically, the first message (Router Functional Capabilities TLV) is used to transmit information during communication. In network protocols, TLV (Type-Length-Value) is a common data structure used to transmit various types of information in data packets. Router Functional Capabilities TLV refers to the router's functional capabilities TLV. It is a type of TLV used in link-state routing protocols (such as OSPF and IS-IS) to transmit information about the router's functional capabilities, typically containing one or more bits to represent a specific function or capability of the router.

[0037] In OSPF and IS-IS, the Router Functional Capabilities TLV is used to broadcast and exchange router functional capability information so that other routers in the network can understand and adapt to these capabilities. These capabilities can include basic router functions (e.g., router type, routing algorithm, network type, etc.) and router-specific capabilities (e.g., support for specific protocol extensions, security functions, traffic engineering capabilities, etc.). By transmitting this capability information in the Router Functional Capabilities TLV, routers can communicate with each other in the network and determine each other's functions and capabilities, contributing to the adaptability and flexibility of routing protocols to meet different network environments and needs.

[0038] Please refer to details. Figure 2 , Figure 2 A schematic diagram of a first message according to an embodiment of this application is shown. Figure 2 As shown, the first message (Router Functional Capabilities TLV) may include a Type field to represent the TLV type, a Length field to represent the TLV length, and a FunctionalCapabilities field to represent the router's functions. In order for the first message to be used to indicate the target node's proxy forwarding capability for all neighboring nodes, specific bits of the Functional Capabilities field PF in the first message can be functionally limited.

[0039] Furthermore, the target node's proxy forwarding capability across all neighboring nodes refers to the proxy server forwarding requests from users within the internal network to the internet. The proxy server can determine whether the requested information is cached before retrieving it from the server. If the requested information is cached, the proxy server can directly send it to the user.

[0040] As an optional embodiment, specific bits in the first message are functionally limited so that the designated bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes. This includes: functionally limiting specific bits in the first message based on the link state advertisement type in the Open Shortest Path First (OSF) protocol, so that the designated bits are used to indicate the target node's proxy forwarding capability for all adjacent nodes. This allows for field expansion of the first message, enabling it to indicate whether the target node has proxy forwarding capability for all adjacent nodes. This allows other nodes to promptly determine the target node's proxy forwarding capability, which is beneficial for improving traffic proxy forwarding efficiency.

[0041] Specifically, based on the Opaque LSA type of Link State Advertisement in the Open Shortest Path First (OSPF) protocol, specific bits (PF) in the first packet can be functionally limited so that the designated bits are used to indicate the proxy forwarding capability of the destination node (Node P) for all its neighboring nodes. Opaque LSA is a special LSA type in OSPF that allows for extended protocol functionality and the transmission of non-standardized information. LSA stands for Link State Advertisement, and LSAs are data packets used in the Open Shortest Path First protocol to exchange routing information.

[0042] Among them, Open Shortest Path First (OSPF) is an Interior Gateway Protocol (IGP). Specifically, OSPF is a dynamic routing protocol used for routing within an Autonomous System (AS); where AS is an independent network domain composed of one or more routers sharing the same routing policy; IGP is a network protocol used for routing within an Autonomous System, and common IGPs include OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System).

[0043] Furthermore, OSPF can construct a network topology map by exchanging Link State Information (LSA), calculate the shortest path based on Dijkstra's algorithm to determine the transmission path of data packets, and maintain a Link State Database (LSDB) to store network topology information. Dijkstra's algorithm is an algorithm for solving the shortest path problem in a graph. The algorithm's goal is to find the shortest path from a vertex (i.e., the source vertex) to all other vertices in the graph. In applications, the shortest path can be the shortest distance between two vertices, or in a weighted graph, the path with the minimum sum of path weights.

[0044] Furthermore, OSPF supports various types of routers, including Border Routers, Internal Routers, and Area Border Routers. These routers exchange information according to the protocol rules defined by OSPF to determine the optimal path and forwarding decisions. OSPF's key features include: public accessibility; a hierarchical structure for organizing and managing large networks, dividing the network into different areas to reduce the size of the link-state database; rapid detection and correction of routing faults; fast convergence; and the ability to use variable-length subnet masks for more flexible network partitioning.

[0045] As an optional embodiment, specific bits in the first message are functionally limited to indicate the target node's proxy forwarding capability for all neighboring nodes. This includes: limiting the function of specific bits in the first message to indicate whether the target node has the proxy forwarding capability for all neighboring nodes; when the specific bit is 1, it is determined that the target node has the proxy forwarding capability for all neighboring nodes; when the specific bit is 0, it is determined that the target node does not have the proxy forwarding capability for all neighboring nodes. This allows the first message to indicate whether the target node has the proxy forwarding capability for all neighboring nodes. In scenarios where there are faulty nodes, this helps the node receiving the first message understand the target node's proxy forwarding capability, thereby ensuring the normal traffic forwarding process.

[0046] Specifically, if the value of the specific bit PF stored in the first message is 1, it means that node P has the ability to perform segment routing (SR) proxy forwarding to all neighboring nodes. If the value of the specific bit PF stored in the first message is 0, it means that node P does not have the ability to perform segment routing (SR) proxy forwarding to all neighboring nodes. However, this does not mean that node P does not have the ability to perform segment routing proxy forwarding to some neighboring nodes. Therefore, it is also necessary to limit the function of specific fields in the second message.

[0047] The embodiments of this application can be applied to traffic engineering techniques that combine segment routing and multiprotocol label switching (SR-MPLS TE). SR-MPLS TE is used to optimize traffic transmission and path selection in the network; where MPLS stands for Multiprotocol Label Switching and TE stands for Traffic Engineering.

[0048] In step S120, specific fields in the second message are functionally limited so that the specific fields are used to indicate the target node's proxy forwarding capability for some adjacent nodes; wherein the first message and the second message correspond to different structure types.

[0049] Specifically, a specific field in the second message (OSPF SID / Label Binding TLV) can be the designated Flags field. In the OSPF SID / Label Binding TLV, the Flags field is used to indicate bit fields of specific attributes or flags.

[0050] The difference between the second message (OSPF SID / Label Binding TLV) and the first message (Router FunctionalCapabilities TLV) is that they correspond to different TLV types in the OSPF protocol. Therefore, the second message and the first message are used to transmit different information.

[0051] Please refer to details. Figure 3 , Figure 3 A schematic diagram of a second message according to an embodiment of this application is shown. Figure 3As shown, the second message (OSPF SID / Label Binding TLV) may include a Type (TBD2) field to represent the TLV type, a Length field to represent the TLV length, a Flags field to represent the TLV flags, a BindingSID Type field to represent the binding SID type and SID type, a Binding SID Sub-TLV / value field to represent the sub-TLV / value of the bound SID, and a SID Sub-TLVs / values ​​field to represent the sub-TLV / value of the SID. In order to enable the first message to be used to indicate the proxy forwarding capability of the target node for all neighboring nodes, a specific bit P in the Flags field of the second message can be functionally limited.

[0052] Specifically, the Router Functional Capabilities TLV, also known as the Router Functional Capabilities TLV, conveys information about the router's functional capabilities, such as supported router types, routing algorithms, and network types. The OSPF SID / Label Binding TLV, also known as the OSPF SID / Label Binding TLV, conveys information related to Segment Routing, including the bound segment identifier (SID) and associated label information. It specifies the association between paths and services and the SID. The Binding SID (Segment Identifier) ​​is a concept used to represent segment identifiers in segment routing.

[0053] In segment routing, path selection and forwarding decisions in the network are based on defined segments. A segment is a path within the network, which can be a link, a node, or a combination of service chains. A Binding SID is a specific type of Segment Identifier that associates a particular service or path with a Segment Identifier; the SID serves as a unique identifier for different segments within the network in segment routing. In segment routing, the Binding SID is used to associate a specific path or service with an identifier so that traffic engineering and forwarding decisions can be performed on the router.

[0054] When a router receives a data packet with a Binding SID, it can determine the next path or service based on the value of the Binding SID. By associating paths or services with Binding SIDs, segment routing enables flexible control and guidance of traffic. The use of Binding SIDs allows segment routing to flexibly define and deploy specific paths and services, while providing a simplified forwarding mechanism.

[0055] Segment routing, as described above, is a network programming and forwarding technique used to specify the path of data packets in an IP network. Based on the concept of source routing, it defines the forwarding path of data packets by specifying a series of segment identifiers (SIDs) in the packet header. The main purpose of segment routing is to define paths in a network as a series of segments; each segment can be a node, a link, or a service chain in the network. By adding a set of segment identifiers to the packet header, data packets can be forwarded according to the specified path. Furthermore, segment routing is widely used in various network scenarios, including data center networks, wide area networks (WANs), and cloud service providers.

[0056] As an optional embodiment, a specific field in the second message is functionally limited so that the specific field is used to indicate the target node's proxy forwarding capability for some neighboring nodes. This includes: limiting the function of the bits in the specific field in the second message to indicate whether the target node has the proxy forwarding capability for some neighboring nodes; when the specific bit is 0, if the bit is 1, it is determined that the target node has the proxy forwarding capability for some neighboring nodes; when the specific bit is 0, if the bit is 0, it is determined that the target node does not have the proxy forwarding capability for some neighboring nodes. This allows the second message to indicate whether the target node has the proxy forwarding capability for some neighboring nodes. When the target node does not have the proxy forwarding capability for all neighboring nodes, it can further determine whether it has the proxy forwarding capability for some neighboring nodes, thereby improving the accuracy of the proxy forwarding capability determination.

[0057] Specifically, if a specific bit P in the second message (OSPF SID / Label Binding TLV) is represented as P-Flag = 1, it indicates that node P has the ability to perform segment routing (SR) proxy forwarding to some neighboring nodes. If a specific bit P in the first message is represented as P-Flag = 0, it indicates that node P does not have the ability to perform segment routing (SR) proxy forwarding to some neighboring nodes.

[0058] Among them, "partially adjacent nodes" is relative to "all adjacent nodes". A partially adjacent node refers to one or more adjacent nodes, and the number of partially adjacent nodes is less than the number of all adjacent nodes.

[0059] In step S130, the extended data structure of the second message is functionally limited so that the extended data structure is used to indicate proxy forwarding information.

[0060] Continue reading Figure 3 The extended data structure of the second message (OSPF SID / Label Binding TLV) refers to the data structure for the Binding SID Sub-TLV / value field. That is, the Binding SID Sub-TLV / value field can be extended to a data structure containing the following fields: Type field, Length field, Flags field, RESERVED field, Range field, Prefix Length field, Prefix field for carrying information about the target node, Prefix (continued, variable) field, and SubTLV (variable) field.

[0061] As an optional embodiment, the extended data structure of the second message is functionally limited to indicate proxy forwarding information. This includes: functionally limiting the first field in the extended data structure of the second message to carry information about the target node; and functionally limiting the second field in the extended data structure of the second message to carry information about the adjacent nodes being proxied. This allows for the recording of proxy forwarding information, enabling the receiving node to determine its proxy forwarding range.

[0062] Specifically, the function of the first field Prefix in the extended data structure Binding SID Sub-TLV / value of the second message can be restricted so that the first field Prefix is ​​used to carry information about the target node. The function of the second field SubTLV(variable) in the extended data structure Binding SID Sub-TLV / value of the second message can also be restricted so that the second field SubTLV(variable) is used to carry information about the neighboring nodes being forwarded by the proxy.

[0063] As an optional embodiment, the method further includes broadcasting the data packet containing the first and second messages to each node. This can be used to ensure the normal proxy forwarding process.

[0064] Specifically, each node refers to a node in the network that can be forwarded by a proxy.

[0065] As an optional implementation, the target node is used to perform traffic proxy forwarding based on the proxy forwarding information. This ensures the normal proxy forwarding process.

[0066] Specifically, traffic can be forwarded by proxy based on the proxy forwarding capability indicated by the proxy forwarding information (i.e., forwarding by all nodes or forwarding by some nodes).

[0067] Please see Figure 4 , Figure 4 A flowchart illustrating a message field expansion method according to another embodiment of this application is shown schematically. Figure 4 As shown, the message field expansion method includes steps S400 to S440.

[0068] Step S400: Based on the link state advertisement type in the Open Shortest Path First (OSF) protocol, the function of a specific bit in the first message is limited to indicating whether the target node has the ability to forward proxies to all neighboring nodes. When the specific bit is 1, it is determined that the target node has the ability to forward proxies to all neighboring nodes; when the specific bit is 0, it is determined that the target node does not have the ability to forward proxies to all neighboring nodes.

[0069] Step S410: The function of the bits in a specific field of the second message is limited to indicating whether the target node has the ability to forward proxies to some of its neighboring nodes. When the specific bit is 0, if the bit is 1, it is determined that the target node has the ability to forward proxies to some of its neighboring nodes; when the specific bit is 0, if the bit is 0, it is determined that the target node does not have the ability to forward proxies to some of its neighboring nodes.

[0070] Step S420: Functionally limit the first field in the extended data structure of the second message so that the first field is used to carry information about the target node.

[0071] Step S430: Functionally restrict the second field in the extended data structure of the second message so that the second field can be used to carry information about the neighboring nodes that are being forwarded by the proxy.

[0072] Step S440: Broadcast the data packet containing the first message and the second message to each node.

[0073] It should be noted that steps S400 to S440 are related to... Figure 1 For the specific implementation details of steps S400 to S440, please refer to the examples shown. Figure 1 The steps and their embodiments shown are not repeated here.

[0074] It is evident that implementation Figure 4 The method shown can further limit the function of specific fields in the second message, under the premise that the specified bits are used to indicate the proxy forwarding capability of the target node for all neighboring nodes, so that the specific fields are used to indicate the proxy forwarding capability of the target node for some neighboring nodes. Furthermore, the extended data structure of the second message is functionally limited so that the extended data structure is used to indicate proxy forwarding information, so as to realize proxy forwarding for some neighboring nodes and ensure normal traffic proxy forwarding under any circumstances.

[0075] Please see Figure 5 , Figure 5 The schematic diagram illustrates the structure of a message field extension device according to an embodiment of this application. Figure 5 As shown, the message field extension device 500 may include the following units.

[0076] The first message extension unit 501 is used to limit the function of specific bits in the first message so that the specified bits are used to indicate the proxy forwarding capability of the target node for all adjacent nodes.

[0077] The second message extension unit 502 is used to functionally limit specific fields in the second message so that the specific fields are used to indicate the proxy forwarding capability of the target node for some adjacent nodes; wherein the first message and the second message correspond to different structure types;

[0078] The data structure extension unit 503 is used to functionally limit the extended data structure of the second message so that the extended data structure can be used to indicate the agent forwarding information.

[0079] It is evident that implementation Figure 5 The apparatus shown can, under the premise that a specified bit is used to indicate the proxy forwarding capability of the target node for all adjacent nodes, further limit the function of a specific field in the second message so that the specific field is used to indicate the proxy forwarding capability of the target node for some adjacent nodes. Furthermore, it limits the function of the extended data structure of the second message so that the extended data structure is used to indicate proxy forwarding information, thereby realizing proxy forwarding for some adjacent nodes and ensuring normal traffic proxy forwarding under any circumstances.

[0080] As an optional embodiment, the first message extension unit 501 performs functional limitation on specific bits in the first message so that the specified bits are used to indicate the proxy forwarding capability of the target node for all adjacent nodes, including: performing functional limitation on specific bits in the first message based on the link state announcement type in the Open Shortest Path First protocol so that the specified bits are used to indicate the proxy forwarding capability of the target node for all adjacent nodes.

[0081] As can be seen, implementing this optional embodiment can expand the fields of the first message so that it can be used to indicate whether the target node has the ability to forward traffic to all adjacent nodes, so that other nodes can determine the target node's ability to forward traffic in a timely manner, which is beneficial to improving the efficiency of traffic forwarding.

[0082] As an optional embodiment, the first message extension unit 501 performs functional limitations on specific bits in the first message so that the specified bits are used to indicate the proxy forwarding capability of the target node for all neighboring nodes. This includes: limiting the function of the specific bits in the first message to indicate whether the target node has the proxy forwarding capability for all neighboring nodes; when the specific bit is 1, determining that the target node has the proxy forwarding capability for all neighboring nodes; when the specific bit is 0, determining that the target node does not have the proxy forwarding capability for all neighboring nodes.

[0083] As can be seen, implementing this optional embodiment allows the first message to indicate whether the target node has the ability to forward traffic to all adjacent nodes. In a scenario where there are faulty nodes, this helps the node receiving the first message to understand the target node's forwarding capabilities, thereby ensuring the normal traffic forwarding process.

[0084] As an optional embodiment, the second message extension unit 502 functionally limits a specific field in the second message so that the specific field is used to indicate the proxy forwarding capability of the target node for some adjacent nodes. This includes: limiting the function of the bits of the specific field in the second message to indicate whether the target node has the proxy forwarding capability for some adjacent nodes; when the specific bit is 0, when the bit is 1, it is determined that the target node has the proxy forwarding capability for some adjacent nodes; when the specific bit is 0, when the bit is 0, it is determined that the target node does not have the proxy forwarding capability for some adjacent nodes.

[0085] As can be seen, by implementing this optional embodiment, the second message can indicate whether the target node has the ability to forward proxies to some of its neighboring nodes. When the target node does not have the ability to forward proxies to all its neighboring nodes, it can further determine whether it has the ability to forward proxies to some of its neighboring nodes, thereby improving the accuracy of the determination of the forwarding ability.

[0086] As an optional embodiment, the data structure extension unit 503 functionally limits the extended data structure of the second message so that the extended data structure is used to indicate proxy forwarding information, including: functionally limiting the first field in the extended data structure of the second message so that the first field is used to carry information of the target node; and functionally limiting the second field in the extended data structure of the second message so that the second field is used to carry information of the adjacent node being forwarded by the proxy.

[0087] As can be seen, implementing this optional embodiment can enable the recording of information related to proxy forwarding, thereby facilitating the determination of the proxy forwarding range by the node receiving the message.

[0088] As an optional embodiment, it also includes:

[0089] The broadcast unit is used to broadcast data packets containing the first and second messages to each node.

[0090] As can be seen, implementing this optional embodiment can be used to ensure the normal proxy forwarding process.

[0091] As an optional embodiment, the target node is used to perform traffic proxy forwarding based on proxy forwarding information.

[0092] As can be seen, implementing this optional embodiment can ensure the normal proxy forwarding process.

[0093] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to the embodiments of this application, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0094] Since the functional modules of the message field extension device in the example embodiments of this application correspond to the steps of the example embodiments of the message field extension method described above, for details not disclosed in the device embodiments of this application, please refer to the embodiments of the message field extension method described above in this application.

[0095] Please see Figure 6 , Figure 6A schematic diagram of the structure of a computer system suitable for implementing the electronic device of the present application is shown.

[0096] It should be noted that, Figure 6 The computer system 600 of the electronic device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0097] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes based on programs stored in read-only memory (ROM) 602 or programs loaded from storage section 608 into random access memory (RAM) 603. The RAM 603 also stores various programs and data required for system operation. The CPU 601, ROM 602, and RAM 603 are interconnected via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0098] The following components are connected to I / O interface 605: an input section 606 including a keyboard, mouse, etc.; an output section 607 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to I / O interface 605 as needed. A removable medium 611, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 610 as needed so that computer programs read from it can be installed into storage section 608 as needed.

[0099] Specifically, according to embodiments of this application, the processes described below with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 609, and / or installed from removable medium 611. When the computer program is executed by central processing unit (CPU) 601, it performs the various functions defined in the methods and apparatus of this application.

[0100] In another aspect, this application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiments; or it may exist independently and not assembled into the electronic device. The computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to implement the methods described in the above embodiments.

[0101] It should be noted that the computer-readable medium shown in this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media can also be any computer-readable medium other than computer-readable storage media, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0102] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0103] The units described in the embodiments of this application can be implemented in software or hardware, and the described units can also be located in a processor. The names of these units do not necessarily limit the specific unit itself.

[0104] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this application are indicated by the claims.

Claims

1. A method for extending message fields, characterized in that, include: The function of a specific bit in the first message is limited to indicating whether the target node has the ability to forward messages to all adjacent nodes. When the specific bit is 1, it is determined that the target node has the ability to forward proxies to all neighboring nodes; when the specific bit is 0, it is determined that the target node does not have the ability to forward proxies to all neighboring nodes. The function of a specific field bit in the second message is limited to indicating whether the target node has the ability to forward proxies to some adjacent nodes; when the specific bit is 0, and the bit is 1, it is determined that the target node has the ability to forward proxies to some adjacent nodes; when the specific bit is 0, and the bit is 0, it is determined that the target node does not have the ability to forward proxies to some adjacent nodes; wherein, the first message and the second message correspond to different structure types; The extended data structure of the second message is functionally limited so that the extended data structure is used to indicate proxy forwarding information.

2. The method according to claim 1, characterized in that, The extended data structure of the second message is functionally limited so that it is used to indicate proxy forwarding information, including: The function of the first field in the extended data structure of the second message is limited so that the first field is used to carry information about the target node; The function of the second field in the extended data structure of the second message is limited so that the second field is used to carry information about the neighboring nodes that are being forwarded by the proxy.

3. The method according to claim 1, characterized in that, Also includes: The data packet containing the first message and the second message is broadcast to each node.

4. The method according to claim 1, characterized in that, in: The target node is used to perform traffic proxy forwarding based on the proxy forwarding information.

5. The method according to claim 1, characterized in that, The function of specific bits in the first message is limited to indicating whether the target node has the ability to forward data to all neighboring nodes, including: Based on the link state announcement type in the Open Shortest Path First protocol, specific bits in the first message are functionally limited so that the specific bits are used to indicate whether the target node has the ability to forward messages to all adjacent nodes.

6. A message field extension device, characterized in that, include: The first message extension unit is used to limit the function of a specific bit in the first message to indicate whether the target node has the proxy forwarding capability for all adjacent nodes; when the specific bit is 1, it is determined that the target node has the proxy forwarding capability for all adjacent nodes; when the specific bit is 0, it is determined that the target node does not have the proxy forwarding capability for all adjacent nodes. The second message extension unit is used to limit the function of a bit in a specific field of the second message to indicate whether the target node has the ability to forward proxies to some adjacent nodes; when the specific bit is 0, when the bit is 1, it is determined that the target node has the ability to forward proxies to some adjacent nodes; when the specific bit is 0, when the bit is 0, it is determined that the target node does not have the ability to forward proxies to some adjacent nodes; wherein the first message and the second message correspond to different structure types; A data structure extension unit is used to functionally limit the extended data structure of the second message so that the extended data structure is used to indicate proxy forwarding information.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it performs the function defined by any one of the methods in claims 1-5.

8. An electronic device, characterized in that, include: processor; as well as Memory for storing the executable instructions of the processor; The processor is configured to perform the function defined by any one of the methods of claims 1-5 by executing the executable instructions.

Images