Methods and systems are provided for determining a shortest minimum regeneration path in an optical network. The method includes creating a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links. The method includes traversing the virtual nodes, wherein traversing the virtual nodes comprises selecting an unvisited virtual node at a node; identifying a candidate virtual node from the unvisited virtual node; determining whether the candidate virtual node exceeds a maximum permitted weight; determining whether the candidate virtual node violates a shortest minimum regeneration path condition; and creating the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition.

Aspects of the disclosure involve a source node, having some predetermined knowledge of the optical network generating a list of nodes and/or optical links between nodes that form a route in the optical network from the source node to the destination node. The nodes in the optical network do not necessarily need to know the entire route from source node to destination node. Each node simply decodes the control information identifying the next hop in the route towards the destination node. By utilizing the decoded control information identifying the next hop, a switch in the node can be controlled to route the optical signal including the payload and some or all of the control information onto the next optical link toward the destination node.

Today's communications require an effective yet scalable way interconnection of data centers and warehouse scale computers (WSCs) whilst operators must provide a significant portion of data center and WSC applications free of charge to users and consumers. At present, data center operators face the requirement to meet exponentially increasing demand for bandwidth without dramatically increasing the cost and power of the infrastructure employed to satisfy this demand. Simultaneously, consumer expectations of download/upload speeds and latency in accessing content provide additional pressure. Accordingly, the inventors provide a number of optical switching fabrics which reduce the latency and microprocessor loading arising from the prior art Internet Protocol multicasting techniques.

Today's communications require an effective yet scalable way interconnection of data centers and warehouse scale computers (WSCs) whilst operators must provide a significant portion of data center and WSC applications free of charge to users and consumers. At present, data center operators face the requirement to meet exponentially increasing demand for bandwidth without dramatically increasing the cost and power of the infrastructure employed to satisfy this demand. Simultaneously, consumer expectations of download/upload speeds and latency in accessing content provide additional pressure. Accordingly, the inventors provide a number of optical switching fabrics which reduce the latency and microprocessor loading arising from the prior art Internet Protocol multicasting techniques.

Today's communications require an effective yet scalable way interconnection of data centers and warehouse scale computers (WSCs) whilst operators must provide a significant portion of data center and WSC applications free of charge to users and consumers. At present, data center operators face the requirement to meet exponentially increasing demand for bandwidth without dramatically increasing the cost and power of the infrastructure employed to satisfy this demand. Simultaneously, consumer expectations of download/upload speeds and latency in accessing content provide additional pressure. Accordingly, the inventors provide a number of optical switching fabrics which reduce the latency and microprocessor loading arising from the prior art Internet Protocol multicasting techniques.

Aspects of the disclosure involve a source node, having some predetermined knowledge of the optical network generating a list of nodes and/or optical links between nodes that form a route in the optical network from the source node to the destination node. The nodes in the optical network do not necessarily need to know the entire route from source node to destination node. Each node simply decodes the control information identifying the next hop in the route towards the destination node. By utilizing the decoded control information identifying the next hop, a switch in the node can be controlled to route the optical signal including the payload and some or all of the control information onto the next optical link toward the destination node.

Methods and systems of a leased line appliance (LLA) network switching system that includes using LLAs for leased line circuits (LLCs) to Internet Protocol (IP) transceiving, IP to LLCs transceiving, and an IP switch fabric having multiple parallel paths as a switching/routing network are disclosed. Each of the LLAs at the edge of the IP switch fabric may perform LLC to IP packet assembly procedures, may perform IP packet to LLC re-assembly procedures, and may utilize the protocol fields of the IP packet header of the IP packet for IP packet transport, which may enable the transport of very high speed leased line services to be carried over an IP/MPLS network using the IP switch fabric.

Methods and systems are provided for determining a shortest minimum regeneration path in an optical network. The method includes creating a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links. The method includes traversing the virtual nodes, wherein traversing the virtual nodes comprises selecting an unvisited virtual node at a node; identifying a candidate virtual node from the unvisited virtual node; determining whether the candidate virtual node exceeds a maximum permitted weight; determining whether the candidate virtual node violates a shortest minimum regeneration path condition; and creating the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition.