Yt Networks Capital, LLC

Nortel Networks Corporation

Lighthouse Capital Partners Iv, LP

Other

Yotta Networks, Inc.

Robert E Best

Lakshman S Tamil

Jeff L Watson

Alessandro Fabbri

Ramaswamy Chandrasekaran

John R Rudin, Iii

Rose Q Hu

Hosame Hassan Abu-Amara

Yi Qian

Wing Fai Lo

Payam Maveddat

Giridhar K Boray

Alireza Abaye

Qingyang Hu

Jeff Babbitt

The invention includes systems and methods for improving the performance of non-blocking data switching systems. One embodiment of the invention includes a method comprising routing data from a plurality of inputs to a plurality of outputs through a switching core according to a first switching schedule, receiving a first set of reports comprising reports from data sources associated with the plurality of inputs, evaluating one or more reports of the first set of reports, determining a sufficiency of the first switching schedule based on the one or more reports, adapting a second switching schedule, wherein the second switching schedule differs from the first switching schedule, sending the second switching schedule to the data sources, issuing one or more synchronization signals associated with a transition to the second switching schedule to the data sources and routing data from the plurality of inputs to the plurality of outputs through the switching core according to the second switching schedule.

System for switching data using dynamic scheduling

A non-blocking optical matrix core switching method that includes maintaining a schedule for routing data through an optical matrix core and receiving and analyzing reports from peripheral devices. The method determines whether the schedule is adequate for the current data traffic patterns and if the schedule is not adequate a new schedule is implemented. The new schedule is then transferred to the peripheral devices for implementation and the new schedule is transferred to the optical matrix core scheduler. Implementation of the new schedule as the schedule on the peripheral devices and the optical matrix core scheduler is then performed.

System and method for implementing dynamic scheduling of data in a non-blocking all-optical switching network

Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained.

Method for dynamically computing a switching schedule

Non-blocking all-optical switching network dynamic data scheduling system and implementation method

An architecture and related systems for improving the performance of non-blocking data switching systems. In one embodiment, a switching system includes an optical switching core coupled to a plurality of edge units, each of which has a set of ingress ports and a set of egress ports. The switching system also contains a scheduler that maintains two non-blocking data transfer schedules, only one of which is active at a time. Data is transferred through the switching system according to the active schedule. The scheduler monitors the sufficiency of data transferred according to the active schedule and, if the currently active schedule is insufficient, the scheduler recomputes the alternate schedule based on demand data received from the edges/ports and activates the alternate schedule. A timing mechanism is employed to ensure that the changeover to the alternate schedule is essentially simultaneous among the components of the system.

An apparatus for allocating communication channels in a manner that increases network efficiencies or operator revenue includes a resource manager that accepts and stores (forms a queue) resource requests for a period of time. Thereafter, the resource manager allocates resources according to specified criteria. The computer instructions stored within the resource manager includes logic to prompt it to allocate communication channel resources according to the size (in order of smallest to largest) of the requested resource, or to the unit value of the requested resources. The communication channels are characterized by a time slice of a signal transmitted at a specified frequency range. Prior to allocating new non-CBR communication channel resources according to size or to unit value, the communication channels are first allocated to legacy continuous bit rate (CBR) subscribers, then to legacy non-CBR subscribers, then to new CBR subscribers.

Method and apparatus for scheduling call admission control in satellite and wireless networks

A method and system are disclosed for utilizing a session processor having multiple internal states to control communication sessions occurring within a wireless and satellite network that includes at least one control interface. First, a message is received from the control interface and is then processed. Next, an internal state of the session processor is changed such that a response message may be formulated. Thereafter, internal tables and counters are updated in response to the message. Finally, the response message is delivered to the control interface, such that the session processor may be utilized to maintain comprehensive and seamless control of communications sessions occurring within the wireless and satellite network.

Controlling communication in wireless and satellite networks

Growing community of inventors

Richardson, TX, United States of America

Robert E Best