Abstract: Presence communications are selectively controlled to reduce signaling traffic associated with one or more presence attributes without impacting when or how frequently presence messages associated with other presence attributes may be sent. A first threshold condition is determined that is associated with sending a presence publication message including first presence information from a presence entity to a presence server. A second threshold condition is determined that is associated with sending a presence publication message including second different presence information from the presence entity to the presence server.

Abstract: The present invention relates to a method of reducing setup delay for an uplink message from a user terminal (UT) in a delay sensitive service in a radio telecommunications system, such as a push to talk service (PoC), by predicting that delay sensitive data is about to be transmitted, sending, as a response to the prediction, a connection setup signal from the terminal to a basestation subsystem (BSS) in order to set up an early uplink radio connection, and transmitting the delay sensitive data via the early uplink connection. There is also provided a user terminal (UT) and a radio telecommunications system.

Abstract: A base station establishes a data channel in an uplink between the base station and a user equipment, establishes a control channel in the uplink between the base station and the user equipment, and determines a gating configuration associated with the control channel. The base station also transmits the gating configuration to the user equipment, receives a gated control signal, via the control channel, based on the gating configuration, and synchronizes time slots for signal bursts associated with the gated control signal and time slots for data packets associated with the data channel. The base station further schedules transmissions of the data packets based on the synchronized time slots, generates an absolute grant based on the scheduled transmissions of the data packets, and transmits the absolute grant to the user equipment.

Abstract: The object of the present invention is to perform an enhanced prediction technique. The object is achieved by a method in a base station comprised in a radio access network. The base station is adapted to communicate with at least one user equipment, the method comprises the steps of receiving a sequence of CQI values sampled at the times t=1, . . . , n, from one or more of the at least one user equipments; estimating for each of the received specific CQI value k, the conditional expectation of the CQI value at time t+d, given the specific CQI value k at time t; and obtaining a predicted CQI value for the specific CQI value k, which predicted CQI value is the estimated conditional expectation of the CQI values at a time t+d for the specific CQI value k. Publ.

Abstract: The present invention is directed towards compressing and decompressing data transmitted between an end terminal (12) and a network server (20) controlling compression in communication sessions involving the end terminal. States related to the end terminal that are created and used for compressing and decompressing data transmitted between the end terminal and the network server when the end terminal is first registered to the first network server are saved as the end terminal deregisters from the first network server. When the end terminal again registers to the network server these saved states are directly used. In this way it is possible to start compressing data using the saved states immediately after a following registering for providing a more effective dynamic compression.

Abstract: A telecommunications network comprises a sending entity (22) and a receiving entity (24) which communicate over a radio interface (26). The sending entity (22) comprises a compressor (40) and a message formatter (34). The compressor (40) in turn comprises a sending entity compression dictionary (60) and dictionary update decision logic (62). The compressor (40) compresses a message to obtain a compressed message to be sent over the radio interface (26) to the receiving entity (24) and also determines a compression factor for the message. The compression factor is based on similarity of the message to contents of the sending entity compression dictionary. The dictionary update decision logic (62) makes a decision whether the compression factor justifies updating of a receiving entity decompression dictionary (70). The message formatter (34) includes, in the compressed message, an update indication regarding the decision.

Abstract: The present invention relates to management of a state memory in a communications unit. The state memory then stores states that are used in message-based communication with external units in a communications system. The data message communicated between the units are defined into multiple message classes. Furthermore the state memory is divided into multiple memory portions, where each such memory portion is assigned to store states associated with a specific message class. This will prevent overwriting important states with less useful states.

Abstract: Presence communications are selectively controlled to reduce signaling traffic associated with one or more presence attributes without impacting when or how frequently presence messages associated with other presence attributes may be sent. A first threshold condition is determined that is associated with sending a presence publication message including first presence information from a presence entity to a presence server. A second threshold condition is determined that is associated with sending a presence publication message including second different presence information from the presence entity to the presence server.

Abstract: The present invention relates to a method of reducing setup delay for an uplink message from a user terminal (UT) in a delay sensitive service in a radio telecommunications system, such as a push to talk service (PoC), by predicting that delay sensitive data is about to be transmitted, sending, as a response to the prediction, a connection setup signal from the terminal to a basestation subsystem (BSS) in order to set up an early uplink radio connection, and transmitting the delay sensitive data via the early uplink connection. There is also provided a user terminal (UT) and a radio telecommunications system.

Abstract: The invention relates to message-based communication between at least two units (100; 200) participating in a communications session. A first communications unit (100) generates and stores a state (10) comprising unit-associated data applicable for multiple messages to be communicated between the unit (100) and a second unit (200). A copy of this state (10) is then transmitted to the second unit (200), where it is stored. The state (10) and state copy can now be used in message processing for the purpose of reducing the message size and reducing utilization of communications resources. Data contained in the state (10) or state copy and found in the message (m1) is removed from the message prior transmission thereof. The resulting reduced-size message (m1?USD) is transmitted to the receiving unit, where the message (m1?USD) is anew processed by re-entering the data, removed by the transmitting unit, into the message (m1?USD) using the state copy or state. The original message (m1) is then recreated.

