Cisco Technology, Inc.

Motorola Corporation

Future Wei Technologies, Inc.

Adara Networks, Inc.

Satmap International Holdings Limited

Huawei Technologies Co., Limited

Randall R Stewart

Peter Lei

Mitesh Dalal

Xuesong Dong

Qiaobing Xie

Renwei Li

Anantha Ramaiah

Ming Li

Amol Khare

Phillip D Neumiller

Hongtao Yin

Yang Yu

Weiqian Dai

Patrick Mahan

Huaimo Chen

Kenneth Durazzo

Bisong Tao

Stewart Frederick Bryant

Michael Anthony Ramalho

Gopal K Dommety

Mohamed Khalid

Benoit Claise

Shihui Hu

Fengkai Li

Paul J Aitken

Ming Chi Chen

Andrew G Johnson

Edgar Martinez

Shmuel Silverman

Vivek Datar

Vineet Dixit

Lewis B Oberlander

Srinivas Subramanian

Raymond M Liss

Nipa Kumar

Tom Joyner

Ken A Morneault

Rich Noradt

Ramakrishnan Rajamoni

La Monte Henry Piggy Yarroll

A flow in a flow set having an access control ('AC') policy assigned is monitored. A bandwidth used by the flow is determined. One or more packets associated with the flow are selectively dropped based on at least one of the used bandwidth and the AC policy.

Controlling congestion controlled flows

A packet is received. A flow associated with the packet is determined. An access control ('AC') policy for the flow is determined. The flow in a flow set is organized for transmission based at least on the AC policy. A bandwidth for the flow is monitored. The flow is marked for transmission based on the monitoring.

Controlling non-congestion controlled flows

Exemplary methods, apparatuses, and systems include a router receiving a first network packet being transmitted across a network path from a first endpoint to a second endpoint, determining that the first network packet does not include a requested rate, modifying the first network packet to include a requested rate in response to determining that the received network packet does not include a requested rate, and transmitting the modified first network packet along the network path to the second endpoint.

Network congestion control

An apparatus comprising a processor configured to migrate load from a source process running on the processor to a target process running on a peer processor in a dynamic manner by monitoring an amount of resources used by the source process, wherein the load is migrated when the amount of resources utilized by the source process exceeds a threshold. Also disclosed is a network component comprising a first processor configured to select a source process to migrate a load from the first processor based on available resources on the first processor and the source process; and a second processor configured upon receiving a migration request from the first processor to one of select and start a target process to which to migrate the load based on available resources for the second processor and the target process.

Method for dynamic migration of a process or services from one control plane processor to another

An apparatus comprising one or more processors configured to implement a plurality of operations for an operating system (OS) platform including a kernel and a user application, one or more shared resource blocks by the kernel and the user application, and one or more shared locks by the kernel and the user application corresponding to the shared resource blocks, wherein the user application is configured to synchronize accesses to the shared resource blocks between a user thread and a kernel thread by directly accessing the locks without using a system call to the kernel.

System and method for implementing shared locks between kernel and user space for synchronize access without using a system call to the kernel

An apparatus comprising a processor configured to startup a new process on a peer processor to off-load a load of a local process on the processor in a dynamic manner based on monitoring an amount of resources used by the processor, wherein the startup of the new process on the peer processor is initiated when the amount of resources used by the local process reaches a threshold.

Method for dynamic on demand startup of a process or resource

An apparatus comprising a proxy configured to couple to a sender and a receiver and to receive data from the sender at a first rate and forward the data to the receiver at a second rate that is less than the first rate. A method comprising detecting a reception speed for each of a plurality of receivers in a multicast group, assigning the receivers to a first group and a second group based on the reception speed of each of the receivers, wherein the first group has a reception speed that is faster than a reception speed of the second group, and sending multicast data intended for all of the receivers to the receivers in the first group and to a proxy at a first rate, wherein the proxy buffers the multicast data and sends the multicast data to the receivers in the second group at a second rate.

Method for group-based multicast with non-uniform receivers

