CA2330846A1 - Dynamic allocation of packet data channels - Google Patents
Dynamic allocation of packet data channels Download PDFInfo
- Publication number
- CA2330846A1 CA2330846A1 CA002330846A CA2330846A CA2330846A1 CA 2330846 A1 CA2330846 A1 CA 2330846A1 CA 002330846 A CA002330846 A CA 002330846A CA 2330846 A CA2330846 A CA 2330846A CA 2330846 A1 CA2330846 A1 CA 2330846A1
- Authority
- CA
- Canada
- Prior art keywords
- ranking
- user
- users
- relative
- plural
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
Abstract
In a cellular telecommunications system, a method of dynamically allocating packet data radio channels among users competing in a same cell for the channels involves determining a user ranking for each of plural competing users in the cell, and classifying each of the plural competing users into one of plural ranking classes. A number of the packet data radio channels available for each of the ranking classes is then determined, after which the users within each ranking class are sorted by ranking. The packet data radio channels are allocated to the users by sorted position within ranking classes.
The user ranking for each of the plural competing users in the cell is related to a weighted combination of plural measures of performance for the user.
The user ranking for each of the plural competing users in the cell is related to a weighted combination of plural measures of performance for the user.
Description
DYNAyIIC ALLOCATION OF PACKET DATA CHANNELS
BACKGROUND
1. FIELD OF THE II'TVENTION
The present invention pertains to cellular telecommunications, and particularly to allocation of data resources in a cellular telecommunications system.
BACKGROUND
1. FIELD OF THE II'TVENTION
The present invention pertains to cellular telecommunications, and particularly to allocation of data resources in a cellular telecommunications system.
2. RELATED ART AND OTHER CONSIDERATIONS
In recent years cellular telephones have become increasingly popular. A
cellular telephone is just one example of what is referred to in telephone parlance as a "mobile station" or "mobile terminal". Telecommunications services are provided between a cellular telecommunications network and a mobile station (e.g., cellular telephone) over an air interface, e.g., over radio frequencies. At any moment an active mobile station is in communication over the air interface with one or more base stations. The base stations are, in turn, managed by base station controllers (BSCs). The base station controllers are connected via control nodes to a core telecommunications network.
:.5 Examples of control nodes include a mobile switching center (MSC) node for connecting to connection-oriented, circuit switched networks such as PSTN
and/or ISDN, and a general packet radio service (GPRS) node for connecting to packet-switched networks such as Internet, for example.
A mobile station can take on various forms other than a cellular .ao telephone, including a compul:er (e.g., a laptop computer) with mobile terniination capabilities. In some forms. mobile stations are capable of engaging in differing types of services, or multimedia services. In other words, the mobile station can execute several differing types of programs (i.e., ''applications") which interact with the user.
Examples of these applications include Internet browsers and electronic mail programs.
:'S Several multimedia applications may reside in the same mobile station.
WO 99157925 PC?/SE99/00688 One type of standardized mobile telecommunications scheme, utilized, e.g., in Europe, is the Global Svstem for l~lobile communications (GSM). GSM
includes standards which specify functions and interfaces for various types of services.
A relatively recent data service available within the GSM system is _General _Packet Radio Service (GPRS). GfRS differs from existing data services in that GPRS is a packet switched service instead of a circuit switched data service. Whereas (in GSyI) a circuit switched data user is connected continuously to the radio network during a data call (e.g., even when not transferring data), a GPRS user is connected to the radio network only when either ( 1. ',~ the mobile station desires to transmit or ('~) the network io has something to transmit to the mobile station. In other words, in GPRS
the mobile station (e.g.. a computer with mobile termination) is not connected to the network constantly while the computer is in use, but only during these two transmission events.
For the purpose of data services in cellular time _division _multiple access (TDNIA) systems, packet data services such as GPRS are used alongside existing is circuit-switched services. Since the existing radio band cannot be expanded, packet data services crust be f tted .into the same band as circuit-switched services. Thus, a certain amount of capacity has to be taken from circuit switched services for packet data services. Additionally, as cir;,uit-switched services have been predominate, the introduction of packet data services must not degrade the quality of service for the 2o existing circuit switched services.
The GPRS service is provided to a connection over a GPRS packet _data channel (PDCH). GPRS ha:> two types of packet data channels: ( 1 ) the-VIPDCH, or master packet data channel (which carries broadcast information, paDing messages, access grant messages, and user information), and (?) the SPDCH, or slave packet _data 25 channel (which carries user information and associated signalling). A time slot in the radio base stations can dynairically be configured, for instance as a TCH/F
(speech traffic channel), MPDCH, or SPDCH.
Radio resource, are allocated dynamically. For speech traffic, the radio resource is a full-rate speech time slot (TCH/F) and for data traffic the resource is a 3o block called PDTCH, which is sent on a PDCH. The packet data channel resources are limited, therefore efficient use of these resources is essential when a radio resource is configured as a PDCH.
In recent years cellular telephones have become increasingly popular. A
cellular telephone is just one example of what is referred to in telephone parlance as a "mobile station" or "mobile terminal". Telecommunications services are provided between a cellular telecommunications network and a mobile station (e.g., cellular telephone) over an air interface, e.g., over radio frequencies. At any moment an active mobile station is in communication over the air interface with one or more base stations. The base stations are, in turn, managed by base station controllers (BSCs). The base station controllers are connected via control nodes to a core telecommunications network.
:.5 Examples of control nodes include a mobile switching center (MSC) node for connecting to connection-oriented, circuit switched networks such as PSTN
and/or ISDN, and a general packet radio service (GPRS) node for connecting to packet-switched networks such as Internet, for example.
A mobile station can take on various forms other than a cellular .ao telephone, including a compul:er (e.g., a laptop computer) with mobile terniination capabilities. In some forms. mobile stations are capable of engaging in differing types of services, or multimedia services. In other words, the mobile station can execute several differing types of programs (i.e., ''applications") which interact with the user.
Examples of these applications include Internet browsers and electronic mail programs.
:'S Several multimedia applications may reside in the same mobile station.
WO 99157925 PC?/SE99/00688 One type of standardized mobile telecommunications scheme, utilized, e.g., in Europe, is the Global Svstem for l~lobile communications (GSM). GSM
includes standards which specify functions and interfaces for various types of services.
A relatively recent data service available within the GSM system is _General _Packet Radio Service (GPRS). GfRS differs from existing data services in that GPRS is a packet switched service instead of a circuit switched data service. Whereas (in GSyI) a circuit switched data user is connected continuously to the radio network during a data call (e.g., even when not transferring data), a GPRS user is connected to the radio network only when either ( 1. ',~ the mobile station desires to transmit or ('~) the network io has something to transmit to the mobile station. In other words, in GPRS
the mobile station (e.g.. a computer with mobile termination) is not connected to the network constantly while the computer is in use, but only during these two transmission events.
For the purpose of data services in cellular time _division _multiple access (TDNIA) systems, packet data services such as GPRS are used alongside existing is circuit-switched services. Since the existing radio band cannot be expanded, packet data services crust be f tted .into the same band as circuit-switched services. Thus, a certain amount of capacity has to be taken from circuit switched services for packet data services. Additionally, as cir;,uit-switched services have been predominate, the introduction of packet data services must not degrade the quality of service for the 2o existing circuit switched services.
The GPRS service is provided to a connection over a GPRS packet _data channel (PDCH). GPRS ha:> two types of packet data channels: ( 1 ) the-VIPDCH, or master packet data channel (which carries broadcast information, paDing messages, access grant messages, and user information), and (?) the SPDCH, or slave packet _data 25 channel (which carries user information and associated signalling). A time slot in the radio base stations can dynairically be configured, for instance as a TCH/F
(speech traffic channel), MPDCH, or SPDCH.
Radio resource, are allocated dynamically. For speech traffic, the radio resource is a full-rate speech time slot (TCH/F) and for data traffic the resource is a 3o block called PDTCH, which is sent on a PDCH. The packet data channel resources are limited, therefore efficient use of these resources is essential when a radio resource is configured as a PDCH.
3 Methods of dynamically allocating speech and data resources are known.
For example, PCT publication W096/2'?66~ discloses a method of determining the number of time slots allocated to a packet data service and to a circuit switched service by dynamically allocating more time slots to the form of service having the greater s demand at any particular time. A nominal basic number of time slots ins reserved for packet radio service and another number of time slots is reserved for circuit switched service. If the traffic requires for packet radio service increases, information regarding the increase is obtained through a request flagged by a mobile station or through traffic measurement by the base station. The information is used as criteria in the allocation of to more time slots to the requiring such slots.
Once a packca data channel has been configured for data traffic, the packet data channel must b~e efficiently utilized in view of the limited packet data resources. Therefore, what is needed, and an object of this invention, is an efficient technique for allocating packet data channels among users.
is BRIEF' SUM1~IARY OF THE INVENTION
In a cellular tele;:orrununications system, a method of dynamically allocating packet data radio channels among users competing in a same cell for the channels involves determining a user ranking for each of plural competing users in the cell, and classifying each of the plural competing users into one of plural ranking classes. A
2o number of the packet data radio channels available for each of the ranking classes is then determined, after which the users within each ranking class are sorted by ranking.
The packet data radio channels are allocated to the users by sorted position within ranking classes.
The user ranking for each of the plural competing users in the cell is related to a ~s weighted combination of plural measures of performance for the user. In general, the user ranking for a user is dcaermined in accordance with the combination - a,f, (xlu ) + a=f~ (x;~ )-+-...+a~, f,~ (x"u ) , in which there are 1~I
different measures of performance for each user; the performance measures being represented by a vector (x), and which includes ranking weighting-functions, fm and ranking weighting-constants, 30 am.
Wo 99/57925 PCT/SE99/00688 In one embodiment, floe plural measures of performance for the user include at least two of the following: ( 1 ) user priority; (?) maximum delay relative to a target ma,~cimum delay value: (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5) a number of remaining packets relative to a target number of remaining packets; (6) a number of recent transmission failures; (?) a required output power value relative to a target output power value; (8) a radia link quality value relative to a target radio link value;
and (9) normalized packet delay.
The step of allocating i:he packet data radio channels to the users by sorted to position within ranking classes can be performed by various techniques of the present invention. According to a first technique, the channels are awarded to the users in descending ranking order within each ranking class. In accordance with a second technique, a limiting number of packet data radio channels available to a particular ranking class is determined ar.~d, to the users in the particular ranking class, the limiting is number of packet data radio channels are awarded in descending ranking order within the particular ranking class.
BRIEF DESCRIPTION OF THE DRAWINGS
The foregoing and other objects, features, and advantages of the invention will be apparent from the followin g more particular description of preferred embodiments as 2o illustrated in the accompanying drawings in which reference characters refer to the same parts throughout the various views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.
Fig. 1 is a diagrammatic view of a mobile telecommunications network.
Fig. 2 is a flowchart showing basic steps involved in a determination of which ?.p competing users in a cell are afforded data packet channels.
Fig. 3 is a graphical view of a plot of a mapping function f,.
Fig. 4 is a graphical view of a plot of a mapping function f=.
J
Fig. ~ is a graphical view showing a sharing of data resources for different priority classes according to a mode of the invention.
Fig. 6 is a chart showing a relationship between user ranking values and corresponding ranking classes.
Fig. 7 is a schematic view of an example base station controller (RNC) which operates in accordance with a mode of the present invention.
Fig. 8 is a schematic view of an example base station (BS) which operates in accordance with a mode of o:he present invention.
to DETAILED DESCRIPTION OF THE DR.aWINt~S
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, interfaces, techniques, etc.
in order to provide a thorou;~h understanding of the present invention.
However, it will be apparent to those skilled in the art that the present invention may be practiced in is other embodiments that depart from these specific details. In other instances, detailed descriptions of well known devices, circuits, and methods are omitted so as not to obscure the description of tree present invention with unnecessary detail..
1.0 NETWORK OVERVIEW
Fig. 1 shows a telecommunications network 18 in which a mobile station 20 2o communicates with one or nnore base stations 22 over air interface (e.g., radio interface) 23. Base stations 22 are connected by terrestrial lines to base station controller 2~> also known as a radio network controller (RNC). Base station controller 24 is, in turn, connected through a control node known as the mobile switching enter 26 to circuit-switched telephone networks represented by cloud ?8. In addition, base station 2s controller (BSC) 24 is connected to Serving GPRS Support Node (SGSN) 2~ and through backbone network _'.? to a Gateway GRPS support node (GGSN) 30, through which connection is made with packet-switched telephone networks (e.g., the Internet, X.2~ external networks) represented by cloud 32.
Gateway GRPS support node (GGSN) 30 provides the interface towards the external IP packet networka and X.2~ networks. Gateway GRPS support node (GGSN) 30 translates data formats, signalling protocols and address information in order to permit communication between the different networks. Backbone network 27 is an Internet Protocol (IP) network. Serving GPRS Support Node (SGSN) ~5 provides packet routing to an from a SGSN service area, and serves GPRS subscribers which are physically located within tlhe SGSN service area. Serving GPRS Support Node (SGSN) 2~ provides functions such as authentication, ciphering, mobility management, charging data, and logical link management toward the mobile station. A GPRS subscriber may to be served by any SGSN in the network depending on location. The GPRS
traffic is routed from the Serving Gl?RS Support Node a SGSN) 2~ to base station controller (BSC) 24 and via base stat:ic>n {BS) 22 to mobile station 20. The functionality of Serving GPRS Support Node (SGSN) 2~ and Gateway GRPS support node (GGSN) 30 may be combined in the same node, or may exist in separate nodes as shown in Fig. 1.
t5 The telecommunications network 18 of Fig. 1 also includes a packet control unit node, shown as packet control unit (PCU) ~0. Various functions of the packet control unit (PCU) ~0 are described e.g., in United States patent application serial number 09/ , (attorney dockEa 2372-15) filed simultaneously herewith and entitled "ALLOCATION OF CHANNELS FOR PACKET DATA SERVICES", which is 2o incorporated herein by reference.
As understood by those skilled in the art, when mobile station 20 is participating in a mobile telephonic connection, signaling information and user information from mobile station 20 are transmitted over air interface 23 on designated radio channels to one or more of the base stations 22. The base stations have radio transceivers which 2s transmit and receive radio signals involved in the connection. For information on the uplink from the mobile station 20 toward the other party involved in the connection, the base stations convert the radio-acquired information to digital signals which are forwarded to base station controller 2~. Base station controller 24 orchestrates participation of the plural base stations 2'_' which may be involved in the connection, 3o since mobile station 20 may be geographically moving and handover may be occurring relative to the base stations 22. On the uplink, base station controller 2.4 obtains user information from one or more base stations 22 to yield a coherent connection between mobile station 20 and the other party, whether that party be in PSTN/IDSN 28 or on the Internet 32.
As seen in Fig. l, base station controller (BSC) 24 has a central processor (CP) or control unit 40. BSC central processor 40 has access to memory ~. As referenced herein, memory =1~ is has stored therein packet data channel allocation instructions.
Further details of an example base station controller (BSC) 24 are shown in Fig.
7 as comprising a switch 2=1~0~. Switch 240, which is controlled by BSC
central processor =10, has a plurality of ports, some of which are connected to diversity handover unit (DHL') 230 and others of which are connected to various interfaces.
to Diversity handover unit (DI-~C: ) 230 is connected to a timing unit 241.
The BSC control unit 40 is connected to each element of BSC 24. BSC 24 is connected to a signaling network via a signaling interface 2=I3. Signaling interface 243 is connected to BSC
central processor =I0. The interfaces connected to ports of switch ?40 include service node interface unit ?:~=l; RNC.' interface unit 246; and base station interface units ?48.
is The service node inte:-face unit 244 is connected to the appropriate mobile switching center 26 and GRPS control node 30. RNC interface unit 246 is connected by inter-RNC transport link 232 to other (unillustrated) base station controllers. Base station interface units 2-1S are connected to the base stations (BS;) 22 served by the base station controller (BSC) 24.
~o An example base station (BS) 22 is shown in Fig. 8 as comprising a switch 260.
Switch 260, which is controlled by base station control unit 262, has a plurality of ports.
At least one, and typically several, of the ports of switch 260 are connected to respective transceiver (Tx/Rx} boards 26-I. Transceiver (Tx~Rx) boards 264 are connected to 2s antennae which are located in the cell served by the base station (BS) 22.
Control unit 262 is also connected to ports. of switch 260, as is an terminal board 266. It is through terminal board 266 that base station (BS) ?'_' communications with its radio network controller base station controller (BSC) 24, with link 225 being connected between an appropriate base station interface unit 24S of base station controller (BSC) 2-1(see Fig.
30 7) and terminal board 266.
The particular example embodiments of base station controller (BSC) 24 shown in Fig. 7 and base station (BS) 2? shown in Fig. 8 happen to be ATVI-bas;.d nodes. In g this regard, both switch ?4la of radio base station controller (BSC) 24 and switch 260 of base station (BS) ?? are, in the illustrated example embodiments, ATVI
switches through which AT~1 cells are directed. It should be understood that the present invention is not limited to the particular architectures of the example base station controller (BSC) 24 and base station (BS) ?'' shown, nor the use of AT?~I
switches, but that other architectures and data transfer techniques can be employed within the scope and spirit of the present invention.
2.0 ALLOCATION OF PDCHs TO C;'SERS
It is the allocation of data packet channels (PDCHs) to users, particularly GPRS
io channels, to which the present invention primarily relates. For each cell, the present invention determines which competing users are to be afforded data packet channels.
The determination of which competing users are to be afforded data packet channels is made by base station controller (BSC) ?4 for each cell controlled by base station controller (BSC) ?4. Since each cell is typically associated with a corresponding base t5 station (BS) ??. the base station controller (BSC) ?~ makes the determination of which competing users are to be afforded data packet channels separately with respect to each base station (BS) 2?.
The determination of which competing users are to be afforded data packet channels is particularly determined by BSC central processor 40 of base station 2o controller (BSC) 24. Basic ,steps performed by BSC central processor 40 are illustrated in Fig. 2 and discussed below. The first basic step, step ?-1 (described in more detail, e.g., in section 2.1 ), involves counting the data resources (dres~) available in cell c at any given instant. Step 2-? (described in more detail, e.g., in section ?.'?) involves, for each competing user, calculating a user ranking value (ru). Step ?-3 (described in more 25 detail, e.g., in section ?.3) involves calculating the data resources per ranking class present (dres~~). Step 2-4 {described in more detail, e.g., in section 2.4) involves sorting the users by ranking to obtain, for the cell, a ranking vector for each class.
Step 2-~
(described in more detail, e. g., in section 2.~) involves allocating the data resources in the cell based on the sorting of users by ranking.
Each of steps 2-1 through ?-~ are described in more detail in the ensuing sections. Reference is made to Table I? for abbreviations and nomenclature employed herein.
2.1 COUNT DATA RESOURCES
s Step 2-I involves counting the data resources (dres~) available in cell c at any given instant. The data resources available at a Qiven instant of time depends on the mufti-frame structure of the 1?DCH, since user information can only be transferred when PDTCH blocks are sent. Thf: data resources available in a cell (dres~) are expressed by Equation l:
da dres~ - ~, (block,s =: PDTCH) Equation 1 ts=i As explained e.g., by 'Table 12, in Equation 1 dts is the number of time slots allocated for data traffic.
22 CALCULATE USER R.A.NKING
Step ?-2 of Fig. ? involves, for each competing user, calculating a user ranking i5 value (r~). For each user, a ranking value between 0 and P is calculated with Equation ?:
r" - a, f, (x,~ ) + a, f= (x =~ )+.. .+a ~, fn,, (x~,,~ ) Equation In Equation 2 it is assumed that there are M different measures of performance for each user. The ranking weighting-functions, fm, are described below (see Equation
For example, PCT publication W096/2'?66~ discloses a method of determining the number of time slots allocated to a packet data service and to a circuit switched service by dynamically allocating more time slots to the form of service having the greater s demand at any particular time. A nominal basic number of time slots ins reserved for packet radio service and another number of time slots is reserved for circuit switched service. If the traffic requires for packet radio service increases, information regarding the increase is obtained through a request flagged by a mobile station or through traffic measurement by the base station. The information is used as criteria in the allocation of to more time slots to the requiring such slots.
Once a packca data channel has been configured for data traffic, the packet data channel must b~e efficiently utilized in view of the limited packet data resources. Therefore, what is needed, and an object of this invention, is an efficient technique for allocating packet data channels among users.
is BRIEF' SUM1~IARY OF THE INVENTION
In a cellular tele;:orrununications system, a method of dynamically allocating packet data radio channels among users competing in a same cell for the channels involves determining a user ranking for each of plural competing users in the cell, and classifying each of the plural competing users into one of plural ranking classes. A
2o number of the packet data radio channels available for each of the ranking classes is then determined, after which the users within each ranking class are sorted by ranking.
The packet data radio channels are allocated to the users by sorted position within ranking classes.
The user ranking for each of the plural competing users in the cell is related to a ~s weighted combination of plural measures of performance for the user. In general, the user ranking for a user is dcaermined in accordance with the combination - a,f, (xlu ) + a=f~ (x;~ )-+-...+a~, f,~ (x"u ) , in which there are 1~I
different measures of performance for each user; the performance measures being represented by a vector (x), and which includes ranking weighting-functions, fm and ranking weighting-constants, 30 am.
Wo 99/57925 PCT/SE99/00688 In one embodiment, floe plural measures of performance for the user include at least two of the following: ( 1 ) user priority; (?) maximum delay relative to a target ma,~cimum delay value: (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5) a number of remaining packets relative to a target number of remaining packets; (6) a number of recent transmission failures; (?) a required output power value relative to a target output power value; (8) a radia link quality value relative to a target radio link value;
and (9) normalized packet delay.
The step of allocating i:he packet data radio channels to the users by sorted to position within ranking classes can be performed by various techniques of the present invention. According to a first technique, the channels are awarded to the users in descending ranking order within each ranking class. In accordance with a second technique, a limiting number of packet data radio channels available to a particular ranking class is determined ar.~d, to the users in the particular ranking class, the limiting is number of packet data radio channels are awarded in descending ranking order within the particular ranking class.
BRIEF DESCRIPTION OF THE DRAWINGS
The foregoing and other objects, features, and advantages of the invention will be apparent from the followin g more particular description of preferred embodiments as 2o illustrated in the accompanying drawings in which reference characters refer to the same parts throughout the various views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.
Fig. 1 is a diagrammatic view of a mobile telecommunications network.
Fig. 2 is a flowchart showing basic steps involved in a determination of which ?.p competing users in a cell are afforded data packet channels.
Fig. 3 is a graphical view of a plot of a mapping function f,.
Fig. 4 is a graphical view of a plot of a mapping function f=.
J
Fig. ~ is a graphical view showing a sharing of data resources for different priority classes according to a mode of the invention.
Fig. 6 is a chart showing a relationship between user ranking values and corresponding ranking classes.
Fig. 7 is a schematic view of an example base station controller (RNC) which operates in accordance with a mode of the present invention.
Fig. 8 is a schematic view of an example base station (BS) which operates in accordance with a mode of o:he present invention.
to DETAILED DESCRIPTION OF THE DR.aWINt~S
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, interfaces, techniques, etc.
in order to provide a thorou;~h understanding of the present invention.
However, it will be apparent to those skilled in the art that the present invention may be practiced in is other embodiments that depart from these specific details. In other instances, detailed descriptions of well known devices, circuits, and methods are omitted so as not to obscure the description of tree present invention with unnecessary detail..
1.0 NETWORK OVERVIEW
Fig. 1 shows a telecommunications network 18 in which a mobile station 20 2o communicates with one or nnore base stations 22 over air interface (e.g., radio interface) 23. Base stations 22 are connected by terrestrial lines to base station controller 2~> also known as a radio network controller (RNC). Base station controller 24 is, in turn, connected through a control node known as the mobile switching enter 26 to circuit-switched telephone networks represented by cloud ?8. In addition, base station 2s controller (BSC) 24 is connected to Serving GPRS Support Node (SGSN) 2~ and through backbone network _'.? to a Gateway GRPS support node (GGSN) 30, through which connection is made with packet-switched telephone networks (e.g., the Internet, X.2~ external networks) represented by cloud 32.
Gateway GRPS support node (GGSN) 30 provides the interface towards the external IP packet networka and X.2~ networks. Gateway GRPS support node (GGSN) 30 translates data formats, signalling protocols and address information in order to permit communication between the different networks. Backbone network 27 is an Internet Protocol (IP) network. Serving GPRS Support Node (SGSN) ~5 provides packet routing to an from a SGSN service area, and serves GPRS subscribers which are physically located within tlhe SGSN service area. Serving GPRS Support Node (SGSN) 2~ provides functions such as authentication, ciphering, mobility management, charging data, and logical link management toward the mobile station. A GPRS subscriber may to be served by any SGSN in the network depending on location. The GPRS
traffic is routed from the Serving Gl?RS Support Node a SGSN) 2~ to base station controller (BSC) 24 and via base stat:ic>n {BS) 22 to mobile station 20. The functionality of Serving GPRS Support Node (SGSN) 2~ and Gateway GRPS support node (GGSN) 30 may be combined in the same node, or may exist in separate nodes as shown in Fig. 1.
t5 The telecommunications network 18 of Fig. 1 also includes a packet control unit node, shown as packet control unit (PCU) ~0. Various functions of the packet control unit (PCU) ~0 are described e.g., in United States patent application serial number 09/ , (attorney dockEa 2372-15) filed simultaneously herewith and entitled "ALLOCATION OF CHANNELS FOR PACKET DATA SERVICES", which is 2o incorporated herein by reference.
As understood by those skilled in the art, when mobile station 20 is participating in a mobile telephonic connection, signaling information and user information from mobile station 20 are transmitted over air interface 23 on designated radio channels to one or more of the base stations 22. The base stations have radio transceivers which 2s transmit and receive radio signals involved in the connection. For information on the uplink from the mobile station 20 toward the other party involved in the connection, the base stations convert the radio-acquired information to digital signals which are forwarded to base station controller 2~. Base station controller 24 orchestrates participation of the plural base stations 2'_' which may be involved in the connection, 3o since mobile station 20 may be geographically moving and handover may be occurring relative to the base stations 22. On the uplink, base station controller 2.4 obtains user information from one or more base stations 22 to yield a coherent connection between mobile station 20 and the other party, whether that party be in PSTN/IDSN 28 or on the Internet 32.
As seen in Fig. l, base station controller (BSC) 24 has a central processor (CP) or control unit 40. BSC central processor 40 has access to memory ~. As referenced herein, memory =1~ is has stored therein packet data channel allocation instructions.
Further details of an example base station controller (BSC) 24 are shown in Fig.
7 as comprising a switch 2=1~0~. Switch 240, which is controlled by BSC
central processor =10, has a plurality of ports, some of which are connected to diversity handover unit (DHL') 230 and others of which are connected to various interfaces.
to Diversity handover unit (DI-~C: ) 230 is connected to a timing unit 241.
The BSC control unit 40 is connected to each element of BSC 24. BSC 24 is connected to a signaling network via a signaling interface 2=I3. Signaling interface 243 is connected to BSC
central processor =I0. The interfaces connected to ports of switch ?40 include service node interface unit ?:~=l; RNC.' interface unit 246; and base station interface units ?48.
is The service node inte:-face unit 244 is connected to the appropriate mobile switching center 26 and GRPS control node 30. RNC interface unit 246 is connected by inter-RNC transport link 232 to other (unillustrated) base station controllers. Base station interface units 2-1S are connected to the base stations (BS;) 22 served by the base station controller (BSC) 24.
~o An example base station (BS) 22 is shown in Fig. 8 as comprising a switch 260.
Switch 260, which is controlled by base station control unit 262, has a plurality of ports.
At least one, and typically several, of the ports of switch 260 are connected to respective transceiver (Tx/Rx} boards 26-I. Transceiver (Tx~Rx) boards 264 are connected to 2s antennae which are located in the cell served by the base station (BS) 22.
Control unit 262 is also connected to ports. of switch 260, as is an terminal board 266. It is through terminal board 266 that base station (BS) ?'_' communications with its radio network controller base station controller (BSC) 24, with link 225 being connected between an appropriate base station interface unit 24S of base station controller (BSC) 2-1(see Fig.
30 7) and terminal board 266.
The particular example embodiments of base station controller (BSC) 24 shown in Fig. 7 and base station (BS) 2? shown in Fig. 8 happen to be ATVI-bas;.d nodes. In g this regard, both switch ?4la of radio base station controller (BSC) 24 and switch 260 of base station (BS) ?? are, in the illustrated example embodiments, ATVI
switches through which AT~1 cells are directed. It should be understood that the present invention is not limited to the particular architectures of the example base station controller (BSC) 24 and base station (BS) ?'' shown, nor the use of AT?~I
switches, but that other architectures and data transfer techniques can be employed within the scope and spirit of the present invention.
2.0 ALLOCATION OF PDCHs TO C;'SERS
It is the allocation of data packet channels (PDCHs) to users, particularly GPRS
io channels, to which the present invention primarily relates. For each cell, the present invention determines which competing users are to be afforded data packet channels.
The determination of which competing users are to be afforded data packet channels is made by base station controller (BSC) ?4 for each cell controlled by base station controller (BSC) ?4. Since each cell is typically associated with a corresponding base t5 station (BS) ??. the base station controller (BSC) ?~ makes the determination of which competing users are to be afforded data packet channels separately with respect to each base station (BS) 2?.
The determination of which competing users are to be afforded data packet channels is particularly determined by BSC central processor 40 of base station 2o controller (BSC) 24. Basic ,steps performed by BSC central processor 40 are illustrated in Fig. 2 and discussed below. The first basic step, step ?-1 (described in more detail, e.g., in section 2.1 ), involves counting the data resources (dres~) available in cell c at any given instant. Step 2-? (described in more detail, e.g., in section ?.'?) involves, for each competing user, calculating a user ranking value (ru). Step ?-3 (described in more 25 detail, e.g., in section ?.3) involves calculating the data resources per ranking class present (dres~~). Step 2-4 {described in more detail, e.g., in section 2.4) involves sorting the users by ranking to obtain, for the cell, a ranking vector for each class.
Step 2-~
(described in more detail, e. g., in section 2.~) involves allocating the data resources in the cell based on the sorting of users by ranking.
Each of steps 2-1 through ?-~ are described in more detail in the ensuing sections. Reference is made to Table I? for abbreviations and nomenclature employed herein.
2.1 COUNT DATA RESOURCES
s Step 2-I involves counting the data resources (dres~) available in cell c at any given instant. The data resources available at a Qiven instant of time depends on the mufti-frame structure of the 1?DCH, since user information can only be transferred when PDTCH blocks are sent. Thf: data resources available in a cell (dres~) are expressed by Equation l:
da dres~ - ~, (block,s =: PDTCH) Equation 1 ts=i As explained e.g., by 'Table 12, in Equation 1 dts is the number of time slots allocated for data traffic.
22 CALCULATE USER R.A.NKING
Step ?-2 of Fig. ? involves, for each competing user, calculating a user ranking i5 value (r~). For each user, a ranking value between 0 and P is calculated with Equation ?:
r" - a, f, (x,~ ) + a, f= (x =~ )+.. .+a ~, fn,, (x~,,~ ) Equation In Equation 2 it is assumed that there are M different measures of performance for each user. The ranking weighting-functions, fm, are described below (see Equation
4), as are ranking weighting-,:.onstants, am (see Equation 5 j. The performance ?o measurements are represented by the x vector of the user as shown in Equation 3:
x~ _ ~x,ux,v... x~,~ ~ Equation 3 In order to ensure a value range of 0 to P, the x vector is mapped with the ranking weighting-functions, fm (see Equation 4):
f~,(xm) E ~0, P~ Equation 4
x~ _ ~x,ux,v... x~,~ ~ Equation 3 In order to ensure a value range of 0 to P, the x vector is mapped with the ranking weighting-functions, fm (see Equation 4):
f~,(xm) E ~0, P~ Equation 4
5 PCT/SE99/00688 The mutual importance between different performance measures is defined by the ranking weighting-constants, am. For instance, assume two performance measures, where the first is considered as three times more important than the second one. With reference to Equation ~, for' example, this jives a, = 0.7~ and a~ = 0.?5.
M
5 ~ a = 1 Equation ~
m m= I
Several performancE: measures may influence the ranking value, such as those listed below:.
~ maximum delay relative to a tarjet delay value ~ user priority, for instance based on subscription to ~ remaining time relative retransmission timer in higher layers (IP and LLC) ~ assigned bit rate. relative a target bit rate value ~ remaininj packets relative a target value ~ number of recent transmission failures ~ needed output power relative a target value is ~ radio link quality relative a target value ~ normalized packet delay (seconds/kbytes) Below is an example where the first performance measure is the user priority (pu) stated in the channel request and the second is the maximum delay currently experienced (dmax").
i p~ [~rpa;!(a ~ Equation 6 The user priority ca.n be mapped with the ranking weight-function, fl of Equation 2s 7:
1~d0 99/57925 PC'TISE99/00688 >_ P
p 1<p~ <P
f~ (P~ ) = P - 1 ~P - pu ) ~ Equation 7 p p,~ < 1 i This way, the highest user priority ( I ) results in the highest ranking (P).
Fig. 3 graphically illustrates a plot of the mapping function f,.
Equation 8 is an example of a mapping function for maximum delay:
dmax >_ dtgt f~ (dmax) = P' a ~ dmax - l ~ ~ dt~Vt < dmax < dtgt ~ Eqn. 8 dtvt ~ _ i dmax _< ~ ~ dtgt In Equation 8, dtgt is the delay target value and dmax is the maximum delay.
Equation 8 is illustrated in Fig. 4 where the target value for maximum delay has been to chosen to 3 seconds. Fig. 4 gzaphically illustrates a plot of the mapping function f2.
If it were desired for p" and dmax to have equal importance, then a ~=0.5 and a~=0.5, in which case from :Equation ? Equation 9 is obtained:
t5 ru = ~ ~ f, (pu ~ + ~ ~ f~ (dmax) Equation 9 2.3 CALCULATE DATA RESOURCES PER RANKING CLASS PRESENT
Step 2-3 of Fig. 2 involves calculating the data resources per ranking class present (dres~p). Each ranh.ng class, represented by at least one user in the cell, is 2o assigned a share of the available resources at a given instant of time. The share of resources is calculated from the ranking of the ranking classes and the number of resources currently available. In the expressions and equations below, p is an integer representing a ranking class present and P is an integer representing the highest possible ranking Class.
p = integer(r~) + 1 ~~For all users in the cell Equation IO
s rP = p for all ranking classes in the cell Equation 11 r dres~~ = round P P ~ dres~ for all ranking classes in the cell Equation 12 r;
;m , Io Due to rounding errors, it is necessary to perform the test of Equation 13 after the calculations of all ranking classes in the cell. As an alternative, it is possible to mathematically foresee where the rounding error will occur.
while ~ dres~a > dres' Equation 13 P
n then deduct one resource from the class with highest priority.
2.4 SORT USERS BY RrIi~IKING
Step 2-4 of Fig. ? involves sorting the users by ranking to obtain, for the cell, a ranking vector for each class>. Consider cell c with five users belonging to the same 2o ranking class (ranking class 2> in this example) and where the ranking for each user has been stored in the r vector as shown in Equation 14:
r~~ _ [1.8 1.1 1.2 1.9' 1.3) Equation 14 ~5 The vector of Equation 14 is then sorted and the indices are stored in another vector shown in Equation 1_i:
ind~ _ [4 1 ~ 3 2] Equation 15 From the resulting ve:ctor of Equation 15, it can be seen that resources should be ~o allocated to the users in the following order: user., user, > user;, user;
and user.
2.~ ALLOCATE DATA RI::SOL'RCE TOP-DOWN
Step ?-~ of Fig. ? involves allocating the data resources in the cell based on the sorting of users by ranking. The allocation of the available resources to the requesting users can be accomplished using many different techniques. The main philosophy is to s allocate as many resources as possible. The ranking warrants a correct handling of each user request. Set forth separately in sections 2.x.1 through 2.x.3 are three alternative techniques of top-down allocation. Common for all alternative techniques is that the allocation is conducted for one ranking class (present in the cell) at a time, starting with the highest ranking class. Tl:~e allocation techniques for users belonging to the same io ranking class, differs in the alternatives.
2.x.1 STRAIGHT-FORWARD TOP-DOWN
According to a first technique of allocating the data resources in the cell based on the sorting of users by ranking, the user requests are processed in descending ranking order. Any unused resources are passed on the next user in turn. The maximum number Is of available resources must not be exceeded. Consequently, all users may not bet the requested number of resources.
Continuing with the example of Section 2.=l, it is assumed that the number of resources in the cell is 10. Then the resourc;,s are allocated as in Table 1.
User Resources Allocated Queued Requested Resources Requests 1 ~ 4 0 ~ 2 ? 0 ~s PC'r/SE99100688 1~0 99/57925 2.x.2 STRAIGHT-FORWA:EZD TOP-DOWN WITH USER LIMITS
According to a second technique of allocating the data resources in the cell based on the sorting of users by ranking, the user requests are processed in descending ranking order exactly as in alternative A, but the maximum number of resources per user is limited. In the example in Table ?, this limit is two resources per user. In this example, only 9 resources are allocated although 10 are available.
Resource;s Allocated Queued User Requested Resources Requests I 4 2 ~ ?
7 ~ J
io 2.x.3 RELATIVE RANKING
According to a third technique of allocating the data resources in the cell based on the sorting of users by ranking, the relative ranking approach used when calculating resources between ranking classes are also used within each ranking class, see Equation I2 and Equation I3. User ranking values are taken from Equation 14. The result is i5 shown in Table 3.
User Resourefa Allocated Queued Requested Resources Requests TABLE 3 RELATIVE RANKING APPROACH:
1~
3.0 ILLUSTR.aTIVE EX.alvIPLE
This section shows are example of the present invention in which a a cell which has 3 transceivers (TRX's ). Two time slots are used for BCCH and SDCCH, which leaves 22 time slots for speech and data traffic. These time slots are currently configured according to Table 4 below.
Description I Parameter Value Speech time slots sts 1?
Data time slots dts Idle time slots its 3 to TABLE :~ CURRF;NT TIME SLOT CONFIGURATION IN CELL C
Table 5 shows the current block status of the data resources.
Data Time Slot ( PDCH ~ Current block =I SPDCH PDTCH
M
5 ~ a = 1 Equation ~
m m= I
Several performancE: measures may influence the ranking value, such as those listed below:.
~ maximum delay relative to a tarjet delay value ~ user priority, for instance based on subscription to ~ remaining time relative retransmission timer in higher layers (IP and LLC) ~ assigned bit rate. relative a target bit rate value ~ remaininj packets relative a target value ~ number of recent transmission failures ~ needed output power relative a target value is ~ radio link quality relative a target value ~ normalized packet delay (seconds/kbytes) Below is an example where the first performance measure is the user priority (pu) stated in the channel request and the second is the maximum delay currently experienced (dmax").
i p~ [~rpa;!(a ~ Equation 6 The user priority ca.n be mapped with the ranking weight-function, fl of Equation 2s 7:
1~d0 99/57925 PC'TISE99/00688 >_ P
p 1<p~ <P
f~ (P~ ) = P - 1 ~P - pu ) ~ Equation 7 p p,~ < 1 i This way, the highest user priority ( I ) results in the highest ranking (P).
Fig. 3 graphically illustrates a plot of the mapping function f,.
Equation 8 is an example of a mapping function for maximum delay:
dmax >_ dtgt f~ (dmax) = P' a ~ dmax - l ~ ~ dt~Vt < dmax < dtgt ~ Eqn. 8 dtvt ~ _ i dmax _< ~ ~ dtgt In Equation 8, dtgt is the delay target value and dmax is the maximum delay.
Equation 8 is illustrated in Fig. 4 where the target value for maximum delay has been to chosen to 3 seconds. Fig. 4 gzaphically illustrates a plot of the mapping function f2.
If it were desired for p" and dmax to have equal importance, then a ~=0.5 and a~=0.5, in which case from :Equation ? Equation 9 is obtained:
t5 ru = ~ ~ f, (pu ~ + ~ ~ f~ (dmax) Equation 9 2.3 CALCULATE DATA RESOURCES PER RANKING CLASS PRESENT
Step 2-3 of Fig. 2 involves calculating the data resources per ranking class present (dres~p). Each ranh.ng class, represented by at least one user in the cell, is 2o assigned a share of the available resources at a given instant of time. The share of resources is calculated from the ranking of the ranking classes and the number of resources currently available. In the expressions and equations below, p is an integer representing a ranking class present and P is an integer representing the highest possible ranking Class.
p = integer(r~) + 1 ~~For all users in the cell Equation IO
s rP = p for all ranking classes in the cell Equation 11 r dres~~ = round P P ~ dres~ for all ranking classes in the cell Equation 12 r;
;m , Io Due to rounding errors, it is necessary to perform the test of Equation 13 after the calculations of all ranking classes in the cell. As an alternative, it is possible to mathematically foresee where the rounding error will occur.
while ~ dres~a > dres' Equation 13 P
n then deduct one resource from the class with highest priority.
2.4 SORT USERS BY RrIi~IKING
Step 2-4 of Fig. ? involves sorting the users by ranking to obtain, for the cell, a ranking vector for each class>. Consider cell c with five users belonging to the same 2o ranking class (ranking class 2> in this example) and where the ranking for each user has been stored in the r vector as shown in Equation 14:
r~~ _ [1.8 1.1 1.2 1.9' 1.3) Equation 14 ~5 The vector of Equation 14 is then sorted and the indices are stored in another vector shown in Equation 1_i:
ind~ _ [4 1 ~ 3 2] Equation 15 From the resulting ve:ctor of Equation 15, it can be seen that resources should be ~o allocated to the users in the following order: user., user, > user;, user;
and user.
2.~ ALLOCATE DATA RI::SOL'RCE TOP-DOWN
Step ?-~ of Fig. ? involves allocating the data resources in the cell based on the sorting of users by ranking. The allocation of the available resources to the requesting users can be accomplished using many different techniques. The main philosophy is to s allocate as many resources as possible. The ranking warrants a correct handling of each user request. Set forth separately in sections 2.x.1 through 2.x.3 are three alternative techniques of top-down allocation. Common for all alternative techniques is that the allocation is conducted for one ranking class (present in the cell) at a time, starting with the highest ranking class. Tl:~e allocation techniques for users belonging to the same io ranking class, differs in the alternatives.
2.x.1 STRAIGHT-FORWARD TOP-DOWN
According to a first technique of allocating the data resources in the cell based on the sorting of users by ranking, the user requests are processed in descending ranking order. Any unused resources are passed on the next user in turn. The maximum number Is of available resources must not be exceeded. Consequently, all users may not bet the requested number of resources.
Continuing with the example of Section 2.=l, it is assumed that the number of resources in the cell is 10. Then the resourc;,s are allocated as in Table 1.
User Resources Allocated Queued Requested Resources Requests 1 ~ 4 0 ~ 2 ? 0 ~s PC'r/SE99100688 1~0 99/57925 2.x.2 STRAIGHT-FORWA:EZD TOP-DOWN WITH USER LIMITS
According to a second technique of allocating the data resources in the cell based on the sorting of users by ranking, the user requests are processed in descending ranking order exactly as in alternative A, but the maximum number of resources per user is limited. In the example in Table ?, this limit is two resources per user. In this example, only 9 resources are allocated although 10 are available.
Resource;s Allocated Queued User Requested Resources Requests I 4 2 ~ ?
7 ~ J
io 2.x.3 RELATIVE RANKING
According to a third technique of allocating the data resources in the cell based on the sorting of users by ranking, the relative ranking approach used when calculating resources between ranking classes are also used within each ranking class, see Equation I2 and Equation I3. User ranking values are taken from Equation 14. The result is i5 shown in Table 3.
User Resourefa Allocated Queued Requested Resources Requests TABLE 3 RELATIVE RANKING APPROACH:
1~
3.0 ILLUSTR.aTIVE EX.alvIPLE
This section shows are example of the present invention in which a a cell which has 3 transceivers (TRX's ). Two time slots are used for BCCH and SDCCH, which leaves 22 time slots for speech and data traffic. These time slots are currently configured according to Table 4 below.
Description I Parameter Value Speech time slots sts 1?
Data time slots dts Idle time slots its 3 to TABLE :~ CURRF;NT TIME SLOT CONFIGURATION IN CELL C
Table 5 shows the current block status of the data resources.
Data Time Slot ( PDCH ~ Current block =I SPDCH PDTCH
6 ~ SPDCH PDTCH
7 ~ SPDCH ~ PDTCH
is TABLE ~ BL.OCK ST.aTUS OF DATA RESOURCES
Out of the seven PDC~H's, six can currently be used to carry user information.
2o There are five users in cell. 'hheir requests for data resources (queued packets) are shown below, together with tl'ze tagged user priority and the current maximum delay WC~ 99/57925 PCT/SE99J00688 value. The user priority subnnitted in the channel request can have values l, 2, 3 and 4, where 1 is highest priority.
3.1. COUNT DATA RESOURCES
From Table ~, it is seen that six data resources (PDTCH) are currently available.
3.2 CALCULATE USER RANKING
Assuming a ranking value based on user priority and maximum delay of equal importance, Equation 9 and fable 6 gives the rankings shown in Table 7 .
User Queued User Priority Maximum Delay P3C:ltetS
a qp p" dmax 2 81 ,~ ~0 3 228 4 i lI0 User Ranking user 1 user 2 user 3 user 4 user 5 ' r" 1.2 0 0 2 1.~5 20 3.3 CALCULATE DATA RESOURCES PER RANKING CLASS PRESENT
The user ranking valu~° is used to determine which ranking class a certain user belongs to, according to Equation 10 (see also Fig. ~). Here, ranking classes l, 2 and 3 s IO
Is WO~ 99/57925 PCTISE99/40688 are present, ranking class 4 is not present. For instance, ranking class 3 is treated as three times more important than ranking class 1 as shown in Table 8 below.
User Ranking user 1 user ? user ~ user 4 user 5 I ( p 2 1 1 3 '' s Fig. 6 illustrates a relationship between user ranking values and corresponding ranking classes.
~o The next step is to calculate the ranking of the ranking classes according to Equation 11. Then Equations I2 and I3 are used to determine the number of data resources per ranking class. The result is shown in Table 9.
Ranking Class Ranking Value Data Resources P rp dr;,s~
3 ~ 3 3 is TABLE 9 NUMIBER OF RESOURCES PER RANKING CLASS
3.~ SORT USERS BY RAN1KING
The users are sorted by ranking order in each ranking class as shown in Table 10.
Ranking Class User User Ranl~:ing 3 =1 _ i.J~
_ -1 i _ T,~BLE 10 USERS SORTED BY R.aNKING
3.5 ALLOCATE DATA RF?SOURCES TOP-DOWN
Assuming allocation ,as described in the first alternative described in section 2.~, s the resources are allocated as shown in Table 11.
Ranking L'ser Queued Resources New Queue Class Packets Allocated 2 5 17 2 l~
I 3 ~~s ~0 228 TABLE 1 i DATA RESOURCES ALLOCATED PER ALTERNATIVE A
io The number of resources allocated to each user can be compared with the user priority of each user request. User 4 has higher user priority and then user ~
and the other three users all have the; lowest priority. Here, user 2 got one resource (not user 1 or 3). User 2 and 3 have the same ranking value in ranking class I and user 2 was chosen randomly.
4.0 EPILOGUE
The invention thus relates to a method of allocating available data resources to data users in a cell. For each user, a ranking value is calculated from several performance measures. Given the ranking value, each user belongs to a ranking class 2o and each ranking class is assigned a share of the total number of the data resources available in the cell. Within. each ranking class, the users are ordered in descending ranking order. Finally, the data resources are allocated top-down and any unused resources are passed on to the next user in turn. Some users may not jet any resources since the number of resources available must never be exceeded.
Fig. ~ graphically illustrates allocation of data channels among three different ranking classes in accordance with one mode of the invention.
The use of ranking classes ensures users with low ranking to at least get a share, perhaps small, of the resources when located in a cell with a few highly ranked users.
The procedure of the present invention is based on Iocal decisions made for each cell in the cellular system and is to be performed at a aregular time interval.
TABLE 1'_' Parameter Descri tion its number oil idle time slots sts number of_time slots allocated for speech traffic dts number olv ume slots allocated for data traffic dmax maximum delay dtat delay tara~~t-Vallle r ranking value a ranking wiQioing constant f ranl:in~ w~e_xght3ng function p ranking cl,z_ss, p - l,'_'....P
x performance value dyes number of available data resources tres number of available traffic resources qp number of packets in queue min minimum number of packets in queue rsts number of_trme slots reserved for speech traffic sw't waiting time when activating a time slot.
The time slot can not carTV traffic during the waiting time ew't waiting time when de-activating a time slot, including time for si.,naling new assignments to the mobile stations estimated servrce-session arrival rate p.;s estimated service-session departure rate U Number of users, a = l,?....U
C Number of cells, c = 1,? . . ..C
A~Sts CrS~S Constant in the expression of reserved speech M time slots Number ofperformance measures. m = l,?.....M
P Highest ( Present) ranking class Tm Slidin; time wrndow when evaluating to end an MPDCH
T, Sliding time window when evaluating to end an ~PT~C'~1 to ~VVO 99/57925 PCT/SE99/00688 While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various; modifications and equivalent arrangements included within the spirit and scope of the 3~,ppended claims.
is TABLE ~ BL.OCK ST.aTUS OF DATA RESOURCES
Out of the seven PDC~H's, six can currently be used to carry user information.
2o There are five users in cell. 'hheir requests for data resources (queued packets) are shown below, together with tl'ze tagged user priority and the current maximum delay WC~ 99/57925 PCT/SE99J00688 value. The user priority subnnitted in the channel request can have values l, 2, 3 and 4, where 1 is highest priority.
3.1. COUNT DATA RESOURCES
From Table ~, it is seen that six data resources (PDTCH) are currently available.
3.2 CALCULATE USER RANKING
Assuming a ranking value based on user priority and maximum delay of equal importance, Equation 9 and fable 6 gives the rankings shown in Table 7 .
User Queued User Priority Maximum Delay P3C:ltetS
a qp p" dmax 2 81 ,~ ~0 3 228 4 i lI0 User Ranking user 1 user 2 user 3 user 4 user 5 ' r" 1.2 0 0 2 1.~5 20 3.3 CALCULATE DATA RESOURCES PER RANKING CLASS PRESENT
The user ranking valu~° is used to determine which ranking class a certain user belongs to, according to Equation 10 (see also Fig. ~). Here, ranking classes l, 2 and 3 s IO
Is WO~ 99/57925 PCTISE99/40688 are present, ranking class 4 is not present. For instance, ranking class 3 is treated as three times more important than ranking class 1 as shown in Table 8 below.
User Ranking user 1 user ? user ~ user 4 user 5 I ( p 2 1 1 3 '' s Fig. 6 illustrates a relationship between user ranking values and corresponding ranking classes.
~o The next step is to calculate the ranking of the ranking classes according to Equation 11. Then Equations I2 and I3 are used to determine the number of data resources per ranking class. The result is shown in Table 9.
Ranking Class Ranking Value Data Resources P rp dr;,s~
3 ~ 3 3 is TABLE 9 NUMIBER OF RESOURCES PER RANKING CLASS
3.~ SORT USERS BY RAN1KING
The users are sorted by ranking order in each ranking class as shown in Table 10.
Ranking Class User User Ranl~:ing 3 =1 _ i.J~
_ -1 i _ T,~BLE 10 USERS SORTED BY R.aNKING
3.5 ALLOCATE DATA RF?SOURCES TOP-DOWN
Assuming allocation ,as described in the first alternative described in section 2.~, s the resources are allocated as shown in Table 11.
Ranking L'ser Queued Resources New Queue Class Packets Allocated 2 5 17 2 l~
I 3 ~~s ~0 228 TABLE 1 i DATA RESOURCES ALLOCATED PER ALTERNATIVE A
io The number of resources allocated to each user can be compared with the user priority of each user request. User 4 has higher user priority and then user ~
and the other three users all have the; lowest priority. Here, user 2 got one resource (not user 1 or 3). User 2 and 3 have the same ranking value in ranking class I and user 2 was chosen randomly.
4.0 EPILOGUE
The invention thus relates to a method of allocating available data resources to data users in a cell. For each user, a ranking value is calculated from several performance measures. Given the ranking value, each user belongs to a ranking class 2o and each ranking class is assigned a share of the total number of the data resources available in the cell. Within. each ranking class, the users are ordered in descending ranking order. Finally, the data resources are allocated top-down and any unused resources are passed on to the next user in turn. Some users may not jet any resources since the number of resources available must never be exceeded.
Fig. ~ graphically illustrates allocation of data channels among three different ranking classes in accordance with one mode of the invention.
The use of ranking classes ensures users with low ranking to at least get a share, perhaps small, of the resources when located in a cell with a few highly ranked users.
The procedure of the present invention is based on Iocal decisions made for each cell in the cellular system and is to be performed at a aregular time interval.
TABLE 1'_' Parameter Descri tion its number oil idle time slots sts number of_time slots allocated for speech traffic dts number olv ume slots allocated for data traffic dmax maximum delay dtat delay tara~~t-Vallle r ranking value a ranking wiQioing constant f ranl:in~ w~e_xght3ng function p ranking cl,z_ss, p - l,'_'....P
x performance value dyes number of available data resources tres number of available traffic resources qp number of packets in queue min minimum number of packets in queue rsts number of_trme slots reserved for speech traffic sw't waiting time when activating a time slot.
The time slot can not carTV traffic during the waiting time ew't waiting time when de-activating a time slot, including time for si.,naling new assignments to the mobile stations estimated servrce-session arrival rate p.;s estimated service-session departure rate U Number of users, a = l,?....U
C Number of cells, c = 1,? . . ..C
A~Sts CrS~S Constant in the expression of reserved speech M time slots Number ofperformance measures. m = l,?.....M
P Highest ( Present) ranking class Tm Slidin; time wrndow when evaluating to end an MPDCH
T, Sliding time window when evaluating to end an ~PT~C'~1 to ~VVO 99/57925 PCT/SE99/00688 While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various; modifications and equivalent arrangements included within the spirit and scope of the 3~,ppended claims.
Claims (28)
1. In a cellular telecommunications system, a method of dynamically allocating packet data radio channels among users competing in a same cell for the channels, the method comprising:
(1) determining a user ranking for each of plural competing users in the cell whereby each of the plural competing users is classified into one of plural ranking classes;
(2) determining a number of the packet data radio channels available for each of the ranking classes;
(3) sorting users within each ranking class by ranking; and (4) allocating the packet data radio channels to the users by ranking classes and in accordance with the sorting of step (3).
(1) determining a user ranking for each of plural competing users in the cell whereby each of the plural competing users is classified into one of plural ranking classes;
(2) determining a number of the packet data radio channels available for each of the ranking classes;
(3) sorting users within each ranking class by ranking; and (4) allocating the packet data radio channels to the users by ranking classes and in accordance with the sorting of step (3).
2. The method of claim 1, wherein the user ranking for a user is related to a combination of plural measures of performance for the user.
3. The method of claim 2, wherein the plural measures of performance for the user include user priority and maximum delay relative to a target maximum delay value.
4. The method of claim 2, wherein the plural measures of performance for the user include at least two of t1e following: (1) user priority; (2) maximum delay relative to a target maximum delay value; (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5) a number of remaining packets relative to a target number of remaining packets;
(6) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
(6) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
5. The method of claim 2, wherein the user ranking for a user is related to a weighted combination of plural measures of performance for the user.
6. The method of claim 2, wherein the user ranking for a user is determined in accordance with the combination r u = a1 f1 (x1u) + a2f2 (x2u)+...+a M f M,(x Mu), in which there are M different measures of performance for each user; the performance measures being represented by a vector (x), and which includes ranking weighting-functions, fm and ranking weighting-constants, am.
7. The method of claim 1, wherein step (4) involves awarding packet data radio channels in descending ranking order within each ranking class.
8. The method of claim 1, wherein step (4) involves determining a limiting number of packet data radio channels available to a particular ranking class and then, to the users in the particular ranking class, awarding the limiting number of packet data radio channels in descending ranking order within the particular ranking class.
9. The method of claim 1, wherein steps (1) through (4) are performed by a processor.
10. The method of claim 9, wherein the processor is situated at a base station controller node of a cellular telecommunications system.
11. A node of a cellular telecommunications system which dynamically allocates packet data radio channels among users competing in a same cell for the channels, the node including a processor which executes instructions stored in a memory for performing the steps of:
(1) determining a user ranking for each of plural competing users in the cell whereby each of the plural competing users is classified into one of plural ranking classes;
(2) determining a number of the packet data radio channels available for each of the ranking classes;
(3) sorting users within each ranking class by ranking; and (4) allocating the packet data radio channels to the users by ranking classes and in accordance with the sorting of step {3).
(1) determining a user ranking for each of plural competing users in the cell whereby each of the plural competing users is classified into one of plural ranking classes;
(2) determining a number of the packet data radio channels available for each of the ranking classes;
(3) sorting users within each ranking class by ranking; and (4) allocating the packet data radio channels to the users by ranking classes and in accordance with the sorting of step {3).
12. The apparatus of claim 11, wherein the user ranking for a user is related to a combination of plural measures of performance for the user.
13. The apparatus of claim 12, wherein the plural measures of performance for the user include user priority and maximum delay relative to a target maximum delay value.
14. The apparatus of claim 12, wherein the plural measures of performance for the user include at least two of the following: (1) user priority; (2) maximum delay relative to a target maximum delay value; (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5 ) a number of remaining packets relative to a target number of remaining packets;
(6 ) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
(6 ) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
15. The apparatus of claim 12, wherein the user ranking for a user is related to a weighted combination of plural measures of performance for the user.
16. The apparatus of claim 12, wherein the user ranking for a user is determined in accordance with the combination ru = a1 f1 (x1u)+ a2 f2 (x2u )+...+am fm (xMu) , in which there are M different measures of performance for each user; the performance measures being represented by a vector (x), and which includes ranking weighting-functions, fm and ranking weighting-constants, am.
17. The apparatus of claim 11, wherein step (4) involves awarding packet data radio channels in descending ranking order within each ranking class.
18. The apparatus of claim 11, wherein step (4)-involves determining a limiting number of packet data radio channels available to a particular ranking class and then, to the users in the particular ranking class, awarding the limiting number of packet data radio channels in descending ranking order within the particular ranking class.
19. The apparatus of claim 11, wherein the node is a base station controller node of the cellular telecommunications system
20. In a cellular telecommunications system, a method of dynamically allocating packet data radio channels among users competing in a same cell for the channels, the method comprising:
(1) determining a user ranking for each of plural competing users in the cell, the user ranking for a user being related to a weighted combination of plural measures of performance for the user; and (2) allocating the packet data radio channels to the users in accordance with user ranking.
(1) determining a user ranking for each of plural competing users in the cell, the user ranking for a user being related to a weighted combination of plural measures of performance for the user; and (2) allocating the packet data radio channels to the users in accordance with user ranking.
21. The method of claim 20, wherein the plural measures of performance for the user include user priority and maximum delay relative to a target maximum delay value.
22. The method of claim 20, wherein the plural measurers of performance for the user include at least two of the following: {1) user priority: (2) maximum delay relative to a target maximum delay value; (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5) a number of remaining packets relative to a target number of remaining packets;
(6) a number of recent transmission failures; {7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
(6) a number of recent transmission failures; {7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
23. The method of claim 20, wherein steps {1) and {2) are performed by a processor.
24. The method of claim 23, wherein the processor is situated at a base station controller node of a cellular telecommunications system.
25. A node of a cellular telecommunications system which dynamically allocates packet data radio channels among users competing in a same cell for the channels, the node including a processor which executes instructions stored in a memory for performing the steps of:
(1) determining a user ranking for each of plural competing users in the cell, the user ranking for a user being related to a weighted combination of plural measures of performance for the user; and (2) allocating the packet data radio channels to the users in accordance with user ranking.
(1) determining a user ranking for each of plural competing users in the cell, the user ranking for a user being related to a weighted combination of plural measures of performance for the user; and (2) allocating the packet data radio channels to the users in accordance with user ranking.
26. The apparatus of claim 25, wherein the plural measures of performance for the user include user priority and maximum delay relative to a target maximum delay value.
27. The apparatus of claim 25, wherein the plural measurers of performance for the user include at least two of the following: (1) user priority; (2) maximum delay relative to a target maximum delay value; (3) remaining time relative to a transmission time in higher layers; (4) an assigned bit rate relative to a target bit rate value; (5) a number of remaining packets relative to a target number of remaining packets;
(6) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
(6) a number of recent transmission failures; (7) a required output power value relative to a target output power value; (8) a radio link quality value relative to a target radio link value; and (9) normalized packet delay.
28. The apparatus of claim 25, wherein the processor is situated at a base station controller node of a cellular telecommunications system.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/069,969 | 1998-04-30 | ||
| US09/069,969 US6721278B1 (en) | 1998-04-30 | 1998-04-30 | Dynamic allocation of packet data channels |
| PCT/SE1999/000688 WO1999057925A1 (en) | 1998-04-30 | 1999-04-27 | Dynamic allocation of packet data channels |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2330846A1 true CA2330846A1 (en) | 1999-11-11 |
Family
ID=22092320
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002330846A Abandoned CA2330846A1 (en) | 1998-04-30 | 1999-04-27 | Dynamic allocation of packet data channels |
Country Status (8)
| Country | Link |
|---|---|
| US (1) | US6721278B1 (en) |
| CN (1) | CN1218591C (en) |
| AU (1) | AU4301999A (en) |
| BR (1) | BR9910069A (en) |
| CA (1) | CA2330846A1 (en) |
| DE (1) | DE19983172B4 (en) |
| GB (1) | GB2353189B (en) |
| WO (1) | WO1999057925A1 (en) |
Families Citing this family (45)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI105969B (en) * | 1998-08-10 | 2000-10-31 | Nokia Networks Oy | Quality of service management in a mobile communication system |
| US6324172B1 (en) * | 1999-03-08 | 2001-11-27 | Qualcomm Incorporated | Method of rate allocation in a data communications network |
| WO2001013659A1 (en) | 1999-08-12 | 2001-02-22 | Elad Barkan | Add-on base station for cellular network expansion |
| GB2355148B (en) | 1999-10-08 | 2004-09-01 | Nokia Mobile Phones Ltd | Communication device |
| FI19992341A (en) * | 1999-10-29 | 2001-04-30 | Nokia Networks Oy | Method and system for redefining the interface |
| GB2357669A (en) * | 1999-12-24 | 2001-06-27 | Nokia Networks Oy | Dynamic channel allocation |
| US7177298B2 (en) * | 2000-01-07 | 2007-02-13 | Gopal Chillariga | Dynamic channel allocation in multiple-access communication systems |
| US6493331B1 (en) * | 2000-03-30 | 2002-12-10 | Qualcomm Incorporated | Method and apparatus for controlling transmissions of a communications systems |
| SE0001173L (en) * | 2000-03-31 | 2001-10-01 | Ericsson Telefon Ab L M | Distribution of traffic load between base radio stations |
| EP1154664A1 (en) * | 2000-05-09 | 2001-11-14 | Lucent Technologies Inc. | Resource reservation in 3G or future generation telecommunication network II |
| DE60044999D1 (en) * | 2000-05-19 | 2010-11-04 | Lucent Technologies Inc | Phone systems |
| DE10029427A1 (en) * | 2000-06-15 | 2001-12-20 | Siemens Ag | Transmission power control method between base station and data terminals by allocating respective transmission powers to packet data traffic channels |
| GB2366688B (en) * | 2000-07-17 | 2004-06-30 | Ericsson Telefon Ab L M | Communications system |
| US7126939B2 (en) * | 2000-07-24 | 2006-10-24 | Nortel Networks Limited | Packet-based calls in a wireless network |
| US7002937B1 (en) * | 2000-10-17 | 2006-02-21 | Sprint Communications Company L.P. | Access based on termination in a wireless communication system |
| US7266080B1 (en) | 2000-10-17 | 2007-09-04 | Sprint Communications Company L.P. | Access based on a rate in a wireless communication system |
| US20020168940A1 (en) * | 2000-10-18 | 2002-11-14 | Geert Heijenk | Predictive fair polling mechanism in a wireless access scheme |
| US20020159418A1 (en) * | 2000-11-02 | 2002-10-31 | Sharp Laboratories Of America, Inc. | Quality of service using wireless lan |
| US6920119B2 (en) * | 2001-01-09 | 2005-07-19 | Motorola, Inc. | Method for scheduling and allocating data transmissions in a broad-band communications system |
| US7006466B2 (en) * | 2001-03-09 | 2006-02-28 | Lucent Technologies Inc. | Dynamic rate control methods and apparatus for scheduling data transmissions in a communication network |
| US7219132B2 (en) * | 2001-03-30 | 2007-05-15 | Space Systems/Loral | Dynamic resource allocation architecture for differentiated services over broadband communication networks |
| US7042856B2 (en) * | 2001-05-03 | 2006-05-09 | Qualcomm, Incorporation | Method and apparatus for controlling uplink transmissions of a wireless communication system |
| US7961616B2 (en) | 2001-06-07 | 2011-06-14 | Qualcomm Incorporated | Method and apparatus for congestion control in a wireless communication system |
| GB2377117B (en) * | 2001-06-27 | 2004-08-18 | Cambridge Broadband Ltd | Method and apparatus for providing communications bandwidth |
| GB2381416A (en) | 2001-10-24 | 2003-04-30 | Ipwireless Inc | Allocation of resources in a packet based radio communications system employing shared channels for data transfer |
| US7508780B2 (en) | 2002-01-18 | 2009-03-24 | Nortel Networks Limited | Method and system for priority-based state transition for high speed data transmission and wireless access networks |
| US20030152070A1 (en) * | 2002-02-04 | 2003-08-14 | Siemens Aktiengesellschaft | Method for transmitting signaling messages between first and second network units, and radio communication system and base station subsystem therefor |
| US7012935B2 (en) * | 2002-05-16 | 2006-03-14 | Intel Corporation | Alignment and deskew device, system and method |
| GB2392347B (en) * | 2002-08-21 | 2006-02-22 | Motorola Inc | An apparatus and method for resource allocation in a communication system |
| US7865547B2 (en) * | 2002-09-12 | 2011-01-04 | Siemens Enterprise Communications, Inc. | System and method for accessing busy IP network resources |
| JP3994046B2 (en) * | 2002-11-19 | 2007-10-17 | 株式会社エヌ・ティ・ティ・ドコモ | Resource allocation control device, resource allocation control method, and mobile communication system |
| JP2004207840A (en) * | 2002-12-24 | 2004-07-22 | Nec Corp | Method of managing radio resource, managing apparatus used therefor, base station and terminal |
| DE602004004084T2 (en) * | 2003-02-19 | 2007-06-06 | Fujitsu Ltd., Kawasaki | EXIT CONTROL FOR PACKAGES |
| JP4335619B2 (en) * | 2003-09-04 | 2009-09-30 | 株式会社エヌ・ティ・ティ・ドコモ | Packet priority control apparatus and method |
| US20070183343A1 (en) * | 2006-02-03 | 2007-08-09 | Liliana Grajales | Method and system for facilitating command of a group |
| US8594933B2 (en) * | 2006-02-09 | 2013-11-26 | Sap Ag | Transmission of sensor data based on geographical navigation data |
| US8331248B2 (en) * | 2007-06-06 | 2012-12-11 | Futurewei Technologies, Inc. | System and method for dynamic resource allocation in wireless communications networks |
| US9264976B2 (en) | 2007-11-16 | 2016-02-16 | Qualcomm Incorporated | Preamble design for a wireless signal |
| US9215669B2 (en) | 2007-11-16 | 2015-12-15 | Qualcomm Incorporated | Preamble design for a wireless signal |
| US8918112B2 (en) | 2007-11-16 | 2014-12-23 | Qualcomm Incorporated | Preamble design for a wireless signal |
| US9801188B2 (en) | 2008-02-01 | 2017-10-24 | Qualcomm Incorporated | Backhaul signaling for interference avoidance |
| US8768372B2 (en) | 2008-02-13 | 2014-07-01 | Qualcomm Incorporated | Sector interference management based on inter-sector performance |
| US20100202388A1 (en) * | 2009-02-03 | 2010-08-12 | Qualcomm Incorporated | Over-the-air enhancement for backhaul dynamic interference management in wireless networks |
| CN101944873A (en) * | 2010-09-17 | 2011-01-12 | 中国科学院上海技术物理研究所 | Acceleration and speed reduction control method for stepper motor |
| KR102363164B1 (en) * | 2015-01-19 | 2022-02-15 | 삼성전자 주식회사 | Method and apparatus for scheduling terminal based on terminal level in mobile communication system |
Family Cites Families (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4012597A (en) * | 1975-11-24 | 1977-03-15 | Motorola, Inc. | Transmission trunk multichannel dispatch system with priority queuing |
| USRE32789E (en) | 1975-11-24 | 1988-11-22 | Motorola, Inc. | Transmission trunk multichannel dispatch system with priority queuing |
| US4716407A (en) | 1985-10-07 | 1987-12-29 | Motorola, Inc. | Trunked communication system true priority channel scan |
| US4726050A (en) | 1986-02-18 | 1988-02-16 | Motorola, Inc. | Scanning receiver allocation method and apparatus for cellular radiotelephone systems |
| GB8628824D0 (en) | 1986-12-02 | 1987-01-07 | Plessey Co Plc | Communication system |
| US5038398A (en) | 1989-08-09 | 1991-08-06 | Harris Corporation | Method of assigning communication links in a dynamic communication network |
| SE500827C2 (en) | 1989-09-13 | 1994-09-12 | Ericsson Telefon Ab L M | Method of communication between a mobile station and a fixed radio station |
| US5179374A (en) | 1989-09-29 | 1993-01-12 | Motorola, Inc. | Communication network prioritization system for mobile unit |
| US5371780A (en) | 1990-10-01 | 1994-12-06 | At&T Corp. | Communications resource assignment in a wireless telecommunications system |
| US5134714A (en) | 1990-10-12 | 1992-07-28 | Motorola, Inc. | Remote control of priority communications automatic |
| US5226071A (en) * | 1990-12-18 | 1993-07-06 | At&T Bell Laboratories | Call path resource allocation in a wireless telecommunications system |
| CA2063901C (en) | 1991-03-25 | 2002-08-13 | Arunas G. Slekys | Cellular data overlay system |
| US5507007A (en) | 1991-09-27 | 1996-04-09 | Televerket | Method of distributing capacity in a radio cell system |
| US5392344A (en) | 1991-10-03 | 1995-02-21 | At&T Corp. | Communications network class-of-service routing |
| WO1993017531A1 (en) | 1992-02-27 | 1993-09-02 | Telefonaktiebolaget Lm Ericsson | Call priority in a mobile radiotelephone system |
| US5533094A (en) | 1992-05-12 | 1996-07-02 | Telefonaktiebolaget L M Ericsson, A Corp. Of Sweden | Allocation of paging capacity in cellular applications by storing a set of page request group designations, paging extents and paging priority parameters |
| US5410740A (en) | 1993-03-24 | 1995-04-25 | Telefonaktiebolaget L M Ericsson | Control of a radio communications system base station |
| JP2888376B2 (en) * | 1993-12-31 | 1999-05-10 | インターナシヨナル・ビジネス・マシーンズ・コーポレーシヨン | Switching equipment for multiple traffic classes |
| US5457735A (en) * | 1994-02-01 | 1995-10-10 | Motorola, Inc. | Method and apparatus for queuing radio telephone service requests |
| US5530912A (en) * | 1994-06-29 | 1996-06-25 | At&T Corp. | Traffic driven channel reservation system for handovers in cellular networks |
| US5537684A (en) | 1994-07-29 | 1996-07-16 | Motorola, Inc. | Method for a communication unit to influence communication resource allocation |
| US5600704A (en) * | 1994-08-30 | 1997-02-04 | Ericsson Inc. | Systems and methods for prioritized routing of telephone calls to a subscriber |
| US5623535A (en) | 1994-09-08 | 1997-04-22 | Lucent Technologies Inc. | Operations of cellular communications systems based on mobility and teletraffic statistics collected by mobile units |
| US5524280A (en) * | 1994-10-31 | 1996-06-04 | Motorola, Inc. | Method of acquiring a channel in a general frequency reuse system |
| FI114178B (en) | 1995-01-09 | 2004-08-31 | Nokia Corp | Dynamic allocation of radio capacity in a TDMA system |
| KR100247146B1 (en) * | 1995-03-31 | 2000-04-01 | 비센트 비.인그라시아 | Method and equipment of allocation communication resource |
| US5574977A (en) | 1995-04-17 | 1996-11-12 | Telefonaktiebolaget Lm Ericsson | System and method for providing priority access and channel assignment in a cellular telecommunication system |
| US5729542A (en) * | 1995-06-28 | 1998-03-17 | Motorola, Inc. | Method and apparatus for communication system access |
| US5752193A (en) | 1995-09-01 | 1998-05-12 | Motorola, Inc. | Method and apparatus for communicating in a wireless communication system |
| US5666348A (en) | 1995-09-18 | 1997-09-09 | Telefonaktiebolaget L M Ericsson (Publ.) | Packet switched radio channel admission control in a cellular telecommunications system |
| US5787352A (en) * | 1995-12-29 | 1998-07-28 | At&T Corp. | System and method for management of neighbor-channel interference with power control and directed channel assignment |
| US5742594A (en) * | 1996-06-13 | 1998-04-21 | Motorola, Inc. | Method and apparatus for allocating shared bandwidth among a plurality of users |
| US5926763A (en) * | 1996-08-09 | 1999-07-20 | Gte Mobile Communications Service Corporation | Cellular communication system with voice channel usage biasing |
| US6108316A (en) * | 1997-07-25 | 2000-08-22 | At & T Corp | Adaptive scheduling priorities based on battery power level in wireless access protocols |
-
1998
- 1998-04-30 US US09/069,969 patent/US6721278B1/en not_active Expired - Lifetime
-
1999
- 1999-04-27 WO PCT/SE1999/000688 patent/WO1999057925A1/en active Application Filing
- 1999-04-27 AU AU43019/99A patent/AU4301999A/en not_active Abandoned
- 1999-04-27 CN CN998080799A patent/CN1218591C/en not_active Expired - Fee Related
- 1999-04-27 GB GB0026386A patent/GB2353189B/en not_active Expired - Fee Related
- 1999-04-27 BR BR9910069-0A patent/BR9910069A/en not_active IP Right Cessation
- 1999-04-27 DE DE19983172T patent/DE19983172B4/en not_active Expired - Fee Related
- 1999-04-27 CA CA002330846A patent/CA2330846A1/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| BR9910069A (en) | 2000-12-26 |
| CN1307785A (en) | 2001-08-08 |
| GB2353189B (en) | 2003-06-25 |
| DE19983172T1 (en) | 2001-06-28 |
| US6721278B1 (en) | 2004-04-13 |
| GB0026386D0 (en) | 2000-12-13 |
| GB2353189A (en) | 2001-02-14 |
| DE19983172B4 (en) | 2011-01-05 |
| CN1218591C (en) | 2005-09-07 |
| WO1999057925A1 (en) | 1999-11-11 |
| AU4301999A (en) | 1999-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2330846A1 (en) | Dynamic allocation of packet data channels | |
| US5570411A (en) | Call priority in a mobile radiotelephone system | |
| US6137787A (en) | Method and apparatus for resource assignment in a wireless communication system | |
| EP1212903B1 (en) | Channel allocation and release for packet data services | |
| KR100275219B1 (en) | Communication channel selection in cellular radio communication systems | |
| US6418317B1 (en) | Method and system for managing frequencies allocated to a base station | |
| US6996412B2 (en) | Efficient resource management for packet data services | |
| JP2586316B2 (en) | Sector configuration mobile communication system | |
| KR100237569B1 (en) | The sound/data duplex service method for improving an utilization coefficient of vocoder | |
| CA2330845A1 (en) | Allocation of channels for packet data services | |
| EP0949834A2 (en) | System and method for handoff control and storage medium therefor | |
| CA2447255A1 (en) | Dynamic channel quality measurement procedure for adaptive modulation and coding techniques | |
| US20090161539A1 (en) | Signal transmission method and base station in mobile communication | |
| CN101347020A (en) | Communication control system, wireless communication terminal and communication control method | |
| CN1981460A (en) | Channel allocation method for asynchronous mobile communication system | |
| KR20010082663A (en) | Mobile radio telecommunication system with improved uplink resource allocation | |
| EP1119951B1 (en) | Increased cell packet switched traffic capacity | |
| CN111818586B (en) | User access method and access network equipment | |
| EP1733573A1 (en) | Method and apparatus for call setup | |
| US6496497B1 (en) | Method for managing walsh code channels in mobile communication system | |
| KR100663562B1 (en) | Method for sharing channel card in base station transceiver system | |
| GB2399991A (en) | Sharing resource access based on location classes | |
| KR100389029B1 (en) | Method for calculating power quantity required for permit controlling of a multimedia call | |
| KR100703381B1 (en) | Apparatus and method for service of packet data in a mobile communication system | |
| JP4510888B2 (en) | Resource distribution and signal routing method in a centralized base station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |