WO2002051176A1 - Method for transmitting data in a radio communication system comprising different units, base station system equipped for said purpose and radio communication system - Google Patents

Method for transmitting data in a radio communication system comprising different units, base station system equipped for said purpose and radio communication system

Info

Publication number
WO2002051176A1
WO2002051176A1 PCT/EP2001/014413 EP0114413W WO0251176A1 WO 2002051176 A1 WO2002051176 A1 WO 2002051176A1 EP 0114413 W EP0114413 W EP 0114413W WO 0251176 A1 WO0251176 A1 WO 0251176A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
φ
rt
tr
time slots
base station
Prior art date
Application number
PCT/EP2001/014413
Other languages
German (de)
French (fr)
Inventor
Arnulf Deinzer
Steffen Wagner
Carsten Ball
Original Assignee
Siemens Aktiengesellschaft
Priority date (The priority date 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 date listed.)
Filing date
Publication date

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00Network traffic or resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26Resource reservation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W92/00Interfaces specially adapted for wireless communication networks
    • H04W92/04Interfaces between hierarchically different network devices
    • H04W92/12Interfaces between hierarchically different network devices between access points and access point controllers

Abstract

A predetermined transmission capacity in the form of a number of time slots (ZS) is reserved for the base station (BTS') in order to transmit data between units, e.g. between a base station (BTS') and a base station controller (BSC') in a radio communication system via a transmission link (US). When a connection is being set up for voice or data transmission, one or more time slots (ZS) from the reserved transmission capacity are assigned to said connection by means of which the data is transmitted between the base station (BTS') and the base station controller (BSC'). The number of assigned time slots (ZS) depends on the service being transmitted via the connection. During the connection, the number of assigned time slots (ZS) can change dynamically if required. After the connection has been terminated, the assigned time slots (ZS) are freed and made available as part of the reserved transmission capacity.

Description

description

A method for data transmission in a different units comprehensive radio communication system and for eingerich- tetes base station system and radio communication system

Radio communication systems are used to transfer data with the aid of electromagnetic waves via a radio interface between a transmitting and a receiving radio station. An example of a radio communication system is the known GSM mobile radio network, in which is provided for transmitting a subscriber signal in each case a gene by a narrow-band frequency range and a time slot channel formed. Since a subscriber signal is separated into a channel in frequency and time of other subscriber signals, the receiving radio station can carry out a detection of the data of this subscriber signal. In recent wireless communication systems such as the UMTS system, each participant will furthermore distinguished by different Spreizcodes-.

A known GSM mobile telephone network, whose block diagram is shown in Figure 1, comprises a plurality of mobile switching centers MSC, which are interconnected or which provide access to a fixed network PSTN. Furthermore, these mobile switching centers MSC are connected to a respective base station controller BSC. In turn, each base station controller BSC makes a connection to at least one base station BTS and responsible for managing the radio resources of the connected base stations BTS before. Such a base station BTS is a radio station which can establish a communication link to mobile stations MS over a radio interface. For transmission of packet switched data, the base station controller BSC is further provided with a packet data service nodes (serving GPRS support note) SGSN connected, establishes access to a fixed data network PDN. ω realized an operation and maintenance center OMC L t to HH

LT1 o o .sigma..sub.i LΠ o LΠ

N tr Φ Q α P P> St. PA

≤ Φ P Φ P p PP = o φ P PH φ Φ Hi HP

P Φ rt

Q td <td P> HH

S Φ o J φ ü P Φ O tr H P. 03 li Holy Q. P-

TJ φ P tr P Φ

03 • tL above 03 P P u Φ 1

Ω 01 P Q> Φ

P = S 3 rt P tr φ P. PP P) PP • xi P) P

Φ CO tr rt P LQ P '! P

H. rt Ü P LQ PO r H Φ 0 NXP 2! p, Φ t PNPX P>

P) Ω Φ o ^ 3 H,

LQ t cd P- 3 rt α

Φ φ * u m 03 td 3 P P

P o π Ω P P P φ

P 3 tr LQ PP

-S 3 to φ Φ 03 P »T j CQ

Φ it. i PP)? P Hi r. Φ "~ -. Hi r) PP

P- P- ω 0 PN rt P

Φ P o Φ P rt X

P Φ LQ 1 h X 0 P- rt tr 1 rt P- f OPO 3 cd φ CQ P P- PO α Φ 3 03 P J> P to

P> P rt 3 ω φ ^ Φ tr rt P P P P P 03

PP Φ Ω rt rt 01

P- P LQ CO 01 X φ j: Hi

IQ S rt P) 3 P = rt

-S f P) P Φ l φ rt CO P P P

H. P = - •; P P P = Q

P ^ tr • 01 O tr Φ J φ φ φ P rt 01 01

P ö Φ 01 P. φ J 3 01 rt H, S> Q. tr rt fi 0

P P P = Φ Φ PJ co tr

Φ Φ P tr P LQ r P

Φ tr H, P 1 ü 03 tr P p. JP Hi) Φ PJ Ω P li XP rt HP tr P - P rt

Φ P Φ LQ P

P φ Φ H P P P

P "≤ td P Φ

P rt φ CO P rt

P P Ω Q. 03 N tr Φ 03 Φ rt tsi P- 03 φ P 3 tr

Φ 03 Φ P PJ N

P 03 P = PPP -3 rt N P tr Ω

1 P Ω Φ tr ii tr

te formed with 160 up to 1300 bits. As stated above, the transmission capacity is, however, each 16 kbps sub-time slots is limited to 320 bits, so that, for GPRS and EDGE only the coding with the lowest data rate, such as CS1, CS2, MCS1 and MCS2 are supported with today's technology NEN koen-. New circuit-switched packet services such as ECSD with transmission rates of up to 56kbps / 64kbps per time slot on the air interface require bigger UE bertragungskapazitaet than 320bit / 20ms.

The invention is therefore based on the problem of specifying a method for data transmission in a different units comprising wireless communication system that supports the transmission of larger amounts of data per channel on the air interface. In addition to a base station system and a

A radio communication system are given in which runs the process.

This problem is solved by a method according to claim 1, and a base station system according to claim 30 and a

A radio communication system according to claim 32. Further embodiments of the invention will be apparent from the dependent claims,

The data transfer between two units of a radiocommunications nikationssystems via a transmission path on which to connect a predetermined transmission capacity in the form of a set of time slots is reserved. When you connect on the air interface for Sprachbzw. Data transmission can be a compound or the assigned several time slots from the reserved transmission capacity, via which the data transmission between the units.

Thus, it is now possible to a channel on the air pattern pieces all total assign to N parallel time slots 20ms nx 320bit, which means that, for example, a data packet of 1300bit to 4 or 5 time slots is distributed and will wear at the same time.

The procedure is for data transfer see both be- a base station and a base station controller as applicable between a base station controller and a transcoder (transcoding and rate adaptation unit TRAU) or between a transcoder (transcoding and rate adaptation unit TRAU) and a mobile switching center bar , Base station, base station controller transcoder (transcoding and rate adaptation unit TRAU) relationship as mobile switching center represent different units of the radio communication system in this case.

If during the connection, for example due to a data rate adjustment (Link Adaptation) to changing conditions on the air interface more or less Ü bertragungskapazitaet needed, additional time slots from the reserved transmission capacity can be unlocked taken or in unnecessary time slots in the reserved

Transmission capacity are released again. After completion of the connection of the connection assigned time slots saemtliehe released and are available as part of the reserved transmission capacity for other connections.

The release of unused time slots is effected, for example, time-controlled using two timers. The first timer controls the release with the rate adaptation (Link Adapta- tion). This release should be adjusted slowly to allow the connection with improving radio conditions again has additional capacity is available quickly without have to request it again only. The second timer controls the release after completion of the connection. To react very quickly. If necessary requirement of Ü bertragungskapazitaet with other compounds, the time slots can be released immediately. LO ω t to HH

