Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser. The register holds the attributes retrieved by the parser. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit supplies the key to a memory to look up a set of user-specified actions to be performed on data in the frame.

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser. The register holds the attributes retrieved by the parser. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit supplies the key to a memory to look up a set of user-specified actions to be performed on data in the frame.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation, such as Ethernet v2 encapsulation or 802.3 with or without one or more VLAN tags. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser. The register holds the attributes retrieved by the parser. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit supplies the key to a memory (which may be either in the integrated circuit i.e. on-chip or outside the integrated circuit i.e.

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser, to hold the attributes. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit uses the key to look up in memory a set of user-specified actions that are then performed on data in the frame.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: A data communication system dynamically selects timer durations to ensure delivery of data at a desired bit rate. A source or proxy source transmits data, such as streaming media, to a destination according to a dynamic bit rate timer, where the timer regulates the transmission frequency and/or the packet size of the data being transmitted. The timer dynamically adapts the transmission frequency or packet size according to the relative positioning of data pointers in a buffer and effectively changes the rate of data delivery. In this way, data may be delivered at the desired average bit rate to the destination despite network capacity fluctuations.

Abstract: An apparatus and method to provide a portable networking interface for distributed switching systems. Two Application Program Interfaces (APIs) are defined for communication to a Forwarding Database Distribution Library (FDDL). The FDDL sits between network client applications and the switch device driver in order to provide a uniform interface to the switch device driver. Towers may be added to the FDDL to provide additional functionality specific to certain client applications.

Abstract: An apparatus and method to provide a portable networking interface for distributed switching systems. Two Application Program Interfaces (APIs) are defined for communication to a Forwarding Database Distribution Library (FDDL). The FDDL sits between network client applications and the switch device driver in order to provide a uniform interface to the switch device driver. Towers may be added to the FDDL to provide additional functionality specific to certain client applications.

Abstract: Methods and systems for providing redundant network connectivity across a network using a tunneling protocol by dynamically moving a TLS tunnel between master and slave switches based on relative connectivity provided by the switches are disclosed. A standby routing protocol executes on the master and slave switches to monitor the relative connectivity. In response to detecting that the relative connectivity of the slave switch exceeds that of the master switch, the standby routing protocol reverses the roles of the master and slave switches, thus moving the TLS tunnel to the new master switch.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: When Internet Protocol (IP) packets or Layer-2 MAC Protocol packets are encapsulated in a MultiProtocol Label Switching (MPLS) packet, one or more labels are assigned to identify the routers of the MPLS network through which the packet has passed. From this information, the underlying protocol (e.g., IP, MAC) can be inferred. In one embodiment, the value assigned to the one or more labels is selected to identify the underlying protocol. In one embodiment, IP packets have label values in a first range and MAC packets have label values in a second range. When the MPLS-encapsulated packets are switched within a load sharing environment, the ranges of the label values indicate the underlying protocol of the packet being switched. Knowing the underlying protocol enables a hash function to be selected that will both preserve packet ordering and effectively load share traffic received from a higher-speed source link across multiple lower-speed links.

Abstract: A network switch receives a data packet, recognizes the data packet as belonging to a given stream, and directs the data packet to a stream processing module in the network switch in response to recognizing the stream to which the packet belongs. The stream processing module further recognizes the source of the stream from which the packet was transmitted, and stores the data packet in a buffer for later transmission, as controlled by the stream processing module, to a destination for the stream. In this way, the stream may be replicated and transmitted by the stream processing module any number of times to multiple destinations in an efficient, cost-effective manner.

Abstract: A working router is coupled to a SONET add-drop multiplexor (ADM) through a working line and a protection router is coupled to the ADM through a protection line. The routers are coupled to each other by a separate side-band connection and comprise a virtual router from the perspective of the neighboring router, which communicates with the virtual router over the SONET network using the Point-to-Point Protocol (PPP). The protection router transmits a heartbeat message to the working router over the side-band connection. If the protection router does not receive a response thereto, it initiates a line switch within the add-drop multiplexor. Once the line switch is complete, the protection router exchanges datagrams with the neighboring router, via the ADM and SONET ring to which the ADM is coupled. The protection router establishes a PPP connection between itself and the neighboring router device coupled to the SONET ring, utilizing the Link Control Protocol (LCP).

Abstract: Methods and systems for efficiently delivering data to multiple destinations in a computer network are disclosed. Data to be delivered to multiple destinations is stored in memory. The stored data is divided into blocks. Checksums are pre-calculated for each block. Pre-calculated checksums are used to calculate the data checksums for data to be inserted in each packet to be delivered to data destinations.

Abstract: When Internet Protocol (IP) packets or Layer-2 MAC Protocol packets are encapsulated in a MultiProtocol Label Switching (MPLS) packet, one or more labels are assigned to identify the routers of the MPLS network through which the packet has passed. From this information, the underlying protocol (e.g., IP, MAC) can be inferred. In one embodiment, the value assigned to the one or more labels is selected to identify the underlying protocol. In one embodiment, IP packets have label values in a first range and MAC packets have label values in a second range. When the MPLS-encapsulated packets are switched within a load sharing environment, the ranges of the label values indicate the underlying protocol of the packet being switched. Knowing the underlying protocol enables a hash function to be selected that will both preserve packet ordering and effectively load share traffic received from a higher-speed source link across multiple lower-speed links.

Abstract: Methods and systems for providing redundant network connectivity across a network using a tunneling protocol by dynamically moving a TLS tunnel between master and slave switches based on relative connectivity provided by the switches are disclosed. A standby routing protocol executes on the master and slave switches to monitor the relative connectivity. In response to detecting that the relative connectivity of the slave switch exceeds that of the master switch, the standby routing protocol reverses the roles of the master and slave switches, thus moving the TLS tunnel to the new master switch.