Patents by Inventor Shunyuan Ye

Shunyuan Ye has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8873955
    Abstract: 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.
    Type: Grant
    Filed: October 25, 2011
    Date of Patent: October 28, 2014
    Assignee: Polytechnic Institute of New York University
    Inventors: Shivendra S. Panwar, Yanming Shen, Shunyuan Ye
  • Patent number: 8824491
    Abstract: 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.
    Type: Grant
    Filed: October 25, 2011
    Date of Patent: September 2, 2014
    Assignee: Polytechnic Institute of New York University
    Inventors: Shivendra S. Panwar, Yanming Shen, Shunyuan Ye
  • Patent number: 8737414
    Abstract: 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.
    Type: Grant
    Filed: December 10, 2010
    Date of Patent: May 27, 2014
    Assignee: Polytechnic Institute of New York University
    Inventors: Shunyuan Ye, Yanming Shen, Shivendra S. Panwar
  • Publication number: 20120128007
    Abstract: 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.
    Type: Application
    Filed: October 25, 2011
    Publication date: May 24, 2012
    Inventors: Shivendra S. PANWAR, Yanming Shen, Shunyuan Ye
  • Publication number: 20120128354
    Abstract: 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.
    Type: Application
    Filed: October 25, 2011
    Publication date: May 24, 2012
    Inventors: Shivendra S. PANWAR, Yanming Shen, Shunyuan Ye
  • Publication number: 20110170558
    Abstract: 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.
    Type: Application
    Filed: December 10, 2010
    Publication date: July 14, 2011
    Inventors: Shunyuan Ye, Yanming Shen, Shivendra S. Panwar