LΠ o LΠ o o LΠ LΠ

φ P tr Ω LQ CQ 01 01 α Pi Pi rt <ε 01 Pi P. 3 03 03 01 PJ NUX rsi & Pi <tr P φ ü Ö trj JP J * ö Ω 0 P) Φ PO H 0 rt Φ P- φ 0 φ tr φ P) PJ Ω P φ P φ P- P-

3 P:> P 1 P) P- tr rt ≤ u H 3 li Hi PJ Φ Φ H £ P ii. P tr tr rt P 1 PHP φ

P LQ P tr 1 rt P φ P P φ Ω N N LQ 0 'CQ P <! rt Φ P- φ P): P tr LQ Pi rt Φ φ td PH P- φ PP * P <P Φ rt li α = Φ φ P- P- P- E 03 03 P rt Φ rt PP N 03 N Φ oi rt LQ LQ LQ Φ P Pi - tr P 0 P φ Ω Ω PPP% *

Φ Φ Φ P s 1 S rt s> & Φ 03 03 ii Φ Φ φ tr tr ii PP Pi tr r α - & LQ φ

P P P P φ 01 φ Hi ≤ tr 3 $ i 03 tsi P φ rt P): Φ Φ P P P CQ CQ ii rt rt φ P to P rt Φ u P = Φ P - φ φ P 0 rt φ φ PS P P u φ i j be P rt 03

P Φ Ω φ φ Φ CQ rt P- tr P P P- ti li P "2 ii Φ rt LQ <i tr O LQ rt li

P - CQ, -. £! Φ P "ü ü LQ Pi 03 P. 03 LQ Pi P) P r) P P ISI rr φ Φ P- tsi s> 03 ii P) φ π N. P 1 P PJ rr Φ P Φ Φ Φ P) IQ φ • PH LQ φ ii PP φ φ 03 φ LQ

2! P P Φ φ φ P. rt LQ - PPP • 03 PP LQ Pi Pi Φ tr Pi - * P li P rt Ω

Φ P Ω 3 01 P P ≤ LQ s: 03 P φ <! P P P rr ii XP

QJ LQ rt Ω rt φ p 01 PP 2 03 03 P- P- Φ LQ <P tr P) o φ PPX 01 tr LQ Φ Φ 1

Φ Φ 03 Φ P - φ * P- P- LQ PJ u 0 i H td 03 Φ Hi O tr 3 Pi P LQ Ω P- Ω 0 = P CQ

H Ω 01 φ P- LQ Φ Φ Pi P Hi P. H- 1 H 1 03 rt P) P 01 P tr PW 01

Φ 3 * 01 Q 3 P Φ tr r 0 Hl P Pi Φ Φ P. N $ P 01 P P rt Φ Φ

KSP 1 Φ • ö N p. 2 tr tr - Pi Φ Ω P- P- PP u Φ Φ rt φ N LQ PP 3 K

O P Q td li hi s "P Hi Φ Φ Φ J MX Φ P Φ Φ LQ P 3 P) 03 li P rr Ω Holy Φ

P tr rt P PJ P O P P P P P u Ω P 03 P rt rt - 01 Φ MOPJ Ω

03 P- PJ ii N 3 P P ü φ 1 φ 3 rt rt PXP Φ ω = P rt Ω Φ 3 3 03 X rt P Φ 1 01 PO IQ Q> p. LQ P3 α LQ Φ P ö <! Φ 3 03 - Ω tr li XP)

Φ CQ rt Ω tr Φ s: rt Φ> P- P- S 1 LQ s! P 0 P "φ Pi Φ Φ tr P PA Φ

03 CQ rt Φ PPP) p- ~ P 3 rr φ Φ Φ φ Φ N tö PP 1 li φ Ω Φ P PPP) PXJ P- - * 1 P Φ α HP Hl LQ PP li Φ ≤ P P P P 'i X P P P P tr)

, -. rt H, Φ CQ J rt <tr Φ Φ P 01 P P P 03 03 Pi Pi rr Φ φ Ω Φ P

Iτj P P. ii) rr tsj N Φ OJ rt rr Pi Φ P Φ 03 φ φ rt N P Φ P P P> PJ HP

P) 0 H. P 1 P> PPPPSP Φ φ - Ω PP P Φ 3 Φ Φ Φ P P P P rt rt rt PP Φ 03 LQ. 0 P- 03 tr LQ LQ P ^ PPJ Hl P- P- Pi 03 υi tr PJ P- Ω 3 li φ i tr Pi Pi rt Φ φ P- WP <<Φ P Φ φ 0 tr tr P 1)

PPP * P> O P P P φ Φ Φ Φ 0 rt PP li P> Φ Φ u Ω PPP P Φ tr o PPPPP Hi 01 <u H • PH Φ LQ P) P tr p. * H tr P Ω 03 φ ii

03 P. Φ Ω Hi 01 φ 03 03 P Φ Pi PX Φ tr <rt Φ O tr o P-

01 P- tr rt PJ CQ rt rt i td <= PP P Φ P Φ 03 03 1 P P P Φ 01 Φ 03 rt P Pi

* - 'P-.PPP) tr P> J Φ φ Φ tr P P P- li p- Ω P l P P- φ Φ i li 3

Φ S p. 01 P Q. P- 01 P- Φ rt li P 03 Φ Ω i ii ^ 3 Pi tr φ ü 03 P li Φ Φ Φ

P- P- P- ii - Hi P- P- P- 3 tr PH • o td P P J 03 Φ P P Ω <! P li tr he φ φ ti O & Φ. 01 O P- P- φ Ω Φ 3 P) PPO pr tr P- rt to Φ p.

03 td P * Q P HP CQ PPH Pi P Pi P P Hi LQ Pi PJ 0 = P φ P Φ Φ

P) PJ = td tö P P rt P P- φ Φ LQ H φ P St PP ii i ii li Ω CQ J P 3 Φ PJ LQ PP Pi φ Φ P Φ Φ P. X P = P rt P Pi rt 3 P> Φ J P LQ α Tt Φ li 01 rt <! P Φ IO P- P. 03 P. O tr in. P Φ φ P rt

P. 01 P- P- P- Hi 3 P) P O LQ HP rt rt Φ Φ Φ Φ 3 P P P Hi cn> υ

P- 01 LQ Φ P) P 03 POP φ P) Φ Φ P Φ 3 HNP 1 Ω QO rt P P P P tr J 03 PP li LQ P φ?PP) tr

0 r P 01 LQ 03 Hi P Φ MP PA M rt rt Φ P PP 1 Φ tr P rt Φ ^

03 J Φ L Φ Φ W 03 03

P rt P & S CQ - ~ PJ Φ PPP P rt N o rt • 0 φ PJ Φ PPP li 03 -> P Q P rt N o rt Hi φ P Pi Φ P "P" < P PJ ii P- LQ M ≤ 3 rt rt CQ P 1 t

POJ Φ 3 "Ω P i rt Φ i ii 1SJ φ P td Φ P St. φ Ό HH P- P- JJP Q. tr -> Ω O Hi N co P PO P i Ω P- 3 φ) P 'P) φ rt Ω

Φ P "Q Φ P r 1 Φ P Ω rt 3 St. <rt P> P 'Pi P Φ 01 01 P ■; LQ Ω Φ tr P-

CQ CQ 03 li Q J - CQ P u tr Φ LQ Φ P): 03 Φ φ tr P φ φ 01 03 03 PP

0 P. rt P CQ tr St. P i P): P co li rt 03 P H. Φ P φ P P Φ <tr tr Ω S td Φ P> Φ φ φ rt rt rt P = φ St. P. P ö Φ PJ LQ P Φ Φ P 'φ P PH, Φ td P 1 HN tr r H. P = P) Hi tsi r P P t_r PJ 03 p, P Φ

