Patent application number | Description | Published |
20130028106 | Resource Aware Parallel Process Distribution on Multi-Node Network Devices - Techniques are provided for monitoring a plurality of independently operating processing nodes in a core data packet routing system, wherein each processing node is running its own operating system instance. A placement decision is made for respective processes on selected ones of the independently operating processing nodes based on a predetermined policy, and then the respective processes are placed, based on the placement decision, on the selected ones of the independently operating processing nodes such that the respective processes become placed processes. A list of placed process/processing node pairs specifying a pairing of the placed processes and the processing nodes on which the placed processes have been placed is maintained so that a user can review the then-current set of process placements | 01-31-2013 |
20140098675 | MPLS SEGMENT-ROUTING - MPLS segment routing is disclosed. In one embodiment, a first core router generates a first data structure that maps first portcodes to respective identities of first neighbor routers or respective first links, wherein the first portcodes identify respective first ports of the first core router, and wherein the first ports are coupled to the first neighbor routers, respectively, via the first links, respectively. The first core router generates and transmits a first link-state packet, wherein the first link-state packet comprises an identity of the first core router and the first data structure. | 04-10-2014 |
20140169370 | Segment Routing Techniques - An apparatus and method is disclosed for segment routing (SR). In one embodiment, the method includes a node creating a segment stack that identifies one segment calculated using a first algorithm and a second segment calculated using a second, different algorithm. The node then attaches this header to a packet and sends it to another node. | 06-19-2014 |
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 |
20140269699 | SEAMLESS SEGMENT ROUTING - In one embodiment, a packet and a segment ID stack is received at a node. The segment ID stack includes a plurality of segment IDs, one or which is a first area-segment ID that identifies a first area of a subdivided network. One of a plurality of forwarding tables at the node is selected based on the first area-segment ID. Thereafter, the packet is forwarded based on information contained in the selected forwarding table. | 09-18-2014 |
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 |
20140280717 | Framework for Dynamically Programmed Network Packet Processing - One or more functions to be performed on a packet at one or more network nodes along a network path are determined at a network device. A packet is generated which includes a packet header. Included in the packet header are an instruction pointer and an instruction portion. A first instruction for the one or more functions to be performed at the one or more network nodes is written to the instruction portion. Additionally, a value pointing to the first instruction is written to the instruction pointer. The packet is transmitted along the network path from the network device. | 09-18-2014 |
20140369356 | OPPORTUNISTIC COMPRESSION OF ROUTING SEGMENT IDENTIFIER STACKS - A method and device are disclosed for opportunistic compression of routing segment identifiers. In one embodiment, the method includes participating in routing of a first data packet through a first node in a network, and subsequently entering into an arrangement with an adjacent node in the network. The first data packet includes a first plurality of routing segment identifiers, and additional data packets to be routed through the first node also include the first plurality of routing segment identifiers. The arrangement entered into includes representation of the first plurality of routing segment identifiers by a single compression identifier. The method further includes participating in routing of at least one of the additional data packets using the compression identifier instead of the first plurality of routing segment identifiers. In an embodiment, the device includes one or more network interfaces and a processor configured to perform the steps of the method. | 12-18-2014 |