Priority queuing of frames in a TDMA network
View Patent ↗A node ( 401 ) responsive to a TDMA protocol is provided. The node ( 401 ) can include a transceiver ( 403 ) and one or more processors ( 407 ) cooperatively operable with the transceiver ( 403 ). The processor ( 407 ) can be configured to facilitate receiving ( 413 ) one or more frames to be transmitted in a communication over the transceiver ( 403 ). The frame(s) can indicate a priority relative to other frames. The processor ( 407 ) can queue ( 415 ) the frame(s) in one of several queues in response to the priority. Each of the queues can correspond to a different priority. The queues are serviced ( 417 ), including processing the frame(s) in the queue(s).
1. A node responsive to a TDMA protocol, comprising:
a transceiver; and
at least one processor cooperatively operable with the transceiver, and configured to facilitate
receiving at least one frame to be transmitted in a communication over the transceiver, wherein the at least one frame indicates a priority relative to other frames;
queuing the at least one frame in one queue of a plurality of queues, responsive to the priority, wherein each of the queues in the plurality of queues correspond to at least one different priority of a plurality of priorities; and
servicing the plurality of queues including processing the at least one frame in the one queue,
wherein each of the queues is associated with a particular time slot of the communication, and
wherein the at least one processor is further configured to facilitate
transmitting frames in a selected queue via an isochronous time slot if the selected queue corresponds to a high priority; and
transmitting the frames in the selected queue via an asynchronous time slot if the selected queue corresponds to a low priority.
2. The node of claim 1 , wherein the servicing of the plurality of queues is in round robin order, and wherein each of the queues are serviced in an order such that frames in a higher priority queue are transmitted ahead of frames in a lower priority queue.
3. The node of claim 1 , further comprising creating a stream in a time slot as needed for the at least one frame, if the at least one frame is high priority.
4. The node of claim 1 , wherein the plurality of queues comprises a low priority queue and a high priority queue, and each of the queues further corresponds to a different destination, wherein the at least one frame indicates a next destination, and wherein the queuing is further responsive to the next destination, wherein the low priority queue and the high priority queue are provided for each destination.
5. The node of claim 1 , wherein at least one queue further corresponds to a different destination, wherein the at least one frame indicates a next destination, and wherein the queuing is further responsive to the next destination.
6. The node of claim 1 , wherein, if the at least one frame is to be retransmitted, the queue is serviced after the other queues in the plurality of queues are serviced.
7. A method of processing frames for a communication in a TDMA network, comprising:
identifying frames to be transmitted, where each frame is associated with a priority;
queuing the frames in at least one queue of a plurality of queues, responsive to the priority associated therewith, wherein each of the queues of the plurality of queues correspond to at least one different priority of a plurality of priorities;
providing a queue for the at least one priority, corresponding to each destination; and
servicing the plurality of queues including processing the frames in the at least one queue,
wherein the at least one frame is further queued responsive to a next destination indicated in the at least one frame, and
wherein the servicing of the plurality of queues, further comprises:
transmitting frames in a selected queue via an isochronous time slot if the selected queue corresponds to a high priority; and
transmitting the frames in the selected queue via an asynchronous time slot if the selected queue corresponds to a low priority.
8. The method of claim 7 , wherein the servicing of the plurality of queues is in round robin order, wherein each of the queues are serviced in an order such that frames in a higher priority queue are transmitted ahead of frames in a lower priority queue.
9. The method of claim 7 , further comprising associating each queue of the plurality of queues with a slot in a TDMA protocol allocation.
10. The method of claim 7 , further comprising associating a stream of frames with a time slot as needed for the at least one frame, if the at least one frame is high priority.
11. The method of claim 7 , wherein the plurality of queues comprises a low priority queue and a high priority queue for each destination, wherein the at least one frame indicates a next destination, and wherein the queuing is further responsive to the next destination.
12. A computer-readable storage medium comprising instructions for execution by a computer, the instructions including a computer-implemented method for processing frames for communication in a TDMA network, the instructions for implementing the steps of:
providing frames to be transmitted, where each frame is associated with a priority;
for each frame, determining a queue of a plurality of queues responsive to the priority of each frame, wherein each of the queues of the plurality of queues correspond to at least one different priority of a plurality of priorities;
queuing the frames in the respective queues responsive to the determining; and
servicing the at least one queue including processing the frames in the at least one queue,
wherein the plurality of queues comprises a low priority queue and a high priority queue for each destination, wherein the at least one frame indicates a next destination, and wherein the queuing is further responsive to the next destination, and
wherein the servicing of the at least one queue, further comprises:
transmitting the frames in the at least one queue via an isochronous time slot if the at least one queue corresponds to a high priority; and
transmitting the frames in the at least one queue via an asynchronous time slot if the at least one queue corresponds to a low priority.
13. The computer-readable storage medium of claim 12 , wherein the servicing of the plurality of queues is in round robin order.
14. The computer-readable storage medium of claim 12 , wherein the plurality of queues are serviced in an order such that frames in a higher priority queue are transmitted ahead of frames in a lower priority queue.
15. The computer-readable storage medium of claim 12 , further comprising instructions for associating each queue of the plurality of queues with a slot in a TDMA protocol allocation.
16. The computer-readable storage medium of claim 12 , further comprising instructions for creating and associating at least one stream with a time slot as needed for the at least one frame, if the at least one frame is high priority.
17. The computer-readable storage medium of claim 12 , wherein there is provided a queue for the at least one priority, corresponding to each destination, wherein the at least one frame is further queued responsive to a next destination indicated in the at least one frame.