1 φ rt HP 1 P P φ φ <! LQ Φ Φ p = PP "X tr tr

Hl NX o li Pi P P 03 li P P Hi P- H ii P 03 P- PJ P) P- P-

P. Φ φ P i 01 rr LQ P 1 P 1 Ω Φ P 01 Φ φ 1 Ό PP l 1 1 Φ rt Φ Φ rr LQ Φ 1 1 1 PJ PH

03 1 1

LO U) to to HP "

LΠ o LΠ o o σι LΠ

N Pi tsi P P. tsi ^ td tr 01 K NP <! tr 3 P- Pi α S Pi Pi Pi he tsi O LQ 2 i Ω 01 φ Φ Φ i Φ φ φ Ω P)) 03 PO Φ P- Φ Φ P- P- 0 Φ J PP P) Φ P Φ 0 P rt Φ 0 Φ H

P 1 H 01 3 P- P- tr H P £ LQ P PP P tr φ rr ii ii ü P P CQ LQ ii φ P P tr P P- li

P rt rt d * PP "Pi • P 1 φ i H ^ 1 ^ P Ω Φ φ 01 tsi Hi P φ PP 3

Φ si P H IS! P Φ P rt P PP Φ tr <! m P- tr s: P P> CQ 3 P 1 N Pi 3

P Φ Φ P = PP ii co rt φ ^ i PP PPP φ P- Φ P Pi P- LQ φ P 1 rt rt Φ Hl

P P P Hi Hi IS. P- rt P LQ tsi LQ Φ P- P P- P- IQ pp P 1 P φ CQ P i • tsi rsi rt O rt o P- LQ LQ Φ rr φ φ rt N 3 03 CQ Hi Pi Φ Ω φ 03 £. 01 ^ Φ φ φ PP 1 CQ ii li 01 3 P P- rt Φ PH φ • d Ω Φ Φ Φ P- P- P Φ .phi li p-P) 3 P- Ω P- 3 rt rt PJ P- Φ P φ tr P * ii ii NPP rt P- tr P rt rt rt P LQ P> Ω P "P) rt CQ 3 M s Pi P- φ P- P- P 3 P = φ 03 φ φ Pi tr td hl

CQ Φ rt rt Φ P- p- P 1 Ω ti P- φ φ φ φ P P = P- LQ td ≤ Φ φ 01 φ P- P

Ω P- P- P- φ 01 Pi 01 'to Φ P 01 P 03 H 03 LQ Pi φ rt φ P- P- P Φ rt Pi tr ii PO r 0 Φ P- P- P PJ PJ 1 01 Φ • d P φ 03 O 01 PP, ZP P PP P-- Hi P-

HPP ö NP <! ii Φ P p rt Ω Φ 'P P P P ≥! Φ P Ω tr Pi Φ φ Hl rt Φ Ω Φ φ

P- Pi PJ P. O rt 3 03 3 tT φ LQ Ω φ PP Pi t Φ φ tr ii li 01 rr rr Φ P = N ii WP tsi φ Ω tr Φ P "tr P 3 - P PP P P s Pi 3 φ 01 P

N P> li Φ tr P rt P tr Φ 1 PP ii 03 Φ Pi 3 Φ P rt Φ 01 Φ Φ PP

Φ PP "P φ Φ Φ LQ NOP 03 £ Φ N Φ 03 rt rt Φ P 01 N H 4 Ω P s:

Pi P) P> li = P P P P P P P tr rt Φ Φ t li 0 NP pi rr) CQ LQ tr Φ

P Φ PP rr tr P rt Φ rr Φ PA P) P Φ P PP P P P Φ • tr P "rt P-

Pi tr 0 tr Φ i 01 pi ii ii ti P) rt 03 <P- rt Φ Pi P »3 Φ Φ P- ii P- M 03 01

Ω Φ rt HP) li P) rt) Φ Φ s P P P Φ 0 "03 ü φ Ω Φ P rt P LQ 0 φ ii Pi LQ rt Hi Φ Φ W td P) 0 ii Φ Ω P li Pi Pi rt 3 "ti P rt Pi Φ P Φ S et ii rt .omega. P LQ P 1 i tsi PJ P" P Pi rt P 3 "PP Φ P- LQ PN Φ rt LQ • P-.

Φ P PPJ - rt P) St. PP 03 Φ Φ Φ Hi P 1 LQ li Φ Φ Φ P Φ Φ φ φ P.

3 P- Φ LQ PP ≥i • li Hi P- P- O P- tr rr PP 3 PP p- • xj ii

Φ rt Φ LQ Φ P PP PP Pi Hi 03 P 1 P rt Φ H, Φ Φ 3 rr Φ φ P tr Pi Pi Pi Φ 3 03 PP ü φ P rt Ω * • N N LQ 03 Φ P- P- Φ 03 Φ t? PH PJ Φ

P, 03 P) α - 3 O p, P rt Φ Φ P i j be Φ Φ rt P- Ω 03 PH PP CQ P a.

Φ Φ tr P> Pi φ H Φ P φ P "rt LQ t Pi φ Φ Φ Φ Φ tr rt P-

N P- P- Φ PJ rr H LQ tsi P X 03 P> CO P) tsi 03 Φ tr • φ H ii N li Pi li cn PJ

PP rt φ Φ PP • P * - • rt Φ P 03 P 03 P φ <! ii P- P rt P- P

Φ Φ P 03 P 01 P P Pi LQ Hi f τ 03 IQ LQ P- α rt rt tr LQ LQ Ω H

P rt ti 01 CQ Pi Φ Φ P Hi P) 03 3 Φ Φ P) • N Φ P) P) P φ tr

P ö Φ tr Φ Pi φ φ S P ii Φ X tr 0 Φ P <! H li Pi Φ LQ P S P>) P- Φ Φ P- Φ LQ J li P Φ u 3 "Φ φ φ rt tr P i PP α - • P- PP) PP" ö

P rt P P rt P- Φ 3 li PP) c.P) rt P rt rt Φ P- P f Hl, P- φ P tr = pι

Pi Φ Φ CQ CQ Φ tr 3 Pi P Pi P- P PJ Φ Pi CQ LQ PP tr ohms P) t φ π Φ Pi Ω Φ PP PP P- tr φ P> LQ Φ Φ Ω P: Pi 3 "03 P Φ P) P PJ ä» d

P. rt rt P 01 PP ^ φ φ P TSJ P rt rt φ u H "H cj = P Φ Φ Φ Ω PP P Hi

PP rr 01 φ P * P φ P H Φ 3 Φ rt φ Hi tr P -: Φ PP tr 03 P

03 0 St. • P- P- P- 01 tr rr PPP Φ Φ Φ li LQ P 3 Φ P P. LQ Ω P

^ P) P- N rt rt P> rt CQ S ü Pi XP 1 P i P ii P- P- LQ 3-

P - Ω td P Φ NP 03 P rr J P PJ rt rt 3 rr M Pi 3 P ti LQ P CSS

Ω P 'P- P- Φ Pi * d Ω φ LQ φ P P- TJ σ 0 = ii P 3 φ φ Φ φ <tr Φ Φ P Hl tö rr rt tr P i P Φ P PJ Φ O P) LQ CQ P) IQ ii φ φ P 3 Φ St. ü PJ 03 φ Φ -> 03 03 P 1 P Φ 01 Φ φ P 1 H. rt P "φ LQ Φ P> ii rt 0 W li Hi

0 P 1 N P> t_j.P) P- LQ ii P- φ P Φ P- P- P P- -S 3 <01 P Pi P- P "Φ

P ≥! Pi P LQ Φ Pi Φ rr 01 Φ 03 P X P Φ Ω P- PP 0 = φ Φ Ω P) 01 P) X

P- 03 P> φ LQ φ φ Ω -3 tsi Hi φ XN 3 H rt tr LQ LQ φ ii li 3 "3 i rt rt Φ

01 Ω Φ ii li ^ 3 P. 3 "P) Φ Φ S - X 03 03 1 P P tr P PJ Φ O Φ 1

P- Pi Pi ^ PJ PJ P-) φ li * d P 1) P tr P- Φ 0 = X P P P P P P 1 p, rt φ P- Φ ii li P P H P tsi - P) PP PJ φ Pi P P> P Ω LQ P rt P P PP) ii φ φ rt Hi 01 01 Ω φ φ CQ NN Hi PA ri PP • d tr Pi M LQ <! PP Φ rt LQ P- P- 3 * P Φ P- PP> φ φ φ PJ rt £ Φ Φ 03 SP Hl φ φ Φ LQ rt P- Φ Φ P- rt P. 01 Pi P> i PN φ - P PP li P <

03 P P P P Φ Φ Ω P) P P) P- P- P- P. u LQ LQ Φ Φ P

PP Φ φ P P- rt 'Φ Φ Φ Φ PP Φ rt & P) 03 P

P Φ P rt rr fi P PJ: P

P rr

should. Even when reestablish a connection all the assigned time slots are synchronized naechst to-. Only then is the actual data transmission. Loses during the operation, a time slot synchronicity its overall genueber remaining time slots, it will be re-synchronized. The service is interrupted or allowed to continue on the remaining time slots with lower quality. Even with the rate adaptation of a service the additional time slots are synchronized once before rate matching is performed.

According to one embodiment of the invention, a compound to be assigned a lower number of time slots, if the reserved transmission capacity, the number of requested time slots is not available. This approach has the advantage that in the event that no more time slots are available in the reserved transmission capacity sufficiently available, a connection can still be established or maintained. The transmitted via this connection service is then lower performance (quality of service) is available. There are existing connections of lower priority than the neuaufzubauende service in the cell, it is within the scope of the invention, the time slots of the existing low-priority connections in favor of the new service release (so-called service Downgra- de). Alternatively, low-priority connections in neighboring cells are shifted (handover, cell reselection). This possibility also exists for the new service if less performance is not tolerated, and there are no other connections to the downgrade in the cell.

during the connection, preferably, the number of allocated time slots of a compound is dynamically adapted to the requirements of the connection. The requirements on the connection may be by an adaptation of the service, for example by changing the coding scheme (Link Adaptation) or by a movement of the mobile station by the LO to to LO HH

LΠ o LΠ o LΠ O LΠ

use while in the actual cell's light traffic.

Furthermore, it is appropriate subsets of reserved transmission capacity for different services, transmission paths and / or transfer methods to reserve and also to define "soft" sleepers / barriers. Thus, the utilization of the transmission path for the different users and services is equally assured. Different transmission paths comprise both the transmission through different base stations, and the transmission over different carrier frequencies one and the same base station. the transmission can be both in the time multiplex Plex as done lexverfahren in frequency division or Spreizcodemultip-. different transfer methods include both the transmission of voice data as well as packet data according to different protocols, in particular the frame relay protocol and the Internet protocol. the different services include, in particular voice, data and / or Sig tionalisation.

Should the transmission over a unit z. B. a base station, a service, a transmission path or a transfer method are preferred, it is within the scope of the inven- tion to provide the corresponding subset in a predetermined minimum size or ization due to a suitable Prio- ensure that, in case of conflict, low-priority services, Üebrtragungswege or transfer methods to release the corresponding capacity.

In a network in which the proportions of the compounds on the individual base stations, services, transmission paths and / or transmission methods vary greatly, it is advantageous to change the size of the subsets of the reserved transmission capacity depending on the amount of connections of each type dynamic. If the size of the subsets such that the sum of the subsets is less than the total reserved transmission capacity is achieved that even if a kind of the compounds has exhausted the reserved for them subset of the transmission capacity, still Compounds of this type can be constructed , wherein use is made of the excess of the reserved transmission capacity.

It is within the scope of the invention tragungsweg a service, an excess or to assign a higher priority to a transmission method. When establishing a connection, the requirements of compounds for the service transmission or the transfer method to be met with the increased priority in this case initially. Then the requirements are approximations of connections for services, transmission paths or transmission methods processed without increased priority. New connections with higher priority effect preferably always the downgrade or the deceleration (Queuing) or the handover / cell reselection low-priority connections, if available to the torque capacity is not sufficient.

In a base station system having a base station and a base station controller a capacity allocation unit is preferably used in the base station controller, which controls the flow of the method and attempts to optimally satisfy all the Quality of Service requirements.

Occupies a base station does not bertragungskapazitaet the entire allocated UE, the remaining Capacity is for internal data exchange between base station and base station controller at your disposal, such as data transmission for signaling, measuring and software download.

Embodiments of the invention will become apparent from the figures. Figure 1 shows a prior art radio communication system

Figure 2 shows a radio communication system in which a base station controller controls three base stations and the data transmission is effected by the inventive method between the base station controller and the base stations.

Figure 3 shows a radio communication system in which a base station controller controls a base station and wherein the data transmission between the base station controller and the base station is carried out according to the inventive method.

A base station controller BSC controls Λ three base stations BTS (see Figure 2). The base station controller BSC λ is connected to each of the base stations BTS via transmission routes X US. The transmission paths are as US PCM24 / 30- lines formed. Each of the base stations BTS is λ two PCM24 / 30 lines with the US Basisstationssteue- tion BSC Λ connected. On the PCM24 / 30 lines transmission over 16kbps timeslots ZS done.

Each of the base stations BTS comprises a central control unit (core unit) GORE. In addition, each of the base stations BTS comprises λ carrier units (carrier unit) CU, which operate in different frequency windows. The outputs of the carrier units CU of one and the same base station BTS X are connected to a combiner (combiner) C, in which the signals of the different carrier units CU are given to an antenna A. Via the antenna A mobile stations MS are supplied with signals λ.

The base station controller BSC λ is the one hand connected via a rate adaptation unit TRAU and a mobile switching center MSC Λ with a fixed network PSTN λ. On the other hand, the base station controller BST is a packet data service node co LO t to HH

LΠ O LΠ o LΠ O in

i iti = P. 03 tr * m 01 he Φ J Pi tr NI 03 to φ H PI 03 <J Hi rt NHH 01 TJ _ φ P φ φ Φ tr rt Φ Φ N P O P φ φ Φ φ Ω PP) P PP Ω φ P φ PP) PJ P φ P φ 53 PP) P P • 01 PP ii PP P. P rt tr ii φ LQ rt rt P {φ? α li 03 HP ≥: rt Φ H φ rt rt 01 3 1 td tr rt Φ P- P- LQ r tr Pi Φ tr P- 3 Φ 53 Φ LQ φ ii ii

Ω <03 rt P P P 3 P • rr p. Φ xo P 03 01 3 0 Φ Φ φ φ H P H P Hi - 03 <!

TJ φ Ω φ 1 HP OP φ P Φ _l. P P)) Ω φ H PJ P HP P rt rt φ P = p) Φ P <! P to H tr PJ CQ ti P P LQ co rt P φ r CQ LQ - P td rt rt • Φ tr PP "P P P Φ co tr LQ LQ 03 Φ J PP 1 53 P- PP P 1 P 1 t tö rt P- φ Ω φ W li P φ LQ H

P P P ii <03 P φ φ ü O 3 TJ 01 P P P tr> φ o TJ P> TJ Ω rt S CQ he rt = tr P 3 "x

Ω P 'rr P φ Φ rt P> P φ P TJ 01 LQ rt φ φ Ω 03 P 03 li tr Ω. rt φ P 2 Ω co Q> N LQ CQ Φ Ω Φ ii PM N rt P- P- P Ω α P- O Φ Φ Φ CQ 00 P P TJ OP

