Alcatel Lucent

Valo, Inc.

Other

Sina Soltani

Radimir Shilshtut

Li-Sheng Chen

Mudhafar Hassan-Ali

Francisco Moreno

Jeff Mendelson

Annie Rastello

Soren Pedersen

Danny Thom

Manish Lohani

Lauren Trevor May

Li-Chen Sheng

Mudhafar A Hassan-Ali

A Virtual Group Connection (VGC) scheme for grouping ATM connections. A plurality of VPCs, VCCs, or both are managed together as a single virtual data pipe having a pool of common connection resources (e.g., bandwidth, buffering, etc.) associated therewith. Shaping, grooming, policing, switching, and other traffic engineering operations may be performed on a VGC as a single connection hierarchy operable to be associated with a single customer.

Virtual group connection scheme for ATM architecture in an access node

A scheme for implementing GFR service in an ATM environment, e.g., an access node's ATM switch fabric. Regulation of a GFR flow is throttled between two modes, a guaranteed rate mode and a non-guaranteed rate mode, depending upon timestamps computed by applicable traffic policer/shaper algorithms. A scheduler is operably coupled to a policing block for scheduling cells from a guaranteed flow queue for transport via the ATM fabric at a guaranteed rate upon determining the onset of a guaranteed service frame. The scheduler switches to non-guaranteed rate mode for scheduling cells from the flow queue at a non-guaranteed rate when a timestamp (TS) for transmission at the non-guaranteed rate is earlier than a timestamp (TS) for transmission of a next guaranteed service frame at the guaranteed rate.

System and method for implementing GFR service in an access node's ATM switch fabric

A hierarchical scheduler architecture for use with an access node terminal disposed in an access network portion. Ingress flows aggregated via a plurality of aggregation layers are switched through an ATM fabric that segregates flow cells based on service priority categories (planes). Thus, a two-dimensional scheduler employs arbitration on a per-aggregation layer, per-service priority basis, wherein each layer is responsible for selecting the most eligible flow from the constituent flows of that layer, which is forwarded to the next layer for arbitration. A service-based arbiter selects overall winner cells for emission through the fabric from winner cells generated for each service plane.

Hierarchical scheduler architecture for use with an access node

A multicast scheme for scheduling a root flow in an ATM environment. A buffer system including an index memory is operable to contain a plurality of leaf flow index values associated with the leaves and a root flow index associated with the root flow from the ingress interface. A pointer memory is provided wherein a plurality of circularly-linked pointers are indexed from the leaf and root flows. A cell memory is provided with a plurality of cell memory locations to which the linked pointers point. Root flow cells in the ATM environment are stored in the cell memory locations based on the root flow index. When a particular flow becomes eligible for scheduling, a copy of a root cell is obtained for emission, the root cell being located in a cell memory location that is pointed to by a linked pointer, to which the particular leaf flow is indexed.

Multicasting system and method for use in an access node's ATM switch fabric

A calendar heap structure and method for sorting N timestamp (TS) values in an ATM fabric scheduler implemented in an access network element. The heap structure is implemented using a radix value (R) for grouping the N TS values into a number of groups. Validity bits associated with the TS values are hierarchically arranged in a tree having log(N) levels, wherein the bottom layer's N bits correspond to pointers that point to linked lists of flows with respective TS values. Starting from the top level heap, each subsequent level's heaps are successively examined for determining which particular heap obtains a minimum value until a particular validity bit of the bottom level is reached, which validity bit points to the minimum TS.

Calendar heap system and method for efficient sorting

Methods, apparatuses and systems facilitating the aggregation or bonding of communications paths into a higher-bandwidth, logical communications path. Embodiments of the present invention can be applied to bond different physical links (e.g., xDSL over twisted pairs), different channels on the same physical line, or even different channels or frequencies in a wireless communications network. The present invention further provides methods, apparatuses and systems facilitating the re-sequencing of data flows transmitted across bonded communications paths. In one embodiment, the re-sequencing methodology of the present invention adapts to the transmission delays (both absolute and relative) across the bonded communications path.

Methods, apparatuses and systems facilitating data transmission across bonded communications paths

Methods, apparatuses and systems facilitating the aggregation or bonding of physical communications links into higher-bandwidth logical links. A novel link bonding and encapsulation protocol scheme that optimizes the efficiency of data transfer across the physical links, while still allowing for desired Quality of Service (QoS) levels to high-priority traffic, such as voice data, with low delay requirements. Data streams are divided and concurrently transported over multiple physical links that are aggregated or bonded together to form one logical link. At the receive end, the original cell streams are recovered from the bonded logical links. In one embodiment, the physical links are xDSL links transmitting and receiving signals via conventional copper twisted-pair cabling. In one embodiment, the present invention allows telecommunications service providers to leverage their investments in existing twisted pair connection technologies to deliver high-bandwidth services to customers in a fast and cost-efficient manner.

Growing community of inventors

Rohnert Park, CA, United States of America

Sina Soltani