WO2009113930A1

WO2009113930A1 - Method and arrangement for prioritising channel allocation

Info

Publication number: WO2009113930A1
Application number: PCT/SE2008/050290
Authority: WO
Inventors: Jie Mao; Wilson Zhang; Haiying Feng
Original assignee: Telefonaktiebolaget L M Ericsson (Publ)
Priority date: 2008-03-14
Filing date: 2008-03-14
Publication date: 2009-09-17
Also published as: CN101971682A; CN101971682B; WO2009113930A8

Abstract

Method and arrangement in a first node for allocating a transmission resource for a timeslot in a carrier. The first node is comprised in a wireless communication network. The first node is arranged to communicate wireless with a second node within the wireless communication network. The method comprises the step of receiving a request for a transmission resource for transmitting a specific amount of data from the second node. Also, the method comprises the step of determining a specific priority class of the requested transmission resource. Further, the method comprises the step of obtaining a threshold limit value associated with the specific priority class, which threshold limit value regards transmission resource for an amount of data. Further yet, the method comprises the step of initiating allocation process for the requested resource to the carrier if the required resource in the carrier not exceeds the obtained threshold limit value.

Description

METHOD AND ARRANGEMENT FOR PRIORITISING CHANNEL ALLOCATION

TECHNICAL FIELD

The present invention relates to a method and an arrangement in a first node comprised in a wireless communication network. In particular it relates to a mechanism for Dynamic Channel Allocation in a multi-frequency cell within the wireless communication network.

BACKGROUND

In Time Division Duplexing approach, so called TDD₁ uplink and downlink traffic are transmitted in the same frequency band, but in different time intervals. A benefit of the time division duplexing mode of operation is e.g. that paired frequency bands are not required. TDD is used e.g. in Time Division-Synchronous Code Division Multiple Access

(TD-SCDMA) systems. By dynamically adjusting the number of timeslots used for downlink and uplink in TD-SCDMA, the system can more easily accommodate asymmetric traffic with different data rate requirements on downlink and uplink than FDD schemes. Since it does not require paired spectrum for downlink and uplink, spectrum allocation flexibility is also increased. Also, using the same carrier frequency for uplink and downlink means that the channel condition is the same on both directions, and the base station can deduce the downlink channel information from uplink channel estimates, which is helpful to the application of beam forming techniques.

Dynamic Channel Allocation (DCA) is an automatic process for assigning traffic channels in a frequency reuse wireless system such as when applying TDD in a wireless communication network. The base station continuously monitors the interference in all idle channels and makes an assignment using an algorithm that determines the channel that will produce the least amount of additional interference. DCA technology manages the allocation of the radio resources frequency, time slot, channelisation codes and angle of arrival.

The transmission quality of a communication and/or coherence properties of a communication channel between the base station and the user equipment may differ, depending on a plurality of unwanted influence on the signal and the radio propagation conditions. Some non limiting examples of such unwanted influence may be thermal noise and interference and a non limiting example of phenomena that adversely affect the propagation conditions are path loss, signal multi-path, and Doppler spread. Further the accuracy of channel estimation will affect the transmission quality.

DCA comprises time field resource allocation, comprising selecting time slot to decrease the interference among users. DCA also comprises frequency field resource allocation, which means to allocate user in different frequency, to decrease the interference among users. Further, DCA comprises code field resource allocation. Code field resource allocation means to change allocated codes of a user to avoid channelisation quality deterioration. Further yet, DCA comprises space field resource allocation thus decreasing the interference among users in the system.

The user access quality and cell throughput in a multi-frequency cell environment is seriously affected if radio resources are allocated in a non satisfactory way.

SUMMARY

It is therefore an object of the present invention to provide a mechanism that improves the allocation in a wireless communication network.

According to a first aspect, the object is achieved by a method in a first node for allocating a transmission resource for a timeslot in a carrier. The first node is comprised in a wireless communication network. The first node is arranged to communicate wireless with a second node within the wireless communication network. The method comprises the step of receiving a request for a transmission resource for transmitting a specific amount of data from the second node. Also, the method comprises the step of determining a specific priority class of the requested transmission resource. Further, the method comprises the step of obtaining a threshold limit value associated with the specific priority class, which threshold limit value regards transmission resource for an amount of data.

Further yet, the method comprises the step of initiating allocation process for the requested resource to the carrier if the required resource in the carrier not exceeds the obtained threshold limit value.

