WO1999022557A2 - Subnetwork dependent convergence protocol for a mobile radio network - Google Patents

Subnetwork dependent convergence protocol for a mobile radio network Download PDF

Info

Publication number
WO1999022557A2
WO1999022557A2 PCT/FI1998/000781 FI9800781W WO9922557A2 WO 1999022557 A2 WO1999022557 A2 WO 1999022557A2 FI 9800781 W FI9800781 W FI 9800781W WO 9922557 A2 WO9922557 A2 WO 9922557A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
convergence protocol
access point
algorithm
sndcp
Prior art date
Application number
PCT/FI1998/000781
Other languages
French (fr)
Other versions
WO1999022557A3 (en
Inventor
Jari HÄMÄLÄINEN
Original Assignee
Nokia Mobile Phones Limited
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=8549831&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=WO1999022557(A2) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Nokia Mobile Phones Limited filed Critical Nokia Mobile Phones Limited
Priority to JP2000518526A priority Critical patent/JP2001522182A/en
Priority to AU94433/98A priority patent/AU750516B2/en
Publication of WO1999022557A2 publication Critical patent/WO1999022557A2/en
Publication of WO1999022557A3 publication Critical patent/WO1999022557A3/en
Priority to HK01104024A priority patent/HK1033401A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/24Negotiation of communication capabilities

Definitions

  • the present invention relates to mobile radio subnetwork dependent convergence protocols.
  • the invention is applicable in particular, though not necessarily, to the Subnetwork Dependent Convergence Protocol (SNDCP) to be specified for the General Packet Radio Service (GPRS).
  • SNDCP Subnetwork Dependent Convergence Protocol
  • GPRS General Packet Radio Service
  • GSM Global System for Mobile communications
  • MS mobile station
  • BSS base station subsystem
  • a physical channel i.e. a series of regularly spaced time slots on one or more frequencies
  • the circuit switched transmission mode is reasonably efficient.
  • data calls e.g, internet access
  • the data stream is 'bursty' and the long term reservation of a physical channel in the circuit switched mode represents an uneconomic use of the air interface.
  • GPRS General Packet Radio Service
  • ETSI European Telecommunications Standards Institute
  • GPRS is intended to operate in conjunction with conventional GSM circuit switched transmission to efficiently use the air interface for both data and voice communications. GPRS will therefore use the basic channel structure defined for GSM.
  • GSM Global System for Mobile Communications
  • a given frequency band is divided in the time domain into a succession of frames, known as TDMA (Time Division Multiple Access) frames.
  • the length of a TDMA frame is 4.615ms.
  • Each TDMA frame is in turn divided into eight consecutive slots of equal duration.
  • TDMA Time Division Multiple Access
  • TDMA Time Division Multiple Access
  • Each TDMA frame is in turn divided into eight consecutive slots of equal duration.
  • a physical channel is defined for that call by reserving a given time slot (1 to 8) in each of a succession of TDMA frames.
  • Physical channels are similarly defined for conveying signalling information.
  • a "traffic channel" for transmitting data is created by dynamically assigning physical channels for either switched circuit transmission mode or for packet switched transmission mode.
  • a large number of physical channels may be reserved for that mode.
  • demand for GPRS transmission is high, a large number of physical channels may be reserved for that mode.
  • a high speed packet switched transmission channel may be provided by assigning two or more slots in each of a succession of TDMA frames to a single MS.
  • the GPRS radio interface for GSM Phase 2+ can be modelled as a hierarchy of logical layers with specific functions as shown in Figure 1 , where the mobile station (MS) and the network have identical layers which communicate via the MS/network interface Urn. It will be understood that the model of Figure 1 does not necessarily represent the hardware contained in the MS and the network, but rather illustrates the flow and processing of data through the system. Each layer formats data received from the neighbouring layer, with received data passing from the bottom to the top layer and data for transmission passing from the top to the bottom layer.
  • PDP packet data protocol
  • PTP packet data protocol
  • IP Internet Protocol
  • X.25 X.25
  • two or more of the PDP entities may use the same PDP.
  • GPRS end point protocols entities such as SMS and signalling (L3M).
  • SMS and signalling L3M
  • SNDCP Subnetwork Dependent Convergence Protocol
  • GSM Global System for Mobile communications
  • SNDCP protocol data units are up to 1600 octets and comprise an address field which contains a network service access point identifier (NSAPI) which identifies the endpoint connection, i.e. the SNDCP user.
  • NSAPI network service access point identifier
  • Each MS may be assigned a set of NSAPIs independently of the other MSs.
  • This architecture means that new PDPs and relays may be developed in the future which can be readily incorporated into the existing GPRS architecture.
  • Each SNDCP (or other GPRS end point protocol) unit is carried by one logical link control (LLC) frame over the radio interface.
  • LLC frames are formulated in the LLC layer (GSM 04.64) and include a header frame with numbering and temporary addressing fields, a variable length information field, and a frame check sequence. More particularly, the addressing fields include a service access point identifier (SAPI) which is used to identify a specific connection endpoint (and its relative priority and Quality of Service (QoS)) on the network side and the user side of the LLC interface.
  • SAPI service access point identifier
  • One connection endpoint is the SNDCP.
  • Other endpoints include the short message service (SMS) and management layer (L3M).
  • SMS short message service
  • L3M management layer
  • the LLC layer formats data received from these different endpoint protocols. SAPIs are allocated permanently and are common to all MSs.
  • the Radio Link Control (RLC) layer defines amongst other things the procedures for segmenting and re-assembling Logical Link Control layer PDUs (LLC-PDU) into RLC Data Blocks, and for retransmission of unsuccessfully delivered RLC blocks.
  • the Medium Access Control (MAC) layer operates above the Phys. Link layer (see below) and defines the procedures that enable multiple MSs to share a common transmission medium.
  • the MAC function arbitrates between multiple MSs attempting to transmit simultaneously and provides collision avoidance, detection and recovery procedures.
  • the physical link layer (Phys. Link) provides a physical channel between the MS and the network).
  • the physical RF layer (Phys. RF) specifies amongst other things the carrier frequencies and GSM radio channel structures, modulation of the GSM channels, and transmitter/receiver characteristics.
  • SNDCP exchange identity (XID) parameters are exchanged between the two peer SNDCP layers, via the respective LLC layers, in an XID parameter negotiation stage.
  • Initialisation of XID negotiation may occur at either the MS or the network.
  • the peer entity Upon receipt of an XID parameter, the peer entity either configures itself according to that parameter or carries out a further negotiation with the user entity.
  • the field format for the SNDCP XID parameters is as follows:
  • Figure 2 considers in more detail the SNDCP layer and its interfaces to the SNDCP users and the LLC layer, and is applicable to both the MS and the SGSN architectures.
  • Figure 2 illustrates the compression of protocol and/or user data which is optionally carried out in the SNDCP layer (as is described in GSM recommendation 04.65). Data is first compressed, and is then sub-divided into blocks before the SNDCP header is added and the SNDCP unit assembled. It will be understood that Figure 2 applies to the preparation of data for transmission. Received data is processed by an analogous reverse decompression.
  • one or more protocol compression/decompression entities may be defined, and identified to the two peer SNDCP layers, by the exchange of XID parameters.
  • a user data compression/decompression entity (or several such entities) may be defined by the exchange of other XID parameters.
  • GSM recommendation 04.65 proposes the following XID message for this purpose:
  • Octet 1 identifies a particular algorithm
  • octet 2 identifies the number of octets to follow in the XID message.
  • These following octets define parameters of the chosen algorithm such as the length of a codebook to be used or the length of the codeword to be used in a codebook (see below).
  • PDP context data is assembled in the SNDCP layer into SNDCP units.
  • the SNDCP layer attaches to each unit a PCOMP (Protocol control information COMPression) tag which identifies whether or not the protocol data contained within that unit has been compressed and, if so, the compression algorithm used.
  • PCOMP Protocol control information COMPression
  • DCOMP Data COMPression
  • the receiving SNDCP layer can determine whether or not the PDP context data needs to be decompressed and, if so, what decompression algorithms need to be used, before routing the data to the appropriate entity (identified by the NSAPI contained in the received SNDCP unit).
  • Compression algorithms suitable for compressing data (both protocol and user data) in the SNDCP layer include algorithms which rely upon the creation of a codebook in which a set of codes are identified by respective vectors. For each data segment, the codebook is searched to find the best matching code. The vector is then transmitted to the peer entity which contains an identical codebook which is searched, using the vector, to recover the original code. In order to optimise the efficiency of the compression process for the data to be compressed, the codebook is dynamically updated using the received data. Where the same compression algorithm is used by two or more PDP entities, these entities share the same codebook.
  • the present invention stems, at least in part, from the realisation that a shared codebook is unlikely to be optimal for any one PDP context which makes use of a shared codebook. It is therefore an object of the present invention to provide a subnetwork dependent convergence protocol in which different PDP contexts can use the same compression algorithm whilst using different codebooks.
  • GPRS Global System for Mobile communications
  • UMTS Universal Mobile Telecommunication System
  • a method of operating a mobile radio network in which data is assembled into units by a first convergence protocol layer prior to transmission of the data to a second, peer convergence protocol layer, said data being provided to the first convergence protocol layer by one of a plurality of convergence protocol layer users, the method comprising: assigning at least one access point identifier to each user; and exchanging between said first and second layers one or more compression control message, each message containing a data compression/decompression algorithm identifier, a set of parameters for the identified algorithm, and identification of at least one access point identifier which is to make use of the identified algorithm.
  • said units of data contain one of said access point identifiers to enable the receiving convergence protocol layer to direct the data contained in the unit to the correct user.
  • said convergence protocol layers use compression/decompression algorithms which make use of codebooks, this allows separate codebooks to be created and used for separate access point identifiers even where these identifiers use the same compression/decompression algorithm.
  • said compression control message contains a bitmap of said access point identifiers, where the bitmap indicates those access point identifiers which are to make use of the identified algorithm and those which are not.
  • each of said messages comprise a first octet identifying the compression/decompression algorithm, at least one octet containing a bitmap of said access point identifiers, and a plurality of octets containing respective algorithm parameters. More preferably, said bitmap is contained in two octets.
  • the method of the present invention forms part of a General Packet Radio Service, and said first and second convergence protocol layers are Subnetwork Dependent Convergence Protocol (SNDCP) layers in a mobile station and in a network.
  • SNDCP Subnetwork Dependent Convergence Protocol
  • said set-up messages are in the form of exchange identity (XID) messages and said access point identifiers are NSAPIs.
  • the present invention is also applicable to other packet radio services which make use of a convergence protocol layer.
  • a mobile radio device arranged to use the method of the above first aspect of the present invention.
  • a serving GPRS support node of a cellular radio network arranged to use the method of the above first aspect of the present invention.
  • Figure 1 illustrates the protocol layers of a GPRS radio link
  • Figure 2 illustrates in more detail the upper layers of the protocol of Figure 1 ;
  • Figure 3 shows schematically the architecture of a GSM/GPRS digital cellular telephone network.
  • the present ETSI recommendation for implementing the SNDCP layer in GPRS allows a number of compression/decompression algorithms to be defined for both protocol and user data.
  • Each algorithm is negotiated between two peer SNDCP layers (one in the MS and the other in the network) prior to the compression and transmission of SNDCP units containing this data.
  • PCOMP and DCOMP tags are included in the unit to identify to the receiving layer whether or not packet data and or user data contained in the unit is compressed, and if so, which algorithms have been used.
  • a bitmap identifying which NSAPIs are to use that algorithm In the current ETSI proposal, 16 NSAPIs can be assigned to a MS. Thus, two extra octets are added to the XID message, where the position of a bit (0 to 15) identifies the NSAPI (1 to 16), a 1 indicates that an NSAPI will use the algorithm, and a 0 indicates that an NSAPI will not use the algorithm.
  • the new XID message is as follows:
  • the compression algorithms used are identified from the PCOMP and DCOMP tags.
  • the codebook, to be used for decompression with the identified algorithm, can then be identified from the NSAPI contained in the unit (as described above).

