Claims:1. A method for sub-second convergence in a redundant network, said method comprising the steps of:
establishing a unique aggregated link between a switch and a peer switch;
exchanging a configuration database comprising port identity information between said switch and said peer switch;
transmitting data packets in the form of one or more tagged packets to said unique aggregated link; and
processing said one or more tagged packets through said unique aggregated link, wherein said processing avoids transmitting of said one or more tagged packets back to the corresponding receiving port.
2. The method as claimed in claim 1, wherein prior to traffic flow, an initialization message is shared between said switch and said peer switch.
3. The method as claimed in claim 1, wherein said database comprises port identity information regarding forwarding mode and non-forwarding mode of each port in said switch and said peer switch.
4. The method as claimed in claim 1, wherein said port identity information comprises identity tagged to one or more ports of said switch and said peer switch.
5. The method as claimed in claim 4, wherein said one or more ports connected to any one of same end system or switch is configured with same identity, and wherein each edge port across said switch and said peer switch is configured with same identity.
6. The method as claimed in claim 1, wherein traffic in the network is forwarded through the ports in the forwarding mode, and wherein said traffic is restricted to the ports in the non-forwarding mode.
7. The method as claimed in claim 1, wherein said network is recovered in sub-second time duration.
8. The method as claimed in claim 1, wherein an event message is generated upon detection in link failure in any of said port of said switch or said peer switch,
9. The method as claimed in claim 8, wherein after generation of said event message, identity information of any of said port is transmitted to any of said switch or said peer switch.
10. The method as claimed in claim 1, wherein said switch and said peer switch are operatively coupled through said unique aggregated link to act as a single virtual switch.
, Description:TECHNICAL FIELD
[1] The present disclosure relates generally to efficient convergence in a network. In particular, the present disclosure relates to sub-second convergence in a redundant network.

BACKGROUND
[2] Background description includes information that may be useful in understanding the present invention. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed invention, or that any publication specifically or implicitly referenced is prior art.
[3] Typically, in conventional switching of network at layer 2 in OSI model, there are usually ‘n’ layers of switches packets that are forwarded to a particular switch by knowledge of the destination MAC addresses. In order to provide efficient functioning in the network, redundant switches are usually employed. However, when conventional L2 forwarding method is employed in the network, it could lead to formation of loops in the network that could eventually lead to broadcast storm, which is undesirable.
[4] Typically, to avoid the formation of loops in a network, a general standard protocol such as Spanning Tree Protocol (STP) is used. Although spanning tree algorithm avoids the formation of loops, however, the convergence time is not as fast as required for some critical applications.
[5] There is, therefore, a requirement in the art for a means to provide faster convergence time in a redundant network while addressing the issues related to loop formation and fault tolerance.
[6] All publications herein are incorporated by reference to the same extent as if each individual publication or patent application were specifically and individually indicated to be incorporated by reference. Where a definition or use of a term in an incorporated reference is inconsistent or contrary to the definition of that term provided herein, the definition of that term provided herein applies and the definition of that term in the reference does not apply.
[7] In some embodiments, the numbers expressing quantities or dimensions of items, and so forth, used to describe and claim certain embodiments of the invention are to be understood as being modified in some instances by the term “about.” Accordingly, in some embodiments, the numerical parameters set forth in the written description and attached claims are approximations that can vary depending upon the desired properties sought to be obtained by a particular embodiment. In some embodiments, the numerical parameters should be construed in light of the number of reported significant digits and by applying ordinary rounding techniques. Notwithstanding that the numerical ranges and parameters setting forth the broad scope of some embodiments of the invention are approximations, the numerical values set forth in the specific examples are reported as precisely as practicable. The numerical values presented in some embodiments of the invention may contain certain errors necessarily resulting from the standard deviation found in their respective testing measurements.
[8] As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
[9] The recitation of ranges of values herein is merely intended to serve as a shorthand method of referring individually to each separate value falling within the range. Unless otherwise indicated herein, each individual value is incorporated into the specification as if it were individually recited herein. All methods described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g. “such as”) provided with respect to certain embodiments herein is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention otherwise claimed. No language in the specification should be construed as indicating any non-claimed element essential to the practice of the invention.
[10] Groupings of alternative elements or embodiments of the invention disclosed herein are not to be construed as limitations. Each group member can be referred to and claimed individually or in any combination with other members of the group or other elements found herein. One or more members of a group can be included in, or deleted from, a group for reasons of convenience and/or patentability. When any such inclusion or deletion occurs, the specification is herein deemed to contain the group as modified thus fulfilling the written description of all groups used in the appended claims.

OBJECTS
[11] A general object of the present disclosure is to provide a method for sub-second convergence in a redundant network.
[12] Another object of the present disclosure is to provide a method that avoids loop formation in a network.
[13] Another object of the present disclosure is to provide a method that handles load balancing of traffic.
[14] Another object of the present disclosure is to provide a method that provides a solution for fault tolerance in a network.