According to a second aspect, the object is also achieved by an arrangement in a first node for allocating a transmission resource for a timeslot in a carrier. The first node is comprised in a cell within a wireless communication network. Further, the first node is arranged to communicate with a second node. The arrangement comprises a receiving unit adapted to receive a request for the resource. The arrangement also comprises a determination unit adapted to determine a priority class of the request for the resource. Also, the arrangement comprises an obtaining unit adapted to obtain a threshold limit value. The arrangement further comprises an associating unit adapted to associate the obtained threshold limit value with the determined priority class. The arrangement further comprises a blocking unit adapted to block the request if the sum of the required resource in the carrier exceeds the obtained threshold limit value. Further yet, the arrangement comprises an allocating unit adapted to allocate a requested resource.

Thanks to the present methods and devices, transmission resources for a in a carrier may be allocated in an efficient way. By obtaining different threshold values for different priority classes, resources may be allocated to prioritized transmission requests. By dividing the available carriers within a cell according to service class, by giving a priority value to each available carriers within a cell and by selecting the carrier with the highest priority value, provided this carrier has sufficient available resources, a mechanism that improves the allocation in a wireless communication network is provided.

An advantage of the present method and arrangement is that imbalance of load of different carrier are eliminated or at least reduced.

Another advantage is that the present method and arrangement improve user access quality and resource utilization.

Yet an advantage is that high priority service is accessed firstly in the system, as the services are divided into several classes.

Yet another advantage of the present method and arrangement is that the flexible carrier selection algorithm makes cell throughput balanced.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will now be described more in detail in relation to the enclosed drawings, in which: Figure 1 is a block diagram illustrating embodiments of a wireless communication network.

Figure 2 is a block diagram illustrating embodiments of a resource block.

Figure 3 is a block diagram illustrating embodiments of a radio frame structure.

Figure 4 is a flow chart illustrating embodiments of method algorithms.

Figure 5 is a flow chart illustrating embodiments of method steps in a first node.

Figure 6 is a block diagram illustrating embodiments of an arrangement in a first node.

DETAILED DESCRIPTION

The invention is defined as a method and an arrangement which may be put into practice in the embodiments described below. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. It should be understood that there is no intent to limit the present method or arrangement to any of the particular forms disclosed, but on the contrary, the present method and arrangement is to cover all modifications, equivalents, and alternatives falling within the scope of the invention as defined by the claims.

Figure 1 depicts a first node 110 communicating with at least one second node 120 in a wireless communication network 100. The communication between the first node 110 and the second node 120 may be made e.g. over a communication carrier 140 in a cell 150 comprised in the wireless communication network 100. The wireless communication network 100 may also comprise a control node 130. The control node 130 may be e.g. a Radio Network Controller. The control node 130 is a governing element in the wireless communication network 100, which may be responsible for the control of base stations e.g. the first node 110, which are connected to the control node 130. The control node 130 may carry out radio resource management; some of the mobility management functions and is the point where encryption may be done before user data is sent to and from the second node 120.

In some embodiments, the first node 110 may be a base station, a wireless communications station, a fixed station, a control station, a Radio Network Controller, a repeater or any similar arrangement for radio communication. The second node 120 may in some embodiments be a user equipment such as e.g. a mobile cellular telephone, a Personal Digital Assistant (PDA), a laptop, a computer or any other kind of device capable of communicating radio resources.

The present method may further be used in a handover scenario in the wireless communication network 100. The handover calls may have high priority. When operating in soft handover, the mobile phone is connected to several cells simultaneously. Thus the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. In case of soft handover, the connection to the target is established before the connection to the source is broken. The interval, during which the two connections are used in parallel, may be brief or substantial. A soft handover may involve using connections to more than two cells, e.g. connections to three, four or more cells may be maintained by one phone at the same time. When a call is performed in soft handover the signal of the best of all used channels may be utilized for the call at a given moment, or all the signals may be combined to produce a clearer copy of the signal. The latter may be more advantageous, according to some embodiments.

Thus, according to some embodiments, also the second node 120 may be a base station, a wireless communications station, a fixed station, a control station, a Radio Network Controller, a repeater or any similar arrangement for radio communication, in particular when operating in handover.

However, in the example depicted in Figure 1 , the first node 1 10 is a base station and the second node 120 is a mobile cellular telephone.

The wireless communication network 100 may be based on technologies such as e.g. TD- SCDMA, LTE, Code division multiple access (CDMA), Wideband Code Division Multiple Access (WCDMA), CDMA 2000, High Speed Downlink Packet Data Access (HSDPA), High Speed Uplink Packet Data Access (HSUPA), High Data Rate (HDR) etc. Further, the wireless communication network 100 according to the present methods and arrangements is with advantage working in time division duplex mode (TDD).

5 The transmission resources at the first node 110 are scheduled by a method in the first node 110. As an example, the scheduling may take place in a base station 1 10. According to some embodiments, the scheduling may be performed partly in the control node 130 and partly in the base station. In some embodiments, the scheduling may be performed entirely in the control node 130. 10

The present methods and arrangements may be used in wireless communication systems 100 comprising N-carrier cell technology, such as e.g. TD-SCDMA.

In an N-carrier TD-SCDMA system, one cell 150 may be configured with several carriers

15 140. If each carrier 140 is regarded as a logic cell 150, the cell 150 is then a combination of the logic cells 150 that share the same common channels. Thus, the system's service bearing capacity may be increased. The purpose of introducing the N-carrier technology is to increase the network capacity, which is helpful for improving the system. Theoretically, the capacity of an N-carrier TD-SCDMA system may be N times of a single-carrier system. 0

Thus the air interface resources may be allocated effectively. An N-carrier carries several frequencies in the cell 150. These carriers 140 in the cell 150 may share the common channel resource located in the one of the carriers 140. 5 Figure 2 illustrates the resource location for a possible single downlink resource block used by the first node 110 and/or the second node 120. In order to use coherent demodulation pilot symbols 210, sometimes referred to as reference symbols or reference signals, e.g. used for channel estimation, are transmitted multiplexed with the data 220. The resource block is extended in the time and frequency dimensions, as illustrated in 0 Figure 2.

In Figure 3 is the time dimension of an embodiment of a possible TDD radio frame 310 illustrated. The carrier 140 is divided into frames 310 and the frame 310 is divided into timeslots 320, 340. 5 The radio frame 310 according to the illustrated embodiment comprises four downlink resources e.g. timeslots 320 followed by six uplink resources e.g. timeslots 340. The resources may typically be a timeslots 320, 340 but may also be of another granularity according to some embodiments. Between the downlink timeslots 320 and the uplink timeslots 340 may a switching point 330 be situated. The timeslots 320, 340 may comprise reference symbols or pilots 360.

Figure 4 illustrates the fundamental principles of a method for allocating resources in a multi-frequency cell 150 in a wireless communication network 100, principles which has been used by the first node 110. The present solution may comprise three algorithms: a Dynamic Channel Allocation (DCA) admission policy 400, a carrier priority algorithm 410 and a time slot priority algorithm 420. The principles of the three algorithms will be further explained in the following, with a focus on one algorithm at the time.

Algorithm 400 Dynamic Channel Allocation admission policy

The DCA admission policy 400, according to the present solution may be the firstly invoked algorithm according to some embodiments of the present methods. Thus, the present methods offer a set of solutions in order to make high priority service accessed in the wireless communication system 100. The requested services may be divided into four classes. They may be divided according to the nature of the requested service: Non- guaranteed, comprising the traffic class "interactive" and/or "background". The second class is Guaranteed, comprising traffic class streaming and/or voice.

The requested service may further be requested due to handover or not. Thus, according to some embodiments of the present method, the DCA admission policy 400 divides all requests into the following four service classes, depending on type: 1. Non- guaranteed/Non-handover. In this case the service is not guaranteed and the there is no request for handover. 2. Guaranteed/Non-handover. In this case the service is guaranteed, while there is no request for handover. 3. Non-guaranteed/handover. In this case the service is not guaranteed, but there is a request for handover. 4.

Guaranteed/handover. In this case the service is guaranteed, and there is a request for handover.

Further, according to the present method, three threshold values are introduced to control the access of the plurality of services. A first threshold value, which may be referred to as tdDcaTimeslotXThreshold, wherein X is the number of time slot, the scope is 0-6. A second threshold value may be referred to as tdDcaDINgThrh/tdDcaUINgThrh. A third threshold value may be referred to as tdDcaDIgThrh/tdDcaUlgThrh.

