WO2010083936A1 - Procédé pour la communication de paquets - Google Patents

Procédé pour la communication de paquets Download PDF

Info

Publication number
WO2010083936A1
WO2010083936A1 PCT/EP2009/068063 EP2009068063W WO2010083936A1 WO 2010083936 A1 WO2010083936 A1 WO 2010083936A1 EP 2009068063 W EP2009068063 W EP 2009068063W WO 2010083936 A1 WO2010083936 A1 WO 2010083936A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
group
transmitted
transmitting
receiver
Prior art date
Application number
PCT/EP2009/068063
Other languages
English (en)
Inventor
Damien Berton
Original Assignee
Nortel Networks 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
Application filed by Nortel Networks Limited filed Critical Nortel Networks Limited
Publication of WO2010083936A1 publication Critical patent/WO2010083936A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04—Protocols for data compression, e.g. ROHC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60—Network streaming of media packets
    • H04L65/70—Media network packetisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/04—Interfaces between hierarchically different network devices
    • H04W92/12—Interfaces between hierarchically different network devices between access points and access point controllers

Definitions

  • the invention relates to a method for packet communication in a radio access network.
  • the invention also relates to an arrangement for packet communication in a radio access network comprising a base station controller and a base station transceiver connected by a physical packet communication medium.
  • the invention further relates to a computer program product comprising a computer-readable medium with program code that when read and executed by a computer causes the computer to execute such method.
  • the evolution in the area of the core network has led to a transition from the transmission between the base station controller and the base transceiver station of the core network taking place over time division multiplexing over the Abis interface to transmitting the corresponding data over a packet network installed between the base transceiver station and the base station controller.
  • the general aspects of the associated infrastructure topology are well-known in the art and are standardized by the 3rd Generation Partnership Project and evolve in an ongoing process as documented on the homepage on the 3rd Generation Partnership Project under for instance http://www.3gpp.org/gsm-edge-radio-access-network.
  • Said method achieves transmission of a plurality of communication channels in frames (600) between a base station controller (140) and a base transceiver station (160) by carrying out following steps: in a first grouping step, grouping a first number of frames associated to at least a first communication channel DSO 0 in a first fixed time period (205) in a first group for transmission in a first packet (325); in a first transmission step, transmitting the first packet and maintaining the first packet at a transmitter and at a receiver; performing a second grouping step for the second fixed time period for grouping the at least first communication channel DSO 0 in a second group; comparing the first and the second group and in case they are identical transmitting first identity information in the second packet, and at the receiver upon reception of the first identity information replacing the second group by the first group in the second fixed time period.
  • Said arrangement comprises thereto a base station controller (140) and a base station transceiver (160) connected by a physical packet communication medium (155), the base station controller and the base transceiver station. It further comprises a grouping entity for grouping in a first grouping step a first number of frames associated to a first communication channel (DSOO) in a first fixed time period (205) in a first group for transmission in a first packet (325); The grouping entity is further configured for performing a second grouping step for the second fixed time period for grouping in a second group.
  • the arrangement additionally comprises a transmitter for transmitting in a first transmission step the first packet and for maintaining the first packet at the transmitter, and a receiver for receiving said first packet and for maintaining the first packet at the receiver.
  • a comparator is present for comparing the first and the second group and in case they are identical transmitting first identity information in the second packet.
  • a replacing entity is present for replacing at the receiver upon reception of the first identity information the second group by the first group in the second fixed time period.
  • the method according to the present invention allows to group a plurality of frames that are for instance transmitted during a packet transmission period.
  • the associated group is stored at the transmitter and at the receiver. In this manner, the grouped frames of one time period can be compared with the group frames of a next fixed time period. A judgement upon the identity of the subsequent frame groups is based on this comparison.
  • the packet communication network may be used more efficiently.
  • the transmitter forms part of the basestation controller and the receiver forms part of the basestation transceiver.
  • the further use of the receiver for instance a transmission to a mobile handset.
  • the transmitter is part of the basestation transceiver and the receiver is part of the basestation controller.
  • frames of a plurality of communication channels can be grouped in a particular time interval.
  • the grouped frames are then transmitted over the packet network in order to exploit the redundancy of a plurality of communication channels in one transmission step.
  • a plurality of communication channels can be transmitted in one communication packet while at the same time each individual channel can be marked in the packet concerning his identity information.
  • a communication channel of a TDM frame is transmitted and the fixed time period is accordingly selected in order to minimize the conversion effort for handling GSM TDM frames.
  • confirmation information is transmitted to the transmitter from the receiver upon reception of a communication packet. This guarantees that no information is lost in the course of the transmission of communication channels according to the present invention.
  • the confirmation information comprises a packet sequence number thus ensuring, that an appropriate packet may be allocated and if one packet in the sequence is lost, the proper packet may be retransmitted from the transmitter to the receiver.
  • a communication packet from the base transceiver station to the base station controller is used to transmit the packet sequence number which allows a further reduction in the traffic associated to performing the method of the present invention, as normal communication packets for instance transmitting uplink traffic can be used to convey the information associated to performing the method according to the present invention.
  • the identity information is transmitted in form of a compression header indicating a list of not transmitted communication channels as this represents an efficient method to communicate which information can be duplicated on the receiver side from the packets stored there after receiving them during previous transmissions.
  • a plurality of communication channels are acquired during a fixed time period as a chunk, as this allows it to adapt the method according to the present invention to the size of the GSM TDM frame precisely representing the number of transmitted communication channels and the corresponding 20 ms transmission period.
  • the transmission occurs over Ethernet, which is a widely accepted and used packet communication network that is available on the market at competitive prices and at the same time operates in a highly reliable manner.
  • the base station controller and the base station transceiver are connected over an Abis interface and thus the method according to the present invention is applicable to the common standard environment of the GSM EDGE radio access network.
  • the subsequent packet is transmitted containing the frames of all the communication channels like the first packet is.
  • the arrangement for packet communication according to the present invention comprises all the communication entities and resources that are required to perform the method according to the present invention and thus allows to perform the method with a minimum number of hardware resources.
  • the physical packet communication medium is arranged as Ethernet and thus allows to use standardized packet communication networks in the arrangement of the present invention.
  • the computer program product according to the present invention allows it to easily store and distribute a computer program code for executing the method of the present invention as process steps in various devices such as base station controllers and base transceiver stations of a radio access network.
  • Fig. 1 shows a configuration of a radio access network
  • Fig. 2 shows an example of a channel usage in a TDM link
  • Fig. 3 shows an example of a TDM channel usage according to an embodiment of the present invention
  • Fig. 4 shows an example for extraction of columns from TDM frames
  • Fig. 5 gives an example of packet confirmation according to an embodiment of the present invention
  • Fig. 6 shows an example of an RTP packet format
  • Fig. 7 gives an example of a packet header
  • Fig. 8 gives an example of a sequence of packet confirmations
  • Fig. 9 shows an example for compression cancellation
  • Fig. 10 gives an example for an optimization of compression cancellation.
  • Fig. 1 shows an example of a radio access network.
  • This network may be comprised of a public switched network 105, which is connected to a mobile switching centre 115.
  • This mobile switching centre 115 is further connected to a telecommunication control unit 125, which is again connected to a base station controller 140.
  • the base station controller 140 was previously connected to the base transceiver station 155 via a TDM - time division multiplexing - connection (150) that realized the Abis interface.
  • the radio access network further comprises an "Agprs"-interface between the basestation controller 140 and an internet or intranet 110.
  • This "Agprs"-interface is embodied with a serving GPRS support node 120 - on the side of the internet 110 - and with a packet control unit support node 130 - linked to the base station controller 140.
  • the GPRS support node 120 and the packet control unit support node 130 are coupled to each other.
  • the basestation controller 140 is further coupled to a base transceiver station 140 over a packet network 145 that realizes the Abis interface.
  • the configuration as shown in Fig. 1 allows a smooth transition between the time division multiplexing communication between the base station controller and the base transceiver station 150 and 155 on the one hand, and a packet communication link 145 between the base station controller 140 and the base transceiver station 160, on the other hand.
  • the packet communication link 145 can be used more efficiently.
  • Fig. 2 gives an example of a prior art approach of transmitting communication channels in packets.
  • the packet communication is carried out in accordance with a E1 TDM link.
  • Reference sign 205 indicates the 256 communication channels that may be transmitted per E1 TDM link.
  • Reference sign 210 indicates 20 ms of speech whereas reference numeral 215 marks the DTX header for discontinuous transmission.
  • Reference sign 200 marks the channel usage example for TDM.
  • Reference sign 220 indicates an LAPD message to transmit control information.
  • reference sign 270 indicates space that is unused in the packets during transmission. Such an unused space may be for instance space that is unused due to half rate communication. As can be seen in the example of Fig.
  • Fig. 3 gives an example of a TDM channel usage 300 according to an embodiment of the present invention.
  • reference sign 305 indicates the 256 channels per E1 TDM link
  • 315 marks the DTX header
  • 310 marks 20 ms of speech.
  • Reference sign 320 is associated to a control LAPD message and reference signs 325 to 360 in steps of five indicate respective contents of packets 1 to 8.
  • Reference sign 312 marks the greyscale for optimized content.
  • Reference sign 316 marks the greyscale for non-optimized content.
  • Reference sign 318 stands for content that is removed from the packet due to redundancy.
  • This TDM channel usage 300 allows a better optimization. For instance, when half rate communication takes place, most of the contents of packets 5 to 8 is unused as indicated by reference signs 376, 378 and 374. Consequently this content may be removed from the packet.
  • the removal is carried out by exploitation of the features of GSM.
  • packets are transmitted within a 20 ms period nature of a GSM TDM frame. All of the transmitted packets are memorized, both at the transmitter and at the receiver.
  • the transmitter compares a new GSM TDM frame to be sent with a previous one sent 20 ms before on a channel by channel basis. As a result of this comparison, the transmitter may reduce the channel size: identical content channels are not sent. Instead, a specific compression header is added which contains the list of non-sent channels. These non-sent channels then can be reproduced from the stored content at the receiver and the information in the compression header on the receiver side and be duplicated.
  • a static compression is used.
  • This static compression represents a first level of compression that directly results from the definition of dialog protocols between the base station controller and a base transceiver station. Indeed for each PCM link serving one IP module of the base transceiver station and one IP gateway of the base station controller a first and a second channel are defined on the packet switched network.
  • the GSM signal which conveys the LAPD message on a UDP/IP Sec connection, and the GSM traffic channels which convey TRAU frames on an RTP N /UDP/IP Sec connection.
  • the content of all DSOs of the PCM link which are not configured - neither as traffic nor as LAPD DSOs - is not transmitted on the packet switched network which is called a static compression.
  • the present invention in this embodiment proposes dynamic compression in the form of differential compression for traffic channels.
  • the differential compression for traffic channels serves to save bandwidth on the packet network by not transporting most of the useless information which is carried by some TRAU frames as there is an idle bit pattern, GPRS idle frames, and a part of the DTX frames.
  • the advantage of differential compression is that it works without any knowledge of the kind of traffic in terms of voice, circuit-switched data or GPRS that is transmitted in the traffic channels.
  • the configuration of channels - full rate or half rate - may also be unknown.
  • Differential compression exploits the fact that when a traffic channel is in a silent situation meaning in an active circuit-switch channel or an idle GPRS channel the same information will be repeated every 20 ms.
  • the differential compression consists in comparing the data being transmitted with the data of the same channel transmitted 20 ms before.
  • the compression function operates on chunks of traffic. Those chunks are made of the content of all traffic DSOs of a given PCM link for a certain time interval which is preferably equal to the period of packet transmission T PT .
  • this time interval is selected to be a divider of 20 ms.
  • a chunk of traffic is preferably divided in columns.
  • a column is made of the content of a particular 8-kbit/s channel inside traffic chunk.
  • Each column is then compared with the column corresponding to the same channel in the chunk transmitted 20 ms before.
  • a chunk used for such a comparison may preferably called reference chunk.
  • a column can be compressed or not according to the following rule: 1. If the content of the column is identical to the content of the same column in the reference chunk, then the column is compressed which means that the data of the column are not included in the transmitted packet.
  • the column is not compressed meaning that the data are included in the transmitted packet.
  • a differential compression method can be applied by comparing each chunk with a reference chunk transmitted D * 20 ms before (40 ms or 60 ms ).
  • D strictly greater than 1 does not include any loss of compression capability for a channel permanently in "silent" state.
  • a compression may be performed for LAPD channels transmitting control information as well as TRAU frames transmitting voice information.
  • a static compression is for instance communicated between the base station controller IP gateway and the base transceiver station IP module in form of the DSO mapping of the IPG-IPM link which is provided in a TCP message.
  • Fig. 4 gives an example of an extraction of columns as an example for groups from TDM frames.
  • the same compression algorithm may be implemented in the transmitting entity of the base station controller IP gateway for downlink and the base transceiver station IP module for uplink traffic.
  • Fig. 4 shows an example of a chunk of traffic channels where a plurality of TDM frames here N TDM frames 430 are acquired over a fixed time period.
  • the traffic channels DSO 0 410, DSOi 415, DSO j 420 and DSOm-1 425 are marked.
  • Traffic channel DSOo is represented in a column 450 and traffic channel DS0 m- i is represented in a column 470.
  • a chunk of traffic made of N TDM frames during a period of time equal to the packet transmission period is acquired.
  • Each of these TDM frames contains m traffic DSOs.
  • the number of traffic DSOs and their position are defined in the DSO mapping provided in the IP service channel.
  • Variable D denotes the compression memory depth which is a parameter for the number of frames that are kept in memory. Columns which are identical are e.g. removed from the transmitted packet which will then contain the set of columns which are not identical and the compression header. This header is for instance made of M bits wherein 1 bit corresponds to each column. If this bit is for instance set to 0 the column may be identical to the one transmitted D * 20 ms before and if it is 1 the column is presently transmitted. Furthermore it is preferable to store the uncompressed chunk in memory as well as in the transmitter and in the receiver in order to be used as a reference chunk.
  • Fig. 5 shows an example of an acknowledgment mechanism according to an embodiment of the present invention.
  • Reference sign 505 marks the IP gateway of the base station controller and reference sign 510 marks the IP module of the base transceiver station.
  • the IP gateway or the IP module for instance receives an RTP packet with a sequence number SN it tags the next transmitted packet on the same link with a piggy-backed sequence number in the S.N. ACK field in the RTP N header.
  • packet transmissions 520, 530, 540 and 550 are marked with their normal sequence numbers for uplink and downlink SN1 D L, PB(SNOUL)] and so on marking the normal packet transmission flow whereby each of the 16-bit sequence number SN DL and SN UL are independent from each other and are managed respectively by the IP module of the base transceiver station for uplink numbers and by the IP gateway of the base station controller for downlink sequence number.
  • the piggy-backed sequence number is corresponding to the last sequence number SN (or the one with the higher sequence number in case of a disordered arrival) which has been received between the previous transmitted packet and the next one to transmit.
  • the piggy-backed sequence number provided will remain the same as the previous one provided and a control byte will be set to 0 informing the receptor of the invalidity of the piggy-backed sequence number.
  • the acknowledgement mechanism is based on the fact that when a packet with a sequence number SN has been transmitted the transmitter expects a packet in the opposite direction with the corresponding piggy-backed sequence number to be received within the maximum round-trip-time of the packet switched network. If the piggy-backed sequence number has not been received at that time, the packet is considered to be lost and present chunks will not be used as reference for the compression.
  • the IP transmitter expects a packet in the opposite direction to be able to supply a new piggy-backed sequence number in the new packet to transmit.
  • the piggy-backed sequence number transmitted is the last or higher sequence number which has been received and if no packet is received, the IP transmitter will input the previous piggy-backed transmitted sequence number and set to 0 an acknowledge bit of a control byte informing of the invalidity of the piggy-backed sequence number.
  • Fig. 6 shows an example of a real-time packet format 600 which is transmitted over the packet network between base station controller and base transceiver station.
  • a real-time packet format 600 which is transmitted over the packet network between base station controller and base transceiver station.
  • it comprises an Ethernet header 605 and a compressed payload 625 which is comprised of columns 613, 618 and 628 and at 623 of a list of columns that are not transmitted because the content of these columns is identical to the ones that have been transmitted with the previous packet.
  • the receiver Upon reception of such a real-time packet the receiver will arrange the packets in the corresponding sequence and take the ones from the reference chunk to fill in the empty space of the payload to compose a complete set of communication channels.
  • Fig. 7 shows an example of an RTP N header 700
  • 715 is the location of the piggy-backed confirmation sequence number
  • 710 is the location of the normal packet sequence number
  • 720 represents the DSO bit map.
  • Fig. 8 explains an example of potential packet network impairments and a corresponding behaviour of the receiver regarding a validity bit of the sequence number.
  • the emitter 805 communicates packets with a receiver 810.
  • packet SN#1 and SN#2 arrives in the same window.
  • the next piggy- backed sequence number supplied by the receiver is at 823 the last higher sequence number PB(SN#2).
  • a piggy-backed sequence number for packet SN#1 is never sent so at 83 the emitter 805 has received a piggy-backed sequence number 2. Consequently here the emitter 805 acknowledges the reception of piggy-backed sequence number #2 at 833.
  • Fig. 9 gives an example for a data flow to effect cancellation of compression.
  • Such an evaluation is preferably performed in order to avoid complications as a consequence of packet losses. This is particularly important, in case whenever a reference chunk has not been acknowledged.
  • the IP transmitter checks preferably the acknowledgement state of the reference chunk 905 at an evaluation 910 before proceeding with compression, meaning omission of certain packet content. If the packet containing the reference chunk has been lost or is still waiting for acknowledgement compression of the columns is prohibited at 913 respectively 923 and an RTP packet which is uncompressed is sent at 928, meaning that all the frames are contained in the respective columns to be transmitted in the packet.
  • the reference chunk has been acknowledged at 918 compression will be effected at 938 allowing a packet to be sent, which only contains the modified columns at 943 and the compression header indicating the identical columns to the previously transmitted chunk.
  • Fig. 10 gives an example for compression optimization according to a further embodiment of the present invention.
  • This alternative method is based on the principle that the compressing side may not compress columns that were included in the non-acknowledged packet. According to that the packet still can be partially compressed. This is an important advantage in case the network load increases during busy hours. In this case the delay and jitter can lengthen with a risk of loss on compression packet acknowledges. Thus this optimization allows to avoid excessive packages with maximal size where the packet is not fully compressed, which are unfavourable for the network.
  • a packet exchange 1000 between an IP module 1020 of a base transceiver station and an IP gateway 1010 of a base station is shown.
  • a packet 1030 is sent from the IP module to the IP gateway and at 1033 is acknowledged by a piggy-backed sequence number from the IP gateway 1010 to the IP module 1020.
  • Greyscales 1023 indicate a column that may be compressed, 1018 a column that is not compressed and 1015 a column which is compressed. In the beginning all columns have the colour 1018 and thus none of them is compressed.
  • packet 10b is transmitted in 1038 to the IP gateway and acknowledged in 1043 to the IP module.
  • packet 10c contains compressed columns 1 and 2 where column 1 is compressed and column 2 which is identical to packet 10b remains compressed. In this case the column 4 has changed and thus is transmitted uncompressed marked by colour 1018. In this case however the IP module 1020 receives no acknowledgement packet and transmits packet 10b as a consequence of the missing acknowledgement packet.
  • columns 3 and 4 have not been acknowledged they have to remain uncompressed.
  • columns 1 and 2 are the same as in packet 10c and thus may be compressed as indicated by colour 1023 because they have been already acknowledged previously.
  • the present invention relates to a method for packet communication in a radio access network.
  • the method leads to an increase in the capacity of a packet switched network between a base station controller and a base transceiver station. This is obtained by gathering a number of TDM frames associated to communication channels to be transmitted in a TDM frame. This occurs in form of a chunk transmitting them, while at the same time storing them at the transmitter and at the receiver.
  • columns representative of a respective communication channel of a next transmission period are compared with a previous one. A determination is made if identical columns are contained. If so, these columns are omitted from transmission. Instead, a reference is transmitted in a compression header indicating the number and position of identical columns. This allows the receiver to generate a complete number of communication channels, e.g. by filling in the previously stored columns that have been not transmitted.
  • the invention further relates to an arrangement in which the method can be implemented, as well as a computer program for carrying out the method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé pour la communication de paquets dans un réseau d'accès radio améliorant la capacité d'un réseau à commutation de paquets entre un contrôleur de station de base et une station d'émetteur-récepteur de base par le regroupement d'un certain nombre de trames TDM associées à des canaux de communication à transmettre dans une trame TDM. Cela se produit sous la forme d'un fragment qui les transmet, tandis qu'au même moment celui-ci les stocke au niveau de l'émetteur et du récepteur. Lors de la transmission suivante, des colonnes représentatives d'un canal de communication respectif d'une période de transmission suivante sont comparées à une transmission antérieure. Une détermination est faite si des colonnes identiques sont contenues. Si c'est le cas, ces colonnes sont omises pour la transmission. Au contraire, une référence est transmise dans un en-tête de compression indiquant le nombre et la position des colonnes identiques. Le récepteur peut alors régénérer un nombre complet de canaux de communication.
PCT/EP2009/068063 2009-01-23 2009-12-31 Procédé pour la communication de paquets WO2010083936A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14682109P 2009-01-23 2009-01-23
US61/146,821 2009-01-23

Publications (1)

Publication Number Publication Date
WO2010083936A1 true WO2010083936A1 (fr) 2010-07-29

Family

ID=42104505

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2009/068063 WO2010083936A1 (fr) 2009-01-23 2009-12-31 Procédé pour la communication de paquets

Country Status (1)

Country Link
WO (1) WO2010083936A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111770177A (zh) * 2020-06-29 2020-10-13 浙江中控技术股份有限公司 一种数据处理方法及数据采集终端

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050117610A1 (en) * 2001-08-23 2005-06-02 Alcatel Compressor, decompressor, data block and resource management method
US20070047657A1 (en) * 2005-08-25 2007-03-01 Toma Andrei E Methods and apparatus for differential encoding

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050117610A1 (en) * 2001-08-23 2005-06-02 Alcatel Compressor, decompressor, data block and resource management method
US20070047657A1 (en) * 2005-08-25 2007-03-01 Toma Andrei E Methods and apparatus for differential encoding

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111770177A (zh) * 2020-06-29 2020-10-13 浙江中控技术股份有限公司 一种数据处理方法及数据采集终端

Similar Documents

Publication Publication Date Title
EP1153490B1 (fr) Compression d'en-tete dans des services en temps reel
EP1525690B1 (fr) Procedes et appareil de regroupement de signaux reseau et de reduction de largeur de bande
EP1927231B1 (fr) Procédé et dispositif pour la segmentation par paquets et la signalisation de concaténation dans le système de communication
US7492789B2 (en) Method and system for dynamic aggregation in a wireless network
EP1913723B1 (fr) Procede et appareil de transmission et/ou de reception de donnees par reseau sans fil et dispositif sans fil
EP2094049B1 (fr) Procédé et dispositif d'envoi de RLC PDU dans un système de communications mobile
US7738505B2 (en) Synchronization method and system for transmitting voice data in a mobile communication system
US20090268667A1 (en) Header compression mechanism for transmitting RTP packets over wireless links
UA77036C2 (en) Method for transmitting data packets (variants); a data transmission system and a mobile terminal for the realization of the method
US7403543B2 (en) TCP/IP header compression format and method over wireless network
SE519221C2 (sv) Icke-transparent kommunikation där bara dataramar som detekterats som korrekta skickas vidare av basstationen
US7468976B2 (en) Efficiency improvement for shared communications networks
CN101170487B (zh) 数据流复用中的压缩方法和压缩系统以及压缩设备
US8005116B2 (en) System and method for mitigating the effects of bit insertion in a communications environment
EP1902567B1 (fr) Codage efficace de paquets de donnees non ordonnes dans un reseau
KR100631742B1 (ko) Ａｃｋ 프레임 전송 방법 및 장치
WO2010083936A1 (fr) Procédé pour la communication de paquets
EP4142397A1 (fr) Dispositif et procédé de communication
US20230246745A1 (en) Communication system
CN1972305A (zh) 一种协商方法及系统
US7764673B1 (en) System and method for implementing a variable size codebook for compression in a communications environment
CN102474754B (zh) 上行链路资源的改进分配
EP2276274A1 (fr) Procédé, système ainsi que station de base et centre de commutation mobile (msc) pour transfert de données
WO2000072550A1 (fr) Systeme de communication et procede relatifs a un reseau ip

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09809066

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09809066

Country of ref document: EP

Kind code of ref document: A1