Patent application number | Description | Published |
20080240118 | Sending Routing Protocol Data on a Multi-Access Network Segment - In one embodiment, a method includes setting a re-flood time to a non-zero first value. Update data that indicates a change to link data is received over a network interface from an updating node of multiple nodes on a multi-access segment connected to the interface. The change is to link data that indicates links on the updating node. It is determined whether an acknowledgment message is not received within the re-flood time from a particular node of the multiple nodes. If an acknowledgment message is not received within the re-flood time, then a multicast packet directed to the multiple nodes and including the change to the link data is sent over onto the segment. This method enables rapid response to failure of a primary node designated to ensure reliable flooding of link data. | 10-02-2008 |
20090052452 | SIGNALING COMPRESSION INFORMATION USING ROUTING PROTOCOLS - An ability to compress packets is announced from a customer edge router (CE) to other CEs through a routing protocol packet. An announcement of that ability is received from another CE through a routing protocol packet. A compression technique is then matched. The CE receives compression information from the other CE in a routing protocol packet, and determines that a compression technique identified therein matches any compression technique the CE is programmed to use. The CE then flags packets transmitted from/received by the CE to be compressed/decompressed according to the matched compression technique. Alternatively, the CE may match by transmitting compression information identifying a compression technique to the another CE in a routing protocol packet; the another CE receives the routing protocol packet and determines that a compression technique identified in the compression information of the routing protocol packet matches any compression technique the another CE is programmed to use. | 02-26-2009 |
20090168682 | HOST ROUTE CONVERGENCE - In one embodiment, detecting a host device on a port of a forwarder switch in a network, detecting a movement of the host device from a first forwarder switch to a second forwarder switch, and multicast broadcasting an updated device information for the host device to a convergence group switches and a proximity group switches, where the convergence group switches includes switches in the network that are not configured as forwarder switches, and the proximity group switches include forwarder switches grouped together based on radio proximity is provided. | 07-02-2009 |
20090172156 | ADDRESS SECURITY IN A ROUTED ACCESS NETWORK - In one embodiment, providing multi-layer address security incorporating Layer 2 Media Access Control (MAC) addresses and corresponding Layer 3 Internet Protocol (IP) addresses for host machines on a routed access network is provided. | 07-02-2009 |
20090172190 | LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT - In one example embodiment, a system and method are shown that includes calculating a first SPF tree for a first device, the first SPF tree including a root node and a first child node, the first device being the root node of the first SPF tree. Additionally, the system and method may include calculating a second SPF tree for a second device that is a neighbor of the first device, the second SPF tree including a root node and a first child node, the second device being the root node of the second SPF tree. Further, the system and method may include building a set of interested nodes including the second device, if the first child node if the first SPF tree and the first child node of the second SPF tree are distinct. | 07-02-2009 |
20100049868 | Maintaining protocol adjacency state with forwarding failure - In one embodiment, a method generally includes establishing a routing protocol peer relationship and a Bidirectional Forwarding Detection (BFD) session with a neighbor node, receiving a DOWN BFD event signal from the neighbor node, and maintaining a routing protocol adjacency down state following successful exchange of routing protocol packets with the neighbor node. An apparatus for maintaining protocol adjacency state with a forwarding failure is also disclosed. | 02-25-2010 |
20100061269 | Differentiated services for unicast and multicast frames in layer 2 topologies - In one embodiment, a method includes receiving information on layer 2 topologies at a network device in a core network, mapping one or more Virtual Local Area Networks (VLANs) to the layer 2 topologies to provide differentiated services in said layer 2 topologies, defining multiple paths for each of the layer 2 topologies, and forwarding a packet received at the network device on one of the multiple paths. An apparatus for providing differentiated services in layer 2 topologies is also disclosed. | 03-11-2010 |
20110038257 | METHOD AND APPARATUS FOR SEQUENCING OPERATIONS FOR AN INCOMING INTERFACE CHECK IN DATA CENTER ETHERNET - In one embodiment, a method includes obtaining an indication that a state associated with a node is to be changed and preventing data from being received on a first link. The method also includes updating at least one selected from a group including an incoming interface check (IIC) table and an outgoing interface (OIF) table to reflect the state. The state indicates that a second link is to be activated. Finally, the method includes allowing the data to be received on the second link after updating either or both the IIC table and the OIF table and after the timer duration for the NULL value for IIC has expired. | 02-17-2011 |
20120213117 | SYSTEM AND METHOD FOR INTELLIGENTLY MAINTAINING CONNECTIVITY IN A NETWORK ENVIRONMENT - A method is provided in one example embodiment and includes establishing a communication pathway between a first network node and a second network node coupled to a network; forming an adjacency to a new network node coupled to the network, where a designated intermediate system (DIS) election operation is executed after the adjacency is formed in order to determine that the new network node is a newly identified DIS for the network; and communicating a message advertising connectivity to both a previously identified DIS and the newly identified DIS, where the message is communicated during a specified time interval. | 08-23-2012 |
20120275347 | DIFFERENTIATED SERVICES FOR UNICAST AND MULTICAST FRAMES IN LAYER 2 TOPOLOGIES - In one embodiment, a method includes receiving information on layer 2 topologies at a network device in a core network, mapping one or more Virtual Local Area Networks (VLANs) to the layer 2 topologies to provide differentiated services in said layer 2 topologies, defining multiple paths for each of the layer 2 topologies, and forwarding a packet received at the network device on one of the multiple paths. An apparatus and logic for providing differentiated services in layer 2 topologies is also disclosed. | 11-01-2012 |
20140003228 | Optimizations in Multi-Destination Tree Calculations for Layer 2 Link State Protocols | 01-02-2014 |
20140043956 | Techniques for Flooding Optimization for Link State Protocols in a Network Topology - Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network. | 02-13-2014 |
20140086043 | System and Method for Maintaining Connectivity in a Single-Hop Network Environment - A method is provided in one example embodiment and includes receiving a first pseudo-node identifier associated with a first network node via a network. The first pseudo-node identifier is generated by the first network node in a first designated intermediate system (DIS) operation. The method further includes detecting a loss of connectivity to the first network node, and receiving a second pseudo-node identifier associated with a second network node via the network. The second pseudo-node identifier is generated by the second network node in a second DIS operation. The method further includes executing a first network path determination operation using the first pseudo-node identifier and the second pseudo-node identifier when an elapsed time between the detecting of the loss of connectivity with the first network node and the executing of the first network path determination operation is within a predetermined threshold. | 03-27-2014 |
20140269410 | Efficient Flooding of Link State Packets for Layer 2 Link State Protocols - Techniques are provided for generating and updating flooding tree paths in a network. At a particular node device in a network, a first flooding tree is generated by performing a first shortest path first (SPF) operation from a first selected node device in the network to a plurality of other node devices in the network. A second flooding tree is generated by performing a second SPF operation from a second selected node device in the network to the plurality of other node devices in the network. A network topology change event is detected in either the first or second flooding tree, and a packet sequence exchange is initiated between the particular node device and another node device in the network in response to the detected network topology change. The first and second flooding trees are then updated based on information obtained during the packet sequence exchange. | 09-18-2014 |