Juniper Networks, Inc.

Lucent Technologies Inc.

Versa Networks, Inc.

Kumar B Mehta

Apurva Mehta

Sanjiv Doshi

Srinivasa Chaganti

Gopi Krishna

Krishna Sankaran

Ramasamy Ramanathan

Jagadish Grandhi

Ramanarayanan Ramakrishnan

Rajagopalan Subbiah

Shiva Shenoy

Bin William Hong

Andrzej Szyszko

Murtuza S Attarwala

Shivaprakash Shenoy

Manjunath Prabhu

Rama Ramakrishnan

Randhir Bhattacharya

Sunesh Rustagi

Marc A Schaub

Dhiraj D Ballal

Ananda Sathyanarayana

Santosh Gupta

Bobby Vandalore

Balakrishnan Ramakrishnan

Sureshkannan Duraisamy

Venkatesh Gota

Usama Anqud

Praveen Madhav

Bill Hong

Samya Das Sarma

Iswar Biswal

Richard Foote

Venkat Manickayasagam

In general, techniques for implementing a flow distribution service using a plurality of traffic nodes that may operate as processing nodes of a distributed computing system are described. In some examples, the traffic nodes in the aggregate form a virtual appliance configured to apply a network service to packet flows.

Flow distribution table for packet flow load balancing

In general, this disclosure describes techniques for applying, with a network device, subscriber-specific packet processing using an internal processing path that includes service objects that are commonly applied to multiple packet flows associated with multiple subscribers. In one example, a network device control plane creates subscriber records that include, for respective subscribers, one or more variable values that specify service objects as well as an identifier for a packet processing template. A forwarding plane of the network device receives and maps subscriber packets to an associated subscriber record and then processes the packet by executing the packet processing template specified by the subscriber record. When the forwarding plane reaches a variable while executing the specified packet processing template, the forwarding plane reads the associated variable value from the subscriber record to identify and then apply the subscriber-specific service object specified by the variable.

Variable-based forwarding path construction for packet processing within a network device

A method, performed by a network device, may include sending a request to a first server, detecting a first timeout without receiving a response from the first server, and sending the request to the first server and to a second server, in response to detecting the first timeout without receiving a response from the first server.

Server selection during retransmit of a request

In general, techniques are described for facilitating interchassis redundancy (ICR) among heterogenous mobile gateway member chassis that provide high-availability services as an group to one or more mobile subscribers. In one example, a member chassis of the mobile gateway comprises a control plane having a plurality of distributed subscriber management service units that serve as anchors for subscriber sessions. A redundancy group defines a backup association between one of the subscriber management service units and a subscriber management service unit of another member chassis of the mobile gateway. A routing unit of the member chassis comprises a resource manager that negotiates parameters for a communication channel for the redundancy group. A session management daemon establishes subscriber sessions anchored by the subscriber management service unit in the association and sends, via the communication channel, subscriber session data for the subscriber sessions anchored by the subscriber management service unit.

High-availability mobile gateways having interchassis non-uniform service unit redundancy

A network system includes a provider backbone bridged network (PBBN) and a multi-homed provider bridge network (PBN) having an L2 switch that operate as backboned edge bridge (BEBs) to bridge L2 packets between the PBN and the PBBN. The L2 switch executes a PBBN routing instance and a separate PBN routing instance. A plurality of packet-forwarding engine (PFE) of the L2 switch are configured to forward L2 packets between interfaces of the PBN routing instance and the PBBN routing instance. The PFEs store L2 network address tables that specify L2 network addresses reachable by the interfaces. The PFEs of the L2 switch are configured to selectively share L2 network addresses between the L2 network address tables of the PBN routing instance and the L2 network address tables of the PBBN routing instance.

Address learning in a layer two bridging network

In general, the invention is directed to techniques for breaking out mobile data traffic from a mobile service provider network to a packet data network. For example, as described herein, a breakout gateway device (BGW) receives a first service request and data traffic for a data session associated with the requested service from a mobile device in a radio access network, wherein the first service request is addressed to a serving node of a mobile core network of the mobile service provider network, and wherein the data traffic is destined for the PDN. A control packet analysis module forwards the first service request from the breakout gateway device to the serving node. A breakout module of the BGW bypasses the serving node by sending the data traffic from the breakout gateway device to the PDN on a data path from the radio access network to the PDN.

