NETWORK CONTROLLER AND COMMUNICATION SYSTEM FOR PERFORMING PACKET DATA TRANSFER WITH REDUCED DELAY

Abstract: In a communication system (SYS) in which a packet data transfer is performed between a network side (NS) and a subscriber terminal side (SS) a physical connection (PC) is maintained during the data packet transfer. In association with each transferred data packet (DP) a transmitter queue length information (CV) is transmitted to a network controller (NC) on the network side (NS). On the basis of the received length information (CV) a network side transmission resources controller (SCH-RES) determines transmission resources (TS) for the data packet transfer on the uplink connection (UL) in the next uplink frame such that at least one data packet (DP) remains in the subscriber terminal side transmitter buffer queue (TR-QUE) during an active period of the application. Since at least one data packet is always present in the transmitter queue (TR-QUE) unnecessary physical connection releases can be avoided.

Description: NETWORK CONTROLLER AND COMMUNICATION SYSTEM FOR PERFORMING PACKET DATA TRANSFER WITH REDUCED DELAY FIELD OF THE INVENTION The invention relates to a network controller and a communication system for performing a packet data transfer on a connection between a subscriber terminal side and a network side. The communication system can comprise a packet data communication system only or a packet data communication system connected to a circuit switched communication system. In such a communication system a physical connection is maintained during a data packet transfer which in principle indicates in the subscriber terminal side and in the network side that the subscriber terminal and the network side are valid for performing a packet data transfer. A data packet transfer can only be performed if the physical connection is established. The present invention in particular addresses the problem to avoid empty transmitter queues in the subscriber terminal side in order to keep the physical connection alive during active periods of real-time applications and thus minimizing the transmission delay. BACKGROUND OF THE INVENTION Although the invention is of course not limited to any particular type of communication system comprising a packet data communication network or a circuit switched communication network and a packet switched communication network in combination, the background of the invention can most easily be understood by reference to the GPRS (General Packet Radio Service) system in GSM (Global System for Mobile Communication) . GPRS is a new packet switched service which is standardized by ETSI . As shown in Fig.vl,. a communication system SYS incorporating a GPRS network architecture comprises for the conventional circuit switched mobile communication network the well-known entities of e.g. a mobile switching centre MSC, a base transceiver station BTS, a base station controller BSC, a home location register HLR etc. wherein the mobile switching centre MSC may be connected to a conventional public switched telephone network PSTN. The GPRS architecture (illustrated with grey shading) introduces new packet switching functionalities in the existing GSM architecture. According to the GSM specifications a new node SGSN (Serving GPRS Support Node) is provided which is interfaced via interfaces Gb, Gs, Gr with the base station controller BSC, the mobile switching centre MSC and the home location register HLR. Via the SGSN node an IP backbone network can be accessible in the conventional mobile communication network. By means of additional nodes GGSN (Gateway GPRS Support node) an IP network or X.25 network can for example be connected to the IP backbone network. In Fig. 1 the dotted lines denote an exchange of signalling messages, the dashed lines denote a circuit switched connection and the solid lines denote a packet switched connection. The existing GSM data services (9.6 k-bit/s packet switched) and a newly standardized High Speech Circuit Switched Data HSCSD and GPRS with data rates up to 114 k-bit/s are based on a Gaussian Minimum Shift Keying (GMSK) Modulation Scheme. To be able to have even higher bit rates a 8-Phase Shift-Keying (PSK) modulation scheme is introduced with an advanced standard, called the EDGE standard, which can boost the available data rate up to 384 k-bit/s (EDGE: enhanced Data Rate for GSM Evolution) . A new extension called EGPRS (Enhanced General Packet Radio System) is considered as the migration from the .second generation mobile network to the third generation Wideband Code Division Multiplex Access (WCDMA) networks. As shown in Fig. 1, GPRS provides a packet switched transmission service to transport data in a mobile environment. This packet oriented data service for GSM supports protocols like X.25 and IP as level 3 protocols and therefore is suitable to work as air link for the access to the IP based Internet. Another advantage in respect of Internet application in the mobile communication network via GPRS is that a packet oriented service no longer needs a costly online connection applying time based charging but enables volume based charging. In the system in Fig. 1 the aim is that the communication system SYS shall be able to support all existing applications via packet switched links, including voice and video but should also support application with bursty traffic, such as Internet applications whose bursty nature requires efficient multiplexing on the GSM time slot (TS) . The idea is to build a -unified network based on IP providing service flexibility and independence of applications and the network. In particular due to the time critical nature of speech transmission it is important to meet the tight quality of service requirements of real time traffic. For example, in real time applications as VoIP (Voice over Internet Protocol) over GPRS and EGPRS, the end-to-end delay time of the transfer of data packets is an important aspect, since for example a high delay time might sound like a speech pause at the receiving end. Therefore, in particular for real time applications special provisions regarding the maximum delay time must be made. PROTOCOL STRUCTURE In Fig. 2 the GPRS protocol structure for the communication network SYS in F g. 1 is shown. MS is the protocol stack of the mobile station or subscriber terminal, more generally of a communication station. BSS is the base station system and SGSN and GGSN are the same nodes as explained above with reference to Fig. 1. It should be noted that a full description of this protocol structure is contained in the ETSI standard GSM 3.60 and hereinafter only those portions of the protocol structure are explained which are relevant for the present invention. As shown in Fig. 2 the medium access layer MAC and the radio link layer RLC operate above the physical link layer. The MAC layer provides the multiplexing of several mobile stations MS on the time slot structure of GSM. The MAC layer arbitrates multiple mobile stations attempting to allocate resources and transmitting simultaneously. The operations of the MAC functions allow a single mobile station to use more than one time slot (TS) simultaneously. The number of allowed parallely used time slots TS in a single TDMA frame is determined by the time slot capabilities of the mobile station. Hereinafter, these capabilities are called ^ multislot capability 1 '. Each mobile station is thus given a certain amount of time slots TS for use, ranging from multislot capability 1 (only 1 time slot TS) up to multislot capability 8 (all 8 time slots TS in the TDMA frame) . The GRPRS MAC layer is responsible for providing efficient multiplexing of data and control signalling on the uplink and downlink connections. The multiplexing on the downlink is controlled by a so-called downlink scheduler which has knowledge of the active mobile stations in the system and of the downlink traffic. Therefore, an efficient multiplexing on the timeslots TS can be made. On the uplink, the multiplexing is controlled by medium allocation to individual users. This is done by resource requests, which are sent by the mobile station to the network which then has to schedule the time slot TS on the uplink. \ ~ j The GPRS RLC function provides the interface towards the LLC (LLC: Logical Link Control) layer, especially the segmentation and re-assembly of LLC-PDUs (PDU: Packet Data Units) into RLC data blocks depending on the used coding scheme (CS) . The procedures of the medium access layer MAC in the mobile station (communication station) on the terminal side and the base station system BSS on the network side NS include the provision of a physical connection which is called the Temporary Block Flow TBF in GPRS . A temporary Block Flow (TBF) is a physical connection used by the two RR peer entities to support the unidirectional transfer of LLC packet data units (PDUs) on packet data physical channels. The TBF is allocated radio resources on one or more packet data channels PDCHs and comprises a number of RLC/MAC blocks carrying one or more LLC PDUs. A TBF is temporary and is maintained only for the duration of the data transfer (i.e. until there are no more RLC/MAC blocks to be transmitted and in RLC acknowledgement mode, all of the transmitted RLC/MAC blocks have been successfully acknowledged by the receiving entity) . The physical connection TBF is assigned a temporary flow identifier (TFI) by the network side NS to associate the mobile station MS with the current physical connection TBF. For example, an uplink state flag (USF) is used by the network side NS (i.e. the network scheduler) to control the multiplexing of the different mobile stations on the uplink connection (for the packet transfer) . The uplink state flag USF is included in the header of each RLC PDU packet on the downlink connection (Packet Data Channel PDCH) . The uplink state flag USF indicates the owner of the corresponding uplink data packet (radio block) . The mobile station MS which has the identity indicated in the USF field is allowed to transmit a RLC block (data packet) in the uplink direction on the corresponding time slot TS . Thus, the physical connection is used to organize the access of the radio resources. A mobile station MS having a valid TBF is therefore included in the GPRS scheduling mechanism and can expect to get access to the radio resources according to its signalled multislot capabilities. Thus, the physical connection indicates in the subscriber terminal (mobile station) and in the network side (base station system BSS) that the subscriber terminal and the network side are valid for performing a packet data transfer. Via this physical connection the subscriber terminal side and the network side know that the subscriber terminal (mobile station or communication station) should be included in the GPRS timeslot (radio resources) scheduling. Thus, via the physical connection a context is generated in the subscriber terminal side and the network side which indicates the subscriber terminal and network side as being included in the packet data communication system radio resources scheduling process. This context or physical connection is only maintained during the data packet transfer and is terminated as soon as a packet data transfer stops. REAL TIME APPLICATION (VOICE CODER) There are applications like real-time applications, which are sensitive against delays occurring during the end-to-end data packet transfer. In particular, this applies to voice coding (a real time application), without being limited to it. >-rJ Ω tr H H- H- r-3 3 O Q CT T H- T5 H- H- Pi IQ rf > 3 H- O Ω T CQ tr Ω cr CT CQ Ω 21 H- 0 Φ 3 3 0 X O l- X 03 SD 0 3 Φ Φ a- oi a Hi O SD Φ SD O Φ ϋ a o μ- Ω 3 CL. CQ PJ CT -J Tj φ Ω L. CQ rf 0 Φ Ω Hi Ω a < ω Ω a tr 3 CT 3 CQ TJ H- φ CT Ω to p- 51 ) . H- Φ Φ φ O 51 ) 0 CT Φ .Y Φ φ rf SD Φ Q T tr Φ Φ n Ω ϋ 5D O ) Ω H Φ Ω fi Ω ii a P- a ii tr H Φ ii 03 a Ω ii > Ω 3 p. SD (T H- D Φ 01 CT 51) rf rf 51 ) Φ Φ P- 3 Φ rf SD tr 03 Hi H Φ μ- Cϊ φ 3 (T H- 01 01 H H -x Ω O 03 rf H- O rf rf H Si) CQ CO ω CT Φ μ- φ 0 μ- 01 a Φ H Ω φ O ^ H- 03 . Φ Φ O ii H- *. rf rf φ rf Φ Φ a ϋ tr 03 Ω p. PJ H- 0 I- * Φ TJ H- c SD 0 0 O O t H- SD SD a T Φ H (T »d 0 Φ - 5U < H CT i IQ ϋ a φ O Ω a rf SD rf ii CT π < φ 0 Φ * - ■ CT P. T 0 Ω Φ φ Φ X P. Φ t a 0 P-. Φ X fu O V Φ 0 Φ X Ω H- ? ϋ i Φ Φ rf 3 rf i i 5D rf Ω 3 μ- a SD CT μ- 03 - 03 Φ Φ (T Φ IQ 01 Φ 51 ) CQ tr 51 ) 5U φ i tr CT Ω H CT 03 CT Φ 03 Ω Ω Ω H- Φ (T H ii a O TJ ω 03 a φ Ω μ- H- a I- * 3 01 i φ a 3 * -<: (T X ϋ H- i H- 0 0 H- ii rf W i SD Φ 03 μ- 03 O Φ μ- 3 3 * \ CQ Ω 3 * φ H- Ω 0 Φ 01 (T Φ * - ■ H- 03 Φ Φ rf • M Ω CT • ! a CQ μ- μ- SD 0 0 ) φ TJ 0 ra TJ (T Φ Pi ii Φ TJ rf H T TJ »-3 5D S Φ < CQ CQ a a TJ i H rf Pi φ Φ ϋ Φ 51J 0 rf 51) 01 Izi 51 ) SH ii α a I- 1 i μ- μ- CQ SD i ii TJ Ω (T Φ O Φ ii Φ 52. Hi <τ Ω O CO a Ω O 5U CT H 0 μ- μ- 0 O 0 s Ω ϋ H ΓT Pi 5D 3 H- Φ Φ ϋ 03 Pi 01 ;* **• (T • SD SD O a o O Ω ϋ p. Φ CQ H- 01 3 H 0 H- C 3 3 Φ a 0 ) a tr a a a 0 φ S» Φ H- H- p. O H- Φ • TJ I- * ii 0 ) H- T Ω Q P. μ- P. 3 Ω ii μ- 03 t i Ω < 0 3 0 0 TJ 0 Φ M Φ μ- *<. rf ω φ TJ r φ O 0 a 01 Φ P> φ PJ 3 ti ω rt • -3 ii α 0 3 CT !H -~J s SD a 03 Hi CT Hi μ- p. 0 I-" H S i O 53- H- Ω iQ a H- f)J Ω CO Φ H >i CT T X 0 a U tr Φ CT P. (T Φ Φ O 1 Φ 03 a ii s- ?r ω I- 1 SD Φ • CQ 03 Φ ii CQ H- T CQ H- TJ 01 X 3 ^ i CQ 03 φ iQ Φ H- Φ • rf T3 3 3 J ii H- Ω ϋ Ω Φ Ω Φ Ω ω T TJ T CT (-> Φ μ- SS S" Φ a SD TJ rt- 3 P ) (T 3 * Φ ii Φ O H- 03 Φ φ 51) 01 rt tr 03 i l-h a 0 ii Φ Φ CT 0 0 ^ φ l-h H- Ω Pi 03 3 l- J 1-1 X ϋ φ a Hi Ω Φ TJ O H- l-h φ ø 0 H- Ω CQ cr 3 p. 3 φ rf Ω SD Hi s Φ Ω T μ- £ i c SD tr 3 o φ -J ct H H- ^ SD ii (T Pi tr l- 1 O ø Ξ o ^ p. 03 M- a o •-< μ- SD CQ o. 3 0 a H r φ Ω H- CQ O H- •<: Φ ii Ω rf 0 Pi I- 1 Ω Ω T a a Hi Φ SD a SD ii Φ PJ 1- Φ 3 ^i 0 P T Φ tr T3 Φ ii 01 φ (T Φ Hi • • Ω a PT tr μ- I-" 03 Hi O U3 CQ Ω Φ H- H- 51 ) a H- ii SD Φ Pi μ- 03 tr Φ rf 3 J3- Φ (T (T CD a Φ ø H- 0 CT C Ω σ 1 μ- ii Ω s - μ- ω Hi 0 CT p ) ϋ ET H CQ Ω O 0 03 C Q Φ Φ •^ ill a < i 0 X O μ- 0 tr X H- TJ Φ Φ T α CT 3" Ti H- CQ H- ■" - 03 Φ ii ii μ- φ Φ . — . 03 3 μ- i t-i Φ H- 3 φ 3 O 51 ) Φ 03 Φ l- J H- Φ CQ . M M a CQ π T SD iQ O Φ Φ Ω I- 1 Φ T IB H- 0 511 ii Φ H Φ IQ P • Φ rf Φ- H- CQ £D a ω a X <J • SD Φ ω H J H- p. 01 P H- T 0 • i rf Φ <. CQ I- 1 S O ■ -<. Φ Φ 03 3 0 ) ^ (- * ^ 3 51) Ω O I- 1 H- Ω 03 s: Φ ii tr 51 ) Ω SD Hi ϋ ii 1-3 Φ φ to TJ O Φ 01 CQ ii O Pi Φ 0 Φ ^ tr Ω 3 - 1 0 SD fi Pi tr a CT T • s 3 φ Φ i Pi . <! 0 tr Si) Φ rf H- CT 3 SD CT μ- rf * ≤ μ- α tr fu -x 3 0 Ω H 3 Φ Φ TJ a O a φ T TS π * μ- a X Hi tr μ- Q μ- Φ (T H- H Φ rf CT C ϋ •rj - χ Pi Φ H- to i SD CQ μ- ti - Ω H- 01 H- Φ ii 0 l- 1 - rf l- 1 3 Φ 3 a CL. Φ Hi SD ii H T CQ φ a a a φ μ- CQ Φ 0 0 ) 3 0 TJ 5" tr Φ U U3 IQ 01 p. * - ■ t rf H- φ 03 μ- Φ T3 Φ 03 Hi 3 t o Φ • & Ω • Φ Ω O 0 Φ φ 0 03 a 03 03 Ω ii φ Ω Φ μ- μ- H- ■ ri CT H CQ Ω 0 ϋ P. M 0 H- Φ 5D o Ω H- H- rt a O CO Φ rt Ω 0 ) o H- = > O α^ Φ H- Pi Ω 03 Si ω ι-3 i SD Pi O rf 3 CQ Q μ- to 3 lΩ J 0 I- * tT tr ϋ tr H T3 0 φ Φ * - ■ - <! φ H- O 1— ' a D- TJ TJ r l • CT i Φ Φ Φ Pi 5D CT 0 ii I- 1 O N CQ Φ 03 Ω Φ Ω a Ω φ O s-x 03 f m 0 T p. 01 rf O φ H- CD Φ •A T X • Φ 0 CT tr Ω X i-3 ^ S" Ω Ω X 3 X Φ ii i T a P-. 0 * 1 • •fl φ Oi 03 P μ- SD μ- rf rf 0 > tr * - ■ 5D Φ O Φ Q 0 Pi 1 ) O Ω φ 3 ι-3 P. φ a a SD tr O ■ s l- 1 ii P. ii ^ ω rf φ O o Ω •a tr SD i CQ a l- 1 Φ 0 Ω φ Φ rt CQ 51J PJ ϋ Hi X φ rf 03 φ h-x O O T Φ SD -x H- 3 * H 5" ω 3 σ μ- |P 3 a CT Φ Φ a Φ 1 5D ι-3 χ -i to i 1 μ- SD K φ T <i μ- φ 3 H Φ μ- ω 03 o CT 3 s Q TJ • μ- Ω i-3 SD tr SD l- 1 rf ^ μ- Q o -. 3 03 Hi 0 ii CQ a Ω tr SD Ω 0 Pi Φ ii rf tr Φ the establishment and release procedures have been defined quite clearly. Thus, with reference to Fig. 5 and Fig. 3 the release procedure for an uplink physical connection TBF is described. The subscriber terminal side comprises a subscriber terminal side transmitter queue monitoring device QUE-MON for determining whetfter the transmitter queue TR-QUE comprises data packets DP to be transmitted (see Fig. 4a) . Furthermore, the subscriber terminal side comprises a transmitter queue information setting means CV-SET for determining on the basis of the determination made by the transmitter queue monitoring means QUE-MON a transmitter queue information CV indicating whether the transmitter queue is empty (CV=0) or whether the transmitter queue TR-QUE contains at least one remaining data packet to be transmitted to the network side (CV>0) . The subscriber terminal side transmitter SS-TR transmits to the network side NS data packets DP from the transmitter queue TR-QUE and transmits in association with the respective data packet DP the determined transmitter queue information CV. The transmitter queue information CV can be transmitted in the respective packet DP as shown in Fig. 5 and Fig. 4c. However, it is of course sufficient to link the transmission of the data packet to the transmission of the respective transmitter queue information CV. Thus, every RLC/MAC data block sent from the subscriber terminal side to the network side contains the transmitter queue information CV (which hereinafter will also be referred to as the counter value CV field) . Usually this counter value CV field is transmitted in the header and is used to signal the number of remaining RLC packets in the transmitter queue TR-QUE. Fig. 4c shows one example of the usage of the counter value CV field for a mobile station handling 2 time slots in a TDMA frame. As can be seen from Fig. 4c, for each transferred data packet a respective counter value field CV is determined, i.e. in Fig. 4c CV=2 for the first data packet (PDU) and CV=1 for the second packet (PDU) ) . According to the ETSI GSM 04.60 V8.2.0 standard the transmitter terminal side transmitter queue information setting means CV-SET sets as said transmitter queue information CV a counter value CV determined in accordance with the following expression: Integer x = roundup ( (TBC-BSN' -1) /NTS) CV = X, if x<= BS_CV_MAX 15, otherwise where : CV: counter value inserted in each data packet DP before transmission; TBC: total number of data packets DP present in the transmitter queue TR-QUE; NTS: transmission resources RES defined as a number of time slots (multislot capability NTS) in a single frame used for data packets DP transferred on the uplink connection with range 1 to 8 ; BSN * : absolute block sequence number of the RLC data block with range from 0 to (TBC-1) ; BS_CV_MAX: a parameter broadcast in the system information; and roundup: rounds upwards to the nearest integer. According to the standard, once a mobile station MS transmits a value of CV other than 15, the mobile station shall transmit exactly (TBC-BSN 1 -1) not transmitted RLC data blocks. In other words, a countdown procedure is started, which leads to the release of the physical connection TBF. In particular, in context with real-time applications, this can cause an unnecessary release of the physical connection TBF and therefore can introduce an unnecessary delay. Any data that arrives from the higher layer after the commencement of the countdown process shall be sent within a future physical countdown TBF. Also without focusing on the countdown procedure, ' the normal resource assignment results in an unnecessary physical connection TBF release as shown in Fig. 4c. The transmitter queue information setting means CV-SET always determines at a certain time the number of data packets which remain when the present data packet is transmitted to the network side. Since for example in step ST4cl the network side transmission resource scheduler SCH-RES had assigned two time slots 2TS (because the mobile station is a multislot capability 2 mobile station) the first data packet transferred in step ST4c2 receives a counter value CV = 2 (CV = roundup [(4-1) /2] = roundup [1.5] = 2) . Likewise, the second data packet receives a counter value of CV = 1 (CV = roundup [(3-1) /2] = roundup [1.0] = 1. The assignment of two timeslots and the transmission of data slots with the respectively calculated counter value CV is continued in Fig. 4c in steps ST4c3, ST4c4, ST4c5 and ST4c6. In Fig. 4c a multislot capability 2 mobile station and an application generating a new data packet every 30ms was assumed. However, also for the general case the calculation of the counter value CV and the transmission of the data packets is the same. That is, in a multislot capability x transmission maximum x timeslots are used for transmission as assigned beforehand by the network side NS and each of the x data packets have a corresponding counter value CV. Furthermore, it should be noted that of course the transmission of the data packets by using timeslots can also be different. For example, each data packet can be distributed over the plurality of timeslots and can be reassembled on the network side NS . Still, after reassembly in the network side NS the respective counter value CV will indicate whether there are any further packets in the transmitter queue TR-QUE or not . As shown in Fig. 5, for the release of an uplink physical connection TBF, at a certain stage in step ST5al a RLC/MAC data packet containing a counter value CV=0 will be transmitted to the network side. The counter value CV=0 in a packet clearly indicates an empty queue to the network side after transmission, i.e. CV=0 indicates that there are no further ^ 'remaining * ' ' data packets in the queue after the transmission of the data packet containing CV=0. In this case the network side will first transmit a so-called packet uplink acknowledgement/negative acknowledgement message in step ST5a2 incorporating a final acknowledgement indicator = 1 to the subscriber terminal side. The message in step ST5a2 is to indicate to the subscriber terminal side that the network side has understood that no further data packets are residing in the subscriber terminal side transmitter queue and that an uplink TBF release procedure is to be started. In step ST5a3 the mobile side sends a packet control acknowledgement message to the network side after releasing the physical connection TBF on the mobile side. Finally, after receiving the message in step ST5a3 the network side performs the release of the physical connection on the network side. As can clearly be seen, a certain time is needed to release or terminate the physical connection for the uplink and furthermore signalling resources are occupied in the network. SUMMARY OF THE INVENTION As explained above, during a data packet transfer between the subscriber terminal side and the network side several conditions may occur which lead to the transmission of a transmitter queue information to the respective other side indicating an empty queue in the respective transmitter queue TR-QUE. This results in frequent releases of the physical connection with the subsequent need of additional signalling to rebuild the physical connection whenever new data packets are available in the transmitter queue. There may be many reasons why the transmitter queue becomes empty, i.e. if the removal rate of the data packets from the transmitter queue varies and is potentially higher than the rate of the arriving packets (see Fig. 4a) . As shown in Fig. 4c, another condition which may lead to a physical connection release is if too many packets are taken away from the transmitter queue if for example in a multislot capability 2 mobile station two time slots (transmission resources) are assigned and only two packets are available in the transmitter queue. During the next data packet transfer to the network side, using two time slots on the uplink, the transmitter queue TR-QUE thus becomes empty leading to a corresponding indication CV = 0 which starts the physical connection release procedure. Even when a next packet arrives (as the packet arriving at the dot-dashed line in Fig. 4c) there will first be a physical connection release and thereafter immediately a physical connection establishment due to the new data packet. Such frequent establishment and release of physical connection drastically increase the end- to-end delays. The inventors have discovered that the increased end-to-end delay during a data packet transmission is due to the fact that conditions in the subscriber terminal side or the network side may lead to empty queues in the subscriber terminal side and thus to frequent physical connection releases consuming time and signalling capacity. Therefore, the object of the present invention is to provide a network controller, a method, and a communication system in which empty subscriber terminal side queues leading to unnecessary physical connection releases during a data packet transfer from the subscriber terminal side to the network side are avoided and the delay time is reduced. h-x φ 3 CQ rt tr 0 l-h CQ SD μ- Pi rt ii SD 3 03 3 p. rt rt Φ ii A a Φ a μ> φ cn -. SD a Ω-. a subscriber terminal side transmitter transmitting in association with each data packet from said transmitter queue said length information to the network side; and on said network side: a network side receiver for receiving said transmitter queue length information transmitted from a subscriber terminal; and a network side transmission resources controller for assigning to a subscriber terminal (SS) transmission, resources for the data packet transfer on the uplink connection on the basis of said received length information such that during an active data packet arrival period in which data packets arrive in said transmitter buffer at least one data packet remains in the subscriber terminal side transmitter buffer queue. Furthermore, the object is also solved by a method (claim 26) in a communication system for performing packet data transfer on a connection between a subscriber terminal side and a network side wherein during a data packet transfer a physical connection is maintained which indicates in the subscriber terminal and the network side that the subscriber terminal and the network side are valid for performing said packet data transfer comprising the following steps : determining on a subscriber terminal side a transmitter queue length information in accordance with the length of said transmitter queue in said subscriber terminal ; transmitting in association with each data packet from said transmitter queue said length information to the network side; receiving said transmitter queue length information transmitted from said subscriber terminal; and assigning to said subscriber terminal transmission resources for the data packet transfer on the uplink connection on the basis of said received length information such that during an active data packet arrival period in which data packets arrive in said transmitter buffer at least one data packet remains in the subscriber terminal side transmitter buffer queue. According to the invention the length information transmitted from the subscriber terminal is used on the network side in order to determine the transmission resources for the next uplink frame such that after transmitting the next uplink frame at least one data packet is left in the subscriber terminal transmitter queue during an active period in which data packets arrive in the transmitter queue. Therefore, it is ensured that he last data packet in the uplink frame contains a length information which indicates a non-empty queue (since still at least one data packet is left in the transmitter queue during the active period) . Therefore, the physical connection release procedure is not initiated in an active period. Preferably, a subscriber terminal side transmitter queue length information setting means is adapted to set as said length information a counter value determined in accordance with the following expression: CV = round up [ (TBC-1) /NTS] where : CV: counter value transmitted to the network side; TBC: total number of data packets present in the transmitter buffer; and NTS: transmission resources defined as the number of time slots (multislot capability NTS) in a single frame used for the data packet transfer on the uplink connection. Preferably, the network side transmission resources controller decreases the transmission resources between a current transmission frame and the next transmission frame on the uplink connection i"f the length information indicates that the transmitter queue contains only one data packet. If a multislot capability 1 subscriber terminal is employed, then the length information indeed indicates the exact number of left data packets. However, if a subscriber terminal of a higher multislot capability (e.g. 2, 3, 4 etc.) is used, then the counter value (length information) having a value of 1 can indicate 1, 2 or more data packets in the transmitter queue . Preferably, a physical connection terminating device is adapted to terminate said physical connection when a CV evaluation means determines that at least one of said counter values has a value of CV=0. Preferably, the resource controller is not only capable to decrease the transmission resources in order to have only one data packet present in the transmitter queue, but it can also increase the transmission resources (timeslot) if an increasing number of data packets is detected in the transmitter queue. It is not always the case that the removal rate from the transmitter queue equals the arrival rate of data packets in the transmitter queue, e.g. it may happen that suddenly at a certain time point the transmitter queue is flooded with data packets which can be removed only slowly by using a small number of transmission resources. Therefore, in such a case the transmission resource controller increases the transmission resources such that a maximum number of data packets are transmitted in one uplink frame whilst of course the increase in the transmission resources is such that still one data packet remains in the transmitter queue even if more resources are allocated. Therefore, further preferably, said network side transmission resources controller assigns the maximum admissible number of time slots when said CV evaluation means determines that all presently received counter values have a value of CV>1. Further preferably, when said CV evaluation means determines that at least one counter value has a value of CV=1 and at least one counter value has a value of CV>1, said network side transmission resources controller assigns a new number of time slots NNTS in accordance with the following relationship : NNTS = NTS - NO(CV=l) where NNTS is the new number of time slots for the next uplink frame, NTS is the multislot capability of the subscriber terminal and NO(CV=l) designates the number of counter values having a value of CV=1. Further preferably, when said CV evaluation means determines that all presently received counter values have a value of CV=1, said network side transmission resources controller assigns a minimum number of time slots. Preferably, said minimum number of time slots is one time slot when the arrival rate of data packets into the transmitter buffer queue is higher or equal than the removal frequency of data packets from said transmitter buffer queue. Preferably, an arrival rate estimator is adapted to estimate the arrival rate of data packets into the transmitter queue on the subscriber terminal side on the basis of the received counter values received within a measurement time interval. Preferably, the transmission resources are further assigned on the basis of the estimated arrival rate. Preferably, said minimum number of time slots is adjusted on the basis of the estimated arrival rate. Further advantageous embodiments and improvements of the invention can be taken from the other dependent claims. Furthermore, it should be noted that the invention is not restricted to the examples and embodiments described in the description and claimed in the claims. In particular, the present invention comprises embodiments which result from a combination of features and/or steps which have been separately described and/or claimed. Therefore, the skilled person can carry out variations and modifications at the teaching disclosed here and all such modifications and variations are considered to fall within the scope of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 shows a principal overview of a GPRS network architecture; Fig. 2 shows a typical GPRS protocol structure; Fig. 3 shows a subscriber terminal side and a network side in accordance with the prior art; Fig. 4a shows a schematic example of a physical connection handling problem, when the transmitter queue becomes empty; Fig. 4b shows the typical packet data traffic shape according to the G.723.1 speech coder; Fig. 4c shows the emptying of a transmitter queue with a static assignment of resources from the network side; Fig. 5 shows the release of an uplink physical connection according to the prior art; Fig. 6 shows a principal block diagram of a subscriber terminal side and a network side according to the principle of the invention; Fig. 7 shows a flowchart for determining transmission resources according to the principle of the invention; Fig. 8 shows the adjustment of the transmission resources (timeslots) in accordance with the embodiments of the invention; Fig. 9 shows an example of decreasing the number of timeslots for illustrating the procedure in Fig. 8 for a multislot capability 2 mobile station when the transmission rate and the arrival rate are equal (1/20ms) ; Fig. 10 shows a continuation of Fig. 9 for the case when the application stops producing data packets and a TBF release is started due to CV=0; Fig. 11 shows the steps in Fig. 9 and Fig. 10 in combination for a fixed data packet arrival rate of 1/30ms ; Fig. 12 shows a similar example as in Fig. 11 but for the adjustment of the number of timeslots for a multislot capability 4 mobile station where again it is assumed that there is a constant rate arrival of data packets into the transmitter queue; Fig. 13 shows an example similar to Fig. 11 for a multislot capability 1 mobile station where again it is assumed that a constant arrival rate (30ms) of data packets into the transmitter queue is present and where the removal rate (transmission rate) is assumed to be higher than the arrival rate; and Fig. 14a shows an example of decreasing the number of resources for a multislot capability 3 subscriber terminal without using the steps ST82 ' ' and ST83 ' ' in Fig. 8; Fig. 14b shows an example of decreasing the number of resources for a multislot capability 3 subscriber terminal with using the steps ST82 ' ' and ST83 ' ' in Fig . 8 ; and Fig. 15 shows another embodiment of the invention for estimating the arrival rate of data packets in the transmitter queue on the network side. In the drawings the same or similar reference numerals denote the same or similar steps and parts throughout. However, it should be also noted that the invention can comprise embodiments which consists of combinations of the respective flowcharts and block diagrams and that the invention is not limited to a separate consideration of the separately described and illustrated embodiments. PRINCIPLE OF THE INVENTION Fig. 6 shows a principle block diagram of the functionalities incorporated in particular on the network side as well as on the subscriber terminal side according to the embodiments of the invention. In addition to the devices already explained with reference to Fig. 3, the network side NS comprises a network controller NC according to the invention. A network side receiver NS-RC is provided for receiving the data packets and the transmitter queue length informations CV transmitted from a subscriber terminal SS in association wit the data packets. The length information CV indicates the length of a transmitter queue in a transmission buffer TR-BUF in the subscriber terminal SS and the value of the rt tr Φ 3 a- rt μ- CQ -x 0 rt Ω SD TJ SD tr μ- h- χ μ- (T 0 l-h rt tr Φ i- LO ii Φ CQ TJ Φ Ω rt μ- <! φ Q a tr 01 Ω ii μ- tr Φ hi terminal (e.g. if the subscriber terminal can transmit on two timeslots at the same time, two timeslots will be reserved if the traffic load in the network allows to do so) , according to the invention the network side transmission resources controller NC assigns to a subscriber terminal transmission resources for the next TDMA frame on the uplink connection frame UL on the basis of said received length information CV. More particularly, the resources controller SCH-RES controls the available transmission resources in such a manner that during an active data packe't arrival period in which data packets arrive in said transmitter buffer at least one data packet DP remains in the subscriber terminal side transmitter buffer queue TR-QUE of the transmission buffer TR-BUF. That is, in an active period in which actually data packets generated by an application arrive in the transmitter buffer the network controller adjusts the resources such that at least one data packet is available in the transmitter buffer queue to be transmitted to the network side in the next uplink frame. The active period is a period in which actually no physical connection release is desired from the network side or the subscriber terminal side, i.e. in this period the application continuously generates data packets which arrive at the transmitter buffer and which should be transmitted to the network side without an unnecessary and undesired physical connection release. An active period can for example be determined by evaluating the inter-arrival time of data packets arriving on the subscriber terminal side and determining an active period as period in which all inter- arrival times are lower than a predetermined threshold. Such an example is e.g. described in the European patent application Nr. XX XXX XXX filed by the same applicant as the present application on the same date which is herewith incorporated in the present application via reference. Alternatively, it is possible to determine an active period simply by periodically, e.g. every 30ms, checking the s tr φ j φ •• capabilities of a higher order there is only a setting in accordance with the number of data packets due to the roundup process. In step ST72 the subscriber terminal transmitter SS-TR transmits the length information in combination with the data packet to the network side controller NC using the currently assigned resources.. The length information CV can be transmitted (e.g. on a separate channel) synchronized to the transmitted data packet and preferably the length information CV can be incorporated in a part of the data packet, for example in the header of the data packet . In step ST73 the network side receiver NS-RC receives the length information CV and in step ST74 the network transmission resources controller SCH-RES determines the transmission resources for the next uplink frame. As indicated in step ST74 in Fig. 7, the network resources controller SCH-RES can actually decide to decrease or increase or keep constant i.e. to adapt the transmission resources for the next frame. The determination in step ST74 is made in accordance with the length information such that at least one data packet remains in the subscriber terminal transmitter queue TR-QUE during an active data packet arrival period in which data packets arrive in said transmitter buffer queue . In step ST75 the network controller NC assigns the resources determined in step ST74 to the next uplink frame and informs the subscriber terminal of the newly assigned transmission resources by a corresponding flag in a downlink packet or by a signalling information. This is shown, e.g. in step ST4cl, ST4c3, ST4c5 of Fig. 4c. It should be noted, that preferably the network side transmission resource controller SCH-RES adapts (see step ST84 to be discussed below) e.g. by decreasing the X Pi Ω en rt rf rf CQ rt Φ tr 3 Ω rt r cn α μ- 3 Ω SD SD 03 P. Pi TJ SD SD rt φ hj SD 0 h3 μ- tr H tr a tr 3 Φ a SD X μ- 3 PJ ti 3 h- 1 Φ SD ti Ω a O Φ SD SD rt 3 ϋ SD SD rt 3 -J CΩ Φ i Φ Ω Φ TJ Ω TJ Φ 3 00 rt 0 rt X CQ t r hi hj Ω rf Ω Pi SD SI 3 SD rt Φ>. • 3 tr rt SD D ** SD φ SD 3 rt Φ rt Φ μ- μ- Φ ti Pi 3 φ Φ ii • rt CQ rt a a Φ tr 3 CQ - X ii <l <! Pi Φ Φ Φ rt 03 hi • TJ 0 00 ti 3 i SD Φ 01 hi μ- SD h- TJ rt Φ 3 SD μ- SD a £ Φ Φ rf ) SD J rf SD 3 3 SD M 3 rt rt φ X 0 rt SD X SD TJ X X rt 03 P 01 Φ μ- 0 ■** d Ω 3 CD a CQ 3 : > tr O μ- μ- rt 0 Ω φ rt rt μ 1 φ μ- SI SD SD μ- Ω μ- rt 03 o W Φ X CQ CQ 03 φ 0 Φ rt (T 3 03 π ti μ- μ- ii 3 SD rf 3 3 03 ti Φ ϋ 03 0 a 3 μ- 3 X ti 0 ^ a tr φ rt SD <! 3 φ rt TJ CΩ Φ P. O φ μ- rt rt rt s μ- 0 μ- rt W r 0 rt • 3 Φ rt ii 3 Φ ? 03 i rt ) rt μ- 3 X o tr Φ 01 cn Φ 03 rt 3 rt Φ hi μ- 0 W SD 03 .Y SD X Ω 0 Ω Φ r 3 Φ X Ω TJ rt rt 3 Ω SD 3 3 K 3 H Pi - 3 3 *< Hi Φ μ- TJ Φ .V Hi -—. SD SD Ω K rt φ ϋ φ rt O 3 SD Φ 0 a μ- CQ μ- hi Φ P. SD Φ CQ (T rt ti p. 3 a cn X ti a ii a CQ 3 01 $. 3 rt CQ rt 3 rf SD TJ Ω rt rt rt φ Φ Φ ti φ SD TJ li W t-3 Φ ti rt rt 3 -- h-x φ o ** tr Ω tr μ- rf p. 3 μ- rt ?r i 01 ii φ 03 3 SD 01 rt hi Dd 00 Λ μ- Λ tr hi μ- O < Φ Φ a Φ rf Φ Hi Φ 3 ii Φ 5^1- SD CQ a O SD Φ Φ cn Ω a 3 a SD 0 ct rf rt φ ii CQ 3 rt hj CΩ SD rt 3 0 3 oi rt rf CQ - 03 a a 0 Φ CΩ Φ rt rt hj 03 hi 3 Φ SD 3 3 CD 3 ω rf X a 1 3 ϋ TJ rt ϋ rt 3 a a h-x Φ SD 0 Φ φ μ- ϋ Λ 0 rt 03 SD 3 3 Φ SD μ- Ω ) μ- h-x Φ X rt Φ SD φ SD φ hi 3 rt X Pi rt a h-x a X 3 ii μ- rt μ- J rt μ- 01 φ Ω ti SD Φ Φ • Ω rt hi 03 0 μ- rt A Φ SD Φ μ- ti rf X 03 3 03 01 t 3 rf PI Λ 3 rf rt tr SD a a ti Pi rt μ- rt Φ 03 cn rt Hi μ- Φ rt rt ω 3 rt μ- I- * ≥i a μ- rt μ- a Φ Φ Φ CΩ 3 rt <! Φ μ- ι-3 X O O tr rt tr hi Φ CQ <! rt φ Ω Φ 01 X 3 3 TJ 03 a - φ Ω φ SD a Φ SD i 3 0 Φ ti a Φ 03 φ SD SD rt φ a 03 Φ SD φ 0 0 φ O 3 hj h-> Φ 3 to 3 r 3 h-x £ 0 hi 03 μ- Φ μ- *** <. μ- S 3 3 o ** Λ X - rt P ) • ≤ Ω 03 h- 1 0 TJ rt 3 0 3 03 3 — • 3 μ- o a TJ φ tr TJ a rt ii - ϋ rf hj φ rf < 3 ti Φ ct Ω Ω 3 SD a I- * .V SD 03 li h- 1 ti a φ Φ Φ SD μ- SD φ tr μ- Ω rf ϋ tr O ti 0 X 0 o rt X Φ Hi ti rt μ- φ a a 03 rf 3 O 3 tr 2 i--. Φ < < 3 Φ 3 ii μ- rf rt tr Φ h-x Φ φ rt O Hi μ- φ TJ 0 O 03 3 Φ SD rf w φ 0 Φ SD TJ Φ 3 03 ti Φ 03 O X hi. Φ Φ 0 h-x a 3 Ω -x Φ < μ- Pi 3 oi CQ a tr SD $, SD ti Pi 3 μ- ti tr μ- 0 O < a Pi SD i hi 01 Φ P, φ Φ O 3 Φ P 3 3 CQ φ 3 O • rf φ 3 Ω φ rt 3 Ω Φ -x Φ φ X SD oi rt a Φ Φ a Φ ii TJ μ- Λ μ- <! ; * v φ rt μ- a < 03 a 01 0 rt rt Φ ii 3 TJ T a h- 1 Φ 3 a 3 Φ 03 P. Φ SD CT hi 5D 3 φ rt 0 pi rt h-- Ω a o Φ Ω CT * CQ rt φ 3 φ Φ H H μ- hj rt X ii h-x I 03 ti a a tr * -<-. Φ l-" 03 a O Φ Φ X P ) •tj 03 a €, α .---. 03 Φ Φ a ti rt SD ϋ Q> TJ TJ φ CD rt CQ Pi 3 ii SD μ- rf r h-x Φ X tr rt Ω lP h-> Φ Φ tr SD a 3 Ω SD h-x SD μ- * μ- μ- 3 (T 3 Hl P ) 0 - μ- φ ^ μ- a a Φ a rt CQ Φ 03 CQ Φ rt μ- Ω ti 3 , — , 03 tr 3 Φ 0 0 (T Ω Ω 3 03 Φ i TJ μ- 03 3 3 ■ x Φ tr rf h-x CΩ Ω rf (T TJ r 03 tr tr o φ 03 a CQ rf ) 3 TJ 0 μ- Pi X Φ 03 Φ μ- 0 φ r μ- tr tr SD tr 3 ii 03 Φ φ rt μ- ti ti Ω hi Ω 03 Φ TJ rt 0 hi 3 rt 0 μ- SD 3 Φ φ Ω Φ Ω i φ SD C 3 SD φ O Φ H- 03 rt SD a Φ Φ rt 3 O < Ω .V O Ω SD 03 3 O Ω O 3 ti 03 fD μ- Φ Ω j SD i hh CQ Ω O 3 SD H SD ϋ Φ Λ 3 0 rt Φ rt tr 0 3 03 i TJ φ rt 0 H .V SD CΩ Ω 0 rt •* μ- Φ ti Φ rf a 03 a p) φ 03 Φ 3 Φ Ω 3 Φ O 3 Φ 3 3 Φ 3 Pi Φ ii O TJ μ- X SD ϋ 3 CQ Φ rt rt 3 SD rt O μ- SD hi rt i μ- rf Φ μ- 03 Φ rt SD 3 Φ Φ $D 03 μ- O a SD ti TJ J Ω 0 i a 3 03 SD hi 3 3 03 tr Ω • tr φ <! μ- Φ 3 P ) SD rt rt ) ^ μ- TJ 3 CQ £ S Φ i SD 0 — * μ- ti 3 CΩ SD SD CQ . rt CQ Ω • • : 3 h-x Φ Φ ,— - -x I- 1 rf a < μ- Φ TJ μ- CQ rt j i 3 TJ h-x Φ a f P ) SD • 03 μ- Ω O ii P. rt 0 μ- hi Φ ii 3 μ- SD h-x CQ SD h Φ P. h-x μ- 3 rf 3 0 μ- 3' a 0 μ- 3 * - Φ SD rt 03 rt rt Φ ti ti O rt rf a h-x h-x H O ? μ- 3 μ- 3 ϋ 3 < SD ^ ^ φ μ- 0 Φ SD SD SD ii O 03 ti < < SD tr 3 0 3 SD Ω SD μ- rt φ CQ rt rf μ- μ- tr Φ P. 3 ti rt -x φ 03 h-x 3 0 hj SD CT h-> 03 01 Φ Φ rt SD 3 3 SD SD tr rt I- 1 03 rt 01 SD LΩ X 0 Φ rf SD tr CΩ SD φ rt μ- r 3 Φ X φ μ- t SD φ rt rt Φ 0 tr φ .V 0 P ) Φ Φ TJ 3 μ- h-x μ- TJ Hi -x SD φ 3 3 3 φ 3 ω Φ headers of the data packets. Depending on the multislot capability, one, two or more CV values can be read. In steps ST82... ST85 the transmission resource controller SCH-RES carries out a determination as to how many timeslots should be used in the next uplink TDMA frame on the basis of the CV value or CV values read in step ST81, i.e. on the basis of the read CV value (s) the network side transmission resources controller SCH-RES decreases or increases or keeps constant the time slots for the next uplink TDMA frame. In step ST82 it is checked whether at least one CV value is CV = 0. If at least one CV value is CV = 0 then this indicates an empty queue and in step ST83 a physical connection (TBF) release procedure is carried out in step ST83, for example in accordance with Fig. 5. If there is no CV value satisfying CV = 0 ("N" in step ST82) then step ST82 ' is carried out. In step ST82 ' it is checked whether at least one CV value is CV = 1. If so ("Y" in step ST82 ' ) then this indicates that there is danger that only one data packet is left in the transmitter queue. Of course, only for the multislot capability 1 (one timeslot per TDMA frame) this will indicate the actual number of data packets left, that is only one data packet; for a higher multislot capability this may indicate one or more data packets left. Preferably, in step ST82 ' ' it may also be checked whether at least one CV value is CV > 1. If there are no CV values satisfying CV > 1 ("N" in step ST82 ' ') then all CV values will satisfy CV = 1. As a safeguard measure in step ST84 therefore the transmission resource controller SCH-RES assigns only a minimum number of time slots in step ST84. The minimum number of time slots may be only one time slot or even zero time slots depending on the arrival time. As will be explained below with respect to an estimation process (Fig. 15) there may be a case where actually the removal rate is higher than the arrival rate of data packets such that after removing one data packet from the transmitter queue no further data packet may arrive in the queue. In this case the transmission resources must be reduced to zero in the next uplink frame since otherwise an emptying of the last remaining data packet in the queue may occur thus causing a TBF release. In step ST83 ' ' the -transmission resources controller SCH-RES determines the new number NNTS of time slots for the next uplink frame in accordance with the following relationship: NNTS = NTS - NO(CV=l) where NNTS is the new number of time slots for the next uplink frame, NTS is the multislot capability and N0(CV=1) indicates how often a counter value of CV=1 was received in association with data packets transferred from the terminal side in the last uplink frame. It should be noted that steps ST82 ' ' , ST83 ' ' are provided in order to avoid that too many data packets reside in the transmitter buffer. However, it should be understood that these two steps are optional and that Fig. 8 is to illustrate the reducing and increasing of transmission resources dependent on the counter value CV. and that steps ST82 ' ' , ST83 ' ' are only preferred examples in order to more rapidly reduce the number of packets in the transmitter queue. On the other hand, if in step ST82 ' it is determined that all counter values CV satisfy CV > 1, this means that there are a sufficient number of data packets in the transmitter queue to allow to set in step ST83 ' the maximum number of time slots possible depending on the multislot capability. Thus, step ST82 ' and step ST84 make sure that during the controlling and determination of transmission resources at least one data packet remains in the transmitter queue during an active data packet arrival period in which data packets arrive in said transmitter buffer queue. Thus, the end-to-end delay can be minimized and at the same time the removal rate of data packets can be maximized, since there is a variable adjustment of the transmission resource allocation dependent on the current length of the transmitter queue. The above described procedure and the examples below should only be taken as an illustration how an adjustment of the transmission resources can be made if it is assumed that each data packet occupies a single timeslot on the uplink frame. However, a skilled person can determine other reductions and increases of the transmission resources if the data packets are differently distributed over several timeslots on the uplink frame, e.g. because of a segmentation, i.e. if a single application data packet is distributed over more than one RLC data packet . EXAMPLE 1; MULTISLOT CAPABILITY 2 DECREASE Fig. 9 shows an example how the adaptation of transmission resources makes sure that during an active data packet arrival period in which data packets arrive in said transmitter buffer queue at least one data packet remains in the transmitter queue TR-QUE using the procedure of Fig. 8. In the example in Fig. 9 it is arranged that three data packets remain in the queue. In Fig. 9 it is assumed that the mobile station has a multislot capability of two timeslots. Furthermore, it will be appreciated that the number of remaining data packets in the transmitter queue will depend on the fact whether or not the removal rate of data packets equals the arrival rate of data packets, e.g. from a real time application. In Fig. 9 it is assumed that the real time application generates a single packet at a generation (arrival) rate of 1/20 ms . In the shown scenario, each 20 ms data packets can be transmitted from the queue via assigned resources. Furthermore, in Fig. 9 it is assumed that the application PDU results in exactly one RLC PDU, i.e. no application data packet segmentation occurs. Furthermore, in Fig. 9 it is assumed that the establishment for a physical connection TBF requires 150 ms, i.e. a time interval in which potentially 7 additional data packets may arrive in the transmitter queue (i.e. one packet which triggers the TBF setup and 7 further packets which arrive subsequently at a l/20ms arrival rate) . In step ST91 a first data packet in the transmitter queue triggers the TBF establishment. Since the TBF establishment takes about 150 ms, the before mentioned 8 additional data packets have arrived in the transmitter queue. Since no data packet has yet been transferred with a counter value CV (and thus no resource re-adjustment was possible) , the network side (the base station system BSS) assigns the two (maximum number of) timeslots 2TS in step ST91. In step ST92 two of the 8 data packets will be transferred on the two timeslots with a counter value of CV = 4 and CV = 3 , respectively. Since in step ST92 no counter values CV fulfil CV = 0 and since all counter values CV are larger than 1, i.e. CV > 1, the network side assigns in step ST92 still the maximum number of 2 timeslots TS in accordance with step ST83 ' . Since it is assumed in Fig. 9 that the removal rate (not the transmission rate which is different to the removal rate (removal frequency) for terminals with a multislot capability greater than 1; in Fig. 9, for example: 2TS assigned -> 2 packets/20ms -> 1 packet/lOms whilst the removal rate determining whether the queue will be emptied or not is l/20ms) of data packets from the transmitter buffer is twice the arrival rate of data packets, in step ST93 there will be again available seven data packets = (8 - 2 transmitted data rt SD tr ι-3 rt 03 Φ rf SD TJ rt ,_-. cn rt Ω rt rt rt Φ H O 03 rt rt CQ μ> SD t-3 tr en rt LO rt TJ μ- I- 1 Φ tr tr rt X H Ω SD hi ϋ μ- μ- ϋ μ- X >Q 3 3 rt X μ- rt • 3 tr Φ 1-3 X • s P ) 3 I- 1 CQ Φ ii Φ Φ SD rf Ω SD Φ 3 3 p ) 3 j a Φ Φ Φ 3 Φ 01 φ VD Φ SD 0 Ω Φ μ- Φ SD Ω 3 a .V 3 Pi Ω Φ II 3 φ Φ SD CQ TJ Φ TJ • s H 0 CO 3 X 1 03 Pi 3 TJ Φ P. a 03 SD Φ 01 a φ ω 01 01 Φ rt rt CD 03 & Φ Φ 3 • 3 Pi P. Φ -x SD 3 hj • rt 3 h-> rt 3 Ω h-> H 3 !-• Φ p. CO Ω h-> en O hi Hi I- 1 SD SD rt 0 rt μ- 0 Pi Φ μ- h-> μ- μ- 0 O • μ- O Pi ti TJ 3 H Φ O 3 φ 0 ^ ι-3 X rf rf 03 rt SD 3 Ω SD 03 {X rt •* ; X rf 3 3 rt rt rf i Φ Φ VD 3 rt 00 Φ Pi ti tr μ- tr SD - — 03 iQ Φ rt rf rt SD rt CΩ Φ t-3 rt r 3 en 03 SD u> - Φ Hi φ 3 Φ TJ Pi SD pi SD Φ SD cn φ X Φ 1 SD o ι-3 ii μ- - $ •« O φ a ti TJ + SD a rt 3 j lΩ ii rf Pi t-3 Pi H <! Ω O rt μ- 3 - μ- μ- a T3 3 Φ SD en Ω SD ti TJ Φ Pi SD SD X SD cn hi en TJ SD rt X O rt rt μ- ti ti Hi Ω O .V 03 Φ SD lP μ- hi >Q Φ rt Φ SD SD h- Φ SD SD X 3 O TJ 0 .V 3 SD Φ Ω SD rt a 3 hj a SD μ- Hi CΩ μ- Ω rt M O Ω ti tr P. Ω o ti Φ φ 03 rt 3 μ- Hi tr φ μ- Φ 3 03 0 SD 03 .V Hi Z i rt 3 Ω Φ SD = 03 SD Φ 03 Φ rt CQ SD 3 Φ rt φ a SD <! a a TJ ti μ- Φ ii 0 en ti O ω rt rt i 01 ω 3 TJ 3 rt Φ Φ <! φ φ g- SD SD Φ 3 SD rt Φ SD 03 ii O p Φ SD a μ- SD φ 0 < • -< ^ CQ ti rt • 0 ) Pi Ω CQ - <! 03 Λ Pi μ- 3 CT Pi TJ SD TJ j tr CΩ Ω £. CQ μ- μ- ti μ- rt φ CQ μ- SD a SD 01 03 Φ SD rt h-> 03 TJ Φ -x SD S" CQ rf rt CQ μ- CQ SD t-3 p. 0 ii Φ μ- p. 3 μ- μ- Φ rt 3 TJ 3 μ- hi μ- cn SD φ μ- 3 Pu μ- tr μ- 3 (T 3 tr SD 3 rt CΩ 3 α h- χ 3 a SD SD μ- Ω O φ 3 t-3 Ω Ω 3 SD tr 3 Φ CQ Φ tr rf O 3 μ- P ) Ω 01 03 cn Φ 3 p ) Ω VD ? SD a tr rt l- 1 Ω φ vo rt •a 3 ii h-> rt $. Hi tr φ SD Ω tr rt ' T 03 03 H SD ϋ φ ft * Φ H a rt φ SD φ < CQ X μ- φ φ tr 0 ) P-. Ω SD h-x X i p. μ- VD I-" > < rt ii X Ω Φ en 03 Hi Φ hi 03 Ω rt φ Φ Ω CΩ O p. •~ O SD CQ μ- Φ rf TJ P ) V o SD t-3 03 0 rf i Φ μ- O μ- μ- ■ x 3 3 CT tr 3 Φ Φ hj P ) hj rt 3 rt VD μ- ti tr 3 SD 3 tr 3 ti 3 μ- rt 3 Φ φ h-x X X Φ Φ Λ 03 hi tr P ) Ω φ M 01 ii C 0 Φ ti φ rf SD Φ Pi CΩ 3 ti rt P hi Φ 0 Φ a Φ SD 3 ;v tr SD 3 - Φ SD SD μ- Φ CQ SD ) CQ CQ • Φ SD 03 £ a Ω φ Hi O O CQ 03 Φ SD SD H φ 3 * ≤ Φ 3 3 3 rt 3 SD 03 3 rf 03 Pi rf φ O 03 rt a Hi Φ Hi 03 hj en 03 μ- Pi rt T μ- Φ Ω rt CQ Φ X o CQ Φ <! Φ a rt Φ CQ Φ 03 3 rt Φ CQ Pi μ- SD 3 rt TJ Φ Ω Φ 3 TJ SD a TJ Φ X a μ- μ- a CT 03 hj μ- SD a μ- X CQ SD SD 3 P CΩ ϋ O TJ μ- <J hi rf ii T rt 0 3 a $ rt hi CΩ hi 03 3 rt 0 μ- rf φ .V SD en £ a rf en Φ Ω O en h-x φ a rt 0 fD Φ X 3 Φ 3 rt Ω a 3 SD Φ P 3 3 μ- a cn rf H Φ ι-3 ) ϋ rt μ- rf Pi Φ φ Ω TJ SD Φ 0 ϋ rt SD 03 VO rf rf i-3 Φ vo tr 03 rt oo rt μ- μ- tr h- 1 rt μ- ii i Φ 0 ii ϋ a Ω CQ TJ μ- CO rf Hi ( * l tr Φ so ii en Φ tr tr 3 <! 3 φ μ- O S Φ μ- 03 μ- rt φ rt SD 3 - — SD Φ • ti cn Φ P ) φ Φ Φ SD μ- 3 3 μ- Hi μ- < CQ N • P μ- Φ Ω ii 03 & rt a hi O 03 rt 3 Φ rt O 3 φ μ- Φ a 3 SD T .V 03 P TJ ti rf < O a X Φ 03 ii CQ a CT t CQ w X H Pi tr i Φ a h-x Φ rt a SD Φ Φ SD 3 Φ Φ -rf i φ rt Φ φ i 03 -x • Φ rf a 0 en rt Φ Pi Ω Pi TJ h-x Φ a ii li Pi 3 S rt tr TJ 3 rt O CD Ω ~ tr Φ SD Φ a 0 ι-3 03 TJ ?r a Φ Φ SD Φ φ μ- rt P Ω 03 Φ rt rt O Φ rf 03 • 03 Ω 00 SD φ μ- en Φ • a Ω rt μ- rt < en 3 TJ 01 Φ μ- en rt a μ- X SD SD vl≥. 3 t-3 SD S CQ ti ti X 3 1-3 μ- 3 Cn w a 3 3 Φ hj Hι > rf 3 ι-3 Hi 01 co 0 rt cn μ- Hi Φ Φ CQ CQ 01 oo rt rt φ 3 Φ 0 μ- S SO a 03 rf SD μ- Φ SD CQ CQ rt SD CO rt 3 H ω Φ ω X μ * TJ 0 μ- rt cn hi μ- rt 3 h-x hi CQ a ΓT O Φ rt — φ VD en cn ti rr rf p ) SD * ti 3 tr rf 3 Φ O TJ Ω hj Φ I- 1 Φ Hi TJ μ- hi ^ en Φ CQ 03 0 0 Φ rt X TJ 3 SD Φ tr Φ P. rt TJ 01 03 $. p. <! TJ t-3 CQ S <! CQ tr Φ rt Ω Φ Pi rt Hi μ- iQ rt 3 :> Pi D 3 μ- 03 μ- O tr Φ ϋ tr cn • <; O SD Cn X cn μ- a a- μ- h-x en j * * "** SD CQ • Pi Φ φ ti Φ H φ 3 Pi SD 3 μ- ι-3 Φ ι-3 Φ h-x Φ Φ CQ μ * a t-3 * & 3 3 μ- CQ Φ Pi SD 0 rf CΩ 3 . oo OO CQ a hj rt Φ VD ^ Φ H 3 SD C 1 3 K * . SD Pi φ ω CO tr φ φ Φ 01 CO Hi C . a CQ μ- Pi rf Φ μ- μ- O • - — Ω Φ . TJ SD hj 3 hj SD 03 O 3 ---. 3 - - < s CQ Ω (D SD rt φ 3 SD h- 1 μ- μ- 03 CΩ 3 H tr SD Φ rt ^ 3 Hi SD II p. SD Φ Hi Φ O 3 h-x CΩ II μ- If at least one data packet with CV = 1 is received, then only one time slot ITS is assigned in the next TDMA frame, in accordance with rules as listed in Fig. 8. Fig. 10 shows a continuation of Fig. 9 for the case that the application stops producing data packets, i.e. that no further data packets arrive in the transmitter queue. In step ST100 (as continuation of e.g. step ST96) only one timeslot ITS was assigned. Therefore, in step ST101 one data packet is transferred with CV = 1 and therefore step ST84 again sets only one timeslot ITS in step ST101. In step ST102 only two data packets are still available in the transmitter queue and one data packet will be transferred with CV = 1. Again, step ST84 will assign only a single timeslot ITS in step ST102. In step ST103 only one data packet will be left and this single data packet is of course transferred with CV = 0 in step ST103. As indicated with step ST83 in Fig. 8, whenever a counter value CV with CV = 0 is received, a logical connection TBF release procedure is started in accordance with Fig. 5. The procedure of transmitting data packets for a timeslot capability 2 mobile station is illustrated with steps ST94, ST95, ST96 in Fig. 9 and steps ST100, ST101, ST102, ST103 in Fig. 10 is summarized with steps ST110-ST1113 in Fig. 11. The difference is that in Fig. 11 every 30 ms a data packet is assumed to enter the transmitter queue TR-QUE . Fig. 12 and Fig. 13 show two corresponding examples to Fig. 11 for a multislot capability 4 mobile station and a multislot capability 1 mobile station, respectively. EXAMPLE 2; MULTISLOT CLASS 3 DECREASE Fig. 14a is an example for a multislot capability 3 mobile station when the step ST82 ' ' and step ST83 ' ' in Fig. 8 are not used. Also in Fig. 14a it has been assumed that the removal frequency equals the arrival rate of data packets. In step ST14al three timeslots 3TS, i.e. the maximum number of timeslots, were assigned. It is assumed that within the time interval of 150 ms 8 data packets have arrived in the transmitter queue . Therefore, in step ST14a2 three data packets in three different timeslots can be transmitted having counter values CV = 3, CV = 2, CV = 2. Since no counter value CV satisfies the relationship in step ST82 ' , in step ST14a2 once more three timeslots 3TS are assigned. Thus, in step ST14a3 6 data packets = 8 data packets - 3 data packets + 1 new data packet are available in a transmitter queue. In step ST14a3 three data packets with CV = 2, CV = 2, CV = 1 are transmitted. Therefore, the question in step ST82 ■ is answered with "Y" and - since it is assumed in Fig. 14a that step ST82 ' ' and step ST83 ' ' are not present - step ST84 will only assign one timeslot ITS in step ST14a3. Since three data packets have been transferred in step ST14a3 and one further data packet has arrived, in step ST14a4 four data packets are available in a transmitter queue. Since four data packets are available in a multislot capability 3 mobile station and only one timeslot ITS is assigned, a single data packet with CV = 1 (CV= (4-1) /3=1) is transmitted in step ST14a4. It can be clearly seen from Fig 14a that the single occurrence of CV = 1 has caused to only assign one timeslot in step ST84 and thus an unnecessary large number of data packets is still available in the transmitter queue after ST14a4. Fig. 14b shows the decreasing of timeslots for more rapidly reducing the transmitter queue, by using the step ST82 ' ' and the step ST83 ' ' . Steps ST14bl, ST14b2 in Fig. 14b correspond to the steps ST14al, ST14a2 in Fig. 14a. Therefore, in step ST14b3 three data packets with CV = 2 , CV = 2 , CV = 1 are transmitted. However, by contrast to Fig. 14a, it is now decided in step ST82 ' ' that at least one counter value CV satisfies CV > 1 (namely, two counter values CV are CV =2) and therefore, the number of timeslots are assigned in accordance with step ST83 ' ' , i.e. Assignment = multislot capability - number of CV = 1. As indicated in step ST14b3 the new number of timeslots assigned is 3 (multislot capability) - 1 (CV = 1 once) = 2. Therefore, in step ST14b4 there can still be transmitted two data packets (two timeslots are available) and both of them will be transferred with a counter value CV = 1. Since both counter values are CV = 1, step ST82 ' ' will be answered with "N" and therefore, step ST14b4 again assigns only one timeslot ITS. As can be seen from the comparison of Fig. 14a and Fig. 14b, the rule defined in step ST82 ' ' and step ST83 ' ' , namely that if at least one CV = 1 and one CV > 1 then the assignment of timeslots will be the multislot capability minus the number of CV = 1, the speed of reduction of existing packets in the transmitter queue can be increased. Of course, the above examples are only an illustration of how the network resource controller can increase or decrease the number of timeslots for the next uplink frame without emptying the transmitter queue. Therefore, on the basis of the indicated length information (counter value) the transmission controller can increase or decrease or keep constant the number of timeslots such that even in the worst case still one data packet remains in the transmitter queue during an active data packet arrival period in which data packets arrive in said transmitter buffer queue. Of course, it will be appreciated that the increasing and decreasing of the" number of timeslots will be most accurate for single slot terminals because here the counter value CV directly indicates the number of remaining data packets in the transmitter queue. Nevertheless, it is possible by exactly monitoring the CV value of the last packets to increase the precision. That is, even for a multislot class of higher order, the network controller can repeatedly evaluate the counter values CV over several uplink frames and can thus obtain a higher precision about the actual available number of data packets in the transmitter queue. Furthermore, as already mentioned above, the minimum number of time slots to which the resources are set for the next uplink frame may also be zero, for example in the case when the removal frequency of the data packets from the queue is higher than the actual arrival rate of data packets into the queue something that can be estimated with the estimation process described below. ESTIMATION OF DATA PACKET ARRIVAL RATE Fig. 15 shows another embodiment of the invention for estimating the arrival rate of data packets in the transmitter queue on the network side. As explained above with reference to Fig. 8 and the examples, the network side NS increases or decreases or keeps constant the number of timeslots TS or the next uplink TDMA frame on the basis of an evaluation of the counter value (s) CV. However, the counter value CV cannot only be used for adjusting the number of timeslots, but it can also be used for providing a rough estimate of the data packet arrival rate in the transmitter queue as will be explained hereinafter. The estimation of the arrival rate at the sender queue can be used for an adaption of the minimum assignment of timeslots to the estimated arrival rate. Fig. 15 shows a simple example for a multislot capability 1 mobile station having a removal frequency from the transmission buffer of 1/20 ms . The arrival rate is assumed to be constant and equal to 1/40 ms . The arrival rate estimator AR-EST (see Fig. 6) estimates the arrival rate on the basis of the received counter values CV within a measurement time interval . As indicated in Fig. 15, a measurement time interval T of 60 ms is selected as an example. After assigning one timeslot ITS in step ST151 it is assumed that the transmitter queue TR-QUE contains three data packets. Therefore, in step ST152 the first counter value received in the measurement time interval T is CV = 2. For a multislot capability 1 mobile station this exactly corresponds to two remaining data packets in the queue. Therefore, the estimator AR-EST estimates that before step ST152 (i.e. at the beginning of the measurement time interval T) a total number of three data packets where in the transmitter queue, i.e. the data packet starting number is Pan = 3. Likewise, at the end of the measurement time interval T the estimator AR-EST estimates the final number of data packets in the transmission queue. Since the last received value of CV was CV = 1 in step ST58, the estimator AR-EST determines as the final number of remaining data packets Pen = 2. Furthermore, the network side estimator AR-EST can determine how many data packets were transferred in the time T, on the •xl 3 tr a a SD ti 03 rt μ- tr φ 03 Φ ti ti 0 3 0 Hi δ Hi u rt φ TJ tr SD Φ Ω 0 SD Hi Φ 03 rt 03 Ω ra μ- 0 CΩ a μ- 3 hj 3 Φ 01 Pi φ μ- Ω rt rt P ) μ- tr rt 3 Φ Φ Φ P. 03 3 l- 1 φ tr 0 rt ^ s: 0 rt hj X ,—, Φ μ- 3 W Ω μ- 0 •- Pi a μ- Φ a CΩ rt • SD Φ ti ii H hi cπ μ- <. < SD μ- SD h- rt a Φ μ- ii CQ SD Ω rt < SD Φ CQ 01 a 3 φ Pi estimator AR-EST must take into account whether or not a single data packet is only transmitted in a single timeslot (as in the above examples) or whether in fact a data packet has its bits distributed over several data packets. However, a skilled person can derive such relationships on the basis of the above teaching for the special case of the multislot capability 1 mobile station and the provision that only one application PDU results in exactly one RLC PDU, i.e. no segmentation takes place. Alternative methods of monitoring the arrival rate are of course the terminal monitoring of the rate and a signalling of the arrival rate to the network side NS . Alternatively, the network side NS arrival rate estimator AR-EST could evaluate time stamps provided on the data packets. Before coming to the special use of the determined (estimated) arrival rate AR, hereinafter a modification of the arrival rate estimation is described. As already explained above, there is an uncertainty in the arrival rate estimation. The real arrival rate amounted to 1/40 ms and the estimated arrival rate was 1/30 ms, i.e. the network side would in such a case actually assume that more data packets are being provided in the transmitter queue than are actually existing. To make a more conservative estimation of the arrival rate, the arrival rate estimator AR-EST according to another embodiment of the invention can also use the following modified expression: Arrival rate AR = (Pin + NATS - Pan - 1)/T. For the above-described example, this value of AR amounts to AR = (2 + 3 - 3 - l)/60 ms = 1/60 ms . Thus, the estimator AR- EST conservatively assumes that less data packets exist than are actually present in the transmitter queue which thus does not cause any problems with the transmitter queue emptying when timeslots TS are assigned in accordance with Fig. 8. Based on the arrival rate estimation on the network side NS the resource scheduler SCH-RES can perform an adaption of the resource allocation on the basis of the estimated arrival rate. For example, if the transmission rate is 1/20 ms in Fig. 15, then the estimated rate AR = 2/3 packets*l/20 ms (1/30 ms) indicates that a minimum assignment = 2/3 packets per TDMA frame is possible. Therefore, the minimum assignment can be determined to be the transmission rate TR (assumed to be constant) divided by the estimated rate AR, i.e. MA (minimum assignment) = 20 ms/30 ms packets per TDMA frame. If the minimum assignment of 1TS/TDMA frame still leads to TBF releases with subsequent re-establishments, the transmission resource scheduler SCH-RES can decide to decrease the minimum assignment MA, e.g. 1TS/2TDMA frame; 2TS/3TDMA frames etc. Alternatively, it is possible to start with the full assignment in the beginning, i.e. transfer as many data packets, but start with 1TS/TDMA frame in order to avoid the possibility of emptying the queue already with the first assignment. • * Thus, on the basis of the estimated arrival rate of data packets into the transmitter queue the resources controller SCH-RES can determine how many packets should be sent per TDMA frame, i.e. an even more accurate determination of the number of necessary timeslots TS can be made in order to minimise the number of packets queued at the sender side. As mentioned above, it should be noted that also application PDU segmentation is possible. In the above explanation it was assumed that each data packet only occupies one timeslot . Therefore, the above described procedure . and the examples below should only be taken as an illustration how an adjustment of the transmission resources can be made if indeed it is assumed that each application PDU results in exactly one RLC PDU. However, a skilled person can determine other reductions and increases of the transmission resources if the data packets are differently distributed over several timeslots on the uplink frame, or if segmentation applies. Of course, the above examples are only an illustration of how the network resource controller can increase or decrease the number of timeslots for the next uplink frame without emptying the transmitter queue. Therefore, on the basis of the indicated length information (counter value) the transmission controller can increase or decrease or keep constant the number of timeslots such that even in the worst case still one data packet remains in the transmitter queue. Of course, it will be appreciated that the increasing and decreasing of the number of timeslots will be best for single slot terminals because here the counter value CV directly indicates the number of remaining data packets in the transmitter queue. Nevertheless, it is possible by exactly monitoring the CV value of the last packets to increase the precision. That is, even for a multislot capability of higher order, the network controller can repeatedly evaluate the counter values CV over several uplink frames and can thus obtain a higher precision of the actual available number of data packets in the transmitter queue. INDUSTRIAL APPLICABILITY As explained above, the variable adjustment of the transmission resources for the uplink frame transmission avoids unnecessary physical connection releases since the physical connection terminating device LC-TERM will only start a physical connection release procedure if an empty queue (zero length) is indicated in the length information. Therefore, the end-to-end delay, in particular for real-time application such as audio/speech transmission is reduced. The avoidance of unnecessary physical connection releases results also in a lower signalling load thus occupying less signalling resources in the network. Of course, the last data packet belonging to an active period is unnecessarily delayed. However, this is by far outweighed by the avoidance of unnecessary physical connection releases. v The above described determination and allocation of transmission resources in accordance with the invention further has the advantage that also (E)GPRS connections comprising mobile station equipment from various manufacturers can show an improved end-to-end delay because due to the allocation of the transmission resources it is always ensured that also the different types of mobile stations at least have one data packet present in the transmitter queue during an active data packet arrival period in which data packets arrive in said transmitter buffer queue. The invention has in particular the advantage that it can be implemented in any network, e.g. in a (E)GPRS network, without having to perform changes at the respective terminals because the resource control is entirely possible from the network side. The transmission resources controller according to the invention can not only adapt (increase, decrease) the transmission resources for the next uplink TDMA frame, but it can also estimate the arrival rate of data packets into the transmitter queue on the basis of an evaluation of the counter values received within a measurement time interval. It is also possible that the transmission resources controller performs the increasing or decreasing of transmission resources, i.e. a minimum assignment, on the basis of the estimated arrival time. Although in the above examples a GPRS system for packet transmission has been considered, the skilled person realizes that similar resource adjustment procedures can be implemented in other packet data communication systems. Therefore, a skilled person on the basis of the above teachings can perform further modifications and variations of the invention and all such modifications and variations are intended to fall in the scope of the attached claims. In particular, the invention can comprise embodiments which result from a combination of steps and features which have been separately described in the specification and/or claimed in the claims. Therefore, it should be understood that the above described embodiments are only the best mode of the invention presently conceived by the inventors. Reference numerals in the claims only serve clarification purposes and do not limit the scope of these claims.

