Alcatel Lucent

Alcatel

Alcatel-lucent USA Inc.

John Blanton

Dominique Verchere

Prasad N Golla

Gerard Damm

Farid Farahmand

Mei Yang

Yijun Xiong

Hakki Cankaya

Frederick H Skoog

Céline Haardt

Si Qing Zheng

Timochin Ozugur

A IP video delivery system () includes a multiplexer () for transmitting multiple data streams of packets over link () to a site having one or more receivers (). During times of congestion, the multiplexer will discard packets from its internal queues. Packets are intelligently chosen to minimize the effects on the output from the receivers () by taking into account timing information related to the packets and priority.

Video packet multiplexer with intelligent packet discard

Method and system for encoding packet interdependency in a packet data stream. In one embodiment, the scheme comprises providing, for each packet in the packet data stream, a dependency relationship field associated therewith; and representing dependency of a first packet on a second packet of the packet data stream by a binary code in the dependency relationship field of the first packet, the binary code for describing the dependency as a subset relationship between the first and second packets.

Method and system for encoding packet interdependency in a packet data transmission system

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 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

Dallas, TX, United States of America

John Blanton