1 P Φ 01 φ tr P tr P tö φ LQ 01 5 J Pi Φ rt LQ 03 X 03 P rt £ TJ li σ P rt tr P i t

HP tr ii P Φ Φ Φ ii φ φ P rt 03 Φ Φ <03 O ö φ tr LQ P Φ CQ

^ LQ tsi P) JP ii P rt - P tö ii Φ P- p.P) r td rt 0 rt tr J PJ TJ li Pi P 01 p] P 1 P

Ω CQ J P P P P P 3 Φ St. OP TJ P) Φ <li P) 0 ii rt Φ PP 03 <! trj <! CQ

CO P = J φ PP P ö ö co tr PP St r P 0 LQ rr P "0 Φ P Pi Φ Φ [> Φ P l tr P tsi HP LQ> h-> P) - φ Φ Φ Φ P) tsi P- P- Φ 1 li r P l tsi ü ii TJ t Φ P- rt LQ P 03 Φ rr - ii P- P- P rt P) rt P 0 LQ 03 TJ OO td Φ 3 3 TJ fi r rt Φ Φ CQ tö Hl P Φ 3 3 P P φ Φ Pi p Hl P) 53 Ω P- P- 53 P- O

TJ rt PJ P Φ CO he P ^ J TJ Φ 2 tö PP 1 03 53 LQ 03 Φ p o P ^ CQ φ φ rt r rr li

PJ ii P> rt Ω P- P) 01 li P φ P. Φ 2 03 Φ Φ Φ 03 Φ Φ α li ü 03 rt rt rr i t P> tr P- O φ P. PP P <Co <P ) H rt it P rr p j H rt Ω Φ i

Φ LQ tr Φ N 1 Ω u p j LQ O - OP Φ Pi Φ - Φ Φ Pi 3 Φ tr tö 1 P Φ rr Φ P PP) = PP P Φ ^ Φ P] li P 01 Φ TJ P) P Φ PP P> P Ω P> P PP 1 rt PPO i P 3 OP LQ P- 01 H 5 LQ 01 LQ Ω Φ P Φ P- φ 03 TJ rt rt P- rt LQ

PJ LQ φ 3 P Pi Pi Pi Φ P) = φ <Φ rt φ 2 i ii li • PH tö P- Φ rt P> rt P- Φ CQ rt 03 -3 P 53 Φ Φ Φ P> H LQ P - O LQ Φ Φ 1 3 PP 03 N CQ Φ P P P TJ ti 03 -

Φ Φ LQ P P li li tr Φ <φ 01 P PH Φ tr 1 Φ P Ω Pi P 03 P - Pi Ω Φ l rt

PH φ LQ P Φ p "i φ tr Φ φ P LQ LQ i Φ rt 3 P- 01 tr - P 1) PJ CQ Q φ 3 P <P φ φ P>

Q> <! CN Φ u xo P rt = 0 ii P> td φ cn Ω Ω rt to ö o Φ φ Φ Φ Φ u P Hi Φ 3 rt P) rt xo Tl td rt xo Ω PPP "Pi? Tr P CQ tr PPP Pi tr li HP) PP rt P- φ • 01 Pi P φ tn P. CQ P- φ TJ CQ φ tr φ i ≥ O! φ • φ H tr P tr φ Ω P- Ω r PP φ O P- rt X tö P- p. JP) P

P. 01 Pi H Pi P- φ 01 φ ii Hl 01 1? H 01 LQ li - -. φ - 03 P CQ rt 03 rr rt O φ α li Φ P P- P- P Ω Φ Φ 01 03 JP P> P td φ 2 3 p. P "li P p, Φ ii PP Pi rt tr φ φ rt P LQ PP TJ P- P- tr CQ O he» P P> P cn P- TSJ

P> P "φ Φ PP P P P P li> Φ CQ rt P) 03 rt rt tr φ tsi LQ CQ Φ Ω r

LQ. 03 tsi xo P rt Ω P P r Φ rt <! 03 r 03 tr rt φ P "53 Φ r CQ P- P- ^ -. * *> Φ ps Φ φ P> LQ Φ α Φ rt H li P OP) J Φ PPJ <CQ rt Ω Φ

P co rt P- ii li 03 ö NP) OH 3 Φ rt Φ φ li Hl ω φ CQ CQ P P- 03

0 tsi <rr P tsi 01 p OO Φ LQ LQ PA P rr P Φ <! Li P H Ω rr Ω CQ li 2 PP

53 P 1 Pi PJ P- 01 03 53 Ω Φ P. Pi PPP) 03 Φ Φ P Ω φ PP P> Ω td tsi 3 PJ tr Pi Φ

P- Φ Φ φ Ω 03 tr P Φ Φ PJ 03 03 P Φ tr Φ P 3 ii trj CQ φ rr P- Hi 3 P 1 P φ li <i tr P- rt 03 t JHH tsi LQ P) rt Φ Φ 3 Φ LQ 5 P- P- P- P rr Pi i P rt P) Ω φ Φ co 01 tsi Φ 3 "<PA P P TJ 2J rt rt rt O -> P α

Ö Φ Pi φ tr P- rt Pi P- PJ P- X 3 P Φ Φ P> Pi rt P> tö ii PMP 01 Φ 1 Φ P>

P co PJ φ P rt rt P Φ P Φ HP) rt rt Φ ii J X CΩ Φ P -3 Ω P 1 03 Φ 1 rt

- TJ rr li NOP P- 01 O - Φ J): ü Hi P) Pi Φ φ Ω P 1 P) φ tr rt 03 P li t Φ Φ Φ ii P tr Ω Ω i 01 P) rt P φ PPN " rt - P> P i Ω 1 φ rt P) P) P

01 p) PN Φ i tr P "Φ φ ti co P P P φ 3 rr Pi P Pi P tr φ ^ - .. rt r o Hi Ω - P tsa P φ Φ TJ HH PN LQ ! P rt CQ CQ φ φ JN rt σ P Hi φ Φ Φ tr LQ co ii P P ii Φ <rt P Φ tr fo r P P -! PP tsi) Φ PP 03

P- Pi Pi φ rr O tö p- PJ: rt tö P) rt 0 Φ P LQ φ r ii Φ P) rt

01 p) 53 P- PJ TJ H tö N Pi Φ rt Φ CO Pi Pi ü 03 α P Φ rt P Φ JP ii tr φ rt r PP PP CO PJ Ω Φ CQ Φ p, Φ P- Ω P- tsi P PJ 03 Hi m Φ PJ PP P> J Φ

Φ φ 03-01 2 Φ u rt P - Φ Φ PP rr rt rt = P 2 H Λ tsi Pi LQ tr H 1 P>

PP Φ = 03 to P- Φ - PP r li Φ Φ p- Φ 1 P P- PJ Hl 03 N

P r Φ Pi 53 01 Φ> P <! td PN = Φ 1 0 PPH rt LQ Φ tö 1 1

P 0 P φ 1 φ φ P P- PJ P- Φ 1 P 53 LQ P-. 1 Φ P CQ Hi

1 ii ii ii Φ ω Φ Ω O 1 1 CQ P- φ 01 Pi li 1

P oi Φ 1 P 1 P 1 1

LO LO to to HH

Lπ o LΠ o LΠ O LΠ

2 Ω LQ P td Φ H 3 W r CQ Φ 03 O Pi td tsi tr Pi Φ P- LQ LQ 53 X ii WN Pi <Pi Φ Φ PJ N co P- P .alpha. Φ Φ Φ Φ rt P- φ ii HP φ Φ P) Φ P Φ P P P Φ Φ P P P Φ φ) Φ

H p, tr 03 PP rt li Φ Φ φ St. P. 03 ii PPP li O φ rt P φ LQ PH li rt P-

Φ Φ φ P Pi Pi P <! P- P P- P Φ Hi P Pi Pi li ü Hl 2 LQ φ 3 Φ rt he ii

P = P- P- P- Φ TJ P 03 P) P. P- P Φ TJ P Φ rt P Φ 1 Φ Pi 03 O P- P- tr 0 P P P 03 03 03 He PPP rt Φ φ p ti P). P tsi P Pi Φ Φ P Ω ii li he tö P Φ rt Ω φ li

Φ tr rt Φ rt P Φ P φ Φ ii Φ φ P t φ) P- rt P- Φ 3 P P- ^ CQ P- Pi Pi rt Φ tr li ii φ P- P) tr 3 rt P α P ö - P r P φ rt Φ rt P 03 PPP 1 Ω Φ PP PP PP 1 i rt tr J Pi P) rt rt LQ Φ 03 φ 03 P - 3 03 - 53 • P Φ <P P-

Φ Φ rt φ P- P- rt Pi o tsi rr 03 tr P- P- P) P- rt LQ Φ P- rt rt rt Φ

P- Φ ii ü O 3 53 Φ Φ Φ P- .-. xo P> P ISI LQ 53 t Ω LQ tr 03 PJ Φ H • p. Φ 03 tsi

P p) PP 3 PPP φ φ Ω CO Ω rt 53 Φ PP) P "P Φ 53 rt rt P- tr tr Pi

Φ ii tsi 03 P P <03 O i Ω Φ tr rt H O P- P- - P- P Φ P- 3 ö "tsi rr -.. Φ 03 rt P O rr P- Pi Φ Pi Φ PA HPP HO Φ P- tr PP) = 0 co tr "Ω P rt P- Φ P PJ Φ Φ 1 tv 03 P- P- 03 tsi PP π td Pi P Φ 3 Pi rt p-

P Φ P) rt Φ XPPPP TJ 03 r PP Pi Pi P) Φ 03 P "φ CQ PP Φ φ <!

Hi P ii ii PJ 3 O 03 P) PO Φ 03 P P P Φ Φ Φ 2 Ω <! PPP, O rt P p. P> Φ φ rt rt rr tsi PPP φ P): P Φ TJ <H P P CQ 3 "φ i LQ Pi φ P

03 LQ P- ii P- Φ Φ P- P- PP Pi Φ rt P- PP> Φ Φ LQ PP - P) = φ ii PP

Ω Φ φ Φ P 0 03 P rt rt Φ p. P ti Ω TJ 03 p. φ Φ H rt tr H φ Φ H tr ii P. PPP Hi tsi P) = - - ii Φ Φ P 1 P 'P 03 he tsi i 0 = <j M P P P PA cn

P p LQ 03 P =. -. Φ rt P P- rt ti P- PP PP) LQ W 0 PP si P 01 O tr

P Ω P td 03 tr 03 P 03 Ω Ω P XPP tr td Φ Φ PP P P φ rt rt tr tr P P P Troubles' S! i Φ O tr tr RTI P- tr 3 er LQ LQ PP li H P TJ P- Φ 53 rt rt PP Co 03 P P tö ii CQ φ Φ Φ φ Φ rt P- PP Φ Pi Φ P LQ Φ 03

03 Φ rt tr rt Ω P <J Ω P- P- rt td 03 3- OP <Hl P li Pi LQ φ P- rt rr Φ u li -3 - Φ LQ P- 3 "Φ 03 rr 53 tsi ii P tr 1 LQ 0 LQ Φ li P CQ 01 o = P 03 PJ

Φ • "P - 3 01 P P TJ φ φ CQ CQ P P u Φ td ii JPW φ Ω P

Ω rr. tr LQ PP 1 P- P- TJ P- P- tr φ P LQ P "i PN PP Ω Φ tr

P 1 i Φ Φ rt P Φ φ Ω rt P- tr rr φ Φ rt P P P tr tsi Hl LQ Φ ii td PH

Φ P> H, -, ö P- P- Ω NP li P first Φ 03 φ φ PP P Hl LQ LQ tr Φ Ω 3

CQ - Ω P P 01 TJ Φ LQ 03 ii Ω 0 tr rt P LQ tsi Φ Φ φ PJ <!co) PS U ω. 03 φ Φ O TJ t tö 03 -3 P Φ 3 "φ Φ Pi Φ rr P) ii tr Hl PO ö 03 Ω

Ii Ω P- CQ φ PJ Φ φ P- P P- rr P) ω P tr P 0 = P = P - tr

03 Φ td tö φ P P P CQ Ω P- P- rr J 53 Ω PMP li 3-NP: Φ

P t P PJ PJ 03 r P P- tr 3 rt 03 rt P LQ) "Pi P- P PJ ii 0 N M P he

P) Φ P 03 03 P P 01 CQ Φ rt O tsi rr xo P) Φ <ω LQ rt P Φ tr co Φ Pi

Ω P P P. -. TJ TJ Φ 01 Φ Φ TJ rt P- Φ Pi O Φ - P- P Ω * li tr 3 Ω P- CQ 03 01 TJ P- rt P- P- LQ ü P- p. rr P> PPP Pi rt CO rt

P r 01 03 P o rt Φ P) PPM Φ tsi P> O ti Φ 3 P 5 φ ω <! α li s:

Pi rt ω - rt rt rt φ Ω u P P PP Φ ^ Φ P P P TSJ xo P li O Ω P> Φ

Φ • P) P) p rt tr xo P P P P P Ω LQ Pi P rt φ P> tr φ PP LQ H.

3 Φ Ω rt rt φ Φ TJ O φ Φ tr rt Φ Φ P- Pi Pi φ Φ 03 tö

P α O p P PPP li ii ii Φ 03 53 <! Pi ti tr rt P> P 53 P) P tsi r P Φ

Ω P P P St. OOJO to Ω P 0 Φ CQ 0 03 3 03 03 φ φ P rt Φ

CO Φ Φ rr td PP P P ö ti tö <tr φ Ω P- tr ii 03 01 P- P- P- H N 0

2 u - LQ Φ Pi Φ p] Φ) PA Φ 03 M Φ tr rr LQ N rt rt Φ 03 rt rt Pi

1 P] Troubles Cd - Φ li CQ P 03 O li P Φ Φ cd P 3 P 1 P) P 03 01 ii Φ P>

CQ P 2, i P. H 3 - rt rt tr PP PP PP Φ LQ rt rt Pi Ω PJ LQ H rt 0 P): ii CQ CQ TJ LO co - • ii Hl 03 P- N - 0 rt rt φ PA P- P- P- P) tsi tr LQ Φ

P> He LQ φ -. - • - Ω <! PJ P 03 P P Φ 3 H o ON O φ φ φ rt P co LQ 1

P Φ P- P- - - CQ tr P. O rt LQ Pi P 1 P 3 P li n Φ Pi P- P P- P Φ φ.

Pi P 1 HP ≥5 3 Φ P) Φ Φ Φ 0. JPPN PP i φ PJ rt NO - PP p) Φ 03 p] PP PP 3 rt rt CQ li P 1 P r P P- φ tö pppn rt

H rt P 3 P li Hi N <! P P P) LQ CQ Φ "i tst LQ p] LQ 03 Φ CQ PJ

Pi) PP) = Hi Pi PJ tr P Φ CO O rt Hi 53 ~ rt CQ Φ ω CO Φ Φ P 03 0 PP) tr rt pi l 01 o 3 rt P P- ii H ii tsi Φ • Ω 3 - tr rt P LQ IV

P- φ 01 φ 03 Φ Φ 3 3 Φ 03 OP ii Pi - N 0- P Φ Φ CQ 53 TSJ

0 O P 03 P rt J P 1 P 1 P 1 PN φ P PA p. P φ φ 1 co rt

3 P rt rt PP) rt P 1 1 1 0 P- Φ tr 3 Φ ii 1 1 1 1 1 1 1 PJ

LO LO to to P> H

LΠ o LΠ o o LΠ in

Speech data which are supplied to the GERAN base station controller GBSC of the rate adaptation unit TRAU 'is in 16kbps timeslots. Packet data that the base station controller wrangling GBSC are supplied via the G interface are λ divided into the packet data control unit PCU in radio blocks whose size depends on the used in the transmission Kodiertiefe. A radio block can contain from 160 to 1300 bits. Circuit switched data (CS) interface from the communication system of the third generation 3G CN are supplied to the common platform CP via the I U, and packet-switched data that the common platform over the Iu (PS) interface from the communication network of the third generation 3G CN are supplied to the packet data control unit PCU 1 are supplied and there is also divided into radio blocks of different sizes.

In a structure of a connection between the base station controller BSC2 x and the base station BTS2 will be a compound of the capacity allocation unit of the base station controller wrangling GBSC or more time slots ZS * assigned. The number of assigned time slots ZS λ is dependent on the type of transmitted data and thus the size of the radio blocks and / or the distance of the mobile station MSi involved in the connection from the base station BTS λ '. Includes a radio block to be transmitted more than 320 bits, the maximum capacity of a lδkbps time slot, the connection will be allocated more time slots. This Zeitschlit- ze may be arranged on different lines of the transmission path or be spread in time.

The allocation of time slots ZS takes place dynamically when setting up the connection through a signaling message, for example by Channel_activation (service type, TRX-number, time slot number, resource list). If the time slots ZS X on different physical links,

only three 16kbps timeslots needed. The superfluous two time slots are released back into the reserved transmission capacity and available to other connections.

The packet data control unit PCU 1 in Fig. 3 can be incorporated instead in the Basisstationssteueerung BSC 'in the base station BTS'. Then, the segmentation of the radio or Funkbioecke no longer takes place for packet data in the Ba sisstationssteuerung BSC but only in the base station BTS '1, ie but also that the frame relay, ATM, or IP data over Gb and Iu must be forwarded via the Basistationssteuerung BSC 'to the base station BTS' and that the base station BTS '1 in their central unit (core unit) c0re x has a packet data interface.

In this case, the capacity allocation unit RP, in the base station unit BSC 'frame relay, ATM, or IP data bare rule, a variable number of time slots from the set of comparable assign time slots, which depends upon how many time slots are required for each of the voice services ,

Claims

claims
1. A method for data transmission in a different units comprehensive radio communication system, - in which the data transfer between two units of the radio communications system via a transmission path on which a predetermined transmission capacity is reserved in the form of a set of time slots,
- be at the allocated from the reserved transmission capacity when establishing a connection for voice or DA th transmission of the connection, one or more time slots over which the data transfer between takes place between the units, wherein the number of the connection assigned time slots depends on a service transmitted over the link,
- are where the connection of assigned upon completion of the connection time slots released and are back as part of the reserved transmission capacity.
2. The method of claim 1, wherein the transmission line as a line, radio link, fiber optic cable, power line communication and / or satellite link is formed.
3. The method of claim 1 or 2,
- in which an estimation is carried out when the connection between a mobile station and the radio communication system, how many time slots of the connection to be assigned,
- This estimate the distance of the mobile station depending on a base station measured by the rate time (Ti ming Advance), this estimate depends on the received level (RXLEV) and signal to noise ratio of access (Channel_Request), - in this estimate also the Kapazitaetsbedarf enters the last connection of the same operators, including the elapsed time since the last access ..
4. The method according to any one of claims 1 to 3, wherein the time slots which are allocated to the connection, are numbered.
5. The method of claim 4, wherein on a multiplexed channel with several participants, all participants have the same time slot numbering on all time slots.
6. The method of claim 4 or 5, wherein the transmitting unit is segmented larger data packets according to the numbering of the time slots, and assembling the received unit these data packets accordingly.
7. The method according to any one of claims 4 to 6, wherein the numbering in the time slots will carry with.
8. A method according to any one of claims 1 to 7, characterized in which zusammengehoerige time slots by means of a eindeu- term identification feature.
9. A method according to any one of claims 1 to 8, wherein a time slot to the main time slot is declared and the main time slot has the smallest number.
10. The method of claim 9, wherein the relevant in-band signaling of the connection takes place predominantly on the main time slot.
11. A method according to any one of claims 1 to 10,
- wherein each time information is transmitted in the time slots from the timing of transmitted in the relevant time slot data segments in relation can be derived on the original data.
12. The method according to any one of claims 1 to 11, wherein the time slots be independently from each other in synchronized timing.
13. The method of claim 11, wherein the timing of the time slots is continuously readjusted by means of the uebertrage- NEN time information.
14. A method according to any one of claims 1 to 13, wherein in case of failure or loss of one time slot of the synchronous data transmission is continued on the remaining time slots of a time slot synchronicity.
15. The method according to any one of claims 1 to 14, wherein the connection is assigned a smaller number of time slots if the reserved capacity in transmission the number of requested time slots is not available.
16. The method according to any one of claims 1 to 15,
- are defined in the compounds of lower priority and connections of higher priority,
- Release in the compounds of lower priority time slots for a connection higher priority, if the reserved transmission capacity rity the number of requested time slots for a compound higher Prio- is not available.
17. The method according to claim 16, to be moved in the low-priority connections to other cells if the reserved transmission capacity, the number of requested time slots is not available for a connection higher priority.
18. The method according to any one of claims 1 to 17, wherein a compound is displaced bertragungskapazitaet in another cell with free Ü, if in the reserved transmission capacity of the source cell, the number of requested time slots of this service is not available.
19. A method according to any one of claims 1 to 18, wherein during the connection, the number of allocated time slots is dynamically adapted to the requirements of the connection.
20. The method according to claim 19,
- in which periodically checks exceeded after the establishment of the connection, if the number of assigned time slots corresponding to the current requirements of the connection, wherein for the case that the number of assigned time slots is less than the current request of the compound, the compound more time slots are allocated from the reserved transmission capacity,
- in which for the case that the number of assigned time slots is greater than the current requirement of the compound, the compound assigned time slots which are not required to be released.
21. The method according to any one of claims 1 to 20,
- wherein the base station controller controls multiple base stations,
- in which a subset of the vorgege- surrounded transmission capacity is reserved for each base station, are allocated from the time slots for connections via the respective base station.
22. The method according to any one of claims 1 to 21, are reserved in the subsets of the reserved transmission capacity for different services, transmission paths and / or transmission methods.
23. The method according to claim 9 or 22, wherein at least one base station, a service, a transmission path or a transmission method, a subset of the reserved transmission capacity is reserved, having a predetermined minimum size.
24. The method of claim 21 or 22, wherein the size of the subsets in response to the conjunction arise is dynamically changed.
25. The method of claim 23 or 24, wherein a base station, a service, a transmission path or a transfer method bertragungskapazitaet the reserved but free Ü another base station of another service, another transmission path or another transmission method, if necessary used, these Übertra - but gungskapazitaet again if required for disposal presents.
26. The method according to any one of claims 22 to 25, wherein the size of said subsets being such that the sum of the partial quantities is bertragungskapazität smaller than the total reserved Ü.
27. The method of claim 22, wherein the at least one service, transmission or Ü bertragungsmethode an increased priority is assigned,
- in which during connection the first demands of compounds for the at least one service,
Transmission path or transmission method to be met with higher priority, then the requirements of connections for services, transmission paths or transmission methods are processed without increasing the priority and / or
- be at the bertragungskapazitaetendie when establishing a connection and scarce free Ü requirements of connections for the at least one service or transmission path Ü bertragungsmethode with higher priority met by providing existing connections with a lower priority transmission gungskapazitaet.
28. The method according to any one of the preceding claims wherein the transmission capacity reserved for signaling nichtgenutze, software download and other internal traffic between the base stations and the controller is used.
29. The method according to any one of claims 1 to 28, in which the units of the radio communication system between which data transfer takes place, a base station and a base station controller, a base station controller and a transcoder (transcoding and rate adaptation U nit), and / or transcoder (transcoding and rate adaptation unit) and a mobile switching center.
30, base station system comprising a base station and a base station controller, wherein the base station controller having a Kapazitätszuteilungs- unit which is designed such that it is controlled the flow of a method according to one of claims 1 to 29 overall.
31 base station system according to claim 30, wherein the capacity allocation unit produces statistics about the usage of the reserved transmission capacity, number of successful and failed connection attempts or connection modifications and forwards them to an operation and maintenance center.
32. A radio communication system with at least one on Basisstati-, at least one base station controller, at least one
Mobile switching center, at least one transcoder (transcoding and rate adaptation unit TRAU) and at least one packet data node, which is designed such that in the course of a method according to one of claims 1 to 30 on at least one of the interfaces between the mobile switching center and transcoder (transcoding and rate adaptation Unit), between base station and base station controller between the base station controller and transcoder (transcoding and rate adaptation unit) and / or switching center between Mobilvermitt- and packet data node is controlled.
PCT/EP2001/014413 2000-12-20 2001-12-07 Method for transmitting data in a radio communication system comprising different units, base station system equipped for said purpose and radio communication system WO2002051176A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
DE10063679.9 2000-12-20
DE2000163679 DE10063679B4 (en) 2000-12-20 2000-12-20 A method for data transmission in a different units comprehensive radio communication system and duly established base station system and radio communication system
EP00127990 2000-12-20
EP00127990.0 2000-12-20

Publications (1)

Publication Number Publication Date
WO2002051176A1 true true WO2002051176A1 (en) 2002-06-27

Family

ID=26008014

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2001/014413 WO2002051176A1 (en) 2000-12-20 2001-12-07 Method for transmitting data in a radio communication system comprising different units, base station system equipped for said purpose and radio communication system

Country Status (1)

Country Link
WO (1) WO2002051176A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1420604A1 (en) * 2002-11-16 2004-05-19 Siemens Mobile Communications S.p.A. Traffic load management method based on the exchange of service specific free capacity information elements among radio access network controllers
EP1631010A1 (en) * 2004-08-30 2006-03-01 Fujitsu Limited Transmitting by a base station information relating to parameters used in the adaptive modulation control (e.g.CQI) to a higher level device
WO2007009290A1 (en) * 2005-07-18 2007-01-25 Zte Corporation Method for sharing abis channel
WO2009027503A1 (en) * 2007-08-31 2009-03-05 Ipwireless Inc Cellular communication system, apparatus and method for management of backhaul resources

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5502723A (en) * 1994-05-06 1996-03-26 Circuit Path Network Systems Method for assigning cell slots to one or more communication channels by mapping the channels to cell slots based on a one-to-one transformation
US5506848A (en) * 1994-06-22 1996-04-09 At&T Corp. Demand assignment system and method for mobile users in a community of interest
US5594727A (en) * 1994-09-19 1997-01-14 Summa Four, Inc. Telephone switch providing dynamic allocation of time division multiplex resources
US6052384A (en) * 1997-03-21 2000-04-18 Scientific-Atlanta, Inc. Using a receiver model to multiplex variable-rate bit streams having timing constraints
US6061784A (en) * 1996-12-26 2000-05-09 Nortel Networks Corporation Method and device for transferring data frames within a serial stream
WO2000074407A1 (en) * 1999-05-28 2000-12-07 Nokia Inc. Apparatus, and associated method, for communicating packet data in a radio communication system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5502723A (en) * 1994-05-06 1996-03-26 Circuit Path Network Systems Method for assigning cell slots to one or more communication channels by mapping the channels to cell slots based on a one-to-one transformation
US5506848A (en) * 1994-06-22 1996-04-09 At&T Corp. Demand assignment system and method for mobile users in a community of interest
US5594727A (en) * 1994-09-19 1997-01-14 Summa Four, Inc. Telephone switch providing dynamic allocation of time division multiplex resources
US6061784A (en) * 1996-12-26 2000-05-09 Nortel Networks Corporation Method and device for transferring data frames within a serial stream
US6052384A (en) * 1997-03-21 2000-04-18 Scientific-Atlanta, Inc. Using a receiver model to multiplex variable-rate bit streams having timing constraints
WO2000074407A1 (en) * 1999-05-28 2000-12-07 Nokia Inc. Apparatus, and associated method, for communicating packet data in a radio communication system

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1420604A1 (en) * 2002-11-16 2004-05-19 Siemens Mobile Communications S.p.A. Traffic load management method based on the exchange of service specific free capacity information elements among radio access network controllers
EP1657862A1 (en) * 2002-11-16 2006-05-17 Siemens S.p.A. Centralized dynamical resource reservation method based on the exchange of service specific capacity settings in a multi-RAT network
EP1631010A1 (en) * 2004-08-30 2006-03-01 Fujitsu Limited Transmitting by a base station information relating to parameters used in the adaptive modulation control (e.g.CQI) to a higher level device
WO2007009290A1 (en) * 2005-07-18 2007-01-25 Zte Corporation Method for sharing abis channel
WO2009027503A1 (en) * 2007-08-31 2009-03-05 Ipwireless Inc Cellular communication system, apparatus and method for management of backhaul resources
US7948962B2 (en) 2007-08-31 2011-05-24 Wireless Technology Solutions Llc Cellular communication system, apparatus and method for management of backhaul resources
US8804743B2 (en) 2007-08-31 2014-08-12 Ip Wireless, Inc. Cellular communication system, apparatus and method for management of backhaul resources

Similar Documents

Publication Publication Date Title
Cai et al. General packet radio service in GSM
US5854786A (en) Method and apparatus for distribution/consolidation (DISCO) interface units for packet switched interconnection system
US5940763A (en) Enhanced preemption within a mobile telecommunications network
US5678178A (en) SDH network having dynamic allocation of transmission capacity
US6138020A (en) Quality-based handover
US6963544B1 (en) System for statistically multiplexing real-time and non-real-time voice and data traffic in a wireless system
US7599384B2 (en) Method for connection reconfiguration in cellular radio network
US20020145988A1 (en) Cellular radio communication system with frequency reuse
US6212173B1 (en) Communication system with fast control traffic
US20040002340A1 (en) Wireless network using multiple channel assignment messages and method of operation
US6772112B1 (en) System and method to reduce speech delay and improve voice quality using half speech blocks
US6813252B2 (en) Method and system for interleaving of full rate channels suitable for half duplex operation and statistical multiplexing
US5926469A (en) Channel resource management within a digital mobile communications network
US6243582B1 (en) Inter-MSC handover in high-speed data transmission
US7006477B1 (en) Method for interleaving of half rate channels suitable for half duplex operation and statistical multiplexing
US20060116136A1 (en) Radio control device, radio communication system using the same, and operation control methof thereof
US5956329A (en) Method of packet-wise data transmission in a mobile radio network
US20050013247A1 (en) Method for controlling data transmission, and data transmission system
US20020085531A1 (en) Wireless network with a selection of transport format combinations
US6996083B1 (en) Burst based access and assignment method for providing real-time services
US5553074A (en) Transmission format in packet based communications
US6810258B1 (en) Contention resolution method in channel allocation
US20010030949A1 (en) Method and apparatus for associated signaling in a wireless communications network
WO2001020938A1 (en) Relocation in a communication system
US20040259548A1 (en) Mobile communication controlling apparatus and inter-frequency handover control method

Legal Events

Date Code Title Description
AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

AK Designated states

Kind code of ref document: A1

Designated state(s): BR CA CN ID JP KR US

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
WWW Wipo information: withdrawn in national office

Country of ref document: JP

NENP Non-entry into the national phase in:

Ref country code: JP