CN113824633B - Method for releasing route in campus network and network equipment - Google Patents
Method for releasing route in campus network and network equipment Download PDFInfo
- Publication number
- CN113824633B CN113824633B CN202010566336.XA CN202010566336A CN113824633B CN 113824633 B CN113824633 B CN 113824633B CN 202010566336 A CN202010566336 A CN 202010566336A CN 113824633 B CN113824633 B CN 113824633B
- Authority
- CN
- China
- Prior art keywords
- network
- neighbor
- network device
- route
- equipment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
- H04L45/245—Link aggregation, e.g. trunking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/06—Deflection routing, e.g. hot-potato routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A method for issuing a route in a campus network and a network device are provided, which relate to the technical field of communication. The method comprises the following steps: the network equipment issues a convergence route to the neighbor equipment of the upper layer connected with the network equipment; issuing a default route to a neighbor device of a next hierarchy connected to the network device; wherein the hierarchy indicates the location of each device in the campus network in the network topology; a converged route is an aggregation of detailed routes received by a network device from a neighbor device of the next level connected to the network device; and the default route indicates that the neighbor equipment of the next level forwards the message to the specified address corresponding to the default route when the route corresponding to the destination address is not successfully acquired. The network device issues the aggregation route to the neighbor device of the previous layer and issues the default route to the neighbor device of the next layer based on the layer of the network device in the campus network, so that the network device issues different routes to the neighbor devices of different layers, and the route issuing number of the network device in the campus network is reduced.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method for issuing a route in a campus network and a network device.
Background
Usually, the network device in the campus network is configured with a link state protocol so that the network device in the campus can learn the routes issued by other network devices in the campus network based on the link state protocol, determine a route forwarding table, and direct the forwarding of the packet. However, as the scale of the campus network is enlarged, the network topology is also changed, the route information to be learned by the network devices is increased, and because the performance of different network devices in the campus network is different, and the performance of some network devices is lower, the route information issued by the network devices in the campus network cannot be learned. Therefore, the forwarding of messages in the campus network is affected.
Disclosure of Invention
Based on the above, the present application provides a method for issuing a route in a campus network and a network device, which reduce the number of issued routes of the network device in the campus network without affecting message forwarding.
In a first aspect, the present application provides a method for issuing a route in a campus network, in which a network device issues a converged route to a neighboring device of a previous hierarchy connected to the network device; and issuing a default route to the neighbor device of the next level connected with the network device; wherein the hierarchy indicates the location of each device in the campus network in the network topology; a converged route is an aggregation of detailed routes received by a network device from a neighbor device of the next level connected to the network device; and the default route indicates that the neighbor equipment of the next level forwards the message to the designated address corresponding to the default route when the route corresponding to the destination address is not successfully acquired.
In the method, the network equipment issues the aggregation route to the neighbor equipment of the previous level connected with the network equipment, and sends the default route to the neighbor equipment of the next level connected with the network equipment, so that the condition that the network equipment in the campus network learns detailed routes issued by all the levels of the network equipment in the campus network is avoided, the network equipment only needs to learn the route information issued by the network equipment of the adjacent level, and the message can be forwarded in the whole network.
In one possible implementation, the network device issues detailed routes and aggregated routes of the network device to neighbor devices of the same hierarchy connected to the network device.
By the method, the network equipment can issue the detail route of the network equipment and the aggregated route after the aggregation of the detail routes of the next-level neighbor equipment to the neighbor equipment of the same level, so that the neighbor equipment of the same level can forward the message, and the neighbor equipment of the same level can forward the message to the neighbor equipment of the next level.
In a possible implementation manner, the network device acquires a message sent by the neighbor device; wherein, the message IS a message of an Open Shortest Path First (OSPF) protocol or a message of an intermediate system-intermediate system (IS-IS) protocol; the message carries a field for indicating the hierarchy of the neighbor device; and acquiring the hierarchy of the neighbor device according to the field for indicating the device hierarchy of the neighbor device in the message.
The network equipment can acquire the hierarchy to which the neighbor equipment belongs according to the message information sent by the neighbor equipment, so that the network equipment can send corresponding routing information to the neighbor equipment according to the hierarchy information of the neighbor equipment, and the number of routes issued by the network equipment is reduced.
In one possible implementation, the network device stores a default route issued by a neighbor device of an upper hierarchy connected to the network device in a first Link State Database (LSDB); storing detailed routes issued by neighbor devices of a next hierarchy connected with the network device in a second LSDB; detail routes issued by neighbor devices of the same hierarchy connected to the network device are stored in the first LSDB.
The routing information issued by the neighbor device and received by the network device is stored in the LSDB, so that the network device can determine the forwarding path of the message according to the routing information.
In a second aspect, the present application provides a network device, comprising: a processing unit; the processing unit is used for issuing a convergence route to a neighbor device of a previous level connected with the network device; and for issuing a default route to a neighbor device of a next hierarchy connected to the network device; wherein the hierarchy indicates the location of each device in the campus network in the network topology; a converged route is an aggregation of detailed routes received by a network device from a neighbor device of the next level connected to the network device; and when the neighbor device of the next level does not successfully acquire the route corresponding to the destination address, forwarding the message to the specified address corresponding to the default route.
In a third aspect, the present application provides a communication apparatus, comprising: a processor and a memory;
the memory stores a computer program; the processor is configured to execute the computer program stored in the memory to cause the method of any of the first aspect to be performed.
In a fourth aspect, the present application provides a communication apparatus comprising: a processor and an interface circuit; the interface circuit is used for receiving code instructions and transmitting the code instructions to the processor; the processor is configured to execute the code instructions to perform any of the aspects of the first aspect.
In a fifth aspect, the present application provides a computer-readable storage medium, in which computer-readable instructions are stored, and when the computer-readable instructions are read and executed by a computer, the computer is enabled to execute any one of the above-mentioned aspects.
In a sixth aspect, the present application provides a computer program product, which, when read and executed by a computer, causes the computer to perform the method according to any one of the above first aspects.
For technical effects that can be achieved by the second aspect to the sixth aspect, please refer to the description of the technical effects that can be achieved by the corresponding possible design scheme in the first aspect, and the detailed description is omitted here.
Drawings
Figure 1 shows a schematic diagram of the architecture of a campus network;
fig. 2 is a flowchart illustrating a route distribution method in a campus network according to an embodiment of the present application;
figure 3 shows a schematic diagram of routing distribution in a campus network according to an embodiment of the present application;
figure 4 shows a schematic diagram of routing distribution in a campus network according to an embodiment of the present application;
fig. 5 is a schematic diagram illustrating routing distribution in a campus network according to an embodiment of the present application;
fig. 6 shows a schematic structural diagram of a network device provided in an embodiment of the present application;
fig. 7 is a schematic structural diagram of a communication device provided in an embodiment of the present application;
fig. 8 shows a schematic structural diagram of a communication device provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clear, the technical solutions in the embodiments of the present application will be described in detail below with reference to the drawings in the embodiments of the present application.
The campus network mainly includes a terminal layer, an access layer, a convergence layer, and a core layer, as shown in fig. 1, where the terminal layer includes a terminal device accessing the campus network, such as: smart terminals, cell phones, personal Computers (PCs), printers, and the like. The access layer provides a campus network access function for the terminal device, and is the boundary of the campus network. The access layer comprises access equipment which can be in communication connection with the terminal equipment. The access device is connected with the network device of the convergence layer through an interface. The convergence layer connects the access layer and the core layer, and includes a convergence device. The core layer is the backbone area of the campus network and may be connected to the convergence layer and other components of the campus network (if any). Other components of campus networks are, for example, data centers. The core layer may be an egress of the campus network, the core layer including a core device.
In addition, the network device of the core layer is connected to a network (Internet or wide area network, WAN)) outside the campus through the network device of the exit area, so as to implement interaction of data information, where the network device of each layer in the campus network may be a switch or a router, and is not limited specifically herein.
As described in the background art, in order to forward a packet, a network device in a campus network generally needs to learn routing information issued by all network devices in the campus network, and thus a large amount of storage space of the network device is occupied. In order to avoid that the network device learns the routing of the network device of the whole network, the network device is divided into a plurality of areas, for example, when the network device configured with the OSPF protocol is divided into areas, the interface of the device can be added into a backbone area or a non-backbone area, wherein, the area 0 is the backbone area, the areas 2 and 3 are non-backbone areas, the LSDB of the network device of the area 0 carries the routing issued by all the network devices in the campus network, the areas 2 and 3 are non-backbone areas, and the LSDB of the network device only carries the routing issued by the network device of the area directly connected with the area, so the communication between the areas 2 and 3 cannot be directly carried out, and the communication can be carried out by the forwarding of the network device in the area 0.
Therefore, it can be known that the network devices in different areas only need to learn the routes issued by the network devices in the areas directly connected with the areas to which the network devices belong, and do not need to learn the routes of the whole network, so that the route learning amount of the network devices is reduced. However, there may be hundreds of interfaces of the network device, and adding the interfaces of the device to the corresponding areas one by one is time-consuming and labor-consuming, and may also be in error. In addition, the network device partition configuration also cannot reflect the actual network topology level of the network device, and cannot meet the actual topology requirement of the network device.
Based on the above, the present application provides a method for issuing a route in a campus network, which reduces the number of routes issued by network devices in the campus network without affecting message forwarding, and also can embody the actual topology level of the network devices.
It should be understood that, in the embodiment of the present application, the network device needs to support the function of forwarding and publishing a route, the network device may be a router or a three-layer switch, which is not specifically limited herein, and all network devices that meet the requirement are applicable to the present application. In this application, the network device may include: at least one of a core switch, an aggregation switch, and an access switch.
The neighbor device is also a device directly connected to the network device, such as: the network equipment is a core switch, the equipment directly connected with the core switch is a convergence switch, the convergence switch is a neighbor equipment of the core switch, and if the equipment directly connected with the core switch also comprises the convergence switch, the convergence switch is also a neighbor equipment of the core switch.
The hierarchy is used for indicating the position of the network equipment in the campus network, and the hierarchy can be identified after being coded by numbers/letters, such as: a core layer is represented by L1, a convergence layer is represented by L2, an access layer is represented by L3, and a next layer of the access layer is represented by L4, wherein the network device of the L1 layer is a neighbor device of a previous layer of the network device of the L2 layer; the network equipment of the L3 layer is the neighbor equipment of the next layer of the network equipment of the L2 layer; the network device at the L2 layer is a neighbor device at the upper layer of the network device at the L3 layer, and the network device at the L4 layer is a neighbor device at the lower layer of the network device at the L3 layer.
The detailed route, that is, the route that is not summarized, for example, the network device 1 issues the detailed route with the destination address of 192.168.0.1, that is, other devices may find the network device 1 through the address of 192.168.0.1.
The aggregated route is also aggregated routes, for example, the detail routes received by the network device 1 with destination addresses of 192.168.0.0-192.168.0.255 are aggregated routes, and the detail routes received by the network device 1 all belong to subnet masks of 255.255.255.255.0, so that the network device 1 can aggregate the received detail routes into 1 route, that is, 192.168.0.0/24, but in actual application, the detail routes can also be aggregated into a plurality of routes according to mask length information, for example, the detail routes with destination addresses of 192.168.0.0-192.168.0.31 are aggregated into 1 route 192.168.0.0/27; the detailed routes with the destination addresses of 192.168.0.32-192.168.0.63 are converged into 1 route 192.168.0.32/27; the detail routes with the destination addresses of 192.168.0.64-192.168.0.95 are converged into 1 route 192.168.0.64/27; the detail routes with the destination addresses of 192.168.0.96-192.168.0.127 are converged into 1 route 192.168.0.96/27; the detail routes with the destination addresses of 192.168.0.128-192.168.0.159 are converged into 1 route 192.168.0.128/27; the detail routes with the destination addresses of 192.168.0.160-192.168.0.191 are converged into 1 route 192.168.0.160/27; the detailed routes with the destination addresses of 192.168.0.192-192.168.0.223 are converged into 1 route 192.168.0.192/27; and the detailed routes with the destination addresses of 192.168.0.224-192.168.0.255 are converged into 1 route 192.168.0.224/27. In addition, the detailed routes corresponding to the destination addresses belonging to different subnet masks cannot be aggregated, for example: the subnet mask of the detail route 1 with the destination address 192.168.0.1 is 255.255.255.224, and the subnet mask of the detail route 2 with the destination address 192.168.0.1 is 255.255.255.0, and the detail route 1 and the detail route 2 do not belong to the same subnet mask, so that the convergence cannot be performed. If the routes issued by the neighboring devices of the next layer received by the network device 1 include the detailed routes and the aggregated routes, or both are the aggregated routes, the network device 1 may further aggregate the routes including the aggregated routes.
A default route, that is, when a route corresponding to a destination address cannot be found when a network device forwards a packet, the packet is sent to an assigned address, for example: the network device 1 forwards the message to the network device 2, but the network device 1 does not obtain the route of the network device 2, and then the network device 1 can forward the message to the specified address (that is, the address of the default route). To more clearly illustrate the default route in this application, it can be illustrated by the following example: the neighbor device of the upper hierarchy of the network device 1 is the network device 2, the neighbor device of the lower hierarchy is the network device 3, the network device 1 sends aggregation information of detailed routes of the neighbor device of the lower hierarchy, that is, aggregation routes, to the network device 2, and issues default route information to the network device 3, that is, if the network device 3 forwards a packet to the network device 2 and cannot acquire a route of the network device 2, the packet may be forwarded to an assigned address, and the packet is forwarded to the network device 2 through the assigned address.
In this application, "and/or" describes an association relationship of associated objects, which means that there may be three relationships, for example, a and/or B, which may mean: a alone, A and B together, and B alone, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple. The singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, such as "one or more", unless the context clearly indicates otherwise. And, unless stated to the contrary, the embodiments of the present application refer to the ordinal numbers "first", "second", etc., for distinguishing a plurality of objects, and do not limit the sequence, timing, priority, or importance of the plurality of objects.
Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.
Fig. 2 is a schematic flow chart of a method for issuing a route in a campus network according to an embodiment of the present application, where the method is executed on a network device side, and the network device may first execute step 201 to issue an aggregation route to a neighboring device in a previous hierarchy connected to the network device; wherein the hierarchy indicates the location of each device in the campus network in the network topology; an aggregated route is an aggregation of detailed routes received by a network device from neighboring devices of the next hierarchy to which the network device is connected.
Step 202, the network device issues a default route to a neighboring device of a next level connected to the network device, where the default route indicates that the neighboring device of the next level forwards the packet to an assigned address corresponding to the default route when the neighboring device of the next level does not successfully acquire the route corresponding to the destination address.
In addition, step 201 and step 202 in fig. 2 may not be in a sequential order, and may be executed simultaneously, or step 202 may be executed first and then step 201, or step 201 may be executed first and then step 202 according to an order, and the execution sequence is not specifically limited in the present application.
In addition, in order to ensure that the neighboring device of the adjacent layer can forward the message to the network device, the network device also issues detailed routes to the neighboring device of the previous layer and the neighboring device of the next layer, so that the network device directly performs information interaction with the neighboring device of the previous layer.
When a campus network is networked, the position of network equipment is planned in advance, if the network equipment on the L1 layer is located in the core layer and comprises core equipment, the network equipment on the L2 layer can be connected with convergence equipment and the core equipment, and the network equipment on the L1 layer is located in the convergence layer and comprises the convergence equipment, and the network equipment on the L2 layer can be connected with the convergence equipment, the core equipment and the access equipment. Schematically, as shown in fig. 3, the network device 1 is located at a level of L2, the neighbor devices in the upper layer include the network device 2 and the network device 3, and the neighbor devices in the lower layer include the network device 4 and the network device 5. The network device 1 may issue the detailed route 1 and the aggregated route 6 of the detailed routes of the network device 4 and the network device 5 to the network device 2 and the network device 3, where a destination address corresponding to the route 1 is an address 1, and a destination address corresponding to the route 6 is an address 6, so that the network device 2 and the network device 3 may forward the packet to the network device 1 through the address 1 and forward the packet to the network device 4 or the network device 5 through the address 6. The network device 1 may also issue a route 1 and a default route 0 to the network devices 4 and 5, so that the network devices 4 and 5 may forward the packet to the network device 1 through the address 1 and forward the packet to the network device 2 or the network device 3 through the address 0, where the designated address corresponding to the default route 0 is the address 0. Because the campus network is usually in a tree structure, the network device forwards the message in either the leaf direction or the root direction, so that the default route can be used to instruct the network device to forward all the messages which are not found to be routed to the root direction.
In the embodiment of the application, the network device issues the aggregation route to the neighbor device connected with the network device in the previous hierarchy, and issues the default route to the neighbor device connected with the network device in the next hierarchy, so that the network device in the campus network is prevented from learning the detailed routes issued by all the hierarchy network devices in the campus network, the network device can forward the message in the whole network only by learning the route information issued by the network devices in the adjacent hierarchy, and by the method, the route issuing number of the network device is reduced on the one hand, and the route learning number of the network device in the campus network is also reduced on the other hand.
In one embodiment, a network device publishes a detailed route and an aggregated route of the network device to a same-tier neighbor device connected to the network device. The network equipment issues detailed routing to the neighbor equipment of the same level so that the neighbor equipment of the same level can forward the message, and issues detailed aggregation routing to the neighbor equipment of the same level so that the neighbor equipment of the same level can forward the message to the neighbor equipment of the next level. As shown in fig. 4, fig. 4 is illustrated on the basis of fig. 3, the neighbor devices of the network device 1 further include a neighbor device network device 6 and a network device 7 in the same hierarchy, and the network device 1 may issue the route 1 and the route 6 to the network device 6 and the network device 7, so that the network device 6 or the network device 7 may forward the packet to the network device 1 through the address 1, and may forward the packet to the network device 4 or the network device 5 through the address 6.
Further, it is also noted that the neighbor devices of the network device may be determined by:
the network equipment acquires a message sent by neighbor equipment; wherein, the message IS the message of OSPF protocol or the message of IS-IS protocol; the message carries a field for indicating the hierarchy of the neighbor device; and acquiring the hierarchy of the neighbor device according to the field for indicating the device hierarchy of the neighbor device in the message. Such as: the network device belongs to a layer L3 and receives a message 1 of an OSPF protocol sent by a neighbor device, and the network device learns that the layer of the neighbor device is L4 by analyzing a field used for indicating the layer of the neighbor device in the message 1, so that the neighbor device of the network device is known to be the network device of the next layer.
In order to enable the network device to better forward message information, the LSDB of the network device can store route information issued by neighbor devices, and default routes issued by neighbor devices of a previous layer connected with the network device are stored in the LSDB of the first link database; storing detailed routes issued by neighbor devices of a next hierarchy connected with the network device in a second link database (LSDB); detailed routes issued by neighbor devices of the same hierarchy connected to the network device are stored in the first link database LSDB.
Schematically, as shown in fig. 5, in the diagram, a network device 1 is located at a level of L3, neighbor devices of an upper layer include a network device 2 and a network device 3, neighbor devices of a lower layer include a network device 4 and a network device 5, and neighbor devices of the same level include a network device 6 and a network device 7. The network device 2 issues a detailed routing route 2 of the network device 2 to the network device 1, so that the network device 1 forwards the packet to the network device 2 according to the address 2, wherein a destination address corresponding to the route 2 is the address 2; the network device 3 issues a detailed route 3 of the network device 3 to the network device 1, so that the network device 1 forwards the packet to the network device 2 according to the address 3, wherein a destination address corresponding to the route 3 is the address 3; in addition, both the network device 2 and the network device 3 issue a default route 0 to the network device 1, where the designated address corresponding to the route 0 is address 0, and the address 0 is used to instruct the network device 1 to forward the packet to a network device that cannot perform explicit routing through the address 0; network devices 4-7 each issue respective detailed routes to network device 1, which are route 4, route 5, route 6, and route 7. Network device 1 may store route 0, route 2, route 3, route 6, and route 7 in a first LSDB and route 4, route 5 in a second LSDB. As shown in table 1, the first LSDB of the network device 1 stores the default route 0 issued by the neighbor device in the previous hierarchy, the detailed routes 2 and 3 issued by the neighbor device in the previous hierarchy, and the detailed routes 6 and 7 issued by the neighbor device in the same hierarchy. The second LSDB stores detailed routes 4 and 5 issued by the neighbor devices in the next hierarchy. As shown in table 2, route 0 and routes 2 to 7 may be stored in the first LSDB, and route 4 and route 5 are stored in the second LSDB, so that the flooding of the next-level device is prevented from affecting the forwarding of the packet.
TABLE 1
TABLE 2
Different routing information is stored in the first LSDB and the second LSDB so that when network equipment forwards a message, the network equipment directly searches the corresponding routing information in the LSDB to forward the message, and therefore the message forwarding efficiency is improved.
Based on the same technical concept, an embodiment of the present application further provides a network device, as shown in fig. 6, including: a processing unit 61.
The processing unit 61 is configured to issue a convergence route to a neighboring device in a previous hierarchy connected to the network device; and for issuing a default route to a neighbor device of a next hierarchy connected to the network device; wherein the hierarchy indicates the location of each device in the campus network in the network topology; the aggregation route is an aggregation of detailed routes received by the network device from a neighbor device of a next level connected to the network device, wherein the default route indicates that the neighbor device of the next level forwards the packet to a designated address corresponding to the default route when the neighbor device of the next level does not successfully acquire the route corresponding to the destination address.
In the embodiment of the application, the network device issues the aggregation route to the neighbor device connected with the network device in the previous hierarchy, and sends the default route to the neighbor device connected with the network device in the next hierarchy, so that the situation that the network device in the campus network learns detailed routes issued by all the network devices in the campus network is avoided, the network device can forward messages in the whole network only by learning the route information issued by the network devices in the adjacent hierarchies, and through the method, the route issuing number of the network device is reduced on the one hand, and the route learning number of the network device in the campus network is also reduced on the other hand.
In one possible implementation, the processor is further configured to issue the detailed route and the aggregated route of the network device to a neighboring device of the same hierarchy connected to the network device.
By the method, the network equipment can issue the detail route of the network equipment and the aggregated route after the aggregation of the detail routes of the next-level neighbor equipment to the neighbor equipment of the same level, so that the neighbor equipment of the same level can forward the message, and the neighbor equipment of the same level can forward the message to the neighbor equipment of the next level.
In one possible implementation, the apparatus further includes: a communication unit; the communication unit is used for acquiring a message sent by neighbor equipment; wherein, the message is the message of OSPF protocol or the message of ISIS protocol from the intermediate system to the intermediate system; the message carries a field for indicating the hierarchy of the neighbor equipment; and acquiring the hierarchy of the neighbor device according to the field used for indicating the device hierarchy of the neighbor device in the message.
The network equipment can acquire the hierarchy to which the neighbor equipment belongs according to the message information sent by the neighbor equipment, so that the network equipment can send corresponding routing information to the neighbor equipment according to the hierarchy information of the neighbor equipment, and the number of routes issued by the network equipment is reduced.
In one possible implementation, the apparatus further includes: a storage unit; the storage unit is used for storing the default route issued by the neighbor device of the upper hierarchy connected with the network device in the first LSDB; storing detailed routes issued by neighbor devices of a next hierarchy connected with the network device in a second LSDB; detail routes issued by neighbor devices of the same hierarchy connected to the network device are stored in the first LSDB.
The routing information issued by the neighbor device and received by the network device is stored in the LSDB, so that the network device can determine the forwarding path of the message according to the routing information.
Based on the same concept, as shown in fig. 7, a communication apparatus 700 is provided for the present application. Illustratively, the communication device 700 may be a chip or a system of chips. Optionally, the chip system in the embodiment of the present application may be formed by a chip, and may also include a chip and other discrete devices.
The communication device 700 may include at least one processor 710 and the device 700 may also include at least one memory 720 for storing computer programs, program instructions and/or data. A memory 720 is coupled to the processor 710. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. The processor 710 may operate in conjunction with the memory 720. Processor 710 may execute computer programs stored in memory 720. Optionally, at least one of the at least one memory 720 may be included in the processor 710.
The communication device 700 may further include a transceiver 730, and the communication device 700 may interact with other devices through the transceiver 730. The transceiver 730 may be a circuit, a bus, a transceiver, or any other device that may be used to exchange information.
In a possible implementation manner, the communication apparatus 700 may be applied to the foregoing network device, and the specific communication apparatus 700 may be the foregoing network device, and may also be an apparatus capable of supporting the foregoing network device to implement any of the foregoing embodiments. The memory 720 holds the necessary computer programs, program instructions and/or data to implement the functionality of the network device in any of the embodiments described above. The processor 710 can execute the computer program stored in the memory 720 to perform the method of any of the above embodiments.
The specific connection medium among the transceiver 730, the processor 710 and the memory 720 is not limited in the embodiments of the present application. In the embodiment of the present application, the memory 720, the processor 710 and the transceiver 730 are connected through a bus in fig. 7, the bus is represented by a thick line in fig. 7, and the connection manner between other components is merely illustrative and not limited thereto. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 7, but this is not intended to represent only one bus or type of bus.
In the embodiments of the present application, the processor may be a general processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in a processor.
In the embodiment of the present application, the memory may be a nonvolatile memory, such as a Hard Disk Drive (HDD) or a solid-state drive (SSD), and may also be a volatile memory, for example, a random-access memory (RAM). The memory can also be any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory in the embodiments of the present application may also be circuitry or any other device capable of performing a storage function for storing computer programs, program instructions and/or data.
Based on the above embodiments, referring to fig. 8, the present application provides another communication apparatus 800, including: an interface circuit 810 and a processor 820;
an interface circuit 810 for receiving code instructions and transmitting them to the processor 820;
a processor 820 for executing the code instructions to perform the method of any of the above embodiments.
Based on the foregoing embodiments, the present application further provides a readable storage medium, which stores instructions that, when executed, cause the method performed by the security detection apparatus in any of the foregoing embodiments to be implemented. The readable storage medium may include: u disk, removable hard disk, read only memory, random access memory, magnetic or optical disk, etc. for storing program codes.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
It should be understood that in the embodiment of the present application, "and/or" describes an association relationship of associated objects, indicating that three relationships may exist, for example, a and/or B may indicate: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple. The singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, such as "one or more", unless the context clearly indicates otherwise. And, unless stated to the contrary, the embodiments of the present application refer to the ordinal numbers "first", "second", etc., for distinguishing a plurality of objects, and do not limit the sequence, timing, priority, or importance of the plurality of objects.
Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (11)
1. A method for issuing a route in a campus network, comprising:
the network equipment issues a convergence route to the neighbor equipment of the upper layer connected with the network equipment; wherein the hierarchy indicates a location of each device in the campus network in a network topology; the aggregated route is an aggregation of detailed routes received by the network device from neighboring devices of a next hierarchy to which the network device is connected;
the network equipment issues a default route to the neighbor equipment of the next level connected with the network equipment, wherein the default route indicates that the neighbor equipment of the next level forwards the message to the designated address corresponding to the default route when the neighbor equipment of the next level does not successfully acquire the route corresponding to the destination address.
2. The method of claim 1, further comprising:
the network device issues the detailed route and the aggregated route of the network device to a neighbor device of the same layer connected with the network device.
3. The method of claim 2, wherein the neighbor devices of the network device are determined by:
the network equipment acquires the message sent by the neighbor equipment; the message IS an OSPF protocol message or an IS-IS protocol message from an intermediate system to the intermediate system; the message carries a field for indicating the hierarchy of the neighbor device;
and the network equipment acquires the hierarchy of the neighbor equipment according to the field which is used for indicating the equipment hierarchy of the neighbor equipment in the message.
4. A method according to claim 2 or 3, characterized in that the method further comprises:
the network equipment stores a default route issued by a neighbor equipment of an upper hierarchy connected with the network equipment in a first link database (LSDB);
the network equipment stores detailed routes issued by neighbor equipment of a next layer connected with the network equipment in a second link database (LSDB);
the network device stores detailed routes issued by neighbor devices of the same hierarchy connected to the network device in a first link database (LSDB).
5. A network device, comprising:
the processing unit is used for issuing the aggregation route to the neighbor equipment of the upper level connected with the network equipment; wherein the hierarchy indicates a location of each device in the campus network in a network topology; the aggregated route is an aggregation of detailed routes received by the network device from a neighbor device of a next hierarchy to which the network device is connected; and the router is used for issuing a default route to the neighbor device of the next layer connected with the network device, wherein the default route indicates that the neighbor device of the next layer forwards the message to the designated address corresponding to the default route when the router corresponding to the destination address is not successfully acquired.
6. The device of claim 5, wherein the processing unit is further configured to publish the detailed route of the network device and the aggregated route to a neighboring device in a same hierarchy to which the network device is connected.
7. The apparatus of claim 6, further comprising:
a communication unit, configured to acquire a message sent by the neighboring device; wherein, the message IS the message of OSPF protocol or the message from intermediate system to intermediate system IS-IS protocol; the message carries a field for indicating the hierarchy of the neighbor device;
and acquiring the hierarchy of the neighbor device according to a field used for indicating the device hierarchy of the neighbor device in the message.
8. The apparatus of claim 6 or 7, further comprising:
a storage unit, configured to store, in a first link database LSDB, a default route issued by a neighbor device of an upper hierarchy connected to the network device;
storing detailed routes issued by neighbor devices of a next hierarchy connected with the network device in a second link database (LSDB);
storing detailed routes issued by neighbor devices of the same hierarchy connected to the network device in a first link database (LSDB).
9. A communications apparatus, comprising: a processor and a memory;
the memory stores a computer program;
the processor configured to execute the computer program stored in the memory to cause the method of any one of claims 1-4 to be performed.
10. A communications apparatus, comprising: a processor and an interface circuit;
the interface circuit is used for receiving code instructions and transmitting the code instructions to the processor;
the processor is configured to execute the code instructions to perform the method of any one of claims 1-4.
11. A computer-readable storage medium having computer-readable instructions stored thereon which, when read and executed by a computer, cause the computer to perform the method of any one of claims 1-4.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010566336.XA CN113824633B (en) | 2020-06-19 | 2020-06-19 | Method for releasing route in campus network and network equipment |
| PCT/CN2021/094673 WO2021254079A1 (en) | 2020-06-19 | 2021-05-19 | Method for issuing route in campus network, and network device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010566336.XA CN113824633B (en) | 2020-06-19 | 2020-06-19 | Method for releasing route in campus network and network equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113824633A CN113824633A (en) | 2021-12-21 |
| CN113824633B true CN113824633B (en) | 2022-12-13 |
Family
ID=78912009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010566336.XA Active CN113824633B (en) | 2020-06-19 | 2020-06-19 | Method for releasing route in campus network and network equipment |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113824633B (en) |
| WO (1) | WO2021254079A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114554566A (en) * | 2022-01-27 | 2022-05-27 | 哈尔滨海能达科技有限公司 | Routing method and device of wireless link, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1816000A (en) * | 2005-02-02 | 2006-08-09 | 华为技术有限公司 | Topology method of one-time route computing to realize hierarchical route |
| US8737406B1 (en) * | 2002-08-01 | 2014-05-27 | Cisco Technology, Inc. | Method for transmitting IP routes to prioritize convergence |
| CN106789664A (en) * | 2016-03-29 | 2017-05-31 | 新华三技术有限公司 | A kind of route aggregating method and device |
| CN109729190A (en) * | 2019-03-15 | 2019-05-07 | 深圳前海微众银行股份有限公司 | Network Access Method, system, equipment and computer readable storage medium |
Family Cites Families (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7020718B2 (en) * | 2000-05-15 | 2006-03-28 | Hewlett-Packard Development Company, L.P. | System and method of aggregating discontiguous address ranges into addresses and masks using a plurality of repeating address blocks |
| EP1331793A1 (en) * | 2002-01-24 | 2003-07-30 | Alcatel Canada Inc. | Method for distributing aggregate route information |
| US7738457B2 (en) * | 2006-12-20 | 2010-06-15 | Oracle America, Inc. | Method and system for virtual routing using containers |
| CN100596107C (en) * | 2007-02-09 | 2010-03-24 | 华为技术有限公司 | Packet forwarding method and border router of autonomous system |
| JP4885819B2 (en) * | 2007-10-22 | 2012-02-29 | 富士通株式会社 | Communication device |
| CN100596117C (en) * | 2007-11-09 | 2010-03-24 | 杭州华三通信技术有限公司 | A route information spreading method and router |
| CN101404621B (en) * | 2008-11-24 | 2010-12-01 | 杭州华三通信技术有限公司 | Method and routing device for implementing VRRP load balance |
| US8208377B2 (en) * | 2009-03-26 | 2012-06-26 | Force10 Networks, Inc. | MAC-address based virtual route aggregation |
| US8625424B2 (en) * | 2011-02-23 | 2014-01-07 | Hp Ventures A/S | Method and system for routing information in a network |
| CN106455135B (en) * | 2016-10-31 | 2019-05-10 | 吉林大学 | A kind of distributed node seismic detector network communication method |
| CN107547374B (en) * | 2017-06-01 | 2020-04-28 | 新华三技术有限公司 | Aggregation route processing method and device |
| CN107770069B (en) * | 2017-10-31 | 2020-04-03 | 杭州迪普科技股份有限公司 | LSA (location-based advertisement) method and device |
-
2020
- 2020-06-19 CN CN202010566336.XA patent/CN113824633B/en active Active
-
2021
- 2021-05-19 WO PCT/CN2021/094673 patent/WO2021254079A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8737406B1 (en) * | 2002-08-01 | 2014-05-27 | Cisco Technology, Inc. | Method for transmitting IP routes to prioritize convergence |
| CN1816000A (en) * | 2005-02-02 | 2006-08-09 | 华为技术有限公司 | Topology method of one-time route computing to realize hierarchical route |
| CN106789664A (en) * | 2016-03-29 | 2017-05-31 | 新华三技术有限公司 | A kind of route aggregating method and device |
| CN109729190A (en) * | 2019-03-15 | 2019-05-07 | 深圳前海微众银行股份有限公司 | Network Access Method, system, equipment and computer readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| OSPF在校园网中的实现;王笑娟等;《中国科技信息》;20100315(第06期);全文 * |
| 基于区域划分的WSN数据汇聚路由算法;周俊青等;《合肥工业大学学报(自然科学版)》;20121228(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021254079A1 (en) | 2021-12-23 |
| CN113824633A (en) | 2021-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9225628B2 (en) | Topology-based consolidation of link state information | |
| CN102282810B (en) | Load balancing | |
| US10574567B2 (en) | Modeling a border gateway protocol network | |
| US8537677B2 (en) | Incremental adaptive packet routing in a multi-dimensional network | |
| US9282031B2 (en) | Network system and routing method | |
| US8312066B2 (en) | Hash collision resolution with key compression in a MAC forwarding data structure | |
| CN102859949B (en) | For the method in fat tree network routing data grouping | |
| CN106713137B (en) | VPN method, device and system based on segmented routing and SDN technology | |
| CN108243103B (en) | Apparatus, system and method for distributing routing protocol information in a clos network | |
| CN108259347B (en) | Message transmission method and device | |
| CN113300949B (en) | Method for forwarding message, method, device and system for releasing routing information | |
| US20110270979A1 (en) | Reducing Propagation Of Message Floods In Computer Networks | |
| CN104704779A (en) | Method and apparatus for accelerating forwarding in software-defined networks | |
| CN105706391A (en) | Multicast increasing through index localization | |
| CN113824633B (en) | Method for releasing route in campus network and network equipment | |
| US10855572B2 (en) | Area abstraction extensions to routing protocols | |
| CN104348737B (en) | The transmission method and interchanger of a kind of multicast message | |
| CN112187635B (en) | Message forwarding method and device | |
| CN108632125B (en) | Multicast table item management method, device, equipment and machine readable storage medium | |
| CN112637053B (en) | Method and device for determining backup forwarding path of route | |
| EP4109824A1 (en) | Traffic monitoring method, related device and system | |
| CN110401594B (en) | Message forwarding method and device, electronic equipment and machine-readable storage medium | |
| CN115514700A (en) | Method, device and equipment for determining backup path between node equipment | |
| CN102413038B (en) | Processing method and system for inaccessibility of next hop of route | |
| CN114760248A (en) | Message transmission method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |