Abstract: A method for providing energy from waste heat from an electrolysis process to one or more commercial or industrial operations is provided. The method includes the steps of converting water to oxygen and a hydrogen product through an electrolysis process, wherein the hydrogen product has a carbon intensity less than about 0.45 kg CO2e/kg H2, and wherein at least some of the required energy for the electrolysis process is provided from a biomass power plant. The method further includes recovering waste heat from the electrolysis process, and then converting at least some of the waste heat to thermal energy for use in the one or more commercial or industrial operations. Examples of commercial and industrial operations includes, without limitation, greenhouses, algae farms, district cooling, and district heating.

Abstract: Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.

Abstract: Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.

Abstract: Disclosed are methods, systems, and computer program products for distributed resource allocation between media gateways (MGs) in a cluster of MGs. According to one method, available resources provided by each MG in a cluster of MGs controlled by a media gateway controller (MGC) are communicated between the MGs in the cluster. At the media gateways, resources required for a call are identified, rules are applied to select resources for the call from the available resources, and the selected resources are allocated to process the call.