According to the DCA admission policy 400 in uplink and downlink, some channel code resources are reserved for a certain timeslot 320, 340. In the certain timeslot 320, 340, requests are blocked when the sum of the channel code resources exceed the first threshold value, tdDcaTimeslotXThreshold, wherein X is the number of the timeslot 320, 340, scope is 0-6. The value of the first threshold value tdDcaTimeslotXThreshold may be configured or, alternatively, be set based on an Interference Signal Code Power (ISCP) measurement. ISCP is a measurement of the interference in a particular timeslot 320, 340. This measurement has many applications, such as for timeslot 320, 340 and channel assignments for the users of the wireless communication system 100.

Further, according to the present method, some channel code resources of all carriers 140 in one cell 150 are reserved according to different services types. Non- guaranteed/non-handover requests are blocked in case the sum of the expected number of codes and number of allocated codes, calculated as unavailability of channelisation codes or midamble codes of all carriers 140, exceeds the limit set by the second threshold value tdDcaDINgThrh/ tdDcaUINgThrh.

Both non-guaranteed/handover and guaranteed/non-handover requests are blocked when the mentioned sum, calculated as unavailability of channelization codes or midamble codes of all carriers 140, exceeds the third threshold value, tdDcaDIgThrh/tdDcaUlgThrh. Guaranteed/handover requests are according to the present method never blocked according to this rule. Thus, a service belonging to the class Guaranteed/handover will be given priority and will accordingly always be accepted, provided that the timeslot 320, 340 in question has enough code resources, besides reserved code in each timeslot 320, 340. The codes which are reserved in every timeslot 320, 340 are not included in the second threshold value tdDcaDINgThrh/ tdDcaUINgThrh and/or the third threshold value tdDcaDlgThrh/ tdDcaUlgThrh.

In order to clarify and further illustrate the present method, an example will be discussed. However, it is to be noted that this is a non limiting example only, not intended to limit the scope of the present method, which scope is limited by the independent claims only. One cell 150 may only comprise one carrier 140 with a timeslot configuration between Uplink and Downlink 3:3. Thus three timeslots 320 are used for uplink and three timeslots 340 for downlink. In TD-SCDMA system, total six timeslots 320, 340 in one carrier 140 may be used, each timeslot 320, 340 may carry 16 SF16 orthogonal codes, wherein SF, the Spreading Factor, is 16. Two codes may be reserved in each timeslot 320, 340, thus tdDcaTimeslot1Threshold-tdDcaTimeslot6Threshold= 2. Thus each timeslot 320, 340 may only use 14 SF16 orthogonal codes. Three Uplink timeslots 320 have totally 14-3= 42 codes to be used. If the second threshold value, tdDcaUINgThrh = 14, the codes which may be used for Non-guaranteed/Non-handover is 42-14 = 28. When this threshold value level is reached, the non-guaranteed/non-handover requests will be blocked. If the third threshold value tdDcaUlgThrh=6 the codes which may be used for Guaranteed/Non- handover and Non-guaranteed/handover are 42-6= 36.

Non-guaranteed/Non-handover service will always be blocked. When a cell's Uplink code has been consumed 36 SF16 channelisation code, Guaranteed/Non-handover and Non- guaranteed/handover service will be blocked.

For Guaranteed/handover service, it must fulfil reservation of 2 SF16 channelisation code in each timeslot 320, 340, according to the present method.

Algorithm 410 Carrier priority algorithm

If the cell 150 only comprises one carrier 140, no priority value is necessary and according to the present method, the timeslot priority algorithm 420 may be invoked to allocate the code directly.

However, in order e.g. to support N-carriers, more than one carrier may be configured in a cell 150. Only one primary carrier 140 may be configured in a cell 150. 0- 5 secondary carriers may also, according to some embodiments, be configured in the cell 150.

So, when resources are to be allocated for a specific service, it must define a priority sequence of all candidate carriers for the following carrier priority algorithm 410.

Every carrier may be given a system priority, e.g. by the control node 130. The priority scope is from one to six, where one is the highest. The priority value may be predefined, configured or set dynamically, based on the network tuning according to some embodiments. Based on the priority of carriers in the cell 150, the highest priority carrier 140, which load can satisfy the service requirement is firstly put into consideration.

If more than one carrier is comprised within the cell 150, these carriers will be divided into two segments: speech preference carrier segment and data service preference carrier segment. The number of carriers divided for each segment may be configured or set dynamically based on network tuning. The proportions may depend e.g. on the traffic model.

