Integrated packet latency aware QoS scheduling algorithm using proportional fairness and weighted fair queuing for wireless integrated multimedia packet services
First Claim
1. A method of scheduling packet transmissions, for use in providing packet communication service to wireless subscriber client devices through a hybrid network having a wireline portion and a wireless portion, the method comprising:
- determining a time budget for delivery of each respective packet through a combination of the wireline and wireless portions of the network to each of a plurality of the wireless subscriber client devices;
recording a respective time stamp indicating time of entry into the network for each packet;
routing the packets through the wireline portion of the network to the wireless portion of the network, using a first scheduling algorithm;
routing the packets through the wireless portion of the network using a second scheduling algorithm different from the first scheduling algorithm;
with respect to a point in the wireline network or a point in the wireless network before transmission of packets over wireless link to respective wireless subscriber client devices, subtracting a difference between time of arrival of each packet at the point before transmission over wireless link and the time of entry indicated by the respective time stamp, from the time budget for the packet, to compute a slack time representing a remaining amount of the time budget for delivery of each respective packet from said point through the network to one of the wireless subscriber client devices; and
at said point, reordering at least two of the packets intended for different wireless subscriber client devices for routing in accord with at least one of the scheduling algorithms, based on the computed slack times for said at least two packets in such a manner as will allow for delivery of the packets intended for different wireless subscriber client devices before expiration of respective timing budgets.
2 Assignments
0 Petitions
Accused Products
Abstract
Packet communication networks for transmission to wireless subscriber devices utilize both wireline and wireless packet routing components. The routing elements of these two different types often implement different packet scheduling algorithms, typically a form of Weighted Fair Queuing (WFQ) in the wireline portion of the network and Proportional Fairness (PF) queuing in the wireless domain. To improve resource allocation and thus end to end quality of service for time sensitive communications, such as integrated multimedia services, the present disclosure suggests adding the notion of slack time into either one or both of the packet scheduling algorithms. By modifying one or more of these algorithms, e.g. to reorder or shuffle packets based on slack times, global optimal resource allocations are possible, at least in certain cases.
-
Citations
18 Claims
-
1. A method of scheduling packet transmissions, for use in providing packet communication service to wireless subscriber client devices through a hybrid network having a wireline portion and a wireless portion, the method comprising:
-
determining a time budget for delivery of each respective packet through a combination of the wireline and wireless portions of the network to each of a plurality of the wireless subscriber client devices; recording a respective time stamp indicating time of entry into the network for each packet; routing the packets through the wireline portion of the network to the wireless portion of the network, using a first scheduling algorithm; routing the packets through the wireless portion of the network using a second scheduling algorithm different from the first scheduling algorithm; with respect to a point in the wireline network or a point in the wireless network before transmission of packets over wireless link to respective wireless subscriber client devices, subtracting a difference between time of arrival of each packet at the point before transmission over wireless link and the time of entry indicated by the respective time stamp, from the time budget for the packet, to compute a slack time representing a remaining amount of the time budget for delivery of each respective packet from said point through the network to one of the wireless subscriber client devices; and at said point, reordering at least two of the packets intended for different wireless subscriber client devices for routing in accord with at least one of the scheduling algorithms, based on the computed slack times for said at least two packets in such a manner as will allow for delivery of the packets intended for different wireless subscriber client devices before expiration of respective timing budgets. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A network for providing wireless service for wireless subscriber client devices, comprising:
-
a wireline portion, including at least one wireline packet routing element having an associated first packet transmission scheduler function for scheduling transmissions of packets from the wireline packet routing element, the first scheduler function utilizing a first scheduling algorithm; a wireless portion for receiving packets from the wireline portion and transmitting received packets over one or more air links to the wireless subscriber client devices, the wireless portion including a wireless packet transmission element having an associated second packet scheduler function for scheduling the received packets for transmissions over the one or more air links, the second scheduler function utilizing a second scheduling algorithm different from the first scheduling algorithm; and a packet monitor system for monitoring flows of packets through the network, wherein the packet monitor system; records a respective time stamp indicating time of entry into the network for each packet; determines a time budget for delivery of each respective packet through a combination of the wireline and wireless portions of the network to each of a plurality of the wireless subscriber client devices; with respect to one of the transmission elements, determines a remaining slack time for delivery of each respective packet representing a remaining amount of the time budget for delivery of the packet, by subtracting a difference between time of arrival of each packet at the one transmission element and the time of entry indicated by the respective time stamp, from the time budget for the packet; and instructs the scheduler function associated with the one transmission element to reorder at least two of the packets intended for routing through the one transmission element and delivery to different wireless subscriber client devices, to avoid an expiration of the slack time for delivery of one of the at least two packets, based on the computed slack times for said at least two packets. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A method of scheduling packet transmissions, for use in providing packet communication service to wireless subscriber client devices through a hybrid network having a wireline portion and a wireless portion, the method comprising:
-
determining a time budget for delivery of each respective packet through a combination of the wireline and wireless portions of the network to each of a plurality of the wireless subscriber client devices, by; determining a communication service or application for the respective packet from among a plurality of services or applications supported through the network; and assigning a time budget associated with the determined service or application from among a plurality of possible time budgets associated with respective services or applications supported through the network as the time budget for delivery of the respective packet through network; routing the packets through the wireline portion of the network to the wireless portion of the network, using a first scheduling algorithm; routing the packets through the wireless portion of the network using a second scheduling algorithm different from the first scheduling algorithm; and at a point in the wireline network or a point in the wireless network before transmission of packets over wireless link to respective wireless subscriber client devices; computing a slack time representing a remaining amount of the time budget for delivery of each respective packet; and reordering at least two of the packets intended for different wireless subscriber client devices for routing in accord with at least one of the scheduling algorithms, based on the computed slack times for said at least two packets in such a manner as will allow for delivery of the packets intended for different wireless subscriber client devices before expiration of respective timing budgets.
-
Specification