Alcatel Lucent

Alcatel

Dominique Verchere

John Blanton

Prasad N Golla

Gerard Damm

Timucin Ozugur

Farid Farahmand

Mei Yang

Yijun Xiong

Hakki Cankaya

Dohy Hong

Annalisa Morea

Martin Vigoureux

Sabine Randriamasy

Richard Douville

Jason P Jue

Si Qing Zheng

Céline Haardt

Timochin Ozugur

A method for controlling the establishment of a connection with a transport network, said message consisting of extracting from a first signaling message a piece of switching status information for a transport switch of said node, configuring said transport switch within said switching status (), estimating () a piece of time information regarding the configuration of said transport switch and generating a second signaling message intended for a network element of said transport network, said second signaling message comprising a piece of time information for determining a configuration end date of said transport switch. Said second signaling message may be transmitted without waiting for the end of communication of said transport switch. A controller is also described.

Method for controlling the establishment of a connection within a transport network

Various exemplary embodiments are a method and apparatus for selecting an access solution in a Grid network including one or more of the following: receiving an application request, the application request having an associated application cost; identifying a plurality of Grid endpoints for which the application cost is not more than an amount of available resources at each of the plurality of Grid endpoints; computing, for each of the plurality of Grid endpoints, a lowest cost path to access the Grid endpoint; and selecting, as the access solution, a first Grid endpoint of the plurality of Grid endpoints. Various exemplary embodiments are a method of selecting aback-up access solution in a Grid network including one or more of the following: ordering a first plurality of couples according to one or more metrics; determining a strategy; and calculating a share of resource load for each couple in the strategy.

Dynamic multi-objective grid resources access

A Look-ahead Contention Resolution ('LCR') technique for application in burst switching networks is described. The LCR technique takes advantage of the existing separation of data bursts and their BHPs in time (offset or '&#x3c4;'). Through a look-ahead window (&#x201c;LAW&#x201d;) W time units wide, a network scheduler can process a group of BHPs prior to the arrival of their respective bursts and gain a collective knowledge of the state of the switch in the futures, rather than processing a single slot &#x3c4; time units in the future.

Look-ahead contention resolution method for a burst switching network

A Parallel Round-Robin Arbiter (PRRA) system and method for arbitrating among N requesters. A plurality of leaf nodes that correspond to the N requesters form a directed ring of a hierarchical decision tree, wherein the leaf nodes are operable to propagate requests from the requesters. Each leaf node is provided with status logic operable to transmit its priority status for resolution of requests by the decision tree. Logic associated with the decision tree's nodes is operable to hierarchically resolve the requests propagated by the leaf nodes, wherein each leaf node is operable to transmit its grant to one of its immediate leaf node neighbors coupled to it via the directed ring for influencing the neighboring leaf node's priority status logic.

Parallel round-robin arbiter system and method

A scheduling system and method operable with a burst switching element wherein control information is provided to the switching element via a separate Burst Header that precedes data bursts on ingress data channels. In one embodiment, a series of scheduling determinations are made in a select order such that packet treatment (i.e., processing for transmission, buffering, or packet dropping) is optimized with respect to packet loss and available buffer space. In another embodiment, control information received in the Burst Headers is utilized to reserve output data channel bandwidth to future incoming data packets in a forward-looking scheduling mechanism.

Scheduling system and method for a burst switch

A lightpath segmentation system and method for use in a GMPLS network is described. In one embodiment, lightpaths are divided into segments according to the distribution of the wavelength-converter-equipped optical switches, or nodes, within a WDM network. As the number of hops within the segment increases, a lightpath segmentation probability increases. When a wavelength-converter-equipped node receives an LSP Request message, it calculates the LPSP and, if the LPSP exceeds a threshold, the node sets up a lightpath between itself and the ingress node or a previous upstream wavelength-converter-equipped node, if the lightpath has already been segmented.

Lightpath segmentation system and method in a generalized multi-protocol label switching network

An optical switch controller ('OSC') and method for use in a Generalized Multi-Protocol Label Switching ('GMPLS') network is described. A Used Pool (&#x201c;UP&#x201d;), an Available Pool (&#x201c;AP&#x201d;), and a Flagged Pool (&#x201c;FP&#x201d;) are maintained at the OSC. The FP includes wavelengths that have been suggested but not yet reserved by a lightpath. The UP includes wavelengths that are currently being used by LSPs. The AP includes wavelengths not included in the UP or the FP. Each wavelength included in the FP includes a time stamp. At each node along the path during lightpath establishment, for each wavelength of the Label Set, if the wavelength is an element of the node's UP, the wavelength is extracted from the Label Set. If the wavelength is an element of the node's FP, a determination is made whether the local clock time minus the time stamp for the wavelength is less than a first threshold. If so, the wavelength is extracted from the Label Set; otherwise, the wavelength is extracted from the Label Set and included in a Flagged Set. For each wavelength of the FP, upon expiration of the time stamp, the wavelength is returned to the AP.

Optical switch controller for fair and effective lightpath reservation in an optical network

A look-up table (LUT)-based arbitration (LTA) system and methodology for use in a network switch element. Input control signals generated by ingress and egress entities associated with a cross-connect matrix of the network switch element are encoded into address information that is used for interrogating a storage structure. Pre-computed arbitration results based on a select arbiter scheme are stored into fields associated with the storage structure. When a particular input combination is applied with respect to an arbitration iteration, a selected arbitration result is obtained by querying the appropriate field, which is then decoded into a corresponding selected entity for the arbitration iteration.

Look-up table arbitration system and method for a fast switching element

A scheduling system and methodology for use in a network switch element having multiserver, multiple-arbiter architecture. Ingress ports and egress ports coupled to the cross-connect fabric of the network element are provided with multiple ingress and egress arbiters, respectively, for effectuating an iterative arbitration strategy such as RGA or RG. Arbiter architectures include singe-arbiter-per-port; single-arbiter-per-server; multiple-arbiters-per-port; and multiple-arbiters-per-server arrangements, wherein the arbiters can be implemented using RRA, BTA, Flexible Ring, or any other arbiter technology. Depending on the iteration strategy, ingress arbiter architecture and egress arbiter architecture, a variety of iterative, multiserver-capable scheduling algorithms can be obtained, which scheduling algorithms can also be implemented in QoS-aware network nodes.

Multiserver scheduling system and method for a fast switching element

A binary-tree-based arbitration system and methodology with attributes that approximate a Generalized Processor Sharing (GPS) scheme for rendering fairer service grants in an environment having a plurality of competing entities. Arbitration based on probabilistic control of arbiter nodes' behavior is set forth for alleviating the inherent unfairness of a binary tree arbiter (BTA). In one implementation, BTA flag direction probabilities are computed based on composite weighted functions that assign relative weights or priorities to such factors as queue sizes, queue ages, and service class parameters. Within this general framework, techniques for desynchronizing a binary tree's root node, shuffling techniques for mapping incoming service requests to the BTA's inputs, and multi-level embedded trees are described.

Growing community of inventors

Plano, TX, United States of America

Dominique Verchere