Abstract: A technique for discovering and identifying locations at which to deploy new Layer-2 nodes within a telecommunications network. The disclosed technique is intended to identify Layer-2 nodes at locations where they can improve service availability when deployed, especially in geographic regions that suffer frequent or simultaneous cable breaks, or both. The locations of the new Layer-2 nodes depend on the underlying Layer-0 network topology, as well as on the existing Layer-2 topology. Thus, the disclosed technique features a cross-layer approach that takes these factors into account and evaluates the locations in a way that can considerably increase the availability of one or more services offered in the telecommunications network.

Abstract: A method for routing data in a network including a plurality of nodes connected by links, the method includes collapsing first and second rings of the nodes together, for each of the nodes in the network, determining a shortest path tree to each of the other nodes in the network, and for data sourced from a particular one of the nodes in the network, blocking the link or links not included in the shortest path tree determined for the particular one of the nodes. Also, a system for routing data through a network having a plurality of nodes connected by links, includes a ring collapsing module for collapsing first and second rings of the nodes together, a shortest path tree calculation module for determining, for each of the nodes, a shortest path tree to each of the other nodes in the network, and a link blocking module for blocking the link or links not included in the shortest path tree determined for data sourced from a particular one of the nodes.

Abstract: A system and method for provisioning bandwidth-on-demand services in a telecommunications network. A disclosed data-processing system receives historical data for the utilization of predetermined resources, the current state of provisioned resources for a particular moment in time, and requests to provision various services to customers. The data-processing system constructs one or more mathematical functions from the historical data or the current state of provisioned resources, or both. The system provisions the service identified in the request, or provisions at least some type of service that is based on the request. The provisioning is based on one or more of the constructed mathematical functions, or on the current state of provisioned resources, or both. The system transmits a signal based on the provisioning of the service, wherein the signal can be used to route one or more data packets based on the provisioning.

Abstract: A technique for discovering and identifying locations at which to deploy new Layer-2 nodes within a telecommunications network. The disclosed technique is intended to identify Layer-2 nodes at locations where they can improve service availability when deployed, especially in geographic regions that suffer frequent or simultaneous cable breaks, or both. The locations of the new Layer-2 nodes depend on the underlying Layer-0 network topology, as well as on the existing Layer-2 topology. Thus, the disclosed technique features a cross-layer approach that takes these factors into account and evaluates the locations in a way that can considerably increase the availability of one or more services offered in the telecommunications network.

Abstract: A method for routing data in a network including a plurality of nodes connected by links, the method includes collapsing first and second rings of the nodes together, for each of the nodes in the network, determining a shortest path tree to each of the other nodes in the network, and for data sourced from a particular one of the nodes in the network, blocking the link or links not included in the shortest path tree determined for the particular one of the nodes. Also, a system for routing data through a network having a plurality of nodes connected by links, includes a ring collapsing module for collapsing first and second rings of the nodes together, a shortest path tree calculation module for determining, for each of the nodes, a shortest path tree to each of the other nodes in the network, and a link blocking module for blocking the link or links not included in the shortest path tree determined for data sourced from a particular one of the nodes.