When selecting carrier 140 for a service according to the present solution, all left codes in all uplink/downlink timeslots 320, 340 in the cell 150 except reserved codes in every timeslot 320, 340 have to be calculated for all carriers.

Every carrier's total load in uplink/downlink and every timeslot load 320, 340 in uplink/downlink may be calculated according to some embodiments of the present method. If the total codes of uplink/downlink in the carrier 140 except the total reserved codes in the carrier 140 are more than the requirement codes, then the carrier 140 may be selected.

All available carriers may be selected using the same method for the current service, and only those carriers which uplink and downlink condition meet the current service at the same time may be selected.

The priority arrangement of all candidate carriers may be based on the carrier system configuration. All usable carriers have been assigned priority from high to low as previously described. Also, all usable carriers have been configured into one of the two segments, speech segment and/or data service segment. If all of the carriers have several different priorities, the highest priority carrier 140 will be arranged in the front of the array. Thus the carrier 140 with the highest priority carrier 140 will be considered firstly.

If there are more than one carrier 140 with the same system priority, for service standalone 3.4kbps signalling/CS speech (12.2kbps), the carriers in speech preference segment will be put into the candidate array firstly, and the one of them with lower load may be given higher priority. Then carriers in the data service preference segment may be put into the candidate array, and the carrier 140 with higher load may be given higher priority than lower load carriers in the data service preference segment.

To the other service, the carriers in data service preference segment will be put into the array firstly, and the higher load will have higher priority; then carriers in speech preference segment with lower load be assigned higher priority than carriers in speech preference segment in turn.

Algorithm 420 Time Slot priority algorithm Every timeslot 320, 340 may be configured a system priority in uplink/downlink, in a similar way as the carriers may be given a priority according to the carrier priority algorithm 410. After one carrier 140 has been selected, the timeslot 320, 340 may be selected based on the timeslot priority and the timeslot load in uplink and downlink, respectively. Only those timeslots 320, 340 which load satisfy the service requirement may be selected.

When the candidate carriers have been sorted in priority sequence, appropriate timeslot 320, 340 and code may be allocated according to the timeslot priority algorithm 420. Timeslot 320, 340 and code allocation attempt may be made at one carrier at the time, starting with the highest priority carrier and until the lowest priority carrier, until a suitable carrier 140 with appropriate timeslot 320, 340 and code is found which may meet the services' requirements.

A non limiting example of the functionality of the timeslot priority algorithm 420 may be given in order to amplify the uninitiated readers understanding of the present methods. The example concerns a cell 150 comprising three carriers. After firstly having performed the carrier priority algorithm 410, the second carrier and the third carrier are selected as candidate carriers and put into priority queue in sequence. Then timeslot 320, 340 and code will be allocated. Firstly, an attempt will be made to allocate the time slot and code in the first carrier in the priority queue. If the attempt fails, a new attempt is made in the next carrier 140 in the priority queue etc. Once timeslot 320, 340 and code may be successfully allocated, the admission control 400 may be invoked to judge whether it is OK for power related resources. Figure 5 is a flow chart illustrating embodiments of method steps 500-570. The method steps 500-570 are comprised within a method in a first node 110. The method aims at allocating a transmission resource for a timeslot 320, 340 in a carrier 140. The first node 110 is comprised in a cell 150 within a wireless communication network 100. The first node 110 is arranged to communicate with a second node 120 within the wireless communication network 100.

As previously discussed, the first node 110 may be a base station and the second node 120 may be a mobile station. However, according to some embodiments, also the second node 120 may be a base station. However, any, some or even all of the method steps 500-570 performed in the first node 110 may be distributed between the first node 110 and the control node 130. Thus any, some or all of the method steps 500-570 according to the present method may be performed entirely or at least to some extent in the control node 130.

To appropriately allocate a transmission resource for a timeslot 320, 340 in a carrier 140, the method may comprise a number of steps 500-570. It is however to be noted that some of the described method steps are optional and only comprised within some embodiments. Further, it is to be noted that the method steps 500-570 may be performed in any arbitrary chronological order and that some of them, e.g. step 505 and step 510, or even all steps may be performed simultaneously or in an altered, arbitrarily rearranged, decomposed or even completely reversed chronological order. The method may comprise the following steps:

Step 500

The first node 110 receives from the second node 120, a request for a transmission resource, for transmitting a specific amount of data.