Abstract: A system, method, and apparatus for increasing the efficiency of the compression of a communication protocol for use over bandwidth limited communication links. One aspect of the present invention uses the knowledge of the structure and content of communication protocols to form a static dictionary or static binary code tree. As a result, the compression efficiency can be greatly increased. Another aspect of the present invention provides a combined static and dynamic dictionary or binary code tree to perform communication protocol compression. In one aspect of the invention, the static binary code tree or static dictionary is constructed by studying flows of data protocols in the conditions of their intended usage.

Abstract: A method, system, and apparatus for increasing the efficiency and robustness of the compression of a communication protocol for communication between entities over bandwidth limited communication links. The present invention uses the request-reply nature of communication protocols to update compression and decompression dictionaries. Each communication entity will update its dictionary with a new message as soon as it is known that the other communication entity has access to the message. In one aspect of the present invention, an entity updates a compression/decompression dictionary by updating the dictionary with sent messages as soon as a reply arrives from the other entity, and by updating the dictionary with received messages immediately. In another aspect of the present invention, received messages are used to update an entity's decompression dictionary and sent messages are used to update an entity's compression dictionary.

Abstract: A telecommunications network comprises a sending entity (22) and a receiving entity (24) which communicate over a radio interface (26). The sending entity (22) comprises a compressor (40) and a message formatter (34). The compressor (40) in turn comprises a sending entity compression dictionary (60) and dictionary update decision logic (62). The compressor (40) compresses a message to obtain a compressed message to be sent over the radio interface (26) to the receiving entity (24) and also determines a compression factor for the message. The compression factor is based on similarity of the message to contents of the sending entity compression dictionary. The dictionary update decision logic (62) makes a decision whether the compression factor justifies updating of a receiving entity decompression dictionary (70). The message formatter (34) includes, in the compressed message, an update indication regarding the decision.

Abstract: A method, system, and apparatus for increasing the efficiency and robustness of the compression of messages using a communication protocol for communication between entities over bandwidth-limited communication links. In one aspect of the present invention, a dictionary compression method is used to compress and decompress messages between communication entities. Each communication entity includes a static dictionary, a dynamic dictionary, a Temporary Receiver Dictionary, and a Temporary Sender Table. During compression of messages, a compressor in each entity uses the static dictionary, the dynamic dictionary, and the Temporary Receiver Dictionary as compression dictionaries. During decompression of messages, a decompressor in each entity uses the static dictionary, the dynamic dictionary, and the Temporary Sender Table as decompression dictionaries.

Abstract: Method and apparatus for conducting a search to match a string of symbols of a sequence of symbols with a stored string of symbols in a dictionary to provide a matched string of symbols. In the method, after a matched string of symbols of the sequence of symbols has been found, beginning from a first position in the dictionary in which the first symbol of the matched string is stored, it is determined if a longer matched string of symbols can be found by first comparing a chosen symbol that follows the matched string of symbols in the sequence of symbols with a symbol stored in a corresponding position in the dictionary, beginning with another position in the dictionary in which the first symbol is stored, to determine whether the symbol stored in the corresponding position matches the chosen symbol. If the comparison does not result in a match, it is immediately known that a longer string of matched symbols has not been found and it maybe possible to omit additional comparing steps.

Abstract: A system, method, and apparatus for increasing the efficiency of the compression of a communication protocol for use over bandwidth limited communication links. One aspect of the present invention uses the knowledge of the structure and content of communication protocols to form a static dictionary or static binary code tree. As a result, the compression efficiency can be greatly increased. Another aspect of the present invention provides a combined static and dynamic dictionary or binary code tree to perform communication protocol compression. In one aspect of the invention, the static binary code tree or static dictionary is constructed by studying flows of data protocols in the conditions of their intended usage.

Abstract: A method, system, and apparatus for increasing the efficiency and robustness of the compression of messages using a communication protocol for communication between entities over bandwidth-limited communication links. In one aspect of the present invention, a dictionary compression method is used to compress and decompress messages between communication entities. Each communication entity includes a static dictionary, a dynamic dictionary, a Temporary Receiver Dictionary, and a Temporary Sender Table. During compression of messages, a compressor in each entity uses the static dictionary, the dynamic dictionary, and the Temporary Receiver Dictionary as compression dictionaries. During decompression of messages, a decompressor in each entity uses the static dictionary, the dynamic dictionary, and the Temporary Sender Table as decompression dictionaries.

Abstract: A method, system, and apparatus for increasing the efficiency and robustness of the compression of a communication protocol for communication between entities over bandwidth limited communication links. The present invention uses the request-reply nature of communication protocols to update compression and decompression dictionaries. Each communication entity will update its dictionary with a new message as soon as it is known that the other communication entity has access to the message. In one aspect of the present invention, an entity updates a compression/decompression dictionary by updating the dictionary with sent messages as soon as a reply arrives from the other entity, and by updating the dictionary with received messages immediately. In another aspect of the present invention, received messages are used to update an entity's decompression dictionary and sent messages are used to update an entity's compression dictionary.