Abstract

A method of operating a mobile radio network in which data is assembled into units by a first convergence protocol (SNDCP) layer prior to transmission of the data to a second, peer convergence protocol (SNDCP) layer. Data is provided to the first convergence protocol layer by one of a plurality of convergence protocol layer users (e.g. PDP entities). The method comprises assigning at least one access point identifier (NSAPI) to each user and exchanging between said first and second layers one or more set-up messages (XID), each message containing a data compression/decompression algorithm identifier, a set of parameters for the identified algorithm, and a bitmap of said access point identifiers, where the bitmap indicates those access point identifiers which are to make use of the identified algorithm and those which are not.

Description

Subnetwork Dependent Convergence Protocol for a Mobile Radio Network
The present invention relates to mobile radio subnetwork dependent convergence protocols. The invention is applicable in particular, though not necessarily, to the Subnetwork Dependent Convergence Protocol (SNDCP) to be specified for the General Packet Radio Service (GPRS).
Current digital cellular telephone systems such as GSM (Global System for Mobile communications) were designed with an emphasis on voice communications. Data is normally transmitted between a mobile station (MS) and a base station subsystem (BSS) over the air interface using the so called 'circuit switched' transmission mode where a physical channel, i.e. a series of regularly spaced time slots on one or more frequencies, is reserved for the duration of the call. For voice communications, where the stream of information to be transmitted is relatively continuous, the circuit switched transmission mode is reasonably efficient. However, during data calls, e.g, internet access, the data stream is 'bursty' and the long term reservation of a physical channel in the circuit switched mode represents an uneconomic use of the air interface.
Given that the demand for data services with digital cellular telephone systems is increasing rapidly, a new GSM based service known as the General Packet Radio Service (GPRS) is currently being standardised by the European Telecommunications Standards Institute (ETSI) and is defined in overall terms in recommendation GSM 03.60. GPRS provides for the dynamic allocation of physical channels for data transmission. That is to say that a physical channel is allocated to a particular MS to BSS link only when there is data to be transmitted. The unnecessary reservation of physical channels when there is no data to be transmitted is avoided.
GPRS is intended to operate in conjunction with conventional GSM circuit switched transmission to efficiently use the air interface for both data and voice communications. GPRS will therefore use the basic channel structure defined for GSM. In GSM, a given frequency band is divided in the time domain into a succession of frames, known as TDMA (Time Division Multiple Access) frames. The length of a TDMA frame is 4.615ms. Each TDMA frame is in turn divided into eight consecutive slots of equal duration. In the conventional circuit switched transmission mode, when a call is initiated, a physical channel is defined for that call by reserving a given time slot (1 to 8) in each of a succession of TDMA frames. Physical channels are similarly defined for conveying signalling information.
With the introduction of GPRS, a "traffic channel" for transmitting data is created by dynamically assigning physical channels for either switched circuit transmission mode or for packet switched transmission mode. When the network requirement for switched circuit transmission mode is high, a large number of physical channels may be reserved for that mode. On the other hand, when demand for GPRS transmission is high, a large number of physical channels may be reserved for that mode. In addition, a high speed packet switched transmission channel may be provided by assigning two or more slots in each of a succession of TDMA frames to a single MS.
The GPRS radio interface for GSM Phase 2+ (GSM 03.64) can be modelled as a hierarchy of logical layers with specific functions as shown in Figure 1 , where the mobile station (MS) and the network have identical layers which communicate via the MS/network interface Urn. It will be understood that the model of Figure 1 does not necessarily represent the hardware contained in the MS and the network, but rather illustrates the flow and processing of data through the system. Each layer formats data received from the neighbouring layer, with received data passing from the bottom to the top layer and data for transmission passing from the top to the bottom layer.
At the top layer in the MS are a number of packet data protocol (PDP) entities. Certain of these PDP entities use point-to-point protocols (PTPs) adapted for sending packet data from one MS to another MS, or from one MS to a fixed terminal. Examples of PTP protocols are IP (Internet Protocol) and X.25 which are capable of interfacing with user applications (not shown in Figure 1). It is noted that two or more of the PDP entities may use the same PDP. Also on the top layer are other GPRS end point protocols entities such as SMS and signalling (L3M). A similar arrangement exists within the network and in particular at the Serving GPRS Support Node (SGSN).
Certain of the top layer entities use a common Subnetwork Dependent Convergence Protocol (SNDCP) - GSM 04.65 - which, as its name suggests, translates (or 'converges') the different SNDCP user data into a common form (SNDCP protocol data units) suitable for further processing in a transparent way. SNDCP units are up to 1600 octets and comprise an address field which contains a network service access point identifier (NSAPI) which identifies the endpoint connection, i.e. the SNDCP user. Each MS may be assigned a set of NSAPIs independently of the other MSs. This architecture means that new PDPs and relays may be developed in the future which can be readily incorporated into the existing GPRS architecture.
Each SNDCP (or other GPRS end point protocol) unit is carried by one logical link control (LLC) frame over the radio interface. The LLC frames are formulated in the LLC layer (GSM 04.64) and include a header frame with numbering and temporary addressing fields, a variable length information field, and a frame check sequence. More particularly, the addressing fields include a service access point identifier (SAPI) which is used to identify a specific connection endpoint (and its relative priority and Quality of Service (QoS)) on the network side and the user side of the LLC interface. One connection endpoint is the SNDCP. Other endpoints include the short message service (SMS) and management layer (L3M). The LLC layer formats data received from these different endpoint protocols. SAPIs are allocated permanently and are common to all MSs.
The Radio Link Control (RLC) layer defines amongst other things the procedures for segmenting and re-assembling Logical Link Control layer PDUs (LLC-PDU) into RLC Data Blocks, and for retransmission of unsuccessfully delivered RLC blocks. The Medium Access Control (MAC) layer operates above the Phys. Link layer (see below) and defines the procedures that enable multiple MSs to share a common transmission medium. The MAC function arbitrates between multiple MSs attempting to transmit simultaneously and provides collision avoidance, detection and recovery procedures. The physical link layer (Phys. Link) provides a physical channel between the MS and the network). The physical RF layer (Phys. RF) specifies amongst other things the carrier frequencies and GSM radio channel structures, modulation of the GSM channels, and transmitter/receiver characteristics.
When a MS becomes active in a network, it is necessary to define exactly how data is to be processed at each of the layers described above. This process also involves conducting preliminary negotiations between the MS and the network. In particular, control parameters known as SNDCP exchange identity (XID) parameters are exchanged between the two peer SNDCP layers, via the respective LLC layers, in an XID parameter negotiation stage. Initialisation of XID negotiation may occur at either the MS or the network. Upon receipt of an XID parameter, the peer entity either configures itself according to that parameter or carries out a further negotiation with the user entity. The field format for the SNDCP XID parameters is as follows:
Figure imgf000006_0001
Figure 2 considers in more detail the SNDCP layer and its interfaces to the SNDCP users and the LLC layer, and is applicable to both the MS and the SGSN architectures. In particular, Figure 2 illustrates the compression of protocol and/or user data which is optionally carried out in the SNDCP layer (as is described in GSM recommendation 04.65). Data is first compressed, and is then sub-divided into blocks before the SNDCP header is added and the SNDCP unit assembled. It will be understood that Figure 2 applies to the preparation of data for transmission. Received data is processed by an analogous reverse decompression. In the present GSM 04.65 recommendation, several different compression algorithms may be provided for the compression of protocol data, whilst only a single compression algorithm is specifically considered for compression of user data (although provision is made for future developments in which several different user data compression algorithms are made available). Typically, the decision over whether to use compression is made by the user interface application which generates the user data supplied to the SNDCP layer via one of the SNDCP users. The decision is notified to the SNDCP layer. However, compression can only be used providing that this is available at both peer SNDCP layers.
During the SNDCP XID parameter negotiations, one or more protocol compression/decompression entities may be defined, and identified to the two peer SNDCP layers, by the exchange of XID parameters. Similarly, a user data compression/decompression entity (or several such entities) may be defined by the exchange of other XID parameters. GSM recommendation 04.65 proposes the following XID message for this purpose:
Figure imgf000007_0001
Octet 1 identifies a particular algorithm, whilst octet 2 identifies the number of octets to follow in the XID message. These following octets define parameters of the chosen algorithm such as the length of a codebook to be used or the length of the codeword to be used in a codebook (see below).
As has already been described, PDP context data is assembled in the SNDCP layer into SNDCP units. The SNDCP layer attaches to each unit a PCOMP (Protocol control information COMPression) tag which identifies whether or not the protocol data contained within that unit has been compressed and, if so, the compression algorithm used. Similarly, a DCOMP (Data COMPression) tag is attached to identify whether or not the user data has been compressed and, if so, which algorithm was used. Upon receipt of each unit, the receiving SNDCP layer can determine whether or not the PDP context data needs to be decompressed and, if so, what decompression algorithms need to be used, before routing the data to the appropriate entity (identified by the NSAPI contained in the received SNDCP unit).
Compression algorithms suitable for compressing data (both protocol and user data) in the SNDCP layer include algorithms which rely upon the creation of a codebook in which a set of codes are identified by respective vectors. For each data segment, the codebook is searched to find the best matching code. The vector is then transmitted to the peer entity which contains an identical codebook which is searched, using the vector, to recover the original code. In order to optimise the efficiency of the compression process for the data to be compressed, the codebook is dynamically updated using the received data. Where the same compression algorithm is used by two or more PDP entities, these entities share the same codebook.
The present invention stems, at least in part, from the realisation that a shared codebook is unlikely to be optimal for any one PDP context which makes use of a shared codebook. It is therefore an object of the present invention to provide a subnetwork dependent convergence protocol in which different PDP contexts can use the same compression algorithm whilst using different codebooks.
Whilst the above discussion of GPRS has been concerned with GSM, it is noted that GPRS has a much wider applicability. For example, by changing only the low level radio protocol, GPRS may be adapted to the proposed third generation standard UMTS (Universal Mobile Telecommunication System).
According to a first aspect of the present invention there is provided a method of operating a mobile radio network in which data is assembled into units by a first convergence protocol layer prior to transmission of the data to a second, peer convergence protocol layer, said data being provided to the first convergence protocol layer by one of a plurality of convergence protocol layer users, the method comprising: assigning at least one access point identifier to each user; and exchanging between said first and second layers one or more compression control message, each message containing a data compression/decompression algorithm identifier, a set of parameters for the identified algorithm, and identification of at least one access point identifier which is to make use of the identified algorithm.
Typically, said units of data contain one of said access point identifiers to enable the receiving convergence protocol layer to direct the data contained in the unit to the correct user. Where the convergence protocol layers use compression/decompression algorithms which make use of codebooks, this allows separate codebooks to be created and used for separate access point identifiers even where these identifiers use the same compression/decompression algorithm.
Preferably, said compression control message contains a bitmap of said access point identifiers, where the bitmap indicates those access point identifiers which are to make use of the identified algorithm and those which are not.
Preferably, each of said messages comprise a first octet identifying the compression/decompression algorithm, at least one octet containing a bitmap of said access point identifiers, and a plurality of octets containing respective algorithm parameters. More preferably, said bitmap is contained in two octets.
Preferably, the method of the present invention forms part of a General Packet Radio Service, and said first and second convergence protocol layers are Subnetwork Dependent Convergence Protocol (SNDCP) layers in a mobile station and in a network. In this case, said set-up messages are in the form of exchange identity (XID) messages and said access point identifiers are NSAPIs.
The present invention is also applicable to other packet radio services which make use of a convergence protocol layer. According to a second aspect of the present invention there is provided a mobile radio device arranged to use the method of the above first aspect of the present invention.
According to a second aspect of the present invention there is provided a serving GPRS support node of a cellular radio network arranged to use the method of the above first aspect of the present invention.
For a better understanding of the present invention and in order to show how the same may be carried into effect reference will now be made, by way of example, to the accompanying drawings, in which:
Figure 1 illustrates the protocol layers of a GPRS radio link; Figure 2 illustrates in more detail the upper layers of the protocol of Figure 1 ; and
Figure 3 shows schematically the architecture of a GSM/GPRS digital cellular telephone network.
As has been described above, the present ETSI recommendation for implementing the SNDCP layer in GPRS allows a number of compression/decompression algorithms to be defined for both protocol and user data. Each algorithm is negotiated between two peer SNDCP layers (one in the MS and the other in the network) prior to the compression and transmission of SNDCP units containing this data. When an SNDCP unit is transmitted, PCOMP and DCOMP tags are included in the unit to identify to the receiving layer whether or not packet data and or user data contained in the unit is compressed, and if so, which algorithms have been used.
It is proposed here to include in the XID message used to negotiate an algorithm, a bitmap identifying which NSAPIs are to use that algorithm. In the current ETSI proposal, 16 NSAPIs can be assigned to a MS. Thus, two extra octets are added to the XID message, where the position of a bit (0 to 15) identifies the NSAPI (1 to 16), a 1 indicates that an NSAPI will use the algorithm, and a 0 indicates that an NSAPI will not use the algorithm. The new XID message is as follows:
Figure imgf000011_0001
Once an algorithm has been negotiated between the two peer SNDCP layers, it is possible to create several different compression/decompression codebooks for that one algorithm, each codebook being assigned to a respective NSAPI. Thus, it is possible to optimise the compression/decompression process for different NSAPIs, i.e. for different SNDCP users. In some cases, a single codebook may still be shared between several NSAPIs using the same algorithm. This may be appropriate, for example, where two end users share the same PDP and are thus likely to generate similar data for which a common codebook is suitable.
When an SNDCP unit is received by an SNDCP layer, the compression algorithms used (if any) are identified from the PCOMP and DCOMP tags. The codebook, to be used for decompression with the identified algorithm, can then be identified from the NSAPI contained in the unit (as described above).
The general structure of a GSM/GPRS radio telephone network is illustrated in Figure 3, where the following acronyms are used. BSC Base Station Controller
BSS Base Station Subsystem
BTS Base Transceiver Station
GGSN Gateway GPRS Support Node
GPRS General Packet Radio Service
GSM Global System for Mobile Communications
HLR Home Location Register
IP Internet Protocol
L3M Layer 3 Management
LLC Logical Link Control
MAC Medium Access Control
MS Mobile Station
MSC Mobile Switching Centre
NSAPI Network Service Access Point Identifier
PC/PDA Personal Computer/Personal Data Assistant
PDP Packet Data Protocol
PDU Packet Data Unit
PSTN Public-Switched Telephone Network
PTM-G Point-To-Multipoint Group
PTM-M Point-To-Multipoint Multicast
PTP Point-To-Point
RLC Radio Link Control
SAPI Service Access Point Identifier
SGSN Serving GPRS Support Node
SMS Short Message Service
SNDCP Subnetwork Dependent Convergence Protocol
SS7 Signalling System number 7
TCP/IP Transmission Control Protocol/Internet Protocol
TDMA Time Division Multiple Access
Urn Mobile Station to Network interface
UMTS Universal Mobile Telecommunications Service
X.25 network layer protocol specification

