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: 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: 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: 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: 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: A method for providing redundancy to an Asynchronous Transfer Mode (ATM) emulated local-area network (LAN) is disclosed. The ATM emulated LAN is served by a primary LAN Emulation Server, a Broadcast and Unknown Server (LES/BUS), and a LAN Emulation Configuration Server (LECS). A backup LES/BUS is coupled to the ATM emulated LAN. A logical redundancy virtual channel connection (VCC) is then established between the primary LES/BUS and the backup LES/BUS. When the redundancy VCC is present between the primary LES/BUS and the backup LES/BUS, the backup LES/BUS is placed in a dormant mode. However, when the redundancy VCC is absence between the primary LES/BUS and the backup LES/BUS, the backup LES/BUS is activated to serve any request generated by the ATM emulated LAN.

Abstract: A method for providing a security mechanism to an Asynchronous Transfer Mode (ATM) emulated local-area network (LAN) is disclosed. The ATM emulated LAN is served by a LAN Emulation Server (LES), a Broadcast and Unknown Server (BUS), and a LAN Emulation Configuration Server (LECS). After receiving a LE_JOIN_REQUEST from an LE client within the emulated LAN, the LES forms a LE_CONFIGURE_REQUEST on behalf of the LE client, by utilizing the information from the LE_JOIN_REQUEST. The LES then sends the LE_CONFIGURE_REQUEST to the LECS. In turn, the LECS sends back a LE_CONFIGURE_RESPONSE to the LES. After receiving the LE_CONFIGURE_RESPONSE from the LECS, a determination is made as to whether or not a status field within the LE_CONFIGURE_RESPONSE indicates a success and a target ATM address field within the LE_CONFIGURE_RESPONSE contains an ATM address of the LES.

Abstract: Provided are a method and system for use within at least one network wherein broadcast occurs. The method and system achieve their objects as follows. In response to reception of a data frame with at least one destination indicator ordinarily requiring broadcast to a first defined group of stations, at least one attribute of the received data frame is examined. In response to the step of examining, the received data frame is transmitted to a defined second group of stations, smaller in number than the first group of stations.