Patent application number | Description | Published |
20110158128 | EFFICIENT PROTECTION SCHEME FOR MPLS MULTICAST - An efficient protection scheme for MPLS multicast is disclosed for protection of Point-to-Multi-Point LSP connections. The efficient protection scheme for MPLS multicast includes a pair of Redundant Multicast Trees for each multicast connection which connects the source of a multicast LSP to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the root node in at least one of the two trees. Furthermore, a method is disclosed that ensures that existing Redundant Multicast Trees can adapt to changes in the set of destination nodes and/or network topology changes without significant modifications. The efficient protection scheme for MPLS multicast is particularly useful for reducing the protection bandwidth requirements over protection methods known in the art. | 06-30-2011 |
20120117563 | OVERLOAD CONTROL IN A CLOUD COMPUTING ENVIRONMENT - Provided is a method and devices for overload control in a cloud computing environment. The method includes receiving a first message from a network element associated with the cloud computing environment. The first message includes information associated with a target virtual machine and a list of sessions from the one or more sessions to move from the serving virtual machine to the target virtual machine. Associating one or more client addresses with an address associated with the target virtual machine based on the list of sessions. And, treating the target virtual machine as the serving virtual machine if processing sessions associated with the list of sessions. | 05-10-2012 |
20120151084 | ASYNCHRONOUS VIRTUAL MACHINE REPLICATION - Provided is a method and devices for asynchronous virtual machine replication. The method includes determining a class corresponding to a data packet associated with the virtual machine and one of buffering the packet and transmitting the packet based on the determined class. | 06-14-2012 |
20120170451 | SYSTEM AND METHOD FOR COMMUNICATING DATA BETWEEN AN APPLICATION SERVER AND AN M2M DEVICE - Systems and methods for communication data between an application server and at least one machine-to-machine (M2M) device via an internet network and a network are provided. An example system includes a network element configured to schedule delivery of the data between the application server and at least one M2M device based on network information. The network element is located on a boundary between the network and the intern et network to which the application server communicates with the at least one M2M device. | 07-05-2012 |
20130077636 | Time-Preserved Transmissions In Asynchronous Virtual Machine Replication - The method includes determining a timestamp corresponding to a received data packet associated with the virtual machine and releasing the data packet from a buffer based on the timestamp and a time another data packet is released from the buffer. | 03-28-2013 |
20130124479 | Method And Apparatus For In The Middle Primary Backup Replication - The backup-in-the-middle primary-backup configuration is created by placing a backup-in-the-middle forwarder in the routing path between the primary and the environment. The backup-in-the-middle forwarder intercepts output messages along with required state information sent by the primary to the environment. The backup-in-the-middle forwarder backs up the primary by updating its state information and forwards the output packets to the environment. | 05-16-2013 |
20130173876 | METHOD AND APPARATUS FOR SYNCHRONIZATION IN PRIMARY-BACKUP REPLICATION SCHEMES - A primary-backup replication capability is disclosed. A primary process and a backup process participate in a synchronization process configured to synchronize state information of the primary and backup processes. The synchronization process operates in periods of time referred to as epochs. During the current epoch, the primary process computes state update information representing changes to the state information of the primary process since a previous epoch, and also buffers output messages generated during the current epoch in an associated output buffer dedicated for use in the current epoch. The primary process initiates a new epoch independent of receiving, from the backup process, a state update acknowledgement for the previous epoch. The output messages buffered for the current epoch are released from the associated output buffer after the primary process receives a state update acknowledgment for the current epoch and all output buffers of all previous epochs are empty. | 07-04-2013 |
20140105018 | Method And Apparatus Of Group Credit Control For Wireless Networks - Methods are provided for metering the usage, on a group of lines subject to a group user agreement, of the data processing capacity of a network. Implementations include steps of receiving usage reports from respective lines of the group at least when usage quotas granted to the lines are exhausted; maintaining a total, over the group, of usage that has been reported by the lines and of outstanding usage quotas that have been granted to the lines; and maintaining a comparison between the total outstanding group quota and a limit that depends on the total reported group usage, so as to detect violation events when said quota violates the limit. Upon occurrence of violation events, instructions for the processors serving respective lines to reallocate quota are sent selectively. | 04-17-2014 |
Patent application number | Description | Published |
20100265945 | METHOD AND APPARATUS FOR FAULT-RESILIENT MULTICAST AND UNICAST IN TRANSPORT NETWORKS - A capability is provided for supporting fault-resilient propagation of traffic in networks using redundant multicast trees (RMTs). Fault-resilient propagation of traffic from a first node to a second node is supported using one or both of a pair of RMTs rooted at the first node and a pair of RMTs rooted at the second node. The pair of RMTs rooted at the first node includes a pair of node-disjoint paths from the first node to the second node. The pair of RMTs rooted at the second node includes a pair of node-disjoint paths from the second node to the first node. The first node propagates multicast traffic toward the second node using at least one of the RMTs in the pair of RMTs rooted at the first node. The first node propagates unicast traffic toward the second node using at least one of: at least one of the RMTs in the pair of RMTs rooted at the first node, or at least one of the RMTs in the pair of RMTs rooted at the second node. | 10-21-2010 |
20130107698 | IP FAST REROUTE SCHEME OFFERING FULL PROTECTION | 05-02-2013 |
20130305344 | ENTERPRISE NETWORK SERVICES OVER DISTRIBUTED CLOUDS - Various exemplary embodiments relate to a method and related network node including one or more of the following: determining that a new virtual gateway location should be created; selecting a data center of a plurality of data centers to host the new virtual gateway location; and establishing a virtual gateway at the selected data center, wherein the virtual gateway is configured to provide at least one device with connectivity to a Virtual Private Network (VPN) and connectivity to the Internet. | 11-14-2013 |
20150009807 | FAULT-RESILIENT BROADCAST, MULTICAST, AND UNICAST SERVICES - In general, various capabilities related to fault-resilient services within communication networks are presented. The services may include broadcast services, multicast services, unicast services, or the like, as well as various combinations thereof. A capability for providing local protection to unicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for providing local protection to multicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees includes partitioning a graph into a pair of partitions based on a link coloring mechanism and constructing the pair of redundant trees based on the pair of partitions. | 01-08-2015 |