Patent application number | Description | Published |
20080225697 | Computing repair path information - An apparatus and method is described for computing repair path information around a failure component in a data communications network having a components nodes and links therebetween. Where, according to a routing protocol, a node sends to a neighbor node a metric indicative of reachability of a destination node, the protocol requiring differentiated action by the node if the route to the destination node includes the neighbor node, the apparatus is arranged to compute a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus not requiring differentiated action relative to the apparatus. | 09-18-2008 |
20080225897 | Providing clock synchronization in a network - In one embodiment, an apparatus for providing clock synchronization in a packet-based network, the network having as components nodes and links therebetween and having a network topology, is arranged to compute a forward clock synchronization packet path to a synchronization destination from the network topology according to a computation rule such that the return path for a clock synchronization packet from the synchronization destination is the same as the forward path. | 09-18-2008 |
20080259923 | Forwarding data in a data communication network - An apparatus for forwarding data in a data communications network having as components nodes and links therebetween is described. The apparatus is arranged to forward data towards a destination on a label switched path and advertise in a label advertisement to nodes in the network in a label advertisement its label for the label switched path and its label for a repair label switched path for use in the event of non availability of a component in the network. The apparatus is further arranged to advertise to a remote node in the network in a label advertisement additional information for deriving repair label switched path information at the remote node. | 10-23-2008 |
20080310433 | Fast Re-routing in Distance Vector Routing Protocol Networks - In one embodiment, a method includes sending an adjacency discovery message | 12-18-2008 |
20100303091 | SYSTEM AND METHOD FOR DYNAMICALLY ASSIGNING VALUES IN A NETWORK - The embodiments described herein present methods and apparatus for dynamically assigning values in a network. A method includes receiving, at a designated value allocator from a network node, a first broadcast message using a link-state protocol. The method then identifies the first broadcast message as including a request to associate a parameter value to the network node and allocates an assigned parameter value to the network node based on the identification of the request included in the first broadcast message. A message that includes the assigned parameter value is then transmitted to the network node. Other embodiments are described. | 12-02-2010 |
20120044811 | CREATING BALANCED LINK-DISJOINT TOPOLOGIES IN A COMPUTER NETWORK - In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology. | 02-23-2012 |
20120275298 | Constructing A Transition Route In A Data Communications Network - A method is described of constructing a transition route in a data communication network having as components nodes and links. Upon receipt of a transition notification identifying a first component a non-neighboring node constructs a transition route around the first component. In an embodiment, a node performs detecting the first component transition; issuing a transition notification identifying the first component and recognizable by nodes configured to construct a transition route around the first component; and upon expiry of a notification transition period, issuing a transition advertisement recognizable by all nodes on the network. | 11-01-2012 |
20130088974 | Avoiding Micro-loops in a Ring Topology of a Network - In one embodiment, micro-loops are avoided in ring topologies of packet switching devices by changing the order of propagation of link state information concerning failed communications between a particular packet switching device and a neighbor packet switching device. In one embodiment, the particular packet switching device communicates link state information of a high cost of the particular communications (e.g., in the direction from particular to neighbor packet switching devices) such that this link state information will propagate towards the particular packet switching device from at least from the furthest packet switching device in the ring topology that is currently configured to forward packets having a destination address of the neighbor packet switching device through the particular packet switching device. | 04-11-2013 |
20130089097 | Forwarding IPv6 Packets based on Shorter Addresses Derived from Their IPv6 Destination Addresses - In one embodiment, a packet switching device is configured to convert an Internet Protocol Version 6 (IPv6) destination address, of a received particular IPv6 packet, to a second, shorter destination address. This second destination address is then used to determine forwarding information for the received IPv6 packet, which is forwarded accordingly. In one embodiment, this second address is a 32-bit address, and in particular, an Internet Protocol Version 4 (IPv4) address. Thus, one embodiment can use the IPv4 forwarding infrastructure of a packet switching device for determining how to forward IPv6 packets. In a network according to one embodiment, packets are encapsulated in an IPv6 packet using an IPv6 destination address (that can be converted to an IPv4 address) of an egress edge packet switching device. Thus, core packet switching devices can forward IPv6 packets using IPv4 lookup operations. | 04-11-2013 |
Patent application number | Description | Published |
20100238788 | Connection verification for MPLS label switched paths and pseudowires - In one embodiment, a connection verification (CV) message is initiated from an initiating maintenance end point (MEP) for an MPLS LSP, the CV message carried in a packet having a time-to-live (TTL) value of 1. Each maintenance intermediate point (MIP) along the MPLS LSP receives the packet and decrements the TTL, and in response to determining that the TTL equals 0, examines a payload of the packet to determine that the packet carries the CV message. The MIP may then append its MIP ID to a route record field of the payload having any previous MIP IDs of upstream MIPs, and forwards the CV message downstream along the MPLS LSP in a packet having a TTL value of 1. The end MEP receives the CV message, and sends a CV reply having the route record field with MIP IDs and an end MEP ID to the initiating MEP. | 09-23-2010 |
20120087280 | IDENTIFICATION OF DUAL PLANE TOPOLOGIES - In one embodiment, two neighboring nodes adjacent to each end-point node of a domain may be associated with a “dual” (a logical structure). A first of the two neighboring nodes may be placed into a first family (and group) of the dual, while a second of the two neighboring nodes may be placed into an opposing second family (and group). Augmentations may then be performed, recursively merging and connecting the duals and/or groups, as well as connecting unplaced nodes to particular duals, families, and groups, according to forced augmentations and/or unforced augmentations where no forced augmentations exist. In the end, it may be determined whether the domain supports dual plane topologies based on whether a solution having one resultant dual with a single group in each opposing family is reached from the recursive augmentations | 04-12-2012 |
20130148489 | CONNECTION VERIFICATION FOR MPLS LABEL SWITCHED PATHS AND PSEUDOWIRES - In one embodiment, a maintenance intermediate point (MIP) receives a packet traveling along a multi-protocol label switching (MPLS) label switched path (LSP) that extends from a first maintenance end point (MEP) to a second MEP. The receiving MIP decrements a time-to-live (TTL) value in a header of the packet. In response the TTL value in the header of the packet equaling a particular value, the receiving MIP examines an associated channel header (ACH) field in an operations, administration, and maintenance (OAM) message stored in a payload of the packet, and determines a particular OAM function to perform based on a code in the ACH field. The receiving MIP performs the particular OAM function. | 06-13-2013 |
Patent application number | Description | Published |
20090067322 | FORWARDING DATA IN A DATA COMMUNICATIONS NETWORK - In an embodiment, an apparatus for forwarding data in a data communications network having as components nodes and links therebetween comprises a network interface configured to couple to a data communications network having as components nodes and links therebetween; first logic which when executed is operable to receive a repair address; second logic which when executed is operable to compute a repair path from a repairing node to the repair address around a failure component on a primary forwarding path between the apparatus and a repairing node; and third logic which when executed is operable to propagate the repair address along a label switched path (LSP), comprising the repair path, to the repairing node. The apparatus offers improved efficiency in computing a repair path in a network around a failed component because unnecessary computations are not performed with the disclosed apparatus and approach. | 03-12-2009 |
20090067330 | COMPUTING PATH INFORMATION TO A DESTINATION NODE IN A DATA COMMUNICATION NETWORK - Approaches for computing path information to a destination node in a data communications network are described. A data communications network comprises as components nodes and links therebetween and comprising a core subdomain of components and a plurality of non-core subdomains of components and having a common identifier for each non-core subdomain. An apparatus comprises first logic which when executed is operable to receive reachability information for a destination node and an associated identifier; and second logic which when executed is operable to perform a computation of path information for a path in the network to a destination node dependent on a particular identifier of a subdomain associated with the destination node, and to forward data for the destination over the path according to the path information. | 03-12-2009 |
20120147736 | Minimizing the Number of Not-Via Addresses - In an embodiment, a method comprises determining a set of protected components that are associated with a notifying node; determining a single network repair address for the set of protected components, wherein the single network repair address is for use in response to unavailability of any of the protected components when transmitting network traffic to the notifying node; assigning the single network repair address to each of the protected components; wherein the notifying node is an internetworking device and wherein the method is performed by one or more processors. | 06-14-2012 |
20140169153 | MINIMIZING THE NUMBER OF NOT-VIA ADDRESSES - In an embodiment, a method comprises determining a set of protected components that are associated with a notifying node; determining a single network repair address for the set of protected components, wherein the single network repair address is for use in response to unavailability of any of the protected components when transmitting network traffic to the notifying node; assigning the single network repair address to each of the protected components; wherein the notifying node is an internetworking device and wherein the method is performed by one or more processors. | 06-19-2014 |