SUMMARY
[15] The present disclosure relates to a method for sub-second convergence in a redundant network.
[16] In an aspect, the present disclosure provides a method for sub-second convergence in a redundant network. The method comprises the steps of establishing a unique aggregated link between a switch and a peer switch, exchanging a configuration database comprising port identity information between the switch and the peer switch, transmitting data packets from the network in the form of one or more tagged packets through the unique aggregated link, and processing the one or more tagged packets through the unique aggregated link, wherein the processing avoids transmitting of the one or more tagged packets back to the corresponding receiving port.
[17] In an embodiment, prior to traffic flow, an initialization message is shared between the switch and the peer switch.
[18] In an embodiment, the database comprises port identity information regarding forwarding mode and non-forwarding mode of each port in the switch and the peer switch.
[19] In an embodiment, the port identity information comprises identity tagged to one or more ports of the switch and the peer switch.
[20] In an embodiment, the one or more ports connected to any one of same end system or switch is configured with same identity, and wherein each edge port across the switch and the peer switch is configured with same identity.
[21] In an embodiment, the traffic in the network is forwarded through the ports in the forwarding mode and the traffic is restricted to the ports in the non-forwarding mode.
[22] In an embodiment, the network is recovered in sub-second time duration.
[23] In an embodiment, an event message is generated upon detection in link failure in any of the port of the switch or the peer switch. After generation of the event message, identity information of any of said port is transmitted to any of the switch or the peer switch.
[24] In an embodiment, the switch and the peer switch are operatively coupled through the unique aggregated link to act as a single virtual switch.
[25] Various objects, features, aspects and advantages of the inventive subject matter will become more apparent from the following detailed description of preferred embodiments, along with the accompanying drawing figures in which like numerals represent like components.

BRIEF DESCRIPTION OF DRAWINGS
[26] The accompanying drawings are included to provide a further understanding of the present invention and are incorporated in and constitute a part of this specification. The drawings illustrate exemplary embodiments of the present invention and, together with the description, serve to explain the principles of the present invention.
[27] FIG. 1 illustrates an exemplary flow diagram for a method 100 for forwarding the traffic in case of unicast traffic received on a port of the switch having unique aggregated link with the peer switch, in accordance with an embodiment of the present disclosure.
[28] FIG. 2 illustrates a exemplary flow diagram for a method 200 for forwarding the traffic in case of multicast traffic received on a port of the switch having unique aggregated link with the peer switch, in accordance with an embodiment of the present disclosure.
[29] FIG. 3 illustrates a flow diagram 300 for configuration, DB creation or update, and exchange of different type of messages, for protocol in accordance with the present disclosure.