Methods and systems are disclosed for routing callers to agents in a contact center, along with an intelligent routing system. A method for routing callers includes routing a caller, if agents are available, to an agent based on a pattern matching algorithm (which may include performance based matching, pattern matching based on agent and caller data, computer models for predicting outcomes of agent-caller pairs, and so on). Further, if no agents are available for the incoming caller, the method includes holding the caller in a shadow queue, e.g., a set of callers. When an agent becomes available the method includes scanning all of the callers in the shadow queue and matching the agent to the best matching caller within shadow queue.

Shadow queue for callers in a performance/pattern matching based call routing system

In one embodiment, a method includes determining a first template defining a data format for one or more first data records and a second template defining a data format for one or more second data records. The template may be needed to decode the information included in an associated data record. The first template is sent on a first stream of a multi-stream protocol in an ordered fashion, such as SCTP. The one or more first data records are also sent on the first stream in an ordered fashion and include first flow information for data sent through a network device. A second template is sent on a second stream using the multi-stream protocol in an ordered fashion. One or more second data records are sent on the second stream including second flow information for data sent through the network device.

Streaming of templates and data records in individual streams using a multistream protocol

Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with automated discovery of network devices supporting particular transport layer protocols, such as, but not limited to Stream Control Transmission Protocol (SCTP). Packet switching devices automatically discover peer packet switching devices supporting a particular transport layer protocol, and then establish a session using the particular transport layer protocol between them for subsequent use in transporting packets.

Automated discovery of network devices supporting particular transport layer protocols

A method is disclosed for providing fault tolerance of an application over a Stream Control Transmission Protocol (SCTP) connection. A method for moving a transport connection from a first host to a second host on a network is also described. After establishing a transport connection between the first host and a peer host, first information about the transport connection is transferred to the second host. Upon the first host becoming unavailable, the second host sends to the peer host a request to update the state of the transport connection. The peer host then updates the transport connection. Without resetting the transport connection, the second host then establishes the same transport connection with the peer host.

Method of moving a transport connection among network hosts

In an embodiment, an existing transport protocol connection though a mobile device is recognized as having entered a state of disconnect. A lowest received sequence number is determined from received messages to be transmitted over a disconnected transport protocol connection. A disconnect acknowledgement message with a receive window of zero and a sequence number of one less than the lowest received sequence number is transmitted. The disconnect acknowledge message with a receive window of zero and a sequence number of one less than the lowest received sequence number is continued to be transmitted until the transport protocol connection exits the disconnect state to a connect state.

Disconnected transport protocol connectivity

The present invention describes various techniques which may be used for determining multi-path latency in data networks which utilize a multi-homed transport protocols. Using the technique of the present invention, for example, appropriate source and destination addresses may be selected for specific IP datagrams in order to achieve an optimal communication path between endpoints which utilize a multi-homed transport protocol.

Technique for determining multi-path latency in multi-homed transport protocol

A network element implementing a method for determining an optimal maximum transmission unit (MTU) value on a path between two nodes in a network is described. A sending node interested in learning the optimal MTU path value allows fragmentation of datagrams sent on the path, selects an initial MTU, and sends one or more data packets to a receiving node. Upon receiving the data the receiver determines if fragmentation occurred. If no fragmentation occurred then the MTU path selected is the optimal MTU for the given path between the nodes. If fragmentation did occur then the sender is notified that the selected MTU was not the optimal MTU for the path. Either the receiver proposes a new MTU for the path, or the sender selects a new, smaller MTU. The process repeats until the receiver detects no fragmentation.

Method of determining a maximum transmission unit value of a network path using transport layer feedback

A multi-homed network node comprises an interface that is addressable using a primary network address and a secondary network address. Network packets identifying the primary network address traverse a first network path and packets identifying the second network address traverse a second network path that is routed physically separately from the first network path. A transport layer network protocol association is established in the network between a first node and the multi-homed node. One or more data messages are sent to the second node and identify the primary network address. Network feedback information indicates one or more performance characteristics of the first network path. In response, the data messages are automatically modified to identify the secondary network address.

Selecting paths in multi-homed transport-layer network associations

Growing community of inventors

Crystal Lake, IL, United States of America

Randall R Stewart