Claims: rt ti SD 3 01 3 μ- rt rt φ ti tr a Hi Hi φ hj ■ d a Φ a Φ ,_, H3 σi fd 1 • o CJ td — • ω t - χ 03 rt 03 Q Hi SD Ω > φ a Φ a tr a 3 ^ a T ^ tr a μ- hi μ- J a 3 03 Pi 3 Pi •i Φ 3 i i 4 Φ rt μ- a rt Φ Φ a rt Ω 3 TJ α £ • Si Ω s * 0 a X CT 0 φ ct 0 3 rt * - ( ϋ rt CD hi Φ Φ Φ CQ H Φ tv <i C Q μ- μ. ti . 0 a Ω tt Ω 3 ISΪ Ω l- H* a π> 0 μ- (D 0 a cn μ * 3 3 3 a * -3 rt Φ α 3 0 rt a rt oo Ω . ti tr ti μ- μ- CO 0 a 0 0 P. 0 — ' 3 - 1 3 I- 1 3 3 rt 03 Φ tr φ a Ω φ 0 3 a Ω a ti *1 ti a Φ μ- CT ct φ 3 a Pi p. a ϋ a rt 3 0 Ω Ω Φ 03 TJ 3 Ω 0 Ω ti X 0 Hi 0 .—, *< rf ϋ ti < * . Ω 03 Φ Pi rt i a < μ- ii μ- μ- μ- h-x 1 Ω 3 3 3 3 a a p. CΩ Φ CΩ Φ * h- 1 3 01 f a rt CQ rt — Ω rf 0 h-x 0 X 0 μ- 0 a Pi 3 3 Ω rf Ω 01 Φ 3 CΩ l- 1 CQ rt φ a a a Φ Ω Pi μ- Hi μ- ii rf Φ 3 0 3 <! 3 μ- < * . ii SD μ- 0 μ- to μ> h- 1 3 3 Ω rf a Φ Φ 0 X Φ 03 .— , ii Φ X , — . 0 rt Ω X ω Hi tr — ' a Ω -• TJ a 1 μ * Ω r 3 1-3 μ- X td 3 II a φ ? X" o rt 3 S 5. A network controller according to claim 2 or 3 , characterized in that said network side transmission resources controller (SCH-RES) assigns (ST83 ' ) the maximum admissible number of time slots (TS) when said CV evaluation means (CV- VAL) determines that all presently received counter values have a value of CV>1. 6. A network controller according to claim 2 or 3 , characterized in that when said CV evaluation means (CV-VAL) determines that at least one counter value has a value of CV=1 and at least one counter value has a value of CV>1, said network side transmission resources controller (SCH-RES) assigns (ST83 ' ■ ) a new number of time slots NNTS in accordance with the following relationship: NNTS = NTS - NO(CV=l) where NNTS is the new number of time slots for the next uplink frame, NTS is the multislot capability of the subscriber terminal and NO(CV=l) designates the number of counter values having a value of CV=1. 7. A network controller according to claim 2 or 3 , characterized in that when said CV evaluation means (CV-VAL) determines that all presently received counter values have a value of CV=1, said network side transmission resources controller (SCH-RES) assigns (ST84) a minimum number of time slots. 8. A network controller according to claim 6, characterized in that said minimum number of time slots (TS) is one time slot (ITS) when the arrival rate of data packets into the transmitter buffer queue is higher or equal than the removal frequency of data packets from said transmitter buffer queue . 9. A network controller according to claim 1, characterized by an arrival rate estimator (AR-EST) for estimating the arrival rate (AR) of data packets into the transmitter v queue (TR-QUE) ' on the subscriber terminal side (MS) on the basis of the received counter values (CV) received within a measurement time interval (T) . 10. A network controller according to claim 9, characterized in that the transmission resources (TS) are further assigned on the basis of the estimated arrival rate (AR) . 11. A network controller according to claim 10 and 7, characterized in that said minimum number of time slots (TS) is adjusted on the basis of the estimated arrival rate (AR) . 12. A communication system (SYS) for controlling packet data transfer on a connection (UL, DL) between a subscriber terminal (SS) side and a network side (NS) , wherein during a data packet transfer a physical connection (TBF) is maintained which indicates in the subscriber terminal (SS) and the network side (NS) that the subscriber terminal (SS) and the network side (NS) are valid for performing said packet data transfer, comprising : on said subscriber terminal side (SS) : a subscriber terminal side transmitter buffer (TBUF) for buffering data packets to be transmitted to the network side (NS) as transmitter queue (TR-QUE) ; a subscriber terminal side transmitter queue length information setting means (CV-SET) for determining a transmitter queue (TR-QUE) length information (CV) in accordance with the length of said transmitter queue (TR-QUE) ; and a subscriber terminal side transmitter (SS-TR) for transmitting in association with each data packet (DPn) from said transmitter queue (TR-QUE) said length information (CV) to the network side (NS) ; and on said network side (NS) : a network side receiver (NS-RC) for receiving said transmitter queue (TR-QUE) length information (CV) transmitted from a subscriber terminal (SS) ; and a network side transmission resources controller (SCH- RES) for assigning to a subscriber terminal (SS) transmission resources (TS) for the data packet transfer on the uplink connection (UL) on the basis of said received length information (CV) such that during an active data packet arrival period in which data packets arrive in said transmitter buffer queue at least one data packet (DP) remains in the subscriber terminal side transmitter buffer queue (TR-QUE) . 13. A system according to claim 12 , characterized in that said length information setting means (CV-SET) is adapted to determine the number of remaining data packets (DP) of the transmitter queue (TR-QUE) and to set said transmitter queue (TR-QUE) length information (CV) in accordance with the determined number of data packets (DP) . 14. A system according to claim 12, characterized in that said length information (CV) is contained in the transmitted data packet (DP) . 15. A system according to claim 13, characterized in that said subscriber terminal side transmitter queue length information setting means (CV-SET) is adapted to set as said length information (CV) a counter value (CV) determined in accordance with the following expression: CV = round up [ (TBC-1) /NTS] where : CV: counter value transmitted to the network side; TBC: total number of data packets (DP) present in the transmitter buffer (TR-BUF) ; and NTS: transmission resources (TS) defined as the number of time slots (multislot capability NTS) in a single frame used for the data packet (DP) transfer on the uplink connection (UL) . 16. A system according to claim 12, characterized by a network side physical connection controller (LC-CTRL) including a physical connection maintaining device (LC- MAIN) adapted to maintain said physical connection (LC) when the received transmitter queue (TR-QUE) length information (CV) indicates (CV>0) a non-empty transmitter queue (TR-QUE) and a physical connection terminating device (LC-TERM) adapted to terminate said physical connection (LC) when the determined transmitter queue (TR-QUE) information (CV) indicates (CV=0) an empty transmitter queue (TR-QUE) . 17. A system according to claim 12, characterized in that said received length information (CV) is a counter value whose value CV corresponds to the length of the transmitter buffer queue (TR-QUE) , said transmission resources are time slots on a TDMA uplink frame, said network side receiver (NS-RC) is adapted to receive one or more data- packets and their associated counter values CV on the time slots said uplink frame, a CV evaluation means (CV-VAL) is provided to determine (ST82, ST82 ' , ST82 ■ ' ) the value of each received counter value, and said network side transmission resources controller (SCH-RES) is adapted to assign as said network resources a predetermined number of time slots for the uplink frame . 18. A system according to claim 16, characterized in that said physical connection terminating device (LC-TERM) terminates (ST83) said physical connection (LC) when said CV evaluation means (CV-VAL) determines that at least one of said counter values has a value of CV=0. 19. A system according to claim 12 or 17, characterized in that said network side transmission resources controller (SCH-RES) assigns (ST83 ■ ) the maximum admissible number of time slots (TS) when said CV evaluation means (CV- VAL) determines that all presently received counter values have a value of CV>1. 20. A system according to claim 12 or 17, characterized in that when said CV evaluation means (CV-VAL) determines that at least one counter value has a value of CV=1 and at least one counter value has a value of CV>1, said network side transmission resources controller (SCH-RES) assigns (ST83' 1 ) a new number of time slots NNTS in accordance with the following relationship: NNTS = NTS - NO(CV=l) where NNTS is the new number of time slots for the next uplink frame, NTS is the multislot capability of the subscriber terminal and N0(CV=1) designates the number of counter values having a value of CV=1. 21. A system according to claim 12 or 17, characterized in that when said CV evaluation means (CV-VAL) determines that all presently received counter values have a value of CV=1 said network side transmission resources controller (SCH-RES) assigns (ST84) a minimum number of time slots. 22. A system according to claim 21, characterized in that said minimum number of time slots (TS) is one time slot (ITS) when the- arrival rate of data packets into the transmitter buffer queue is higher or equal than the removal frequency of data packets from said transmitter buffer queue. 23. A system according to claim 12, characterized by said network side transmission resources controller (SCH-RES) comprising an arrival rate estimator (AR-EST) for estimating the arrival rate (AR) of data packets into the transmitter queue (TR-QUE) on the subscriber terminal side (MS) on the basis of the received counter values (CV) received within a measurement time interval (T) . 24. A system according to claim 23, characterized in that said transmission resources controller (SCH-RE) assigns the transmission resources on the basis of the estimated arrival rate (AR) . 25. A system according to claim 24 and 21, characterized in that said minimum number of time slots (TS) is adjusted on the basis of the estimated arrival rate (AR) . 26. A method in a communication system (SYS) for performing packet data transfer on a connection (UL, DL) between a subscriber terminal (SS) side and a network side (NS) wherein during a data packet transfer a physical connection (TBF) is maintained which indicates in the subscriber terminal (SS) and the network side (NS) that the subscriber terminal (SS) and the network side (NS) are valid for performing said packet data transfer, comprising the following steps: receiving (ST73) transmitter queue (TR-QUE) length information (CV) transmitted from said subscriber terminal (SS) , said length information (CV) indicating the length of said transmitter queue (TR-QUE) in a transmission buffer (TR-BUF) in said subscriber terminal (SS) ; and assigning to said subscriber terminal (SS) transmission resources (TS) for the data packet transfer on the uplink connection (UL) on the basis of said received length information (CV) such that during an active data packet arrival period in which data packets arrive in said transmitter buffer queue at least one data packet (DP) remains in the subscriber terminal side transmitter buffer queue (BUF-QUE) . 27. A method according to claim 26, characterized by determining the number of data packets (DP) of the transmitter queue (TR-QUE) and setting said transmitter queue (TR-QUE) length information (CV) in accordance with the determined number of data packets (DP) . 28. A method according to claim 26 or 27, characterized by- maintaining said physical connection (LC) when the received transmitter queue (TR-QUE) length information (CV) indicates (CV>0) a non-empty transmitter queue (TR- QUE) and terminating said physical connection (LC) when the determined transmitter queue (TR-QUE) information (CV) indicates (CV=0) an empty transmitter queue (TR- QUE) . 29. A method according to claim 27, characterized in that determining on the subscriber terminal side (SS) said received length information (CV) as a counter value whose value CV corresponds to the length of the transmitter buffer queue (TR-QUE) , assigning as said transmission resources time slots on a TDMA uplink frame, receiving on the network side one or more data packets and their associated counter values CV on said time slots of said uplink frame, determining (ST82, ST82 ' , ST82 ' ' ) the value of each received counter value on the network side, and assigning as said network resources a predetermined number of time slots for the uplink frame. 30. A method according to claim 27, characterized by setting as said length information (CV) a counter value (CV) determined in accordance with the following expression: CV = round up [ (TBC- 1 ) /NTS] where : CV: count value transmitted to the network side; TBC: total number of data packets (DP) present in the transmitter buffer (TR-BUF) ; and NTS: transmission resources (TS) defined as the number of time slots (multislot capability NTS) in a single frame used for the data packet (DP) transfer on the uplink connection (UL) . 31. A method according to claim 26 or 30, characterized Jy including said length information (CV) in the transmitted data packet (DP) . 32. A method according to claim 28, characterized in that terminating (ST83) said physical connection (LC) when it is determined that at least one of said counter values has a value of CV=0. 33. A method according to claim 27 or 29, characterized in that assigning (ST83 ' ) the maximum admissible number of time slots (TS) when it is determined that all presently received counter values have a value of CV>1. 34. A method according to claim 27 or 29, characterized in that when it is determined that at least one counter value has a value of CV=1 and at least one counter value has a value of CV>1, assigning (ST83 ' ' ) a new number of time slots NNTS in accordance with the following relationship: NNTS = NTS - NO (CV=l ) where NNTS is the new number of time slots for the next uplink frame, NTS is the multislot capability of the subscriber terminal and NO(CV=l) designates the number of counter values having a value of CV=1. 35. A method according to claim 27 or 29, characterized in that when it is determined that all presently received counter values have a value of CV=1 a minimum number of time slots is assigned (ST84) . 36. A method according to claim 35, characterized in that said minimum number of time slots (TS) is one time slot (ITS) when the arrival rate of data packets into the transmitter buffer queue is higher or equal than the removal frequency of data packets from said transmitter buffer queue. 37. A method according to claim 26, characterized by the following steps: estimating, at the start of a measurement time interval (T) on the network side (NS) , an initial number of available packets (Pan) in the transmitter queue on the basis of a received counter value (CV) ; determining the number (NATS) of received data packets within said measurement time interval (T) ; estimating, at the end of the measurement time interval (T) , the final number (Pen) of available data packets in the transmitter queue on the basis of another counter value (CV) received at the end of the measurement time interval (T) ; and estimating the arrival rate (AR) of data packets into the transmitter queue on the basis of the initial number (Pan) of packets, the number (NATS) of received data packets in the measurement time interval (T) , the final number (Pen) of data packets and the measurement time interval (T) . 38. A method according to claim 37, characterized in that the transmission resources (TS) are further assigned on the basis of the determined arrival rate (AR) . 39. A method according to claim 38 and 35, characterized in that said minimum number of time slots (TS) is adjusted on the basis of the estimated arrival rate (AR) .

Inventors: LEY TOBIAS, SCHIEDER ANDREAS, LEY, TOBIAS, SCHIEDER, ANDREAS
Applicants: ERICSSON TELEFON AB L M, LEY TOBIAS, SCHIEDER ANDREAS, LEY, TOBIAS, SCHIEDER, ANDREAS, TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Application year: 2001
Main classification: H04L12
IPC codes: H04L12