Patent classifications
H04L12/24
BANDWIDTH MANAGEMENT FOR RESOURCE RESERVATION PROTOCOL LSPS AND NON-RESOURCE RESERVATION PROTOCOL LSPS
In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.
PREDICTIVE ANOMALY DETECTION IN COMMUNICATION SYSTEMS
Systems, methods, and software for operational anomaly detection in communication systems is provided herein. An exemplary method includes obtaining a measured sequence of state information associated with the communications system during a first timeframe, processing the measured sequence of state information to determine a predicted sequence of state information for the communication system during a second timeframe, and monitoring current state information for the communication system over at least a portion of the second timeframe. The method also includes determining operational anomalies associated with the communication system based at least on a comparison between the current state information and the predicted sequence of state information.
Data Plane API in a Distributed Computing Network
Embodiments are directed to a distributed computing system comprising a plurality of compute nodes for providing resources to users and a hierarchy of two or more layers of controllers coupling the compute nodes to a user interface via a control plane, wherein at least one compute node receives a local application program interface (API) call from an application running on the at least compute node, the local API call causing the at least one compute node to configure a local resource without requiring commands from the control plane.
Constraint Based Controlled Seeding
In one example, a peer-to-peer network may use partial seeding to increase the number of seed devices available to a peer device acting as a leeching device. A catalog service may maintain an active peer list for a peer-to-peer network describing active peer devices. The catalog service may track a data file composed of a set of sub-pieces for the peer-to-peer network. The catalog service may identify a device constraint for a peer device of the peer-to-peer network describing a characteristic of the peer device impacting an ability of the peer device to store a sub-piece of the data file. The catalog service may assign a seed sub-piece of the data file based on the device constraint to the peer device when executing a seed client to provide the seed sub-piece to a leeching client on the peer-to-peer network. The catalog service may direct the peer device to retain a persistent sub-piece on the peer device as the seed sub-piece for the peer device until a release event.
Peer-to-Peer Assisted Personal Synchronization
In one example, a catalog service may use a peer-to-peer network to distribute a data content item across multiple associated user devices. The catalog service may maintain a device group list describing a device group and a content catalog for the device group listing a data content set stored in the device group. The catalog service may identify a content change to the data content set listed in the content catalog at a seed device of the device group. The catalog service may send an update alert to a leeching device of the device group of the content change to trigger the leeching device to receive the content change over a peer-to-peer network between the seed device and the leaching device.
METHOD AND SYSTEM FOR DISTRIBUTIVE FLOW CONTROL AND BANDWIDTH MANAGEMENT IN A NETWORK
A method and system for distributive flow control and bandwidth management in networks is disclosed. The method includes: providing multiple Internet Protocol (IP) Gateways (IPGWs) that each have a maximum send rate and one or more sessions with associated throughput criteria, wherein each IPGW performs flow control by limiting information flows by the respective maximum send rate and throughput criteria; providing multiple Code Rate Organizers (CROs) that each have a bandwidth capacity, wherein each CRO performs bandwidth allocation of its respective bandwidth capacity to one or more IPGWs of the multiple IPGWs; interconnecting the multiple IPGWs with the multiple CROs; and performing bandwidth management across the multiple CROs and IPGWs. In the method, an IPGW of the multiple IPGWs provides flow control across a plurality of the CROs of the multiple CROs, and a CRO of the multiple CROs allocates bandwidth to a plurality of the IPGWs of the multiple IPGWs.
MOBILE COMMUNICATION SYSTEM, CONTROL DEVICE, BASE STATION DEVICE, SYSTEM CONTROL METHOD AND DEVICE CONTROL METHOD
A mobile communication system includes a control device and a base station device. Data communication between the control device and the base station device is conducted using a fixed-length data size and a variable-length data size. The control device transmits information indicating whether a data size of the data communication has a fixed length or a variable length. The base station device receives the information from the control device.
INFORMATION SYSTEM, CONTROL SERVER, VIRTUAL NETWORK MANAGEMENT METHOD, AND PROGRAM
A control apparatus, includes a first unit configured to be capable of specifying an identification rule to identify a packet based on a user of a virtual network including a plurality of virtual nodes; and a second unit configured to be capable of sending an instruction to a physical node corresponding to each of the virtual nodes of the virtual network, wherein each of the virtual nodes includes a predetermined network function being capable of providing a first packet operation to the packet, wherein the instruction includes that the physical node provides a second packet operation to the packet so as to emulate the first packet operation.
End-To-End Secure Cloud Computing
A method includes receiving, at a control node of a cloud computing network, a first enterprise policy specific to the first enterprise and a second enterprise policy specific to the second enterprise, and managing communications between at least one user device of the first enterprise and the at least one enterprise application hosted on behalf of the first enterprise based on the first enterprise policy. The method also includes managing communications between at least one user device of the second enterprise and the at least one enterprise application hosted on behalf of the second enterprise based on the second enterprise policy.
ADVANCED LINK TRACKING FOR VIRTUAL CLUSTER SWITCHING
One embodiment of the present invention provides a switch system. The switch includes a port that couples to a server hosting a number of virtual machines. The switch also includes a link tracking module. During operation, the link tracking module determines that reachability to at least one end host coupled to a virtual cluster switch of which the switch is a member is disrupted. The link tracking module then determines that at least one virtual machine coupled to the port is affected by the disrupted reachability, and communicates to the server hosting the affected virtual machine about the disrupted reachability.