Claims

Claims
1. A method of operating a mobile radio network in which data is assembled into units by a first convergence protocol layer prior to transmission of the data to a second, peer convergence protocol layer, said data being provided to the first convergence protocol layer by one of a plurality of convergence protocol layer users, the method comprising: assigning at least one access point identifier to each user; and exchanging between said first and second layers one or more compression control message, each message containing a data compression/decompression algorithm identifier, a set of parameters for the identified algorithm, and identification of at least one access point identifier which is to make use of the identified algorithm.
2. A method according to claim 1 , wherein said units of data contain one of said access point identifiers to enable the receiving convergence protocol layer to direct the data contained in the unit to the correct user.
3. A method according to claim 1 or 2, wherein said compression control message contains a bitmap of said access point identifiers, where the bitmap indicates those access point identifiers which are to make use of the identified algorithm and those which are not.
4. A method according to claim 3, wherein each of said messages comprise one octet identifying the compression/decompression algorithm, at least one octet containing a bitmap of said access point identifiers, and a plurality of octets containing respective algorithm parameters.
5. A method according to claim 4, wherein said bitmap is contained in two octets.
6. A method according to any one of the preceding claims, wherein the method forms part of a General Packet Radio Service, and said first and second convergence protocol layers are Subnetwork Dependent Convergence Protocol (SNDCP) layers in a mobile station and in a network, said compression control messages are in the form of exchange identity (XID) messages and said access point identifiers are NSAPI s.
7. A mobile radio device arranged to use the method of any one of the preceding claims.
8. A serving GPRS support node of a cellular radio network arranged to use the method of any one of claims 1 to 7.
PCT/FI1998/000781 1997-10-30 1998-10-06 Subnetwork dependent convergence protocol for a mobile radio network WO1999022557A2 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2000518526A JP2001522182A (en) 1997-10-30 1998-10-06 Subnetwork dependent convergence protocol for mobile wireless networks
AU94433/98A AU750516B2 (en) 1997-10-30 1998-10-06 Subnetwork dependent convergence protocol for a mobile radio network
HK01104024A HK1033401A1 (en) 1997-10-30 2001-06-12 Method and device for operating a mobile radio network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FI974094A FI105760B (en) 1997-10-30 1997-10-30 Cellular Subnet Dependent Convergence Protocol
FI974094 1997-10-30

