New York University

Yanming Shen

Shivendra S Panwar

Shunyuan Ye

Yao Rong Wang

H Jonathan Chao

Keith W Ross

Zhengye Liu

Scheduling methods and apparatus for use with optical switches with hybrid architectures are provided. An exemplary distributed scheduling process achieves 100% throughput for any admissible Bernoulli arrival traffic. The exemplary distributed scheduling process may be easily adapted to work for any finite round trip time, without sacrificing any throughput. Simulation results also showed that this distributed scheduling process can provide very good delay performance for different traffic patterns and for different round trip times associated with current switches.

Distributed scheduling for an optical switch

Scheduling methods and apparatus are provided for an input-queued switch. The exemplary distributed scheduling process achieves 100% throughput for any admissible Bernoulli arrival traffic. The exemplary distributed scheduling process includes scheduling variable size packets. The exemplary distributed scheduling process may be easily implemented with a low-rate control or by sacrificing the throughput by a small amount. Simulation results also showed that this distributed scheduling process can provide very good delay performance for different traffic patterns. The exemplary distributed scheduling process may therefore be a good candidate large-scale high-speed switching systems.

Distributed scheduling for variable-size packet switching system

Scheduling methods and apparatus are provided for buffered crossbar switches with a crosspoint buffer size as small as one and no speedup. An exemplary distributed scheduling process achieves 100% throughput for any admissible Bernoulli arrival traffic. Simulation results also showed that this distributed scheduling process can provide very good delay performance for different traffic patterns. The simulation results also showed that packet delay is very weakly dependent on the switch size, which implies that the exemplary distributed scheduling process can scale with the number of switch ports.

Scheduling, including distributed scheduling, for a buffered crossbar switch

MD-FEC is considered an efficient way to generate a large number of descriptions. However, typically, MD-FEC introduces significant redundancy across streams. MD-FEC encoded streams (descriptions) are adapted based on feedback. Specifically, the bits sent in each description by a supplying peer are adapted based on the number of available descriptions in its receiving peer. The adaptive delivery eliminates unnecessary bits in the original MD-FEC streams (descriptions), and significantly reduces the consumed uplink bandwidth at supplying peers. The saved bandwidth can be used to accommodate more video sessions or for other applications.

Feedback assisted transmission of multiple description, forward error correction coded, streams in a peer-to-peer video system

Scheduling techniques for use with buffered crossbar switches, without speedup, which can provide 100% throughput are described. Each input/output may keep track of the previously served VOQ/crosspoint buffer. The queue lengths of such VOQs and the queue lengths of VOQs corresponding to a uniform probability selection output (e.g., from a Hamiltonian walk schedule) are used to improve the schedule at each time slot.

Growing community of inventors

Brooklyn, NY, United States of America

Yanming Shen