Breakout gateway for mobile data traffic

Methods, apparatus, and products for routing frames in a network using bridge identifiers, wherein the network includes a plurality of bridge nodes. At least one of the bridge nodes operates as an ingress bridge node through which frames are received into the network. At least one of the bridge nodes operates as an egress bridge node through which frames are transmitted out of the network. One of the bridge nodes receives, from the ingress bridge node, a frame for transmission to a destination node. The destination node connects to the network through the egress bridge node. The frame includes an ingress bridge identifier and an egress bridge identifier. The bridge that received the frame then routes the frame to the egress bridge node through which the destination node connects to the network in dependence upon the ingress bridge identifier and the egress bridge identifier included in the frame.

Routing frames in a computer network using bridge identifiers

Methods, apparatus, and products are disclosed for forwarding frames in a computer network using shortest path bridging ('SPB'). The network includes multiple bridges, and each edge bridge is assigned a unique service virtual local area network ('VLAN') identifier. One of the bridges receives a frame for transmission to a destination node. The received frame includes a service VLAN identifier for the ingress bridge through which the frame entered the network and a customer VLAN identifier. The one bridge identifies an SPB forwarding tree in dependence upon the service VLAN identifier. The SPB forwarding tree specifies a shortest route in the network from the ingress bridge through the one bridge to the other bridges in the network. The one bridge then forwards the received frame to the egress bridge without MAC-in-MAC encapsulation in dependence upon the SPB forwarding tree and the customer VLAN identifier.

Forwarding frames in a computer network using shortest path bridging

Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname.

Routing frames in a shortest path computer network for a multi-homed legacy bridge node

A derived state value is calculated based on a plurality of component state values. As any of the plurality of component state values changes, the derived state value is recalculated. When sending information about a MAC address or other data between two components, the derived state value is included in the information sent. An object receiving a MAC address or other data from another object checks the validity of the received derived state value to determine whether to accept the new data and flush old data, to accept the new data, or to ignore the new data.

Determining MAC state using sequence numbers in a distributed environment

Methods, apparatus, and products are disclosed for routing frames in a TRILL network using service VLAN identifiers by: receiving a frame from an ingress bridge node for transmission through the TRILL network to a destination node that connects to the TRILL network through an egress node, the received frame including a customer VLAN identifier, a service VLAN identifier uniquely assigned to the ingress bridge node, and a destination node address for the destination node, the received frame not having mac-in-mac encapsulation; adding, in dependence upon the service VLAN identifier and the destination node address, a TRILL header conforming to the TRILL protocol, the TRILL header including an ingress bridge nickname and an egress bridge nickname; and routing, to the egress bridge node through which the destination node connects to the network, the frame in dependence upon the ingress bridge nickname and the egress bridge nickname.

Routing frames in a trill network using service VLAN identifiers

A technique for managing network traffic is disclosed. According to the technique, a set of VLAN IDs is explicitly identified for use with a first service. The rest of the customer traffic is considered as part of a default service. Traffic that is received at a PE from a customer is examined to identify whether or not the traffic belongs to the first service. For example, the VLAN ID and incoming port of a packet is compared to the set of VLAN IDs that were allocated to the first service on the respective port. Traffic that is identified as belonging to the first service is 'extracted' from the default service and forwarded on a path that is related to the first service. The remaining traffic is forwarded on a path that is related to the default service. The service extraction technique can be implemented across an MPLS domain.

Multiprotocol label switching (MPLS) edge service extraction

Distributing packets from an input link to multiple output links involves categorizing each incoming packet, selecting a mapping algorithm based on the packet category, and using the selected mapping algorithm for each packet to determine an output link for the respective packet. If packets are from a category that requires the order of the packets to be maintained, then the selected mapping algorithm causes packets from the same set of packets to be distributed to the same output link. If packets are from a category that does not require the order of the packets to be maintained, then the selected mapping algorithm can cause packets to be distributed more evenly among the multiple output links. Hashing can be used to distribute in-order packets from the same set to the same output link. Load balancing and round-robin distribution can be used to distribute out-of-order packets more evenly across the output links.

Growing community of inventors

Cupertino, CA, United States of America

Kumar B Mehta