Abstract: A method, comprises measuring, by circuitry of a computer system, a first bandwidth of data traffic of a transport path over a time period, the transport path passing through a plurality of nodes and conforming to a protocol using a number of time slots to allocate a second bandwidth to the transport path. The method further includes passing a signal, from the computer system to at least one of the nodes of the transport path, the signal including at least one instruction that when executed by circuitry of the at least one node causes a change to the number of time slots allocated to the transport path.

Abstract: A method includes the steps of: (1) generating, by circuitry of a first node, an advertising message including (a) a working path bandwidth demand; (b) an identification of at least two communication links in a shared risk link group of the working path; and (c) at least one protecting path and a bitmap indicative of failure of at least one first communication link in the shared risk link group that causes the at least one protecting path to be used; and (2) transmitting the advertising message from the first node to second nodes within a mesh network.

Abstract: Nodes and methods are disclosed for protection and restoration in the event of multiple failures for multiple paths involved for the same service in shared mesh networks, including, a method comprising the steps of storing, in non-transitory memory of a first node in a shared mesh network having a plurality of connections through the shared mesh network, records of global contention handling priority values of the plurality of connections; detecting a first signal from a second node requesting activation of a first connection of the plurality of connections, and a second signal from a third node requesting activation of a second connection of the plurality of connections, the first and second connections having overlapping requirements; determining that the second connection has a higher global contention handling priority value than the first connection based at least in part on the records; and activating the second connection.

Abstract: Nodes and methods are disclosed for protection and restoration in the event of multiple failures for multiple paths involved for the same service in shared mesh networks, including, a method comprising the steps of storing, in non-transitory memory of a first node in a shared mesh network having a plurality of connections through the shared mesh network, records of global contention handling priority values of the plurality of connections; detecting a first signal from a second node requesting activation of a first connection of the plurality of connections, and a second signal from a third node requesting activation of a second connection of the plurality of connections, the first and second connections having overlapping requirements; determining that the second connection has a higher global contention handling priority value than the first connection based at least in part on the records; and activating the second connection.

Abstract: A method includes the steps of: (1) generating, by circuitry of a first node, an advertising message including (a) a working path bandwidth demand; (b) an identification of at least two communication links in a shared risk link group of the working path; and (c) at least one protecting path and a bitmap indicative of failure of at least one first communication link in the shared risk link group that causes the at least one protecting path to be used; and (2) transmitting the advertising message from the first node to second nodes within a mesh network.

Abstract: A method, comprises measuring, by circuitry of a computer system, a first bandwidth of data traffic of a transport path over a time period, the transport path passing through a plurality of nodes and conforming to a protocol using a number of time slots to allocate a second bandwidth to the transport path. The method further includes passing a signal, from the computer system to at least one of the nodes of the transport path, the signal including at least one instruction that when executed by circuitry of the at least one node causes a change to the number of time slots allocated to the transport path.