CN107395479B - Lossless ring network switch, lossless self-healing ring network and data communication method thereof - Google Patents
Lossless ring network switch, lossless self-healing ring network and data communication method thereof Download PDFInfo
- Publication number
- CN107395479B CN107395479B CN201710357928.9A CN201710357928A CN107395479B CN 107395479 B CN107395479 B CN 107395479B CN 201710357928 A CN201710357928 A CN 201710357928A CN 107395479 B CN107395479 B CN 107395479B
- Authority
- CN
- China
- Prior art keywords
- data frame
- switch
- ring network
- lossless
- data
- 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
- 238000000034 method Methods 0.000 title claims description 27
- 238000004891 communication Methods 0.000 title claims description 11
- 230000008521 reorganization Effects 0.000 claims abstract 5
- 230000000903 blocking effect Effects 0.000 claims description 18
- 230000007246 mechanism Effects 0.000 claims description 11
- 230000006798 recombination Effects 0.000 claims description 11
- 238000005215 recombination Methods 0.000 claims description 11
- 230000005540 biological transmission Effects 0.000 description 15
- 230000008569 process Effects 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000032683 aging Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/10—Packet switching elements characterised by the switching fabric construction
- H04L49/113—Arrangements for redundant switching, e.g. using parallel planes
- H04L49/118—Address processing within a device, e.g. using internal ID or tags for routing within a switch
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3009—Header conversion, routing tables or routing tags
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/35—Switches specially adapted for specific applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2101/00—Indexing scheme associated with group H04L61/00
- H04L2101/60—Types of network addresses
- H04L2101/618—Details of network addresses
- H04L2101/622—Layer-2 addresses, e.g. medium access control [MAC] addresses
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure relates to a lossless ring network switch, including: a switching logic unit and a routing logic component. The routing logic component comprises a data reorganization unit, an ID learning unit and a routing decision unit, wherein the ID learning unit learns the ID of the source lossless ring network switch, the data reorganization unit adds or strips a routing protocol containing the ID of a destination switch, the ID of a local switch and a data frame serial number for a data frame, and the routing decision unit routes the data frame which is not registered and is destined to the ID of the local switch to the direction of an opposite network link port only, routes the data frame which is not registered and is destined to the ID of the local switch to the direction of the data reorganization unit of the local lossless ring network switch, and discards the data frame of which the frame serial number is registered.
Description
Technical Field
The present disclosure relates to a switch, and more particularly, to a lossless ring network switch, a lossless self-healing ring network formed by the lossless ring network switch, and a lossless ring network data communication method.
Background
Currently, the industrial ring network includes a lossy switching ring network (non-zero self-healing) and a lossless switching ring network. The lossless ring network switch used in the lossless switching ring network, such as the HSR switch, adopts international standard IEC62439, which utilizes PRP (parallel Redundancy protocol) and HSR (High-availability seamless protocol). Although the lossy switching ring network has its inherent advantages, in an environment with high technical requirements for data, the lossy switching ring network cannot meet user requirements (for example, there is a data loss problem), so some industrial application occasions adopt the lossless switching ring network. However, in the current lossless switching ring network, i.e. the zero self-healing ring network, the self-healing mechanism of the switch is based on the ethernet source MAC learning mechanism, and the zero self-healing transmission is achieved by using the own packet ID in the ethernet data protocol. Therefore, when a large number of devices exist on the network, a large number of resources are needed to store the MAC, and the MAC is searched and the data packet ID is compared for a long time, so that the resource limitation and searching comparison mode greatly reduces the device access amount and the bandwidth utilization rate. This also results in the limitation of the number of access devices (usually not more than 512) of the current zero self-healing lossless ring network switch, and therefore, the switch cannot be applied to the industrial occasions where the access devices are used on a large scale.
It is therefore desirable to provide a method that enables a lossless ring network to be suitable for industrial applications with a large number of access devices.
Disclosure of Invention
Therefore, the present disclosure provides a lossless ring network switch, including: one or more device ports; a pair of network link ports; the switching logic unit learns the source MAC address in the data frame from the network link port based on a source MAC address learning mechanism and forms an MAC address table; and a routing logic component including a data reorganizing unit, an ID learning unit, and a routing decision unit, the ID learning unit learns a source lossless ring network switch ID included in a routing protocol in a data frame transmitted from one of the network link ports and forms a source lossless ring network switch ID table in a ring network, the data reorganizing unit searches a locally located source lossless ring network switch ID table for the data frame transmitted from the switching logic unit based on a destination MAC address in the data frame to acquire a destination switch ID corresponding to the destination MAC and adds a routing protocol including the acquired destination switch ID, the local switch ID, and a data frame sequence number generated based on the source switch ID and a routing protocol added for data frame stripping transmitted from the network link port to the data frame, and the routing decision unit strips the destination switch ID included in the routing protocol to be not the local switch ID and the data frame sequence number The data frame whose column number is not registered is routed only to a network link port direction opposite to a network link port that receives the data frame, the data frame whose destination switch ID contained in the routing protocol is a local switch ID and whose frame number is not registered is routed to a data reassembly unit direction of the local lossless ring network switch, and the data frame whose frame number is already registered is discarded.
According to the lossless ring network switch disclosed by the disclosure, when the routing decision unit routes the data frame to the direction of the data recombination unit of the local lossless ring network switch, the data recombination unit strips the routing protocol added in the data frame and sends the data frame to the switching logic unit.
According to the lossless ring network switch of the present disclosure, the data reassembly unit reassembles a blocking packet that does not include data content based on a routing protocol of the received data frame, in a case where the data frame from the network link port is an unregistered data frame, and the routing decision unit routes the blocking packet to a network link port direction opposite to the network link port that receives the data frame.
According to the lossless ring network switch of the present disclosure, the routing decision unit determines whether the received data frame is registered based on the source lossless ring network switch ID and the data sequence number included in the received data frame.
According to another aspect of the present disclosure, a lossless self-healing ring network is provided, which is composed of a plurality of lossless ring network switches of the present disclosure.
According to another aspect of the present disclosure, a lossless ring network data communication method is provided, including: a first data frame sent by a first user equipment from a user equipment port of a first lossless ring network switch through a first switching logic unit; a first data recombination unit of a first lossless ring network switch acquires a destination lossless ring network switch ID corresponding to a destination MAC by adopting a Hash algorithm based on a destination MAC address in a first data frame and a source lossless ring network switch ID table in the first lossless ring network switch, adds a routing protocol containing the acquired destination lossless ring network switch ID, the first lossless ring network switch ID and a data frame serial number generated based on the first lossless ring network switch ID for the first data frame, and copies the first data frame after the protocol is added; a first routing decision unit of a first lossless loop network switch routes the first data frame and a copy thereof to a pair of network link port directions of the first lossless loop network switch respectively; when a second ID learning unit of at least one second lossless looped network switch receives a first data frame from first user equipment through one of the paired network link ports, based on a source address learning mechanism, learning a first lossless looped network switch ID contained in a routing protocol of the first data frame and forming a source lossless looped network switch ID table in a looped network; and a second routing decision unit of the at least one second lossless ring network switch, upon receiving the first data frame from the first user equipment through one of its paired network link ports, routes the first data frame, which has the destination switch ID included in the routing protocol not being the local switch ID and the data frame sequence number not registered, only to a direction of the network link port opposite to the network link port receiving the first data frame, routes the first data frame, which has the destination lossless ring network switch ID included in the routing protocol being the second lossless ring network switch ID and the data frame sequence number not registered, to a direction of a second data reassembly unit of the second lossless ring network switch, and discards the first data frame, which has the frame sequence number already registered.
The lossless looped network data communication method according to the present disclosure further includes: when the second routing decision unit routes the first data frame to the second data recombination unit, the second data recombination unit strips the routing protocol added in the first data frame and then sends the routing protocol to the second switching logic unit of the second lossless ring network switch.
The lossless looped network data communication method according to the present disclosure further includes: and as the second routing decision unit routes the first data frame with the destination lossless ring network switch ID as the second lossless ring network switch ID to the direction of the second data recombination unit, the second data recombination unit recombines a blocking packet without substantial data content based on the routing protocol of the received first data frame, and routes the blocking packet to the direction of the network link port opposite to the network link port receiving the first data frame.
The lossless looped network data communication method according to the present disclosure further includes: the second ID learning unit registers the data frame sequence number of the first data frame in the data frame sequence number registration table in association with the first lossless network switch ID when the data frame sequence number of the first data frame is not registered.
By adopting the lossless ring network switch, because the learning of the source switch ID is only carried out aiming at the data frame, and the pair of the destination switch ID and the source switch data frame serial number is checked, the data exchange speed of the switch is greatly reduced, because the number of the switches on the ring network is far less than that of the access equipment, the MAC number of the single lossless ring network switch can reach the degree (equivalent to the capacity of a single switch chip) of more than 16K. The transmission rate can reach more than 90% of the linear speed (the designed speed of the line).
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
Fig. 1 is a schematic diagram of a lossless ring network switch according to an embodiment of the present invention.
Fig. 2 is a flow chart illustrating a process of processing a locally sourced data frame by a lossless ring network switch according to the present disclosure.
Fig. 3 is a flow chart illustrating a processing procedure of a lossless ring network switch according to the present disclosure for a data frame from a network link port.
Fig. 4 is a schematic diagram of a lossless ring network formed by lossless ring network switches according to the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in this disclosure and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, a first switch may also be referred to as a second switch, and vice versa, without departing from the scope of this disclosure. The word "if" as used herein may be interpreted as "at …" or "when …" or "in response to a determination", depending on the context.
For a better understanding of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
Fig. 1 shows a schematic diagram of a lossless ring network switch 100 according to an embodiment of the invention. As shown in fig. 1, a lossless ring network switch 100 (for convenience of description, the lossless ring network switch of the present disclosure is hereinafter referred to as "NET switch") includes: one or more device ports C, routing logic component 110, and switching logic unit 120. The routing logic component 110 and the switching logic unit 120 implement data interaction in a single-channel or multi-channel manner.
The routing logic component 110 includes at least one pair of network link ports, i.e., transmission channels a and B. The switching logic unit 120 is connected to one or more device ports C, which are connected to user equipment. The user equipment generates a data frame and sends the data frame to the switching logic unit 120 via the port C. The switching logic unit 120 learns the MAC of the source device received from the outside based on the source address learning mechanism, forms a source device MAC address table of the received data frame, and updates the MAC address table according to a conventional aging mechanism. The MAC address table is similar to the MAC address table in a conventional switch, e.g., contains MAC addresses and port numbers.
The routing logic component 110 includes an ID learning unit 111, a routing decision unit 112, and a data reassembly unit 113. The switching logic unit 120 passes the received user data frame to the routing logic component 110. The data frames sent out by the switching logic unit 120 will contain the routing protocol of the data frames sent out by the conventional switch. In order to distinguish the data frames sent out by different switches, the data reassembly unit 113 of the switch of the present disclosure adds a data frame sequence number generated based on the ID of the lossless ring network switch 100 to the data frame to be sent out from the lossless ring network switch to which it belongs. Thus, data frames transmitted over a ring network that includes the lossless ring network switch of the present disclosure all include a data frame sequence number associated with the ID of its source switch. Furthermore, the data reassembly unit 113 will add a layer of routing protocol to the data frame to be sent out, and the added layer of routing protocol will contain the ID of the local lossless ring network switch, i.e. the source switch ID.
The ID learning unit 111 performs source switch ID learning on data frames from the network link channel a or B, that is, the transmission channel a or B, based on a source address learning mechanism, to form a source switch ID table. Table 1 shows an example of a source switch ID table.
Table 1:
specifically, for a data frame from a network link port, various algorithms, such as a hash algorithm (if there are other algorithms, the example can be continued), etc., are used to obtain an index of each MAC address based on its source MAC address, and the index, the MAC identification field, the source switch ID, and the corresponding attributes, etc., are stored in table 1 above in an associated manner.
Therefore, when a local ue wants to communicate with a ue, the initial routing protocol of the original data frame includes the MAC address of the ue as the destination MAC address. When the data reassembly unit 113 receives the data frame, it also uses the same algorithm, for example, hash algorithm, based on the destination MAC address in the data frame to obtain its corresponding index, finds the source switch ID to which the destination MAC address belongs or corresponds in the source switch ID table based on the index, and includes the found switch ID in the added layer routing protocol as the destination switch ID. The source switch ID may be updated using existing aging mechanisms for the MAC address table.
Therefore, the data reassembly unit 113 adds a layer of routing protocol to the data frame to be transmitted, which includes the lossless ring network switch ID (as the source switch ID) to which the data reassembly unit 113 belongs, the lossless ring network switch ID (as the destination switch ID) to which the destination MAC address in the data frame belongs, and the data frame sequence number generated based on the source switch ID.
The ID learning unit 111 also registers the data frame sequence number for the data frame from the network link channel a or B, that is, the transmission channel a or B, and forms a data frame sequence number table associated with the source switch ID. Specifically, the sequence number of a data frame that is not included in the existing data frame number table is determined as a newly received data frame, and the data frame number is registered in the data frame number table, thereby updating the data frame number table. Table 2 below shows an example of such a table of data frame numbers.
TABLE 2
Although both learning and updating of table 1 and table 2 are handled by the ID learning unit 111 in the present disclosure, they may be handled by different units. Although table 2 is described separately, the contents of table 2 may be combined in table 1 to form only one learning table.
Therefore, when the switch 100 according to the present disclosure is to transmit a data, a new data frame is formed after being reassembled by the data reassembly unit 113 based on the addition of a layer of routing protocol to the data frame destination MAC, and the structure of the new data frame is as shown in table 3:
TABLE 3
After the original data frame is added with one side routing protocol, the original data frame still contains original data of the original data frame and original routing protocol data, and can also contain other user protocols.
Fig. 2 is a flow chart illustrating a process of processing a locally sourced data frame by the lossless ring network switch 100 according to the present disclosure. As shown in fig. 2, first at step S210, the switching logic unit 120 issues an original data frame, and then the data reassembly unit 113 looks up the switch ID corresponding to the destination MAC in table 1 based on the hash algorithm based on the destination MAC address in the data frame, and generates a data frame sequence number associated with the source switch ID based on the local switch ID. Subsequently, at step S230, the data frame to be transmitted is reassembled, i.e., a layer of routing protocol, i.e., a routing protocol including the source switch ID and the destination switch ID, is added, and a data frame sequence number generated based on the source switch ID is added. The data frame sequence number generated based on the source switch ID may also be included directly in the routing protocol as a routing protocol data field for addition. After the reassembly, the reassembled data is copied to one copy and sent to the route decision unit 112. At step S240, the route decision unit 112 routes the reassembled data frame and its copy to the direction of the paired network link ports a and B for transmission into the ring network link.
It should be noted that if the sent data frame is a broadcast data frame or a multicast data frame, the destination switch ID in the routing protocol field added to the data frame is treated as full F in a conventional manner. Of course, other identifiers may be used to indicate the destination switch ID to indicate that the data frame is a broadcast frame. Although the above-described routing protocol is added to the header of the data frame, the length and the addition position of the routing protocol may be arbitrarily set according to the application.
Fig. 3 is a flow chart illustrating a processing procedure of the lossless ring network switch 100 according to the present disclosure for data frames from the network link ports. As shown in fig. 3, first, at step S310, the lossless ring network switch 100 according to the present disclosure receives a data frame from the network link port a or B. Subsequently, at step S320, the ID learning unit 111 learns the source switch ID of the data frame based on the source address learning mechanism, and matches the source MAC and the source switch ID in the data frame using a hash algorithm, obtaining a source switch ID table. Subsequently, in step S330, the ID learning unit 111 acquires the data frame sequence number associated with the source switch ID in the data frame, and checks whether the data frame is registered by referring to table 1 described above. If registered, the route decision unit 112 does not perform any route processing on the data frame and discards the data frame. If not registered, the ID learning unit 111 registers the new data frame sequence number in association with the source switch ID in table 2 described above at step S340. Subsequently, the destination switch ID of the data frame is checked against the local switch ID at step S350 to determine whether they are the same. On the one hand, if the destination switch ID is the same as the local switch ID, the route decision unit sends the data route to the data reassembly unit 113 so that the side routing protocol added by the data frame is stripped off by the data reassembly unit 113 at step S380 to send the data frame to the switching logic unit 120, and finally received by the local user equipment at step S395. Meanwhile, at step S390, a blocking packet, i.e., a null packet containing only the routing protocol, is reassembled by the data reassembly unit 113 based on the original routing protocol of the data frame. The blocking packet is then routed to another network link port opposite the network link port from which the data frame was received at step S370. On the other hand, if the destination switch ID is different from the local switch ID, it is determined whether the data frame is a broadcast frame at step S360. The operations at steps S380 and S370 described above are also performed as well if it is a broadcast frame.
Although steps S330-360 are described above in order, this is not a fixed order or in a sequential relationship with each other. The determination described later herein also uses the result of the previous determination as a determination condition, and for example, it is possible to directly determine whether or not the data frame is a broadcast frame, without assuming that the determination of whether or not the destination switch ID thereof is a local switch ID. Similarly, determining whether or not a data frame is already registered does not provide a premise for determining whether or not its destination switch ID is a local switch ID. Moreover, these judgment processes can be performed simultaneously without any influence.
Through the above-described processing of the NET switch 100 for data from the network link port a or B, it is understood that the switch only needs to learn the source switch ID when performing data routing, and forms a smaller number of switch ID learning tables, and only needs to verify the ID of its destination switch and the sequence number of the data frame under the source switch ID when performing routing. Therefore, the destination address table traversed by the switch during the data exchange process, especially the data verification and destination address process during forwarding, is small, taking less time, and speeding up the data exchange process. Therefore, the number of the devices on the ring network is not limited like the number of the user devices on the existing ring network, and the user devices which can be connected on the ring network are increased in geometric grade, so that the application scale of the industrial ring network is enlarged.
Moreover, the switching logic unit 120 associated with the local switch can still maintain the routing protocol of the existing ring network, and it only learns the MAC addresses of the ports of other switches communicating with the local switch, so it is not necessary to learn the MAC addresses of the destination devices included in the data frames that only pass through the switch and are not required to be downloaded to the local user equipment, that is, it is not necessary to learn all the MAC addresses of the user equipments on the entire ring network, therefore, the MAC address table thereof will also be greatly reduced, and only the source MAC addresses in the actual use process need to be stored in the MAC address table thereof, thereby increasing the speed of data exchange.
Fig. 4 is a schematic diagram of a ring network formed by lossless ring network switches 100 according to the present disclosure. As shown in fig. 4, the ring network 400 includes only four lossless ring network switches 100-1, 100-2, 100-3, and 100-4 for simplicity. In a traditional zero self-healing lossless ring network switch, source equipment sends out a packet, a data packet with a short transmission path and a priority reaching target equipment is received by the target equipment, and a data packet with a long transmission path still needs to be transmitted to the target equipment in a network to judge whether the data packet needs to be discarded or not. Therefore, the transmission of the data packet covers the whole ring network, and when the data packet and the data volume are large, the bandwidth utilization rate of the ring network is reduced. On the ring network shown in fig. 4, when a first user equipment (i.e. a source device) connected to a first lossless ring network switch 100-1 sends out a first data frame, the first routing decision unit 112 on the first lossless ring network switch performs bidirectional routing and sends the first data frame to a second lossless ring network switch 100-2 and a fourth lossless ring network switch 100-4. When the second lossless ring network switch 100-2 or the fourth lossless ring network switch 100-4 determines that the destination switch ID of the first data frame is not the ID of the second local switch, the first data frame is forwarded to other switches between the lossless ring network switches 100-2 and 100-4, for example, the third lossless ring network switch 100-3; and if the second lossless ring network switch 100-2 or the fourth lossless ring network switch 100-4 determines that the ID of the destination switch of the data frame is the ID of the second lossless ring network switch 100-2 or the fourth lossless ring network switch 100-4, directly downloading the first data frame to the local equipment. The data frames sent by the source device are typically large. If the second lossless ring network switch 100-2 has received the first data frame transmitted from one direction, the duplicate first data frame transmitted in the other direction is discarded after the destination switch receives it. The transmission process of the repeated data frame occupies too much transmission time of the ring network.
In order to shorten the transmission time of the ring network occupied by the repeated first data frame, the present disclosure particularly provides a method for stopping the repeated first data frame in advance to continue transmission. For example, when the destination switch ID of the first data frame is the ID of the second lossless ring network switch and the data frame is received for the first time, as shown in fig. 4, the second data reassembly unit 113 immediately reassembles a blocking packet that does not contain substantial data content based on the routing protocol of the received data frame, and the second routing decision unit routes the blocking packet to the network link port direction opposite to the network link port that receives the data frame from the network link port. The blocking packet mainly contains routing protocol data and a data frame sequence number because the blocking packet does not contain the essential data content of the original data frame. The size of the blocking packet will typically be only about 60 bytes, much smaller than the size of the original data frame (e.g., 500 bytes). The blocking packet will be transmitted at a faster rate in the opposite direction to the direction of transmission of the repeated first data frame. Therefore, when the second lossless ring network switch 100-3 receives the blocking packet first, because the switch 100-3 has already received the blocking packet including the routing information of the original data frame, when receiving the copy of the first data frame again, the routing decision unit 112 will determine that the switch has already forwarded the data frame and discard the repeated data frame at the third lossless ring network switch 100-3, thereby eliminating the repeated first data frame being forwarded by the third lossless ring network switch 100-3 to the link channel between the third lossless ring network switch 100-3 and the second lossless ring network switch 100-2, thereby shortening the time that the repeated first data frame occupies the transmission channel, and thus improving the ring network utilization efficiency.
The basic principles of the present disclosure have been described in connection with specific embodiments, but it should be noted that it will be understood by those skilled in the art that all or any of the steps or components of the method and apparatus of the present disclosure may be implemented in any computing device (including processors, storage media, etc.) or network of computing devices, in hardware, firmware, software, or a combination thereof, which can be implemented by those skilled in the art using their basic programming skills after reading the description of the present disclosure.
Thus, the objects of the present disclosure may also be achieved by running a program or a set of programs on any computing device. The computing device may be a general purpose device as is well known. Thus, the object of the present disclosure can also be achieved merely by providing a program product containing program code for implementing the method or apparatus. That is, such a program product also constitutes the present disclosure, and a storage medium storing such a program product also constitutes the present disclosure. It is to be understood that the storage medium may be any known storage medium or any storage medium developed in the future.
It is also noted that in the apparatus and methods of the present disclosure, it is apparent that individual components or steps may be disassembled and/or re-assembled. These decompositions and/or recombinations are to be considered equivalents of the present disclosure. Also, the steps of executing the series of processes described above may naturally be executed chronologically in the order described, but need not necessarily be executed chronologically. Some steps may be performed in parallel or independently of each other.
The above detailed description should not be construed as limiting the scope of the disclosure. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the scope of protection of the present disclosure.
Claims (9)
1. A lossless ring network switch comprising:
one or more device ports;
a pair of network link ports
The switching logic unit learns the source MAC address in the data frame from the network link port based on a source MAC address learning mechanism and forms an MAC address table; and
a routing logic component including a data reorganizing unit that learns a source lossless ring network switch ID included in a routing protocol in a data frame transmitted from one of the network link ports and forms a source lossless ring network switch ID table in a ring network, an ID learning unit that searches a locally located source lossless ring network switch ID table based on a destination MAC address in the data frame for the data frame transmitted from the switching logic unit to acquire a destination switch ID corresponding to the destination MAC and adds a routing protocol including the acquired destination switch ID, the local switch ID, and a data frame sequence number generated based on the source switch ID and a routing protocol added for stripping the data frame transmitted from the network link port, and a routing decision unit that changes the destination switch ID included in the routing protocol from the local switch ID and the data frame sequence number The unregistered data frame is routed only to a network link port direction opposite to a network link port that receives the data frame, the data frame whose destination switch ID contained in the routing protocol is a local switch ID and whose frame sequence number is not registered is routed to a data reassembly unit direction of the local lossless ring network switch, and the data frame whose frame sequence number has been registered is discarded.
2. The lossless ring network switch of claim 1, wherein the data reassembly unit sends the data frame to the switching logic unit after stripping the routing protocol added to the data frame when the routing decision unit routes the data frame to the direction of the data reassembly unit of the local lossless ring network switch.
3. The lossless ring network switch according to claim 1 or 2, wherein the data reassembly unit reassembles a blocking packet mainly containing routing protocol data and a data frame sequence number without containing data contents based on a routing protocol of the received data frame in a case where the data frame from the network link port is a data frame which is not registered and a destination switch ID is a local switch ID, and the routing decision unit routes the blocking packet to a network link port direction opposite to the network link port which receives the data frame.
4. The lossless ring network switch of claim 3, wherein the routing decision unit determines whether the received data frame has been registered based on a source lossless ring network switch ID and a data sequence number included in the received data frame.
5. A lossless self-healing ring network comprising a plurality of lossless ring network switches according to any one of claims 1 to 4.
6. A lossless looped network data communication method comprises the following steps:
a first data frame sent by a first user equipment from a user equipment port of a first lossless ring network switch through a first switching logic unit;
a first data recombination unit of a first lossless ring network switch acquires a destination lossless ring network switch ID corresponding to a destination MAC by adopting a Hash algorithm based on a destination MAC address in a first data frame and a source lossless ring network switch ID table in the first lossless ring network switch, adds a routing protocol containing the acquired destination lossless ring network switch ID, the first lossless ring network switch ID and a data frame serial number generated based on the first lossless ring network switch ID for the first data frame, and copies the first data frame after the protocol is added;
a first routing decision unit of a first lossless loop network switch routes the first data frame and a copy thereof to a pair of network link port directions of the first lossless loop network switch respectively;
when a second ID learning unit of at least one second lossless looped network switch receives a first data frame from first user equipment through one of the paired network link ports, based on a source address learning mechanism, learning a first lossless looped network switch ID contained in a routing protocol of the first data frame and forming a source lossless looped network switch ID table in a looped network; and
the second routing decision unit of the at least one second lossless ring network switch, upon receiving the first data frame from the first user equipment through one of its paired network link ports, routes the first data frame, which is included in the routing protocol and whose destination switch ID is not the local switch ID and whose data frame sequence number is not registered, only to the direction of the network link port opposite to the network link port that received the first data frame, routes the first data frame, which is included in the routing protocol and whose destination lossless ring network switch ID is the second lossless ring network switch ID and whose data frame sequence number is not registered, to the direction of the second data reassembly unit of the second lossless ring network switch, and discards the first data frame, whose frame sequence number has been registered.
7. The lossless ring network data communication method according to claim 6, further comprising:
when the second routing decision unit routes the first data frame to the second data recombination unit, the second data recombination unit strips the routing protocol added in the first data frame and then sends the routing protocol to the second switching logic unit of the second lossless ring network switch.
8. The lossless ring network data communication method according to claim 6 or 7, further comprising:
as the second routing decision unit routes the first data frame with the destination lossless ring network switch ID as the second lossless ring network switch ID to the direction of the second data reorganization unit, the second data reorganization unit reorganizes a blocking packet mainly containing routing protocol data and a data frame sequence number but not containing substantial data content based on the routing protocol of the received first data frame, and routes the blocking packet to the direction of the network link port opposite to the network link port receiving the first data frame.
9. The lossless ring network data communication method according to claim 8, further comprising:
the second ID learning unit registers the data frame sequence number of the first data frame in the data frame sequence number registration table in association with the first lossless network switch ID when the data frame sequence number of the first data frame is not registered.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710357928.9A CN107395479B (en) | 2017-05-19 | 2017-05-19 | Lossless ring network switch, lossless self-healing ring network and data communication method thereof |
| PCT/CN2018/087331 WO2018210312A1 (en) | 2017-05-19 | 2018-05-17 | Lossless ring network switch, lossless self-healing ring network, and data communication method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710357928.9A CN107395479B (en) | 2017-05-19 | 2017-05-19 | Lossless ring network switch, lossless self-healing ring network and data communication method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107395479A CN107395479A (en) | 2017-11-24 |
| CN107395479B true CN107395479B (en) | 2019-12-31 |
Family
ID=60338927
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710357928.9A Active CN107395479B (en) | 2017-05-19 | 2017-05-19 | Lossless ring network switch, lossless self-healing ring network and data communication method thereof |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107395479B (en) |
| WO (1) | WO2018210312A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395479B (en) * | 2017-05-19 | 2019-12-31 | 闫晓峰 | Lossless ring network switch, lossless self-healing ring network and data communication method thereof |
| CN108600097B (en) * | 2018-04-20 | 2020-09-22 | 闫晓峰 | Communication equipment capable of transmitting data in multiple paths, data communication network system and data communication method |
| CN112422236A (en) * | 2020-11-20 | 2021-02-26 | 广东电网有限责任公司佛山供电局 | Ethernet data transmission method and system based on format modification strategy |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101577711A (en) * | 2009-06-17 | 2009-11-11 | 上海吉盛网络技术有限公司 | Method for realizing network security platform of IP software router by utilizing VLAN technology |
| CN102594668A (en) * | 2012-02-03 | 2012-07-18 | 福建星网锐捷网络有限公司 | Message forwarding method, device and exchange equipment |
| CN105978652A (en) * | 2016-04-27 | 2016-09-28 | 刘巍 | Synchronous time comparing equipment of redundant Ethernet, system and method thereof |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5158369B2 (en) * | 2006-05-09 | 2013-03-06 | 日本電気株式会社 | Communication system, node, terminal, communication method, and program |
| CN107395479B (en) * | 2017-05-19 | 2019-12-31 | 闫晓峰 | Lossless ring network switch, lossless self-healing ring network and data communication method thereof |
-
2017
- 2017-05-19 CN CN201710357928.9A patent/CN107395479B/en active Active
-
2018
- 2018-05-17 WO PCT/CN2018/087331 patent/WO2018210312A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101577711A (en) * | 2009-06-17 | 2009-11-11 | 上海吉盛网络技术有限公司 | Method for realizing network security platform of IP software router by utilizing VLAN technology |
| CN102594668A (en) * | 2012-02-03 | 2012-07-18 | 福建星网锐捷网络有限公司 | Message forwarding method, device and exchange equipment |
| CN105978652A (en) * | 2016-04-27 | 2016-09-28 | 刘巍 | Synchronous time comparing equipment of redundant Ethernet, system and method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2018210312A1 (en) | 2018-11-22 |
| CN107395479A (en) | 2017-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110301120B (en) | Stream classification device, method and system | |
| US9602428B2 (en) | Method and apparatus for locality sensitive hash-based load balancing | |
| US9215171B2 (en) | Hashing-based routing table management | |
| CN105049359A (en) | Technologies for distributed routing table lookup | |
| US10608866B2 (en) | Forwarding Ethernet packets | |
| US9660938B2 (en) | Two-stage port-channel resolution in a multistage fabric switch | |
| JP6437693B2 (en) | Multicast data packet forwarding | |
| US20140269720A1 (en) | Scalable infiniband packet-routing technique | |
| US10855480B2 (en) | Systems and methods for processing packets in a computer network | |
| US10397116B1 (en) | Access control based on range-matching | |
| US9369293B2 (en) | Compressing singly linked lists sharing common nodes for multi-destination group expansion | |
| US20160006583A1 (en) | Control apparatus, communication system, switch control method and program | |
| CN107395479B (en) | Lossless ring network switch, lossless self-healing ring network and data communication method thereof | |
| JP6488426B2 (en) | Multicast data packet forwarding | |
| US8179792B1 (en) | Packet de-duplication | |
| US10547547B1 (en) | Uniform route distribution for a forwarding table | |
| US11159427B2 (en) | Single lookup entry for symmetric flows | |
| US20150085704A1 (en) | Virtual stacking of switches | |
| EP3672167B1 (en) | Packet forwarding method and device | |
| US8923291B2 (en) | Communication apparatus and communication method | |
| US9898069B1 (en) | Power reduction methods for variable sized tables | |
| US8996798B1 (en) | Systems and methods for using TCAMs in network devices | |
| JP2013183397A (en) | Device and method for destination search for flow-by-flow packet transfer | |
| US20240291799A1 (en) | Packet processing for network security groups |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221130 Address after: 209, Building C-7, Dongsheng Science Park, Zhongguancun, No. 66, Xixiaokou Road, Haidian District, Beijing Patentee after: Beijing Enyitong Technology Development Co.,Ltd. Address before: Fremont Patentee before: Yan Xiaofeng |