Abstract: The invention relates to a method and an apparatus for producing a hydrocarbons product from plastic containing material, wherein the plastic containing material is subjected into a pyrolysis reactor, steam is fed into the pyrolysis reactor, and the plastic containing material is pyrolyzed in the presence of the steam by using a catalytic pyrolysis with a mildly acidic catalyst comprising at least aluminium oxide, aluminium silicate, zirconium oxide or their combinations to convert the plastic containing material to the hydrocarbon product comprising wax. Further, the invention relates to the use of the product obtained by the method.

Abstract: An intraocular lens system comprising a single lens comprising two optical surfaces selected to maintain image quality at the foveal centre whilst reducing image aberration at preferred retinal locus locations outside of the fovea region.

Abstract: The invention relates to a method and an apparatus for producing hydrocarbons from plastic containing material, wherein the plastic containing material (1) is subjected into a pyrolysis reactor (2), steam (3) is fed into the pyrolysis reactor, and the plastic containing material is pyrolyzed with the steam by using a catalytic pyrolysis with a basic catalyst to convert the plastic containing material to a product (4) comprising hydrocarbons. Further, the invention relates to the use of the product obtained by the method.

Abstract: An intraocular lens system comprising a single lens comprising two optical surfaces selected to maintain image quality at the foveal centre whilst reducing image aberration at preferred retinal locus locations outside of the fovea region.

Abstract: An intraocular lens system comprising a single lens comprising two optical surfaces selected to maintain image quality at the foveal centre whilst reducing image aberration at preferred retinal locus locations outside of the fovea region.

Abstract: An intraocular lens system comprising a single lens comprising two optical surfaces selected to maintain image quality at the foveal centre whilst reducing image aberration at preferred retinal locus locations outside of the fovea region.

Abstract: A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.

Abstract: A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.

Abstract: A protected communication network utilizes a link-based recovery strategy that supports independent recovery paths for individual demands, where each link includes one or more lines and each line can support one or more demands. Failure of one or more—or even all—of the lines/ports of a link will typically result in the independent rerouting of the affected demands along one or more link-detour paths. The flexibility afforded by recovery at the granularity of a demand supports the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. The network also addresses the restricted case where all demands on a line/port are recovered along the same link-detour path.

Abstract: An optical transport network comprises a number of nodes, or routers, which are coupled together via optical fibers. When a physical link comes up between a node and a neighboring node, a handshake between the node and the neighboring node recognizes the link such that the node, and the neighboring node, include it in respective link assignment tables. In addition, the node and the neighboring node negotiate a predefined sequence for assigning link resources from their respective assignment tables for satisfying future connection requests.

Abstract: A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.

Abstract: A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

Abstract: A protected communication network utilizes a link-based recovery strategy that includes methods for calculating and distributing link-protection parameters and calculating primary and link-detour paths based on these parameters. These link-protection parameters support the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. A joint-optimization mechanism can be employed that considers both the cost of link-detour paths as well as the cost of links in candidate primary paths in the selection of a primary path for a demand. Information for the joint optimization is preferably distributed using link-state advertisements.

Abstract: An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.

Abstract: In a packet-based data network, packets are duplicated and a sequence number is inserted into each duplicate packet, where the duplicate packets are transmitted along two different paths from a source node to a destination node in the network. Depending on the implementation, the source node inserts different types of sequence numbers into the duplicate packets, and the destination node processes those sequence numbers accordingly to determine whether to accept or reject each received packet. In certain implementations, the number of sequence bits allocated to each packet is smaller than the size of the effective sequence number for the packet as interpreted by the destination node.

Abstract: In a network architecture, selective grooming is performed. In selective grooming, a low traffic node is coupled (a) directly to an other low traffic node via a high capacity trunk, and (b) to a high traffic node via a high capacity trunk such that only a portion of the client signals destined for the other low traffic node are groomed into the high capacity trunk to the high traffic node.

Abstract: Method and apparatus for routing messages in a network includes first filters to provide frequency-based message signals converted from an optically-based signal and mixers adapted to mix the frequency-based message signals with sub-carriers to generate frequency-based sub-carrier modulated message signals. A frequency generator connected to the mixers provides the sub-carriers to the mixers and a combiner connected to the mixers combines the frequency-based sub-carrier modulated message signals. Second filters connected to the combiner receive and group the frequency-based sub-carrier modulated message signals. Optical transmitters connected to second filters optically convert and transmit the frequency-based sub-carrier modulated message signals. The frequency generator generates and applies a particular sub-carrier frequency to one of the mixers according to information contained in the frequency-based message signal.

Abstract: An Optical Transport Network (OTN) (comprising a number of OTN nodes) uses an Internet Protocol (IP) based control plane (out-of-band signaling on a separate wavelength). Each OTN node of the IP-based control plane performs dual-feeding and dual-selecting of signaling messages on diverse signaling paths. The IP-based control plane establishes a pair of physically disjoint signaling paths between every set of neighboring OTN nodes (pre-computed and pre-established physically disjoint primary and secondary message paths in the IP-based control plane).

Abstract: A protected communication network utilizes a link-based recovery strategy that supports independent recovery paths for individual demands, where each link includes one or more lines and each line can support one or more demands. Failure of one or more—or even all—of the lines/ports of a link will typically result in the independent rerouting of the affected demands along one or more link-detour paths. The flexibility afforded by recovery at the granularity of a demand supports the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. The network also addresses the restricted case where all demands on a line/port are recovered along the same link-detour path.

Abstract: A protected communication network utilizes a link-based recovery strategy that incorporates loop-avoidance mechanisms to eliminate redundant traversal of links in recovery paths, thereby improving network efficiency. The loop-avoidance mechanisms can include calculation of recovery paths taking into account protected segments that include shared risk link groups. In one two-phase loop-avoidance mechanism, a full link-detour path is calculated for a primary-path link by generating a minimum cost path between the upstream and downstream terminating nodes for the link. Next, the full link-detour path is shortened by removing redundant links that are shared by the full link-detour path and the original primary path. Calculation of link-detours and elimination of loops is supported in some embodiments by the distribution of link-state parameters via extensions to the link-state-advertisement (LSA) protocol.