Gigabit passive optical network strict priority weighted round robin scheduling mechanism

1. A method for strict priority weighted round robin scheduling, comprising:

selecting, via a processor, a set of bandwidth allocation table filled entries stored in a memory having a common destination address, each filled entry associated with a received data packet;

increasing an increment in the bandwidth allocation table by a pre-determined value upon reception of the received data packet;

setting a block count in a bandwidth allocation table entry to a counted number of bytes associated with the received data packet; and

determining, via the processor, a scheduling weight for each bandwidth allocation table entry in the selected set, the scheduling weight determined first by a priority and then by an assigned weight, wherein the assigned weight is calculated after receiving an end of frame for the received data packet by multiplying the increment and the block count, and adding the product to an initial weight of the received data packet stored in the bandwidth allocation table entry associated with the received data packet.

2. The method of claim 1 comprising counting a number of bytes in the received data packet.

3. The method of claim 1 comprising adding the increment to the bandwidth allocation table entry associated with the received data packet.

4. The method of claim 3 comprising adding the block count to the bandwidth allocation table entry associated with the received data packet.

5. The method of claim 1 comprising resetting the assigned weight of the selected entries having identical destination addresses and common priority to zero if overflow occurs.

6. The method of claim 1 comprising receiving the data packet, the data packet including the destination address, the priority and an initial weight.

7. The method of claim 1 comprising constructing the bandwidth allocation table entry corresponding to the received data packet, the bandwidth allocation table entry including the destination address, the priority and an initial weight.

8. The method of claim 1 comprising accepting a grant for transmission of the data packet.

9. The method of claim 1 comprising transmitting the data packet having a minimum scheduling weight, which is the minimum assigned weight for entries having a common destination address and common priority.

10. A non-transitory computer readable storage medium comprising instructions that when executed cause a processor to perform:

constructing an entry in a bandwidth allocation table associated with a received data packet, the entry having an index, a destination address, a priority, an initial weight, an increment and a block count;

assigning the index for the bandwidth allocation table entry;

determining the priority of the bandwidth allocation table entry;

allocating the initial weight of the bandwidth allocation table entry;

increasing the increment of the bandwidth allocation table entry by a pre-determined value upon reception of the received data packet;

setting the block count of the bandwidth allocation table entry to a counted number of bytes associated with the received data packet; and

determining a scheduling weight for each bandwidth allocation table entry in a selected set, the scheduling weight determined first by a priority and then by an assigned weight, wherein the assigned weight is calculated after receiving an end of frame for the received data packet by multiplying the increment and the block count, and adding the product to an initial weight of the received data packet stored in the bandwidth allocation table entry associated with the received data packet.