Publications (2)

Publication Number Publication Date
WO1999022557A2 true WO1999022557A2 (en) 1999-05-14
WO1999022557A3 WO1999022557A3 (en) 1999-07-08

Family

ID=8549831

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI1998/000781 WO1999022557A2 (en) 1997-10-30 1998-10-06 Subnetwork dependent convergence protocol for a mobile radio network

Country Status (15)

Country Link
US (1) US6434133B1 (en)
JP (2) JP2001522182A (en)
CN (1) CN1108683C (en)
AT (1) AT408397B (en)
AU (1) AU750516B2 (en)
DE (1) DE19847679B4 (en)
FI (1) FI105760B (en)
FR (1) FR2770729B1 (en)
GB (1) GB2333211B (en)
HK (1) HK1033401A1 (en)
IT (1) IT1303264B1 (en)
NL (1) NL1010427C2 (en)
RU (1) RU2226315C2 (en)
SE (1) SE518795C2 (en)
WO (1) WO1999022557A2 (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001019066A1 (en) * 1999-09-08 2001-03-15 Voxlab Oy Method, system and software product for transmitting speech on internet
WO2001078286A2 (en) * 2000-04-07 2001-10-18 Nokia Corporation Data packet numbering in packet-switched data transmission
WO2001039522A3 (en) * 1999-11-22 2001-12-27 Bosch Gmbh Robert Method for operating a mobile radio network
WO2002032071A2 (en) * 2000-10-11 2002-04-18 Motorola, Inc. Method and apparatus for optimizing data compression in a wireless digital access system
WO2003001753A1 (en) * 2001-06-25 2003-01-03 Telefonaktiebolaget Lm Ericsson Method for control of data compression
WO2003001828A1 (en) * 2001-06-25 2003-01-03 Telefonaktiebolaget Lm Ericsson Traffic dependent data compression control
JP2003512774A (en) * 1999-10-21 2003-04-02 ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング Driving method of mobile radio network
US6816458B1 (en) * 2000-09-13 2004-11-09 Harris Corporation System and method prioritizing message packets for transmission
US6826152B1 (en) 2000-09-13 2004-11-30 Harris Corporation System and method of conserving bandwidth in the transmission of message packets
US6826153B1 (en) 2000-09-13 2004-11-30 Jeffrey Kroon System and method of increasing the message throughput in a radio network
KR100481477B1 (en) * 2002-11-19 2005-04-07 엘지전자 주식회사 Method for exchange the transfor prameter of General Packet Radio Service system
CN1309278C (en) * 1999-11-02 2007-04-04 诺基亚有限公司 Signalling method
US7460475B2 (en) 2000-06-28 2008-12-02 Nokia Corporation Allocating data transmission resources in packet-switched data transmission
US8190181B2 (en) 2001-03-26 2012-05-29 Tencent (Bvi) Limited Instant messaging system and method

Families Citing this family (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI106088B (en) * 1997-09-12 2000-11-15 Nokia Networks Oy Method of transmitting data between the network portion of a General Packet Radio Service and a subscriber terminal
SE516122C2 (en) * 1999-02-11 2001-11-19 Ericsson Telefon Ab L M Device and method relating to packet data communication and a packet data communication system
FI106762B (en) * 1999-02-16 2001-03-30 Nokia Mobile Phones Ltd A method and system for performing some negotiations in a packet data network
EP1033893A1 (en) * 1999-03-02 2000-09-06 TELEFONAKTIEBOLAGET LM ERICSSON (publ) Basic architecture for packet switched protocol based GSM networks
FI107424B (en) * 1999-03-22 2001-07-31 Nokia Mobile Phones Ltd Method and arrangement to prepare for the transport of multimedia-related information in a cellular radio network
US6804202B1 (en) * 1999-04-08 2004-10-12 Lg Information And Communications, Ltd. Radio protocol for mobile communication system and method
KR100382470B1 (en) * 1999-04-08 2003-05-01 엘지전자 주식회사 Radio Protocol in IMT-2000 Mobile Communication System
FI108599B (en) * 1999-04-14 2002-02-15 Ericsson Telefon Ab L M Recovery in Mobile Systems
KR100308152B1 (en) * 1999-07-31 2001-09-29 서평원 Cell Broadcasting method for Short Message Service
DE19944334C1 (en) * 1999-09-15 2000-12-21 Bosch Gmbh Robert Mobile radio network operating method has data delivered from user and accompanying protocol control information compressed in first convergence protocol layer before grouping into protocol data units
DE19948753A1 (en) * 1999-10-09 2001-04-12 Deutsche Telekom Ag Satellite-based communication system with return channel routing via terrestrial mobile radio networks
US6683853B1 (en) * 1999-12-01 2004-01-27 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic upgrade of quality of service in a packet switched network
DE19958510A1 (en) 1999-12-04 2001-06-07 Bosch Gmbh Robert Method for operating a cellular network
DE10010974A1 (en) * 2000-03-07 2001-09-13 Bosch Gmbh Robert Process for the transmission of data
US6901060B1 (en) * 2000-05-17 2005-05-31 Nokia Corporation Method and apparatus for multiplexing a plurality of data connections onto one temporary block flow
FI20002890A (en) * 2000-12-29 2002-06-30 Nokia Corp Defining a compression in packet switching data transfer
US6947738B2 (en) * 2001-01-18 2005-09-20 Telefonaktiebolaget Lm Ericsson (Publ) Multimedia messaging service routing system and method
US7155173B2 (en) * 2001-03-14 2006-12-26 Nokia Corporation Method and system for providing a context for message compression
CN100433006C (en) * 2001-03-26 2008-11-12 腾讯科技(深圳)有限公司 Method for displaying multiple pages on single window of browser and browse system
US7165112B2 (en) * 2001-06-22 2007-01-16 Motorola, Inc. Method and apparatus for transmitting data in a communication system
US20030039232A1 (en) * 2001-08-22 2003-02-27 Alessio Casati Method of sending a multicast message in such as a GPRS/UMTS network, and a mobile telecommunications network
EP1301000B1 (en) * 2001-10-08 2005-12-21 Siemens Aktiengesellschaft Channel allocation of control and payload data in wireless communication systems
US6661780B2 (en) * 2001-12-07 2003-12-09 Nokia Corporation Mechanisms for policy based UMTS QoS and IP QoS management in mobile IP networks
EP1422882B1 (en) * 2002-11-19 2007-01-17 Research In Motion Limited System and method of unacknowledged network layer service access point identifier (NSAPI) recovery in sub-network dependent convergence protocol (SNDCP) communication
US20040246993A1 (en) * 2003-06-04 2004-12-09 Samsung Electronics Co., Ltd. Method and apparatus for transmitting and receiving multi-protocol data frames
US7193979B2 (en) * 2003-07-11 2007-03-20 Nokia Corporation Method and apparatus for use by a GPRS device in responding to change in SAPI connection
EP1723819B1 (en) * 2004-03-11 2019-10-16 Nokia Solutions and Networks GmbH & Co. KG A method of packet switched handover
GB0405389D0 (en) * 2004-03-11 2004-04-21 Siemens Ag Inter-SGSN PS handover optimisation
EP1741256A1 (en) * 2004-04-28 2007-01-10 Nokia Corporation Protocol parameter negotiation
FI20041005A0 (en) * 2004-07-20 2004-07-20 Nokia Corp Header compression between a compressor and a decompressor
CN1306766C (en) * 2004-09-30 2007-03-21 华为技术有限公司 Service recognition and route method in multimedia broadcast multicast service system
WO2007030041A1 (en) * 2005-09-09 2007-03-15 Telefonaktiebolaget L M Ericsson (Publ) Method and apapratus for sending control information in a communications network
CN101141225B (en) * 2006-09-08 2010-06-09 中兴通讯股份有限公司 Data loss processing method in mobile communication system
US8363607B2 (en) 2006-09-11 2013-01-29 Qualcomm Incorporated VOIP group resource management
CN101843054B (en) * 2007-10-31 2014-12-17 富士通株式会社 Communication method and communication terminal, data transfer device, and controller
CN101287008B (en) * 2008-05-26 2011-05-11 中兴通讯股份有限公司 System for realizing subnet dependent converge protocol
US9240853B2 (en) * 2012-11-16 2016-01-19 Huawei Technologies Co., Ltd. Systems and methods for sparse code multiple access
US9419770B2 (en) 2014-03-31 2016-08-16 Huawei Technologies Co., Ltd. Method and apparatus for asynchronous OFDMA/SC-FDMA
US10701685B2 (en) 2014-03-31 2020-06-30 Huawei Technologies Co., Ltd. Method and apparatus for asynchronous OFDMA/SC-FDMA
US10531432B2 (en) 2015-03-25 2020-01-07 Huawei Technologies Co., Ltd. System and method for resource allocation for sparse code multiple access transmissions
WO2017071586A1 (en) 2015-10-30 2017-05-04 Huawei Technologies Co., Ltd. System and method for high-rate sparse code multiple access in downlink

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0584027A2 (en) * 1992-08-19 1994-02-23 International Business Machines Corporation Seamless peer-to-peer communications in a layered communications architecture
WO1995020283A1 (en) * 1994-01-21 1995-07-27 Nokia Telecommunications Oy Network element in a mobile communication system and a method for packet data transmission in a mobile communication system
WO1996027268A1 (en) * 1995-03-01 1996-09-06 Northern Telecom Limited Cellular packet data arrangement
WO1997048212A1 (en) * 1996-06-07 1997-12-18 Nokia Telecommunications Oy Data compression on a data connection
GB2319144A (en) * 1996-10-11 1998-05-13 Nokia Mobile Phones Ltd A compressed data service in DECT/GSM interworking
WO1998032304A2 (en) * 1997-01-20 1998-07-23 Nokia Telecommunications Oy Routing area updating in packet radio network
WO1998032303A2 (en) * 1997-01-20 1998-07-23 Nokia Telecommunications Oy Routing area updating in packet radio network

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI87616C (en) 1991-04-05 1993-01-25 Nokia Mobile Phones Ltd Method for controlling the function of a packet switched CDMA data network for controlling the operation of the transmitters and receivers
FI97517C (en) 1993-09-06 1996-12-27 Nokia Mobile Phones Ltd Packet data transmission in a digital cellular network
FI98426C (en) 1994-05-03 1997-06-10 Nokia Mobile Phones Ltd Systems for transmitting packet data in the air interface within a digital TMDA cellular system
FI98427C (en) 1994-06-08 1997-06-10 Nokia Mobile Phones Ltd To transmit system packet data at different bit rates in a TDMA cellular system
FI114178B (en) 1995-01-09 2004-08-31 Nokia Corp Dynamic allocation of radio capacity in a TDMA system
FI98027C (en) * 1995-01-10 1997-03-25 Nokia Telecommunications Oy Packet radio system and terminal equipment for a packet radio system
FI102936B1 (en) * 1996-03-04 1999-03-15 Nokia Telecommunications Oy Improving security of packet transmission in a mobile communication system
FI101921B (en) * 1996-06-07 1998-09-15 Nokia Telecommunications Oy Implementation of ATM virtual channels in a packet network
US5790534A (en) 1996-09-20 1998-08-04 Nokia Mobile Phones Limited Load control method and apparatus for CDMA cellular system having circuit and packet switched terminals
FI972725A (en) * 1997-06-24 1998-12-25 Nokia Telecommunications Oy re-routing
US6009456A (en) * 1997-07-30 1999-12-28 Lockheed Martin Corp. Information exchange by intelligent mobile agents in a network

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0584027A2 (en) * 1992-08-19 1994-02-23 International Business Machines Corporation Seamless peer-to-peer communications in a layered communications architecture
WO1995020283A1 (en) * 1994-01-21 1995-07-27 Nokia Telecommunications Oy Network element in a mobile communication system and a method for packet data transmission in a mobile communication system
WO1996027268A1 (en) * 1995-03-01 1996-09-06 Northern Telecom Limited Cellular packet data arrangement
WO1997048212A1 (en) * 1996-06-07 1997-12-18 Nokia Telecommunications Oy Data compression on a data connection
GB2319144A (en) * 1996-10-11 1998-05-13 Nokia Mobile Phones Ltd A compressed data service in DECT/GSM interworking
WO1998032304A2 (en) * 1997-01-20 1998-07-23 Nokia Telecommunications Oy Routing area updating in packet radio network
WO1998032303A2 (en) * 1997-01-20 1998-07-23 Nokia Telecommunications Oy Routing area updating in packet radio network

Cited By (42)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001019066A1 (en) * 1999-09-08 2001-03-15 Voxlab Oy Method, system and software product for transmitting speech on internet
US8295230B2 (en) 1999-10-21 2012-10-23 Ipcom Gmbh & Co., Kg Method for operating a mobile wireless network
US8446918B2 (en) 1999-10-21 2013-05-21 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
US8457154B2 (en) 1999-10-21 2013-06-04 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
US9674314B2 (en) 1999-10-21 2017-06-06 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
US9509808B2 (en) 1999-10-21 2016-11-29 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
CN101527930B (en) * 1999-10-21 2013-07-17 IPCom两合公司 Operating method for mobile radio network
JP2003512774A (en) * 1999-10-21 2003-04-02 ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング Driving method of mobile radio network
US7609726B2 (en) 1999-10-21 2009-10-27 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
US7245636B1 (en) 1999-10-21 2007-07-17 Robert Bosch Gmbh Method for operating a mobile radiotelephone network
US8208428B2 (en) 1999-10-21 2012-06-26 Ipcom Gmbh & Co., Kg Method for operating a mobile wireless network
US8787254B2 (en) 1999-10-21 2014-07-22 Ipcom Gmbh & Co. Kg Method for operating a mobile wireless network
CN1309278C (en) * 1999-11-02 2007-04-04 诺基亚有限公司 Signalling method
EP2309797A3 (en) * 1999-11-22 2011-08-03 IPCom GmbH & Co. KG Method for operating a mobile radio network
US8031659B2 (en) 1999-11-22 2011-10-04 Ipcom Gmbh & Co. Kg Telecommunications network
US8644221B2 (en) 1999-11-22 2014-02-04 Ipcom Gmbh & Co. Kg Telecommunications network
DE10017062B4 (en) * 1999-11-22 2015-03-05 Ipcom Gmbh & Co. Kg Method for operating a mobile radio network
WO2001039522A3 (en) * 1999-11-22 2001-12-27 Bosch Gmbh Robert Method for operating a mobile radio network
JP2003524320A (en) * 1999-11-22 2003-08-12 ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング How to operate a mobile wireless communication network
US7768964B2 (en) 1999-11-22 2010-08-03 Ipcom Gmbh & Co. Kg Method of operating a mobile wireless network
JP2011050069A (en) * 1999-11-22 2011-03-10 Ipcom Gmbh & Co Kg Method for operating mobile radio network
US9072023B2 (en) 1999-11-22 2015-06-30 Ipcom Gmbh & Co. Kg Telecommunications network
JP4755377B2 (en) * 1999-11-22 2011-08-24 アイピーコム ゲゼルシャフト ミット ベシュレンクテル ハフツング ウント コンパニー コマンディートゲゼルシャフト Method for operating a mobile radio communication network
JP2012070420A (en) * 1999-11-22 2012-04-05 Ipcom Gmbh & Co Kg Method of operating mobile radio communications network
US6930980B2 (en) 2000-04-07 2005-08-16 Nokia Mobile Phones Ltd. Data packet numbering in packet-switched data transmission
WO2001078286A3 (en) * 2000-04-07 2002-01-24 Nokia Corp Data packet numbering in packet-switched data transmission
WO2001078286A2 (en) * 2000-04-07 2001-10-18 Nokia Corporation Data packet numbering in packet-switched data transmission
CN1838639B (en) * 2000-04-07 2012-09-05 核心无线许可有限公司 Data packet numbering in packet-switched data transmission
US7460475B2 (en) 2000-06-28 2008-12-02 Nokia Corporation Allocating data transmission resources in packet-switched data transmission
US6816458B1 (en) * 2000-09-13 2004-11-09 Harris Corporation System and method prioritizing message packets for transmission
US6826153B1 (en) 2000-09-13 2004-11-30 Jeffrey Kroon System and method of increasing the message throughput in a radio network
US6826152B1 (en) 2000-09-13 2004-11-30 Harris Corporation System and method of conserving bandwidth in the transmission of message packets
WO2002032071A3 (en) * 2000-10-11 2003-09-25 Motorola Inc Method and apparatus for optimizing data compression in a wireless digital access system
WO2002032071A2 (en) * 2000-10-11 2002-04-18 Motorola, Inc. Method and apparatus for optimizing data compression in a wireless digital access system
US8412785B2 (en) 2001-03-26 2013-04-02 Tencent (Bvi) Limited Instant messaging system and method
US8190182B2 (en) 2001-03-26 2012-05-29 Tencent (Bvi) Limited Instant messaging system and method
US8190181B2 (en) 2001-03-26 2012-05-29 Tencent (Bvi) Limited Instant messaging system and method
US8560939B2 (en) 2001-03-26 2013-10-15 Tencent (Bvi) Limited Instant messaging system and method
US8566404B2 (en) 2001-03-26 2013-10-22 Tencent (Bvi) Limited Instant messaging system and method
WO2003001828A1 (en) * 2001-06-25 2003-01-03 Telefonaktiebolaget Lm Ericsson Traffic dependent data compression control
WO2003001753A1 (en) * 2001-06-25 2003-01-03 Telefonaktiebolaget Lm Ericsson Method for control of data compression
KR100481477B1 (en) * 2002-11-19 2005-04-07 엘지전자 주식회사 Method for exchange the transfor prameter of General Packet Radio Service system

Also Published As

Publication number Publication date
AU750516B2 (en) 2002-07-18
US6434133B1 (en) 2002-08-13
IT1303264B1 (en) 2000-11-06
GB2333211B (en) 2002-12-11
RU2226315C2 (en) 2004-03-27
FR2770729A1 (en) 1999-05-07
CN1278383A (en) 2000-12-27
FR2770729B1 (en) 2002-01-18
ITMI982311A0 (en) 1998-10-28
CN1108683C (en) 2003-05-14
NL1010427A1 (en) 1999-05-07
NL1010427C2 (en) 2000-11-30
FI974094A0 (en) 1997-10-30
ITMI982311A1 (en) 2000-04-28
GB2333211A (en) 1999-07-14
FI105760B (en) 2000-09-29
DE19847679B4 (en) 2007-10-04
SE9803644D0 (en) 1998-10-23
WO1999022557A3 (en) 1999-07-08
SE9803644L (en) 1999-05-01
DE19847679A1 (en) 1999-05-06
HK1033401A1 (en) 2001-08-24
AT408397B (en) 2001-11-26
SE518795C2 (en) 2002-11-19
GB9823844D0 (en) 1998-12-23
JP2001522182A (en) 2001-11-13
JP2005168065A (en) 2005-06-23
FI974094A (en) 1999-05-01
AU9443398A (en) 1999-05-24
ATA177598A (en) 2001-03-15

Similar Documents

Publication Publication Date Title
AU750516B2 (en) Subnetwork dependent convergence protocol for a mobile radio network
US8688094B2 (en) Point-to-multipoint mobile radio transmission
EP2256999B1 (en) Radio access network and terminal with robust header compression
WO1999050974A1 (en) Method for routing data in a communication system
EP0898825A1 (en) Data compression on a data connection
WO2001020924A1 (en) Allocation of radio resources from a network in a packet switched data transmission system
JP3813511B2 (en) Method of operating a mobile radio network
KR20040004358A (en) A method for header compression context control during handover in mobile data communication networks
EP1234426B1 (en) Method and system for identifying encoding/decoding information in a mobile radio network

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 98810820.8

Country of ref document: CN

AK Designated states

Kind code of ref document: A2

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

AK Designated states

Kind code of ref document: A3

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 94433/98

Country of ref document: AU

NENP Non-entry into the national phase

Ref country code: KR

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

122 Ep: pct application non-entry in european phase
WWG Wipo information: grant in national office

Ref document number: 94433/98

Country of ref document: AU