Step 505 It is determined, at the first node 110, a specific priority class of the requested transmission resource.

Step 510

A threshold limit value, associated with the specific priority class, is obtained. The threshold limit value regards transmission resource for an amount of data. According to some optional embodiments, the request may be blocked if the sum of the required resource in the carrier 140 exceeds the obtained threshold limit value.

Step 520

This step is optional and may only be comprised within some embodiments of the present method. A priority value may be granted to each carrier 140 comprised within the cell 150.

Step 530 This step is optional and may only be comprised within some embodiments of the present method. The carriers may be sorted in a priority order, according to the granted priority value. The step of sorting may according to some embodiments be performed by sorting the carriers in a priority order, according to the granted priority value and in dependence of the divided service.

Step 535

This step is optional and may only be comprised within some embodiments of the present method. The carriers may be divided into speech service carriers and data service carriers, if more than one carrier 140 is comprised within the cell 150.

Step 540

This step is optional and may only be comprised within some embodiments of the present method. It may be determined if the request for the resource concerns speech service or data service.

Step 545

This step is optional and may only be comprised within some embodiments of the present method. The carrier with the highest priority may be selected. According to some embodiments, this step may be performed by controlling if more resources need to be allocated. If more resources need to be allocated, it may be controlled if the selected carrier comprises available resource, and if not, selecting the next carrier in the priority order.

Step 550 This step is optional and may only be comprised within some embodiments of the present method. The selected carrier's 140 available resource for each timeslot 320, 340 may be computed.

Step 555

This step is optional and may only be comprised within some embodiments of the present method. The computed available resource for each timeslot 320, 340 may be compared with the required resource.

Step 560

This step is optional and may only be comprised within some embodiments of the present method. The timeslot 320, 340 with an available resource which is more than the required resource may be selected.

Step 570

An allocation process for the requested resource to the carrier 140 is initiated if the required resource in the carrier 140 does not exceed the obtained threshold limit value.

Figure 6 is a block diagram illustrating embodiments of an arrangement 600 situated in the first node 110. To perform the method steps 500-570 in the first node 110, the first node 110 comprises the arrangement 600 as depicted in Figure 6.

For the sake of clarity and in order not to render unnecessary aggravating circumstances for the uninitiated reader to comprehend the present method and arrangement 600, any internal electronics of the arrangement 600, not necessary for performing the present method has been omitted from Figure 6.

The arrangement 600 is configured to allocate a transmission resource for a timeslot 320, 340 in a carrier 140. The first node 110 is comprised in a cell 150 within a wireless communication network 100. The first node 110 is arranged to communicate with a second node 120. The arrangement 600 comprises a receiving unit 610. The receiving unit 610 is adapted to receive a request for the resource. Also, the arrangement 600 comprises a determination unit 620. The determination unit 620 is adapted to determine a priority class of the request for the resource. Further, the arrangement 600 comprises an obtaining unit 630. The obtaining unit 630 is adapted to obtain a threshold limit value. Further yet, the arrangement 600 comprises an associating unit 640. The associating unit 640 is adapted to associate the obtained threshold limit value with the determined priority class. Still further, the arrangement 600 comprises a blocking unit 650. The blocking unit 650 is adapted to block the request, if the sum of the required resource in the carrier 140 exceeds the obtained threshold limit value. The arrangement 600 also comprises an allocating unit 660. The allocating unit 660 is adapted to allocate a requested resource.

It is to be noted that the described units 610-660 comprised within the arrangement 600 are to be regarded as separate logical entities but not with necessity separate physical entities. Any, some or all of the units 610-660 may be comprised or co-arranged within the same physical unit. However, in order to facilitate the understanding of the functionality of the arrangement 600, the comprised units 610-660 are illustrated as separate physical units in Figure 6.

The method for allocating a transmission resource for a timeslot 320, 340 in a carrier 140 according to the present method may be implemented through one or more processors (not shown) in the first node 110, together with computer program code for performing the functions of the method. The program code mentioned above may also be provided as a computer program product, for instance in the form of a data carrier carrying computer program code for performing the method according to the present invention when being loaded into the processor unit. The data carrier may be a CD ROM disc, a memory stick, or any other appropriate medium such as a disk or tape that can hold machine readable data. The computer program code can furthermore be provided as pure program code on a server and downloaded to the first node 1 10 remotely.

Thus a computer program comprising instruction sets for performing the method according to at least some of the steps 500-570 may be used for implementing the previously described method.

