×

Method and apparatus for scheduling cells for use in a static priority scheduler

  • US 5,999,534 A
  • Filed: 11/24/1997
  • Issued: 12/07/1999
  • Est. Priority Date: 12/26/1996
  • Status: Expired due to Term
First Claim
Patent Images

1. A method for scheduling a plurality of cells of N number of prioritized queues in a node of an ATM network, N being a positive integer, wherein each prioritized queue has a static priority different from priorities of other queues, the method comprising the steps of:

  • (a) in response to a cell having a jth static priority, calculating a holding time after which the cell will be eligible for transmission, wherein the static prioritized number j is a positive integer less than or equal to N and a smaller static prioritized number has a higher priority;

    (b) holding the cell for the holding time so that the cell becomes eligible for transmission;

    (c) generating an empty flag EFj of a value either `0` or `1` on a time slot basis, wherein the empty flag EFj of a value `0` represents that there exists an eligible cell for transmission in a corresponding jth prioritized queue while that of a value `1` indicates that there is none eligible;

    (d) switching a jth prioritized queue to a higher prioritized switch in a jth prioritized switch based on the empty flag EFj, wherein the jth prioritized switch has two input terminals, a jth one and a lower one, which are connected to the jth prioritized queue and a lower prioritized switch, respectively, and an output terminal, which is connected to the higher prioritized switch; and

    the output terminal of a first prioritized switch is attached to a transmitter for transmission and the lower input terminal of an Nth prioritized switch is attached to a non real-time queue which has non-prioritized cells; and

    (e) transmitting the eligible cell attached to the transmitter to a destined next node on a time slot basis.

View all claims
  • 5 Assignments
Timeline View
Assignment View
    ×
    ×