Alcatel Lucent

Pramod V Koppol

Yigal Bejerano

Gordon Thomas Wilfong

Kedar S Namjoshi

Thanos Stathopoulos

Dimitrios Stiliadis

Adiseshu Hari

Daniel Matthew Andrews

Harish Viswanathan

Aleksandr Stolyar

John Brian Reid

Antony Martin

Yuh-Jye Chang

Spyridon Antonakopoulos

Sreedhar Rao

Athanasios Stathopoulos

Athansios Stathopoulos

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.

Fault-resilient broadcast, multicast, and unicast services

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.

Method and apparatus for in the middle primary backup replication

In one example embodiment, a group server includes a processor configured to receive a data quota usage report corresponding to data quota usage by at least one of a plurality of lines, the plurality of lines forming a group subject to a pre-paid data usage agreement with a data service provider and determine a data quota for the at least one of the plurality of lines based on at least the received data quota usage report and an accuracy threshold.

Data allocation for pre-paid group data plans

An IP fast reroute scheme offering full protection is disclosed for reducing the number of address lookups associated with a message packet. The IP fast reroute scheme offering full protection includes a router configured to forward the arriving packet to a next-hop neighbor node according to one of a first pointer and a second pointer associated to a destination node in a forwarding information table stored in a forwarding information memory storage; the first pointer is directed to a first next-hop neighbor node which is on the shortest path from the network node to the destination node; and the second pointer is directed to a second next-hop neighbor node different from the first next-hop neighbor node, the second next-hop neighbor node on a candidate cycle containing both the network node and the destination node having the greatest overlap with a sink tree rooted at the destination node. The IP fast reroute scheme offering full protection is particularly useful for providing full protection against single link and node failures with a simple method requiring no packet modifications.

IP fast reroute scheme offering full protection

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.

Asynchronous virtual machine replication

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.

Method and apparatus of group credit control for wireless networks

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.

Overload control in a cloud computing environment

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.

System and method for communicating data between an application server and an M2M device

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.

Method and apparatus for synchronization in primary-backup replication schemes

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.

Time-preserved transmissions in asynchronous virtual machine replication

A pair of Redundant Multicast Trees for each multicast connection 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 ensures that existing Redundant Multicast Trees can adapt to changes in the set of destination nodes and/or network topology changes without significant modifications.

Efficient protection scheme for MPLS multicast

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.

Method and apparatus for fault-resilient multicast and unicast in transport networks

A capability is provided for supporting fault-resilient multicast using multiple sources. A method for supporting fault-resilient propagation of multicast traffic using Redundant Multicast Trees (RMTs) includes identifying each potential Shared Risk Link Group (SRLG) conflict associated with a pair of RMTs providing node-disjoint paths to a plurality of destination nodes, identifying each potential SRLG conflict that is an actual SRLG conflict, and, for each actual SRLG conflict, determining a detour path for protecting the links of the actual SRLG conflict. The pair of RMTs includes a first RMT from a first multicast source node to each of the destination nodes and a second RMT from a second multicast source node to each of the destination nodes. Each potential SRLG conflict includes a plurality of links. A potential SRLG conflict is determined to be an actual SRLG conflict if first and second paths for one of the destination nodes over the respective first and second RMTs each traverse at least one link of the potential SRLG conflict.

Growing community of inventors

Manalapan, NJ, United States of America

Pramod V Koppol