As will be appreciated by one of skill in the art, the present invention may be embodied as an arrangement 600 within a first node 1 10, a method or a computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, a software embodiment or an embodiment combining software and hardware aspects all generally referred to herein as a "circuit" or "module." Furthermore, the present invention may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium. Any suitable computer readable medium may be utilized including hard disks, CD-ROMs, optical storage devices, a transmission media such as those supporting the Internet or an intranet, or magnetic storage devices.

Computer program code for carrying out operations of the present invention may be written in any arbitrary object oriented programming language such as Java®, Smalltalk or C++. However, the computer program code for carrying out the steps of the present method may also be written in any conventional procedural programming languages, such as the "C" programming language and/or a lower level assembler language. The program code may execute entirely on the user's arrangement 600, partly on the user's arrangement 600, as a stand-alone software package, partly on the user's arrangement 600 and partly on a remote computing device or entirely on the remote computing device. In the latter scenario, the remote computing device may be connected to the user's arrangement 600 through a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer, for example, through the Internet using an Internet Service Provider.

Furthermore, the present method was described in part above with reference to flowchart illustrations and/or block diagrams of arrangements, methods, and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

The terminology used in the detailed description of the particular exemplary embodiments illustrated in the accompanying drawings is not intended to be limiting of the invention. In the drawings, like numbers refer to like elements.

As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless expressly stated otherwise. It will be further understood that the terms "includes," "comprises," "including" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Furthermore, "connected" or "coupled" as used herein may include wirelessly connected or coupled. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

Unless otherwise defined, all terms including technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

Claims

1. Method in a first node (110) for allocating a transmission resource for a timeslot

(320, 340) in a carrier (140), which first node (110) is comprised in a wireless communication network (100), the first node (110) is arranged to communicate wireless with a second node (120) within the wireless communication network

(100), the method comprises the steps of: receiving (500) a request for a transmission resource for transmitting a specific amount of data from the second node (120), determining (505) a specific priority class of the requested transmission resource, obtaining (510) a threshold limit value associated with the specific priority class, which threshold limit value regards transmission resource for an amount of data, and initiating (570) allocation process for the requested resource to the carrier

(140) if the required resource in the carrier (140) not exceeds the obtained threshold limit value.

2. Method according to claim 1 , further comprising the steps of: granting (520) a priority value to each carrier (140) comprised within the cell (150), and sorting (530) the carriers in a priority order, according to the granted priority value.

3. Method according to claim 2, wherein the step of sorting (530) the carriers in a priority order, is performed by: sorting the carriers in a priority order, according to the granted priority value and in dependence of the divided service.

4. Method according to any of the previous claims 1 -3, further comprising the steps of: dividing (535) the carriers into speech service carriers and data service carriers, if more than one carrier is comprised within the cell (150), and determining (540) if the request for the resource concerns speech service or data service.

5. Method according to any of the previous claims 1 -4, wherein the method comprises the further steps of: selecting (545) the carrier (140) with the highest priority, computing (550) the selected carrier's (140) available resource for each timeslot (320, 340), comparing (555) the computed available resource for each timeslot 320, 340, with the required resource, and selecting (560) the timeslot (320, 340) with an available resource which is more than the required resource.

6. Method according to claim 5, wherein the step of selecting (545) the carrier (140) with the highest priority is performed by: controlling if more resources needs to be allocated, and if so, controlling if the selected carrier comprise available resource, and if not, selecting the next carrier in the priority order.

7. Method according to any of the claims 1 -6 wherein the first node (110) is represented by a base station.

8. Method according to any of the claims 1-6 wherein the first node (110) is represented by a control node.

9. Arrangement (600) in a first node (110) for allocating a transmission resource for a timeslot (320, 340) in a carrier (140), which first node (110) is comprised in a cell

(150) within a wireless communication network (100), the first node (110) is arranged to communicate with a second node (120), the arrangement (600) comprises: a receiving unit (610) adapted to receive a request for the resource, a determination unit (620) adapted to determine a priority class of the request for the resource, an obtaining unit (630) adapted to obtain a threshold limit value, an associating unit (640) adapted to associate the obtained threshold limit value with the determined priority class, a blocking unit (650) adapted to block the request if the sum of the required resource in the carrier (140) exceeds the obtained threshold limit value, and an allocating unit (660) adapted to allocate a requested resource.