Block Scheduling Method For Scalable And Flexible Scheduling In A HSUPA System

• US 20140126481A1
• Filed: 11/06/2012
• Published: 05/08/2014
• Est. Priority Date: 11/06/2012
• Status: Abandoned Application

• Current Assignee: Nokia Solutions and Networks US LLC (Nokia Corporation)
• Original Assignee: Nokia Solutions and Networks US LLC (Nokia Corporation)
• Inventors: Arulselvan, Naveen, Sanghvi, Harshit Pradip, Omanakutty Amma Vijayaraghavan Nair, Vishnu Ram, Pillai, Amal
• Application Number:
  US13/669,586
• Publication Number:
  US 20140126481A1
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04W 72/121 for groups of terminals or users

Abstract

A method for block scheduling of users is described. The method includes, in response to determining that a number of users in a wireless network exceed a threshold number, allotting the users into k block. The value of k is at least two. For each block, the method performs determining residual information for the block. The method also includes, for each block of the k blocks, loading into a fast-access memory user data for users in the block and scheduling the block in a scheduling period based at least in part on the user data and the residual information for k−1 other blocks. Apparatus and computer readable media are also described.

Claims

1. A method comprising:

in response to determining that a number of users in a wireless network exceed a threshold number, allotting the users into k block, where k is at least two;

for each block, determining residual information for the block; and

for each block of the k blocks, loading into a fast-access memory user data for users in the block and scheduling the block in a scheduling period based at least in part on the user data and the residual information for k−

1 other blocks.

2. The method of claim 1, where allotting the users into k blocks comprises sorting the user based on at least one of the following criteria, but not limited to:

an order of arrival of the users, activity of the users, traffic profile of the users and priority of the users.

3. The method of claim 1, where each block could be allocated a weight based on at least one of but not limited to:

priority of the block, type of application data handled by users in that block, activity of users in the block and scheduling the block is further based on a weight for each of the other k−

1 blocks.

4. The method of claim 1, where loading into the fast-access memory the user data for the users in the block comprises loading into a first fast-access memory the user data for the users in a first block of the k blocks and

the method further comprises:

loading into a second fast-access memory the user data for users in a second block of the k blocks; and

simultaneously scheduling, in the same scheduling period, the users in the first block in a first processor and scheduling the users in the second block in a second processor.

5. The method of claim 4, where the number of processors involved in processing the k blocks is configurable by the operator or determined dynamically.

6. The method of claim 1, further comprising selecting a value of k such that a number of users in a block is approximately equal to a maximum number of users that can be scheduled in an individual scheduling period,

where k scheduling periods are equal in length to a scheduling epoch.

7. The method of claim 1, where k blocks of users are already present in a wireless network and, in response to determining that a number of users in a wireless network is lower than a threshold number, x blocks are deleted, where x is at least one and at most k−

1;

where each of the x blocks is selected based on but not limited to (a) least number of users among all the blocks, and (b) block with users of a particular category; and

where each user in x blocks is transferred to the other k−

x blocks.

8. The method of claim 2, where k blocks of users are already present in a wireless network and, in response to a change in at least one sorting criterion, reallocating users across the k blocks.

9. The method of claim 7, where the number of blocks may be varied in response to the reallocation of users.

10. The method of claim 1, where the residual information of a block comprises a cumulative sum of resource consumption metrics based on at least one of but not limited to (a) cell load (b) buffer size and (c) processing cycles.

11. The method of claim 1, where the residual information of a block comprises a modification token indicating a top candidate user for a scheduling modification.

12. The method of claim 11, where scheduling the block comprises determining whether a top candidate user for the scheduling modification in the block being scheduled has a less appropriate priority than a candidate user for the scheduling modification indicated in a modification token for one of the other k−

1 blocks.

13. The method of claim 12, further comprising, in response to determining that the top candidate user for the scheduling modification in the block being scheduled has a less appropriate priority than any candidate user for the scheduling modification indicated in a modification token for the other k−

1 blocks, suspending the scheduling modification.

14. The method of claim 12, where one of:

the scheduling modification is a downgrade and the less appropriate priority is a higher priority;

the scheduling modification is an upgrade and the less appropriate priority is a lower priority;

the scheduling modification is a load balancing operation and the less appropriate priority is a higher priority; and

the scheduling modification is a resource distribution operation and the less appropriate priority is a higher priority.

15. An apparatus, comprising at least one processor;

and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following;

to allot the users into k block in response to determining that a number of users in a wireless network exceed a threshold number, where k is at least two;

for each block, to determine residual information for the block; and

for each block of the k blocks, to load into a fast-access memory user data for users in the block and to schedule the block in a scheduling period based at least in part on the user data and the residual information for k−

1 other blocks.

16. The apparatus of claim 15, where, when loading into the fast-access memory the user data for the users in the block the at least one memory and the computer program code are further configured to cause the apparatus to load into a first fast-access memory the user data for the users in a first block of the k blocks;

to load into a second fast-access memory the user data for users in a second block of the k blocks; and

to simultaneously schedule, in the same scheduling period, the users in the first block in a first processor and scheduling the users in the second block in a second processor.

17. The apparatus of claim 15, where the at least one memory and the computer program code are further configured to cause the apparatus to select a value of k such that a number of users in a block is approximately equal to a maximum number of users that can be scheduled in an individual scheduling period,

where k scheduling periods are equal in length to a scheduling epoch.

18. A computer readable medium tangibly encoded with a computer program executable by a processor to perform actions comprising:

in response to determining that a number of users in a wireless network exceed a threshold number, allotting the users into k block, where k is at least two;

for each block, determining residual information for the block; and

for each block of the k blocks, loading into a fast-access memory user data for users in the block and scheduling the block in a scheduling period based at least in part on the user data and the residual information for k−

1 other blocks.

19. The computer readable medium of claim 18, where loading into the fast-access memory the user data for the users in the block comprises loading into a first fast-access memory the user data for the users in a first block of the k blocks and

the actions further comprise:

loading into a second fast-access memory the user data for users in a second block of the k blocks; and

simultaneously scheduling, in the same scheduling period, the users in the first block in a first processor and scheduling the users in the second block in a second processor.

20. An apparatus comprising:

means for allotting the users into k block in response to determining that a number of users in a wireless network exceed a threshold number, where k is at least two;

means for determining, for each block, residual information for the block;

means for loading into a fast-access memory user data for users in a given block; and

means for scheduling the given block in a scheduling period based at least in part on the user data and the residual information for k−

1 other blocks.

21. The apparatus of claim 20, where the loading means comprises means for loading into a first fast-access memory the user data for the users in a first block of the k blocks and

the apparatus further comprises:

means for loading into a second fast-access memory the user data for users in a second block of the k blocks; and

means for simultaneously scheduling, in the same scheduling period, the users in the first block and for scheduling the users in the second block.