Approach to minimize worst-case queuing delay for a switching communication system with transmission constraints
View Patent ↗An approach for minimizing queuing delay of packets is disclosed. M number of queues are configured to store packets. A memory stores a search order table that has table entries corresponding to the M queues. Specifically, the table entries store values that correspond to relative positions of the M queues and that are selected based upon a transmission constraint of the communication system. A scheduler is coupled to the memory and is configured to schedule transmission of the packets stored in the M queues based upon the search order table. According to one embodiment of the present invention, this queuing mechanism is applied in a satellite communication system with transmission constraints to the downlink cells.
1. A method of transmission scheduling in a communication system, the method comprising:
determining order of servicing of a plurality of M queues based on one or more transmission constraints of the communication system, wherein the M queues correspond to different transmission regions, and the transmission constraint prevents transmission of the packets to the transmission regions that are interfering;
creating a list that includes identifiers corresponding to the plurality of queues, wherein ordering of the identifiers within the list represents the determined order of the servicing of the queues;
scheduling transmission of packets stored in the M queues based upon the list; and
transmitting the packets via N number of transmitters, wherein N is less than or equal to M.
2. The method according to claim 1 , wherein the communication system includes a satellite communication system.
3. The method according to claim 1 , wherein the transmitting step comprises:
checking whether a particular one of the M queues has a packet stored therein and satisfies the transmission constraint;
selectively including the particular queue in a transmission list based upon the checking step; and
iteratively performing steps of checking and selectively including the particular queue until at least one of each of the M queues is checked and N number of the queues are included in the transmission list.
4. The method according to claim 3 , wherein the list has K consecutive entries associated with K queues that satisfy the transmission constraint.
5. The method according to claim 4 , wherein K is greater than or equal to N.
6. The method according to claim 4 , wherein the list has L consecutive entries associated with L queues that satisfy another one of the transmission constraints.
7. The method according to claim 6 , wherein each of the transmission regions includes a plurality of destination nodes that are non-interfering, and the other one of the transmission constraints specifies that only one of the destination nodes selectively requires high-powered transmission.
8. The method according to claim 1 , further comprising:
inputting repetitive entry values in the list based upon relative traffic load associated with a plurality of destination nodes.
9. The method according to claim 1 , further comprising:
generating a plurality of lists based upon a plurality of power constraints associated with the communication system;
storing the plurality of lists; and
selecting a particular one of the plurality of lists.
10. The method according to claim 1 , wherein the list is a search table.
11. An apparatus for providing transmission scheduling, the apparatus comprising:
a processor configured to determine order of servicing of a plurality of M queues based on one or more transmission constraints of the communication system, wherein the M queues correspond to different transmission regions, and the transmission constraint prevents transmission of the packets to the transmission regions that are interfering, the processor being further configured to create a list that includes identifiers corresponding to the plurality of queues,
wherein ordering of the identifiers within the list represents the determined order of the servicing of the queues;
a scheduler coupled to the processor and configured to schedule transmission of packets stored in the M queues based upon the list; and
N number of transmitters configured to transmit, wherein N is less than or equal to M.
12. The apparatus according to claim 11 , wherein the M queues correspond respectively to different transmission regions of a satellite network.
13. The apparatus according to claim 11 , wherein the processor is further configured to determine whether a particular one of the M queues has a packet stored therein and satisfies the transmission constraint and to selectively including the particular queue in the list based upon the determination.
14. The apparatus according to claim 13 , wherein the list has K consecutive entries associated with K queues that satisfy the transmission constraint.
15. The apparatus according to claim 14 , wherein K is greater than or equal to N.
16. The apparatus according to claim 14 , wherein the list has L consecutive entries associated with L queues that satisfy another one of the transmission constraints.
17. The apparatus according to claim 16 , wherein each of the transmission regions includes a plurality of destination nodes that are non-interfering, and that the other one of the transmission constraints specifies that only one of the destination nodes selectively requires high-powered transmission.
18. The apparatus according to claim 11 , further comprising:
means for inputting repetitive entry values in the list based upon relative traffic load associated with a plurality of destination nodes.
19. The apparatus according to claim 11 , further comprising:
generating a plurality of lists based upon a plurality of power constraints associated with the communication system;
storing the plurality of lists; and
selecting a particular one of the plurality of lists.
20. The apparatus according to claim 11 , wherein the list is a search table.
21. A method of forwarding packets via a satellite to a plurality of nodes, the method comprising:
scheduling transmission of the packets stored in a plurality of M queues based upon a search order table that has entries that are ordered to reflect a desired ordering of the queues for servicing, wherein the desired ordering is determined according to a transmission constraint relating to the nodes, wherein the queues correspond to different transmission regions, and the transmission constraint prevents transmission of the packets to the transmission regions that are interfering; and
transmitting, via N number of transmitters, wherein N is less than or equal to M, the packets to the nodes over one or more satellite links according to the search order table.