Patent application number | Description | Published |
20100329120 | Determining Disjoint Paths With An Optimized Number Of Regenerators - According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators. | 12-30-2010 |
20110080846 | Determining Paths In A Network With Asymmetric Switches - According to particular embodiments, determining paths in a network with asymmetric switches includes receiving a graph representing the network. Each asymmetric switch has defined degree connectivity between one or more pairs of degrees of the asymmetric switch. The graph is transformed to yield a transformed graph that accounts for the asymmetric switches. A routing process is applied to the transformed graph to yield one or more paths through the network. | 04-07-2011 |
20110167183 | Minimizing Interconnections In A Multi-Shelf Switching System - In certain embodiments, minimizing interconnections in a multi-shelf switching system includes receiving a map describing the switching system, where the switching system comprises shelves and input/output (I/O) points. The map is transformed to yield a graph comprising nodes and edges. A node represents an I/O point, and a node weight represents a number of interface cards of the I/O point represented by the node. An edge between a node pair represents traffic demand between the I/O points represented by the node pair, and an edge weight represents the amount of the traffic demand represented by the edge. The graph is partitioned to yield a groups that minimize interconnection traffic among the shelves, where each group represents a shelf of the multi-shelf switching system. | 07-07-2011 |
20110206374 | System and Method for Demand Aggregation in Optical Networks Employing Shared Ring Protection - In accordance with embodiments of the present disclosure, a method for demand aggregation is provided. The method may include routing demands in a ring network such that a length for each routed demand does not exceed a route length maximum, and a load imbalance at each node in the ring network is minimized. The method may also include maximizing optical line card sharing by assigning routed demands sharing common ends to the same wavelength. | 08-25-2011 |
20110242995 | SYSTEMS AND METHODS FOR MULTI-DOMAIN ROUTING - Systems and methods for multi-domain routing are provided. In some embodiments, a method for determining a path calculation from a source node to a destination node over a multi-domain network is provided. The method may include steps for receiving a predetermined sequence of domains for communicating information from the source node to the destination node, determining a link type for each of a plurality of links in the predetermined sequence of domains, modifying the link type of one or more of the plurality of links such that the plurality of links are unidirectional links towards a destination node, and determining a path along the predetermined sequence of domains based on the modified plurality of links. | 10-06-2011 |
20110243030 | SYSTEMS AND METHODS FOR DETERMINING PROTECTION PATHS IN A MULTI-DOMAIN NETWORK - Systems and methods for determining multiple paths in a multi-domain network are provided. In some embodiment, a method for determining multiple paths in a network is provided. The method may include determining a first path between a source node and a destination node and determining a second path disjoint from the first path. In some embodiments, to determine the second path includes determining which ingress nodes are available in a domain that includes the destination node, where the available ingress nodes are not part of the first path, and implementing a disjoint path algorithm for each of the available ingress nodes. To determine the first path includes implementing forward path calculations. | 10-06-2011 |
20120093507 | Dynamic Circuit Adjustment - A system and method are provided for dynamically reconfiguring an optical circuit between a first node and a second node of a communication network. The system and method may include establishing a scheduling window for receiving a plurality of optical traffic demands, classifying the plurality of optical traffic demands into at least a set of bandwidth adjustable demands and a set of fixed bandwidth demands, provisioning a first set of provisioned wavelengths from the plurality of wavelengths to carry the set of fixed bandwidth demands during the scheduling window, allocating the bandwidth remaining on the first set of provisioned wavelengths to the set of bandwidth adjustable demands, and if necessary, provisioning a second set of provisioned wavelengths from the plurality of wavelengths to carry the bandwidth required by the set of bandwidth adjustable demands that could not be allocated to the first set of provisioned wavelengths. | 04-19-2012 |
20120117269 | SYSTEMS AND METHODS FOR MULTI-LAYER TRAFFIC GROOMING - A method may include constructing an auxiliary graph for a network comprising a plurality of network elements, the network elements having an Internet Protocol layer, a lower layer, and a wavelength layer, the auxiliary graph including a plurality of directed edges, the plurality of directed edges indicative of connectivity of components of the plurality of network elements. The method may further include: (i) deleting directed edges from the auxiliary graph whose available bandwidth is lower than the required bandwidth of a selected demand; (ii) finding a path for the demand on the auxiliary graph via remaining directed edges; (iii) deleting at least one directed edge of the auxiliary graph on the wavelength layer along the path; (iv) adding lower layer lightpath edges to the auxiliary graph for a lower layer lightpath for the path; and (v) converting lower layer lightpaths to Internet Protocol lightpaths if a conversion condition is satisfied. | 05-10-2012 |
20120263455 | METHOD AND SYSTEM FOR CALCULATING SPECTRUM GRANULARITY IN FLEXIBLE GRID OPTICAL NETWORKS - In accordance with embodiments of the present disclosure, a method may include determining individual spectrum requirements for each of a plurality of signals to be communicated in an optical network, wherein a first signal of the plurality of signals has a first spectrum requirement and a second signal of the plurality of signals has a second spectrum requirement. The method may also include calculating a minimum spectrum granularity based on the individual spectrum requirements. The method may further include assigning each particular signal a channel spectrum equal to an integer multiple of the minimum spectrum granularity. | 10-18-2012 |
20120301140 | Methods for Efficient Transmission in OTN Networks - In accordance with some embodiments of the present disclosure a method for shared mesh protection in an optical transport network comprises provisioning a route for each of a plurality of working demands through the optical transport network. The method further comprises provisioning a route for backup demands corresponding to each of the plurality of working demands. The method additionally comprises packing into a single optical data unit a first backup demand corresponding to a first of the plurality of working demands and a second backup demand corresponding to a second of the plurality of working demands, wherein the first and second of the plurality of working demands share at least one common link in the optical transport network. The method also comprises unpacking the first and second backup demands from the optical data unit. | 11-29-2012 |
20120328286 | System and Method for Calculating Utilization Entropy - A system and method are provided for monitoring traffic in a network comprising a plurality of links, wherein each of the plurality of links comprises a plurality of neighboring pairs of slots. The system and method may include identifying a first usage status and a second usage status, calculating a utilization entropy value based at least on the difference between the first and second usage status, iteratively calculating a set of utilization entropy values for a portion of the network, and calculating an overall utilization entropy value for the portion of the network under analysis based at least on a statistical analysis of the set of utilization entropy values. | 12-27-2012 |
20130089317 | METHOD AND SYSTEM FOR HYBRID MULTI-LAYER MESH RESTORATION IN A COMMUNICATION NETWORK - In accordance with embodiments of the present disclosure, a method may include sorting potential optical layer link failures in a network in an increasing order of failed traffic amount. The method may further include, for each potential optical link failure in increasing order of failed traffic amount: determining the additional higher layer link capacity required on existing higher layer links associated with the potential optical link failure using higher layer restoration of the potential optical link failure; determining the additional optical layer capacity required for restoring the existing higher layer links associated with the potential optical link failure using optical layer restoration; and selecting one of the higher layer and the optical layer as a restoration layer for restoration of the existing higher layer links associated with the potential optical link failure based on the determined additional higher layer link capacity and the determined additional optical layer capacity. | 04-11-2013 |
20130272693 | SYSTEM AND METHOD FOR SHARED MESH RESTORATION IN OPTICAL NETWORKS - A method for shared mesh restoration includes configuring a switch to allow sharing of a plurality of backup line cards across a plurality of node degrees associated with a reconfigurable optical add/drop multiplexer (ROADM). The switch is communicatively coupled to the ROADM. The method further includes configuring a number of backup line cards coupled to the switch. The number of backup line cards is based on determining a number of active backup lightpaths for each of a plurality of network failures associated with each of the plurality of node degrees of the ROADM, identifying which node degree and failure has the largest number of active backup lightpaths for all of the plurality of node degrees of the ROADM and for each of the plurality of network failures, and determining the number of backup line cards to configure based on the identified largest number of active backup lightpaths. | 10-17-2013 |
20140052419 | PROBABILITY-BASED REGENERATOR SITE ANALYSIS - An optical network analysis tool includes a computer-readable storage medium having computer-readable instructions stored thereon. The computer-readable instructions are executable by a computing device to perform operations. The operations include generating a simulated network that models an optical network. The simulated network includes regenerator candidate sites. The operations may also include conducting an analysis of the optical network. The analysis includes introducing a multiple signals transmitted between source/destination pairs and recording a number of times each of the regenerator candidate sites are selected as a regenerator site while applying each of a set of data traffic conditions in the simulated network. The operations may also include statistically analyzing the number of times each of the regenerator candidate sites is selected to generate statistically analyzed information and presenting the statistically analyzed information. | 02-20-2014 |
20140099102 | SYSTEMS AND METHODS FOR STATISTICAL SHARING IN OPTICAL COMMUNICATIONS NETWORKS - A method of statistical sharing in an optical communications network is disclosed. The method includes identifying a peak transmission rate and a base transmission rate for each of a plurality of client interface cards of an optical node. | 04-10-2014 |
20140099118 | SYSTEMS AND METHODS FOR ROUTING AND WAVELENGTH ASSIGNMENT FOR NETWORK VIRTUALIZATION - A method for routing and wavelength assignment for optical network resources required for a plurality of virtual network requests includes receiving the plurality of virtual network requests. The method further includes determining a number of virtual links for each virtual network request. The method includes sorting the plurality of virtual network requests based on the number of virtual links, and selecting a virtual network request from the plurality of virtual network requests and setting a number of allowable spans. Additionally, the method includes determining whether a valid virtual node mapping exists for the virtual network request on any of a plurality of wavelengths based on the allowable spans, and based on determining that no valid virtual node mapping exists on any of the plurality of wavelengths, incrementing the number of allowable spans. | 04-10-2014 |
20140215032 | SYSTEMS AND METHODS OF NETWORK RECONFIGURATION - The present disclosure may include a method of reconfiguring a network. The method includes collecting a plurality of network demands, each of the plurality of network demands having a possible resource release by rerouting the network demand from its current path to a new path. The method further includes selecting a subset of the plurality of network demands that, if rerouted, has the highest resource release without resource contention. The method additionally includes rerouting the subset of the plurality of network demands, and, in response to rerouting the subset of the plurality of network demands, releasing resources no longer used by rerouted demands. The present disclosure may further include associated systems and apparatuses. | 07-31-2014 |
20140308040 | OPTICAL PATH COMPUTATION BASED ON A REACHABILITY MATRIX - Methods and systems for optical path computation based on a reachability matrix may rely on matrix multiplication to determine a number and respective network locations of regenerators for establishing an end-to-end reachable path in an optical network between a source node and a destination node. The reachability matrix may specify directly reachable optical paths between nodes in the optical network. | 10-16-2014 |
20140317257 | RISK MITIGATION IN DATA CENTER NETWORKS - A method employing resource orchestration algorithms may find a fewest number of working data centers (DCs) to guarantee K-connect survivability using an overlay network representing a physical optical network. The overlay network may not include certain topological features of the physical optical network. A risk-based algorithm may result in fewer working DCs for K-connect survivability. A delay-based algorithm may be more suitable for delay-sensitive cloud applications. | 10-23-2014 |