DETAILED DESCRIPTION
[30] The following is a detailed description of embodiments of the disclosure depicted in the accompanying drawings. The embodiments are in such detail as to clearly communicate the disclosure. However, the amount of detail offered is not intended to limit the anticipated variations of embodiments; on the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present disclosure as defined by the appended claims.
[31] If the specification states a component or feature “may”, “can”, “could”, or “might” be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic.
[32] As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
[33] Exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments are shown. These exemplary embodiments are provided only for illustrative purposes and so that this disclosure will be thorough and complete and will fully convey the scope of the invention to those of ordinary skill in the art. The invention disclosed may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Various modifications will be readily apparent to persons skilled in the art. The general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Moreover, all statements herein reciting embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure). Also, the terminology and phraseology used is for the purpose of describing exemplary embodiments and should not be considered limiting. Thus, the present invention is to be accorded the widest scope encompassing numerous alternatives, modifications and equivalents consistent with the principles and features disclosed. For purpose of clarity, details relating to technical material that is known in the technical fields related to the invention have not been described in detail so as not to unnecessarily obscure the present invention.
[34] The use of any and all examples, or exemplary language (e.g., “such as”) provided with respect to certain embodiments herein is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention otherwise claimed. No language in the specification should be construed as indicating any non – claimed element essential to the practice of the invention.
[35] In an aspect, the present disclosure provides a method for sub-second convergence in a redundant network. The method comprises the steps of establishing a unique aggregated link between a switch and a peer switch, exchanging a configuration database comprising port identity information between the switch and the peer switch, transmitting data packets from the network in the form of one or more tagged packets through the unique aggregated link, and processing the one or more tagged packets through the unique aggregated link, wherein the processing avoids transmitting of the one or more tagged packets back to the corresponding receiving port.
[36] In an embodiment, prior to traffic flow, an initialization message is shared between the switch and the peer switch.
[37] In an embodiment, the database comprises port identity information regarding forwarding mode and non-forwarding mode of each port in the switch and the peer switch.
[38] In accordance with the present disclosure, the port identity information comprises identity tagged to one or more ports of the switch and the peer switch.
[39] In an embodiment, the one or more ports connected to any one of same end system or switch is provided with same identity, and each edge port across the switch and the peer switch is provided with same identity.
[40] In an embodiment, the switch and the peer switch are operatively coupled through the unique aggregated link to act as a single virtual switch.
[41] In an embodiment, the traffic in the network is forwarded through the ports in the forwarding mode. The traffic is restricted to the ports in the non-forwarding mode.
[42] In an embodiment, the network is recovered in sub-second time duration. This ensures relatively faster convergence time than the conventional methods.
[43] The method as per the present disclosure is possible to be used in different systems. In an embodiment, the method of the present disclosure is used in a unicast traffic based system. FIG. 1 illustrates an exemplary flow diagram for a method 100 for forwarding the traffic in the unicast traffic received on a port of the switch having unique aggregated link with the peer switch. The flow diagram depicts that the unicast traffic received on any port is searched by the MAC module, wherein the output port is searched for the respective identity. If the identity of the port is in forwarding mode, the traffic is pushed out otherwise the traffic is sent over unique aggregated link established between the switch and the peer switch, with tag same as identity of received port.
[44] A configuration database is exchanged comprising port identity information between the switch and the peer switch.
[45] In the next step, data packets from the network are transmitted in the form of one or more tagged packets through the unique aggregated link, and the one or more tagged packets are processed through the unique aggregated link, wherein the processing avoids transmitting of the one or more tagged packets back to the corresponding receiving port. By this strategy, loop is avoided.
[46] FIG. 2 illustrates a exemplary flow diagram for a method 200 for forwarding the traffic in case of multicast traffic received on a port of the switch having unique aggregated link with the peer switch, in accordance with an embodiment of the present disclosure. The flow diagram depicts that the multicast traffic received on any port is searched by the MAC module, wherein the output port is searched for the respective identity. If the identity of the port is in forwarding mode, the traffic is pushed out otherwise the traffic is sent over the unique aggregated link established between the switch and the peer switch, with tag same as identity of received port.
[47] A configuration database is exchanged comprising port identity information between the switch and the peer switch.
[48] In the next step, data packets from the network are transmitted in the form of one or more tagged packets through the unique aggregated link, and the one or more tagged packets are processed through the unique aggregated link, wherein the processing avoids transmitting of the one or more tagged packets back to the corresponding receiving port. By this strategy, loop is avoided.
[49] In an embodiment, an event message is generated upon detection in link failure in any of the port of the switch or the peer switch. In one embodiment, the link failure occurs in any of the port of the switch. In another embodiment, the link failure occurs in any of the port of the peer switch.
[50] After generation of the event message, identity information of any of said port is transmitted to any of the switch or the peer switch. As the mode of the identity changes, the traffic will be handled by the corresponding switch. By this strategy, sub second convergence is achieved, which in turn resolves the fault tolerance and redundancy in links.
[51] FIG. 3 illustrates a flow diagram 300 for configuration, DB creation or update, and exchange of different type of messages, for protocol in accordance with the present disclosure. Prior to traffic flow, initialisation packets are hand shaken. Upon receiving initialisation message, a database is created, maintained and exchanged periodically. Upon detection in link failure in any of the port of the switch and the peer switch, an event message is generated, followed by transmission of identity information of any of the port of the switch or the peer switch.
[52] It should be apparent to those skilled in the art that many more modifications besides those already described are possible without departing from the inventive concepts herein. The inventive patient matter, therefore, is not to be restricted except in the spirit of the appended claims. Moreover, in interpreting both the specification and the claims, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms “includes” and “including” should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, or utilized, or combined with other elements, components, or steps that are not expressly referenced. Where the specification claims refer to at least one of something selected from the group consisting of A, B, C ….and N, the text should be interpreted as requiring only one element from the group, not A plus N, or B plus N, etc. The foregoing description of the specific embodiments will so fully reveal the general nature of the embodiments herein that others can, by applying current knowledge, readily modify and/or adapt for various applications such specific embodiments without departing from the generic concept, and, therefore, such adaptations and modifications should and are intended to be comprehended within the meaning and range of equivalents of the disclosed embodiments. It is to be understood that the phraseology or terminology employed herein is for the purpose of description and not of limitation. Therefore, while the embodiments herein have been described in terms of preferred embodiments, those skilled in the art will recognize that the embodiments herein can be practised with modification within the spirit and scope of the appended claims.
[53] While the foregoing describes various embodiments of the invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof. The scope of the invention is determined by the claims that follow. The invention is not limited to the described embodiments, versions or examples, which are included to enable a person having ordinary skill in the art to make and use the invention when combined with information and knowledge available to the person having ordinary skill in the art.

ADVANTAGES
[54] The present disclosure provides a method for sub-second convergence in a redundant network.
[55] The present disclosure provides a method that avoids loop formation in a network.
[56] The present disclosure provides a method that handles load balancing of traffic.
[57] The present disclosure provides a method that provides a solution for fault tolerance in a network.
[58] The present disclosure provides a method wherein MAC table is not exchanged between the switches due to which the bandwidth utilized for this method by the unique aggregation link is minimal.