Patent application number | Description | Published |
20080267180 | Stacked tagging for broadcasting through hierarchy of meshes - One embodiment relates to a method of processing a broadcast packet by a switch. If the packet is received from another switch within a same mesh, then the packet is flooded to appropriate destination ports based on a flood map corresponding to an existing mesh tag in the packet. If the packet is received from an end node, then a new mesh tag is added to the packet and then the packet is flooded to appropriate destination ports based on a flood map corresponding to the new mesh tag in the packet. If the packet is received from a meta mesh, then an existing meta-mesh tag is stripped from the packet, a mesh tag in the packet is modified, and the packet is flooded to appropriate destination ports based on a flood map corresponding to the modified mesh tag in the packet. Other embodiments, aspects and features are also disclosed. | 10-30-2008 |
20100142371 | Loadbalancing network traffic across multiple remote inspection devices - Methods of balancing network packet traffic among multiple checking functionalities (CFs) are described. A network has at least one client operatively connected to at least one source switch and multiple available CFs operatively connected to at least one destination switch. Each available CF has predetermined, but possibly different inspection capabilities. A source switch receiving packets from a client inspects each packet and can optionally choose an available CF having at least the minimum necessary inspection capabilities to inspect the particular packet, and tunnel the packet to the chosen CF. | 06-10-2010 |
20110231933 | LOADBALANCING NETWORK TRAFFIC ACROSS MULTIPLE REMOTE INSPECTION DEVICES - An apparatus includes a checking functionality (CF) for processing data packets in a computer network that comprises a plurality of CFs. The CF includes an interface for communication with one or more source switches that route data packets to the CF for processing, a packet processing capability for processing the data packets, and logic for communicating data regarding the packet processing capability to the source switch through the interface. | 09-22-2011 |
20130024541 | SENDING REQUEST MESSAGES TO NODES INDICATED AS UNRESOLVED - Techniques are provided for sending request messages to destination nodes. Destination nodes may be indicated as unresolved. Request messages are sent to destination nodes indicated as unresolved. | 01-24-2013 |
20130028266 | RESPONSE MESSAGES BASED ON PENDING REQUESTS - Techniques are provided for sending response messages based on pending requests. A request message identifying a data packet may be received. A pending request structure may be used to determine output queues that are in need of the data packet identified in the request message. A response message may be sent indicating if the request message is being refused based on the output queues. | 01-31-2013 |
20130111062 | DETERMINATION OF A LOWEST COST PATH BETWEEN NODES | 05-02-2013 |
20130128893 | METHOD AND SYSTEM FOR SLIDING WINDOW PROCESSING OF A DATAGRAM - A method for sliding window processing of a datagram split into packets, may include processing entire strings of adjacent consecutive packets of the datagram regardless the order of the packets using parallel processors. The method may also include processing adjacent ends of the strings of the adjacent consecutive packets while maintaining the order of the adjacent ends to correspond to the order of the consecutive packets. | 05-23-2013 |
20130290649 | FORWARD COUNTER BLOCK - A forward counter block may include at least one of a plurality of local counter storage elements for counting events. The forward counter block may also include an update engine, the update engine configured to update an external memory by forwarding a value stored in any of said at lease one of a plurality of local counter storage elements and return a zero value to that local counter storage element, when the value stored in that local counter storage element reaches or surpasses a threshold value. | 10-31-2013 |
20130294448 | METHODS FOR HANDLING CONFLICTS IN A MULTICAST ROUTING ELECTION - A method for handling of conflicts in a multicast routing election in a multicast network is described herein. The multicast network includes a plurality of multicast network devices. A conflict is detected in a Designated Forwarder (DF) election for a link. | 11-07-2013 |
20130315090 | METHODS FOR CONTROLLING ELECTIONS IN A MULTICAST NETWORK - Methods for controlling a Designated Forwarder (DF) election in a multicast network are described herein. The multicast network includes a plurality of multicast network devices, including a first network device and a second network device. A Designated Forwarder is determined. It is determined whether to initiate a Designated Forwarder election based on a comparison of a metric measuring a distance to a Rendezvous Point Address from a first network device and a metric measuring the distance to the Rendezvous Point Address from the second network device. | 11-28-2013 |
20140095783 | PHYSICAL AND LOGICAL COUNTERS - Techniques for reducing a number of physical counters are provided. Logical counters may be associated with physical counters. The number of logical counters may be less than the number of physical counters. It may be determined if an association of a logical counter to a physical counter exists already. If not, a new association may be created. The physical counter associated with the logical counter may then be updated. | 04-03-2014 |
20140344934 | BLOOM FILTER WITH MEMORY ELEMENT - Techniques are provided for determining if an element is contained in a set of elements. In one aspect, an element may be received and inserted into a bloom filter. The element may also be inserted into a memory associative on the bloom filter indexes. In another aspect, a search element may be received and compared to a bloom filter. If the search element is included in the bloom filter, a memory may be used to determine if the search element is included in the set of elements. | 11-20-2014 |
20140372628 | COUNTER UPDATE REMOTE PROCESSING - According to an example, a counter update determination module may receive a counter address for a local counter and map the counter address to a specific forwarding mode of a plurality of forwarding modes. In addition, a remote processing module may receive a posted value associated with the local counter. The remote processing module may include a plurality of forwarding engines respectively associated with a mapped forwarding mode. A forwarding engine of the plurality of forwarding engines may be selected based on the mapped forwarding mode, and the selected forwarding engine may forward the posted value to a remote device for remote processing. | 12-18-2014 |
20140372691 | COUNTER POLICY IMPLEMENTATION - According to an example, a counter policy implementation apparatus may include a policy determination module to receive a counter address for a local counter and to map the counter address to a specific policy of a plurality of policies, and a policy application module to receive a posted value and a double data rate (DDR) value associated with the local counter. The policy application module may include a comparator to compare the posted value or the DDR value with a maximum value associated with the local counter specified in the mapped policy, and an action block to perform an action specified by the mapped policy based on the comparison. | 12-18-2014 |