Ciena Corporation

Dispersive Networks, Inc.

Dispersive Holdings, Inc.

Gustav Larsson

Abhishek Chaudhary

William Vaughan

Boris Altshul

Michael John Wingrove

Vagish Madrahalli

Richard W Conklin

Satish Mysore Gopalakrishna

Jonathan Sewter

Neena Aluri

Hongxing Meng

Goran Bjelcevic

Saravanan Purushothaman

Feng Ling

Satish Gopalakrishan

In accordance with one or more preferred implementations, an overlay network in the form of a dispersive virtual network is implemented utilizing data deflects to implement and facilitate routing in a data plane and call processing deflects to implement and facilitate routing in a control plane. Various nodes in the dispersive virtual network, such as end devices running dispersive virtual networking client software, establish communication channels to these deflects running dispersive virtual networking protocols transported by user datagram protocol (UDP) frames, transmission control protocol (TCP) streams, and hypertext transfer protocol (HTTP) streams. In accordance with one or more preferred implementations, software allows nodes in a dispersive virtual network to automatically detect the channel types that are available at the time the node must initiate a new session, and automatically configure the most efficient communication channel without requiring input from an end user or from a network administrator.

Automatically selecting an optimized communication channel for communications with a deflect in an overlay network

A system includes a plurality of modules, a backplane communicatively coupled to the plurality of modules, a plurality of links defined between the plurality of modules over the backplane, and a link management system configured to dynamically manage parameters associated with each of the plurality of links. A link management method includes, for a system, defining a codebook for each module, device, and interconnect in the system, the codebook includes data describing physical link topologies and configuration parameters associated therewith, for initializing a link in the system, obtaining appropriate codebooks for each segment in the link, calculating an overall link loss for the link based on data in the appropriate codebooks, and obtaining configuration parameters for the link based on the overall link loss.

Link management systems and methods for multi-stage, high-speed systems

The present disclosure provides to Optical Transport Network (OTN_ synchronization systems and methods that maintain proper sequential ordering of events at nodes which may be utilized in performing root cause analysis or diagnosing network performance. In an exemplary embodiment, the systems and methods utilize functionality incorporated into OTN providing a cost effective and standards-based approach to nodal synchronization. Once synchronized, network events are logged with an appropriate timestamp enabling a determination of a sequential order of network events can be determined. Further, the node timestamps may be synchronized, with microsecond or even sub-microsecond of precession which is critical in diagnosing network failures or slow traffic recovery.

Optical transport network synchronization and timestamping systems and methods

The present disclosure provides dynamic service provisioning by creating embedded Optical Transport Network (OTN) ports on the fly during mesh restoration or circuit provisioning. These dynamically provisioned ports are referred to herein as 'fast paths' with all the management objects created in a 'slow path' so that they do not interfere with mesh restoration performance. During network failures, these dynamically created objects are deleted via the &#x201c;slow path&#x201d; and a new mesh path supports &#x201c;fast path&#x201d; creation of these objects. This results in substantial increase in mesh performance and also provides enhancements for operators allowing a &#x201c;Click and Go&#x201d; model to provision circuits across a network. This also reduces routing scaling issue as the routing itself is against the OTU level and not against the embedded lines.

Dynamic trail termination point creation for optical transport networks

The present invention provides systems and methods for programming connections through a multi-stage switch fabric. The present invention utilizes load-balancing, blocking recovery, background rebalancing, and rollback algorithms to select and manage connection balance on center stage switches in the multi-stage switch fabric for new and modified connections. The load-balancing algorithm attempts to spread the multi-connection slices across center stage switches as evenly as possible, to increase the probability that future multi-connection slices can be added without needing to rearrange existing slices. Advantageously, the present invention is efficient by making the best possible local decision for one multi-connection slice at a time, without considering other multi-connection slices that may also need center switch assignments. Additionally blocking recovery, rollback and background rebalancing features are also supported.

Systems and methods for programming connections through a multi-stage switch fabric with blocking recovery, background rebalancing, and rollback

Growing community of inventors

Sunnyvale, CA, United States of America

Gustav Larsson