Patent classifications
H04L47/22
SYSTEM AND METHOD FOR PRIORITIZING NETWORK TRAFFIC IN A DISTRIBUTED ENVIRONMENT
A system and method for prioritizing network traffic in a distributed environment. The system includes: a plurality of logic modules configured to receive policy data from a network device; a control processor associated with each logic module, each control processor configured to determine data associated with a traffic flow and coordinate traffic actions over the plurality of logic modules; a packet processor associated with each control processor and configured to determine a traffic action based on the traffic flow and received policy data; and at least one shaper object configured to enforce the determined traffic action. The method includes: receiving policy data from a network device; determining data associated with a traffic flow at logic modules to coordinate traffic actions of the logic modules; determining a traffic action based on the traffic flow and received policy data; and enforcing the traffic action across at least one shaper object.
SYSTEM AND METHOD FOR PRIORITIZING NETWORK TRAFFIC IN A DISTRIBUTED ENVIRONMENT
A system and method for prioritizing network traffic in a distributed environment. The system includes: a plurality of logic modules configured to receive policy data from a network device; a control processor associated with each logic module, each control processor configured to determine data associated with a traffic flow and coordinate traffic actions over the plurality of logic modules; a packet processor associated with each control processor and configured to determine a traffic action based on the traffic flow and received policy data; and at least one shaper object configured to enforce the determined traffic action. The method includes: receiving policy data from a network device; determining data associated with a traffic flow at logic modules to coordinate traffic actions of the logic modules; determining a traffic action based on the traffic flow and received policy data; and enforcing the traffic action across at least one shaper object.
Dynamic path selection and data flow forwarding
Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.
Dynamic path selection and data flow forwarding
Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.
Techniques for transparently emulating network conditions
In various embodiments, a network emulation application emulates network conditions when testing a software application. In response to a request to emulate a first set of network conditions for a first client device that is executing the software application, causing a kernel to implement a first pipeline and to automatically input network traffic associated with the first client device to the first pipeline instead of a default bridge. In response to a request to emulate a second set of network conditions for a second client device that is executing the software application, causing the kernel to implement a second pipeline and to automatically input network traffic associated with the second client device to the second pipeline instead of the default bridge. Each of the pipelines perform one or more traffic shaping operations on at least a subset of the network traffic input into the pipeline.
Techniques for transparently emulating network conditions
In various embodiments, a network emulation application emulates network conditions when testing a software application. In response to a request to emulate a first set of network conditions for a first client device that is executing the software application, causing a kernel to implement a first pipeline and to automatically input network traffic associated with the first client device to the first pipeline instead of a default bridge. In response to a request to emulate a second set of network conditions for a second client device that is executing the software application, causing the kernel to implement a second pipeline and to automatically input network traffic associated with the second client device to the second pipeline instead of the default bridge. Each of the pipelines perform one or more traffic shaping operations on at least a subset of the network traffic input into the pipeline.
REGULATION METHODS FOR PROXY SERVICES
Systems and methods to manage and regulate the requests of multiple proxy clients are disclosed. In one aspect, the system and methods disclosed herein aids in configuring proxy server(s) with a rate-limit functionality. Configuration of the rate-limit functionality may be realized by, but not limited to, installing configuration file(s) and/or software application(s) on the proxy server(s). The configuration provides information about the list of restricted and unrestricted domains and their respective request limit specification in a given time frame. Therefore, each time before a proxy server forwards the clients' requests to a target domain, the proxy server checks and ensures that the request count to the particular target domain is well within the limit specified in the request limit specification. Thus, the embodiments described herein aid in preventing the IP addresses of proxy service providers from being blocked or denied from the target websites.
UTILIZING EGRESS PEER ENGINEERING TO DETERMINE OPTIMIZED TRAFFIC PLANS AND TO IMPLEMENT AN OPTIMIZED TRAFFIC PLAN
A device determines traffic and costs associated with a network that includes network devices interconnected by links, and determines traffic assignments for the network based on the traffic and the costs associated with the network. The device determines tunnel use for the network based on the traffic assignments, and determines peer link use for the network based on the tunnel use. The device determines costs associated with the traffic assignments, the tunnel use, and the peer link use for the network, and generates traffic plans based on the traffic assignments, the tunnel use, the peer link use, and the costs associated with the traffic assignments, the tunnel use, and the peer link use. The device causes one of the traffic plans to be implemented in the network by the network devices and the links.
UTILIZING EGRESS PEER ENGINEERING TO DETERMINE OPTIMIZED TRAFFIC PLANS AND TO IMPLEMENT AN OPTIMIZED TRAFFIC PLAN
A device determines traffic and costs associated with a network that includes network devices interconnected by links, and determines traffic assignments for the network based on the traffic and the costs associated with the network. The device determines tunnel use for the network based on the traffic assignments, and determines peer link use for the network based on the tunnel use. The device determines costs associated with the traffic assignments, the tunnel use, and the peer link use for the network, and generates traffic plans based on the traffic assignments, the tunnel use, the peer link use, and the costs associated with the traffic assignments, the tunnel use, and the peer link use. The device causes one of the traffic plans to be implemented in the network by the network devices and the links.
SERVICE FLOW ADJUSTMENT METHOD AND COMMUNICATION APPARATUS
A service flow adjustment method and a communication apparatus are provided. Slot adjustment information is carried in a client signal flow sent between nodes, so that times at which all nodes on a network switch slot configuration can be unified, to avoid service damage in a process of adjusting a network transmission bandwidth. The method includes: A first node receives a first client signal flow from a second node by using N slots of a first bundling group; and after first duration starting from a time at which the first node detects slot adjustment information, the first node receives the first client signal flow from the second node by using M slots of the first bundling group.