Patent application number | Description | Published |
20090201811 | Load Balancing Manipulation of Packet Flows Within a Transport Conduit - Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for load balancing manipulation of packet flows within a transport conduit (e.g., a tunnel, pseudo wire, etc.), typically using a load balancing value which is independent of standard routing-based parameters (e.g., source address, destination address, source port, destination port, protocol type, etc.). A load balancing value is included in encapsulated packets transported across a network using a transport conduit. This load balancing value can be used to load balance the individual flows/microflows within the transport conduit. | 08-13-2009 |
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 |
20110153869 | RECALIBRATION OF PRECISION CLOCKS IN A COMPUTER NETWORK - In one embodiment, a clock on a network device is initialized, and then a first timing message is received at the network device from a reference device having a first timestamp indicating when the first timing message was transmitted from the reference device. The network device may then determine and store a one-way delay from the first timestamp to a first time at which the first timing message was received at the network device. In response to restarting the clock, the network device may receive a second timing message from the reference device having a second timestamp indicating when the second timing message was transmitted from the reference device. The network device may then calibrate the clock such that a second time at which the network device received the second timing message is the second timestamp plus the stored one-way delay. | 06-23-2011 |
20120063450 | Data Path Processing Information included in the Pseudowire Layer of Packets - Data path processing information is included in the pseudowire layer of pseudowire packets in order to provide information for use in the data path processing of data (e.g., a packet), typically, but not always, included in the payload of the pseudowire packet itself. The pseudowire packet typically includes in corresponding fields: a pseudowire label for identifying a pseudowire type; a pseudowire control word; and payload data. The pseudowire type identifies the structure of the pseudowire control word field and the payload field, including the location of data path meta data, such as in the pseudowire control word field or payload field. This data path meta data identifies one or more attributes for use in processing the payload data. | 03-15-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 |
20140269714 | UNIVERSAL LABELS IN INTERNETWORKING - In an embodiment, a method comprises: receiving a data communications packet comprising one or more labels in a label stack; determining whether a table identifier is present in the label stack. In response to determining that the table identifier is present in the label stack: based, at least in part, on the table identifier, a label table is determined; a next hop for the data communications packet is determined by performing a next-hop lookup in the label table using at least one of the one or more labels; and the data communications packet is forwarded to the next hop. In an embodiment, the method is performed by one or more computing devices. | 09-18-2014 |
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 |
Patent application number | Description | Published |
20090010158 | QUASI RTP METRICS FOR NON-RTP MEDIA FLOWS - In one embodiment, a router receives a real-time multimedia flow that comprises IP packets. The router then processes values included in the Identifier fields of the IP packets using resources similar to those used in the monitoring of RTP flows to identify metrics for the real-time multimedia flow. The metrics may be transferred to a remote management device for aggregation with metrics output by other routers located on the data path for the real-time multimedia flow. | 01-08-2009 |
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 |
20140211794 | Signaling Using a Time-to-Live (TTL) Field of a Packet - In one embodiment, a Time-to-Live (TTL) field of a packet is used to signal information (other than normal other than a life span of the packet or distance information relative to the network node). The packet is sent through a network, which typically includes traversing one or more intermediate nodes resulting in a modification of its TTL field (e.g., each node reduces the TTL value). After receiving the packet, a network node interprets the current value of the TTL field to identify the particular information encoded in the TTL field. Typically the current value of the TTL field is compared to a range of possible values to accommodate different TTL reductions due to different paths through a network. Signaling using the TTL value may be advantageous in networks that perform Equal-Cost-Multi-Path (ECMP) routing as the TTL value does not effect this routing. | 07-31-2014 |
20150029849 | RECEIVER-SIGNALED ENTROPY LABELS FOR TRAFFIC FORWARDING IN A COMPUTER NETWORK - In one embodiment, a receiver device determines that it accepts flow entropy, and accordingly determines a set of entropy labels the receiver device is accepting. After transmitting the set of entropy labels from the receiver device to one or more sender devices, the receiver device may then receive packets from the one or more sender devices with selected particular entropy labels from the set of entropy labels. In another embodiment, a sender device receives from a receiver device a set of entropy labels the receiver device is accepting. As such, when determining a packet to forward to the receiver device with flow entropy, the sender device may select a particular entropy label from the set of entropy labels for that receiver device, and transmits the packet device to the receiver device with the selected particular entropy label. | 01-29-2015 |
20150029871 | SERVICE LEVEL AGREEMENT VALIDATION VIA SERVICE TRAFFIC SAMPLE-AND-REPLAY - In one embodiment, a device samples actual service traffic at a device in a computer network, and generates real-time statistics on distribution of various packet header parameters of the sampled traffic that influence forwarding in the computer network. As such, the device may generate and transmit synthetic measurement traffic according to the distribution. For instance, in one embodiment, the synthetic traffic may be a replay of actual service traffic with an indication that the replayed traffic is synthetic, while in another embodiment, newly generated synthetic measurement traffic may have packet header parameters substantially matching the sampled traffic. | 01-29-2015 |
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 |
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 |