EP1166502A1 - Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic - Google Patents

Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic

Info

Publication number
EP1166502A1
EP1166502A1 EP00919989A EP00919989A EP1166502A1 EP 1166502 A1 EP1166502 A1 EP 1166502A1 EP 00919989 A EP00919989 A EP 00919989A EP 00919989 A EP00919989 A EP 00919989A EP 1166502 A1 EP1166502 A1 EP 1166502A1
Authority
EP
European Patent Office
Prior art keywords
packets
signaling message
rlp
voice
priority
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP00919989A
Other languages
German (de)
English (en)
Inventor
Roy Davis
Parviz Yegani
Frank Quick
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
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 Qualcomm Inc filed Critical Qualcomm Inc
Publication of EP1166502A1 publication Critical patent/EP1166502A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Definitions

  • the invention relates to wireless communications, and more particularly, to a system and method for prioritizing signaling messages that are multiplexed into a digital voice or data transmission channel to reduce the impact of the signaling transmission on voice quality.
  • Wireless communication systems generally are comprised of many mobile stations (also referred to as user terminals) and one or more base stations.
  • a base station will provide service to several mobile users via individual communications channels.
  • a typical terrestrial wireless communications system comprises at least one terrestrial base station and a number of mobile stations (for example, a mobile telephone).
  • a satellite communications system links between a mobile station (MS) and a base station (BS) or gateway (G W) are provided by one or more relay satellites.
  • a base station can link a mobile station to other mobile stations or to a terrestrial network, such as a public telephone system.
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • CDMA code division multiple access
  • PN spreading codes are used to discriminate between signals transmitted by a base station over different beams, and to discriminate between multipath signals. These PN codes are typically shared by all communications signals within a beam.
  • channelizing codes are used to discriminate between signals for particular mobile stations transmitted within a satellite beam on the forward link. That is, a unique orthogonal channel is provided for each mobile station on the forward link by using a unique "channelizing" orthogonal code. Signals intended for conveying information to particular mobile stations are referred to as "traffic channels.”
  • Typical CDMA spread-spectrum communications systems contemplate the use of coherent modulation and demodulation for forward link mobile station communications.
  • a "pilot" carrier signal (hereinafter referred to as a "pilot signal”) is used as a coherent phase reference for base station-to-subscriber links. That is, a pilot signal, which typically contains no data modulation, is transmitted by a base station throughout a region of coverage. A single pilot signal is typically transmitted by each base station for each frequency used. These pilot signals are shared by all mobile stations receiving signals from the base station. Pilot signals are used by mobile stations to obtain initial system synchronization and time, frequency, and phase tracking of other signals transmitted by the base station.
  • Phase information obtained from tracking a pilot signal carrier is used as a carrier phase reference for coherent demodulation of signals transmitted on the traffic channels.
  • This technique allows many traffic channels to share a common pilot signal as a phase reference, providing for a less costly and more efficient tracking mechanism.
  • a traffic channel is referred to as a channel carrying signals for a particular mobile station.
  • the base station can convey information to that particular mobile station using a channel known as a paging channel. For example, when a call has been placed to a particular mobile phone, the base station alerts the mobile phone by means of a signal transmitted on the paging channel. Paging channels are also used to distribute system overhead information.
  • a mobile station can respond to a paging signal by sending a signal over a channel referred to as an "access channel" on the "reverse" communications (that is, the communications link originating at the mobile station and terminating at the base station).
  • the access channel is also used by a mobile station to originate a communication link or call, or send location updating information.
  • a particular access channel is typically associated with a particular paging channel.
  • Traffic channels include voice data packets (sometimes called voice data "streams") and signaling messages carrying control information and short text messages specific to a mobile station. Voice packets and signaling messages share a single traffic channel.
  • the traffic channel comprises frames that are used to transmit either voice packets or signaling messages (signaling data packets).
  • Conventional digital voice coding techniques vocoders
  • vocoders cause single words to be transmitted during several separate traffic channel frames.
  • An artifact of this approach is that degradation of voice reception occurs if voice data frames (notably voice frames including accented syllables) are "blanked,” or deleted, in order to transmit critical signaling messages (i.e., those required to maintain the link with the mobile station).
  • the random timing and variable length of critical signaling messages results in voice packets being deleted from the traffic channel data stream for an unpredictable number of traffic channel frames.
  • a variable data rate vocoder for typical speech patterns approximately half of the transmitted traffic channel frames are sent at a lower data rate. Special advantage can be taken by delaying signaling messages and multiplexing them into the traffic channel data stream during the lower rate voice frames. These lower rate frames do not occupy the full bandwidth of the traffic channel, and the spare bandwidth can be used to carry signaling messages without affecting voice quality.
  • One purpose of the invention is to prioritize signaling messages by positioning signaling message frames within a traffic channel to reduce their impact on voice quality.
  • the invention places signaling message frames within the traffic channel so as to avoid unnecessary deletion of voice information. Because air links are bandwidth-limited by nature, arbitrary voice frame deletions would adversely affect voice signal quality. For example, voice quality will be seriously degraded if arbitrarily placed signaling messages made up more than five percent of the traffic channel frames. According to the present invention, signaling messages using up to fifteen percent of the total traffic channel bandwidth will not be perceivable to the human ear.
  • FIG. la depicts a typical satellite communication system 100A
  • FIG. lb depicts a typical cellular communication system 100B
  • FIG. 2 shows the interrelationship of protocol layers in a mobile station according to the present invention
  • FIG. 3 is a block diagram illustrating queues implementing signaling traffic prioritization according to the present invention.
  • the present invention is a system and method for prioritizing signaling messages on the forward and reverse traffic channels of a mobile wireless communications system.
  • the preferred embodiment of the invention is discussed in detail below. While specific steps, configurations and arrangements are discussed, it should be understood that this is done for illustrative purposes only. A person skilled in the relevant art will recognize that other steps, configurations and arrangements can be used without departing from the spirit and scope of the present invention.
  • FIG. la depicts a typical satellite communication system 100A.
  • Satellite communication system 100A comprises base station or gateway 102A, one or more relay satellites 104, and mobile stations 106.
  • Mobile stations 106 are generally of three types: fixed station or user terminals 106A, which are typically mounted in or on permanent structures; mobile stations 106B, which are typically mounted in vehicles; and portable stations 106C, which are typically hand-held.
  • Base station 102 communicates with mobile stations 106 via relay satellite 104.
  • FIG. lb depicts a typical cellular communication system 100B.
  • Cellular communication system 100B comprises base station 102B and mobile stations 107.
  • Mobile stations 107 are generally of three types: fixed stations 107A, which are typically mounted in permanent structures; mobile stations 107B, which are typically mounted in vehicles; and portable stations 107C, which are typically hand-held.
  • priority schemes can be used as a scheduling method to transmit voice and signaling traffic over a traffic channel of a satellite communication system (or any other CDMA, TDMA, or other system for that matter).
  • the simplest priority scheme is a static (or fixed) priority.
  • priority is always given to messages that control the communication system (signaling messages) over messages that merely contain voice data.
  • signaling messages are sometimes transmitted instead of voice packets. This preemption causes degradation of voice signals.
  • Priority scheduling reduces the effect of signaling traffic on the quality of voice when voice and signaling traffic are transmitted sharing traffic channel frames.
  • the priority scheme differentiates between three different priority classes: high priority signaling traffic, low priority signaling traffic and voice traffic in order to meet the delay requirement of each traffic type. High priority signaling traffic and voice traffic are more delay sensitive and each have a different delay requirement. Low priority signaling traffic is less delay sensitive and is transmitted when the channel is not used for full rate voice packets or high priority signaling traffic.
  • the disclosed priority scheme gives highest priority to the high priority signaling traffic, which has the strictest delay requirement. Voice traffic, however, is given priority over the low priority signaling traffic.
  • the scheme therefore, is designed to minimize voice packet loss, guarantee the timely delivery of urgent (time-critical) signaling messages, and provide a bounded delay for the low priority signaling messages.
  • time-critical and “high priority,” and the terms “non-time-critical” and “low priority” are used interchangeably.
  • the main goal of the message prioritization of the invention is to reduce the effect of signaling traffic on the quality of received voice signals when voice packets and signaling messages are transmitted sharing traffic channel frames.
  • a frame is 20 milliseconds (msec) long.
  • time-critical signaling messages are given higher priority over voice packets.
  • Signaling messages are assigned a priority delivery time (PDT) (i.e., the maximum possible transmission delay time).
  • PDT priority delivery time
  • An exemplary PDT for time-critical signaling messages is five frames, or 100 msec.
  • time-critical signaling messages are transmitted via blank-and-burst, dim-and-burst, or brighten-and-burst techniques as described below.
  • low priority signaling messages are delayed and sent with voice packets via either dim-and-burst or brighten-and-burst transmission, when the vocoder uses lower transmission-rate frames.
  • PDTs are measured according to a system clock of the mobile station. The waiting time before a signaling message is transmitted is measured beginning at the instant it is dispatched, regardless of its priority. If its PDT is reached before it is transmitted, it is re-prioritized for prompt transmission.
  • system clocks and the use of timers in general would be apparent to a person skilled in the relevant art.
  • a dim-and-burst mode of the present invention the vocoder is forced to transmit voice data packets at a maximum rate less than full frame rate so that signaling data packets can be sent immediately by filling in the remainder of the frame.
  • the priority scheme of the present invention alternatively uses a brighten-and-burst mode to send signaling data packets along with voice data packets when the vocoder is transmitting at less than the full frame rate.
  • Signaling messages transmitted on the traffic channel have different delay requirements. Messages and orders that are transmitted for purposes of radio resource management (RM) and mobility management (MM) normally have tighter delay requirements than other messages.
  • RM includes messages about power control, handoff operations, and the like.
  • MM includes messages about authentication signaling, traffic channel registration, and the like.
  • RM and MM messages must be transmitted with minimum delay to avoid delays in call or handoff setup that could result in call loss.
  • messages and orders that are used for maintenance, obtaining status information about the mobile station, and providing supplementary services are not required to be transmitted immediately. These messages can be delayed and transmitted when voice activity is low and the traffic channel has some leftover bandwidth to transmit them using dim-and-burst or brighten-and-burst modes.
  • the present scheduling scheme differentiates between signaling messages with different delay requirements.
  • a multiplex (MUX) sublayer was designed to support simultaneous transmission of signaling traffic and voice traffic.
  • the multiplex sublayer accomplishes this by splitting a high-rate frame into two pieces: part used for low rate voice traffic and the remainder for the signaling traffic.
  • FIG. 2 shows the interrelationship of protocol layers in a CDMA-based wireless communication system according to the invention.
  • a physical layer 202 performs functionality according to a standard communications protocol, such as IS-95.
  • a multiplex sublayer 204 performs the function of selecting voice and signaling traffic according to the prioritization scheme of the present invention.
  • the prioritized traffic is passed directly to physical layer 202, as represented by the interface 206 between layers 202 and 204.
  • a radio link protocol (RLP) 208 passes information between multiplex sublayer 204 and a link layer (layer 2) 210.
  • RLP 208 described later, is an enhancement to the protocol defined in IS-95 that improves the effective frame error rate of the traffic channel to provide more reliable signaling when long signaling messages are sent.
  • Layer 210 implements a selective repeat protocol that retransmits a signaling message until it is acknowledged by the receiver.
  • a signaling layer 212 passes signaling traffic (e.g., RM or MM type signaling messages) via layers 210 and 208 as signaling data packets.
  • a voice coder (vocoder) 214 passes voice packets to multiplex sublayer 204 as voice data frames. The vocoder can transmit streams of voice data packets at several common rates, including: full-rate frame (9600 bps), half-rate frame (4800 bps), quarter-rate frame (2400 bps) and eighth-rate frames (1200 bps).
  • Physical layer 202 transmits signals via an air link using CDMA signal processing operations, as would be apparent to a person skilled in the relevant art.
  • the signaling layer 212 passes signaling messages to the multiplex sublayer 204 with a PDT value (the maximum latency for beginning to transmit individual messages).
  • the multiplex sublayer 204 is controlled to classify signaling message data to be transmitted as high priority or low priority.
  • Multiplex Sublayer 204 is also controlled to classify high priority signaling message data as preemptive if any of the following are true; otherwise, the multiplex sublayer 204 is controlled to classify high priority message data as non-preemptive:
  • signaling messages are queued (e.g., buffered) during the traffic channel operation.
  • One realization of the scheme is to allow all signaling messages to enter a long time queue.
  • a high-priority signaling message with the smallest PDT is placed at the head of the queue (or immediately following any signaling messages that have expired PDTs).
  • a low-priority signaling message is placed somewhere in the back of the queue, based on its PDT relative to the PDTs of other queued items.
  • High priority signaling messages that are either timed out or about to time out can preempt voice packets at frame boundaries during a call.
  • Low priority signaling messages are queued until the vocoder uses low rate frames to transmit voice data packets. In this case, signaling data and low rate voice packets are transmitted via a dim-and-burst or brighten-and-burst technique.
  • a first queue 302 is used to handle high priority signaling traffic and a second queue 304 is used to handle low priority signaling traffic.
  • Vocoder 306 generates voice data packets that are passed to layers 210/208. The vocoder, depending on the voice activity, can furnish voice data packets at several rates.
  • the multiplex sublayer 204 selects an available vocoder rate to optimize channel bandwidth. As a result, an appropriate mix of voice and signaling packets are selected to be transmitted. Scheduling of the signaling message transmission is done according to the prioritization scheme of the present invention, and in the preferred embodiment, according to the rules set forth above in Table 1.
  • a priority bypass 314 depicts re-prioritizing of low priority signaling messages (i.e., packets). Re-prioritizing of low priority signaling messages is performed by the prioritization control function within Layer 2/RLP 210/208.
  • the prioritization function is implemented as a processing element (e.g., controller logic) operating in accordance with software being executed in Layer2/RLP.
  • the prioritization function may also be implemented with a combination of software, hardware and firmware in accordance with the IS-95 standard as would be apparent.
  • Signaling messages belonging to each priority class are served on a First-Come First-Served (FCFS) basis.
  • FCFS First-Come First-Served
  • a signaling message's position is determined by its assigned PDT.
  • the scheme adjusts the relative priorities of signaling messages by imposing a limit on the maximum queuing delay experienced by a low priority signaling message in the system.
  • the waiting time of a signaling message in the low priority queue 304 exceeds a fraction of the PDT, that signaling message is moved to the high priority queue (as represented by priority bypass 314).
  • a signaling message that changes priority is treated as a newly arriving high priority signaling message, but retains its original delay requirement (i.e., its PDT is not re-set).
  • the queueing delay of a signaling message before it joins the higher priority queue is bounded by the delay limit of the low priority queue 304.
  • the signaling messages listed below in Table 2 are examples of signaling message types considered time-critical. If a given one of these signaling messages is not transmitted before its PDT (e.g., 200 msec), it is classified as a high priority message. For more details of the signaling messages that are listed in Table 2 please refer to the IS-95 standard specification.
  • Signaling messages that are not time-critical have a relatively long PDT and are considered as non-time-critical or low priority signaling messages.
  • a low priority signaling message is reclassified as high priority if it is not transmitted before its PDT.
  • message prioritization reduces the adverse impact of signaling traffic on the quality of the received vocoded signals.
  • high priority signaling messages can only tolerate short delays, while low priority signaling messages can stand much longer delays. If the vocoder is not running at full rate, then the high priority message is sent right away. If the vocoder is running at full rate, a signaling message takes priority over voice frames only when it has timed out. The latter situation would result in a "forced" blank frame (blank-and-burst) or a "forced" lower-rate vocoder frame (dim-and-burst).
  • Tables 3 and 4 list example blank and burst frame statistics for forward and reverse traffic channels, respectively.
  • Each table includes three main columns.
  • the first column lists typical transmission rates for a satellite system. (Rate sets 1 and 2 as shown represent typical mixes of the three rates.)
  • the second and third main columns list, for a given transmission rate, the number of blank-and-burst frames expected during a single call (about 80 seconds in duration) without message prioritization and with message prioritization (see columns 2 and 3, respectively).
  • Both the second and third main columns have subcolumns that list the number of blank- and-burst frames with and without consideration of the effects of transient terrain blockage for transmission of signaling packets. (Terrain blockage typically results in higher error rates for longer messages, causing more retransmissions of signaling messages.)
  • the disclosed message prioritization scheme is used to minimize this impact.
  • the inventors have determined that the use of this message prioritization scheme significantly reduces the number of blank-and-burst frames sent during a call.
  • the number of blank-and-burst frames sent per call using message prioritization is 16 frames on the forward channel and 11 frames on the reverse channel. Compare these with 112 and 119 (Tables 3 and 4, respectively) blank-and-burst frames sent on the forward and reverse traffic channels without message prioritization.
  • the signaling traffic that would impact voice quality in this case is reduced to a tolerable value of 0.57% (of the total traffic) on the forward direction and 0.34% on the reverse direction when message prioritization is used.
  • the multiplex sublayer provides the following services to the higher protocol layers.
  • RLP Radio Link Protocol
  • the multiplex sublayer uses the physical layer for traffic channel frame transmission and reception.
  • the multiplex sublayer transmits all new RLP frames containing the parts of each Layer 212 message before transmitting any new RLP frame containing part of any other Layer 212 message.
  • the signaling Layer 210 passes Layer 212 messages to the multiplex sublayer with a PDT value.
  • the multiplex sublayer classifies Layer 212 message data to be transmitted as high priority or low priority according to the following rules:
  • the multiplex sublayer shall classify the signaling message data as low priority.
  • the multiplex sublayer shall classify the signaling message data as high priority.
  • the multiplex sublayer shall reclassify the remaining signaling message data as high priority.
  • the multiplex sublayer shall reclassify the remaining data from the signaling message being transmitted as high priority.
  • the multiplex sublayer shall classify Layer 212 message data as preemptive if any of the following are true; otherwise, the multiplex sublayer shall classify Layer 212 message data as non-preemptive. I.
  • the current system time is more than 200 msec later than the indicated PDT; or
  • the multiplex sublayer shall classify the data that are available for transmission from RLP and higher protocol layers into the priority classes defined below.
  • the higher protocol layers are signaling Layer 210 data and data generated by the service options using primary and secondary traffic.
  • the data priority classes are:
  • Preemptive high priority Layer 210 message data (contained in RLP data frames being sent for the first time).
  • Non-preemptive high priority signaling data consisting of:
  • Non-preemptive high priority Layer 210 message data (contained in RLP data frames being sent for the first time).
  • primary traffic data shall have priority over secondary traffic data.
  • the multiplex sublayer When the physical layer is ready to send a traffic channel frame, the multiplex sublayer shall perform the following: I. If high priority signaling data are available for transmission, the multiplex sublayer shall perform the following:
  • the multiplex sublayer shall select the data with highest priority among the high-priority signaling data available for transmission.
  • the multiplex sublayer shall select the lowest traffic channel frame rate allowed under the connected service configuration, that can carry the signaling data.
  • the multiplex sublayer shall form a blank-and- burst traffic channel frame and forward it to the physical layer for transmission.
  • the multiplex sublayer shall perform the following:
  • the multiplex sublayer shall form a blank-and-burst traffic channel frame at the highest allowable traffic channel frame rate, and shall forward the traffic channel frame to the physical layer for transmission. 2. Otherwise, the multiplex sublayer should form a dim-and-burst traffic channel frame containing signaling data and primary or secondary traffic data, and forward the traffic channel frame to the physical layer for transmission. (The multiplex options defined in this specification provide dim-and-burst frames for primary and signaling traffic only.
  • the multiplex sublayer forms a blank- and-burst frame containing signaling when only signaling and secondary traffic are available for transmission.
  • the dim-and-burst frame should be formed using the lowest allowable traffic channel frame rate that can carry both the signaling and traffic data.
  • the multiplex sublayer should form a traffic channel frame containing primary and secondary data.
  • the multiplex sublayer shall select the lowest traffic channel frame rate allowed under the connected service configuration, that can carry the data.
  • the multiplex sublayer shall forward the traffic channel frame to the physical layer for transmission.
  • the multiplex sublayer shall perform the following:
  • the multiplex sublayer shall select the low-priority signaling data with highest priority among the low-priority signaling data available for transmission.
  • the multiplex sublayer shall select the lowest traffic channel frame rate allowed under the connected service configuration that can carry both the signaling and traffic data.
  • the multiplex sublayer shall form a dim-and-burst traffic channel frame containing traffic and signaling data and shall forward the traffic channel frame to the physical layer for transmission.
  • the multiplex sublayer shall select the lowest traffic channel frame rate allowed under the connected service configuration that can carry the traffic data.
  • the multiplex sublayer shall form a traffic channel frame containing only traffic data, and shall forward the traffic channel frame to the physical layer for transmission.
  • the multiplex sublayer shall perform the following:
  • the multiplex sublayer shall select the low-priority signaling data with highest priority among the low-priority signaling data available for transmission.
  • the multiplex sublayer shall select the lowest traffic channel frame rate allowed under the connected service configuration, that is sufficient to carry the selected signaling data.
  • the multiplex sublayer shall form a blank-and-burst traffic channel frame and forward it to the physical layer for transmission.
  • the multiplex sublayer shall request that the physical layer send null traffic data.
  • RLP Radio Link Protocol
  • the RLP of the multiplex sublayer provides a message transmission service on forward and reverse traffic channels, substantially reducing the error rate typically exhibited by these channels. This service is intended to carry the variable length signaling messages of the Layer 210 protocol.
  • RLP divides the Layer 210 messages into traffic channel frames for transmission. A large packet may span multiple traffic channel frames, or a single traffic channel frame may contain all of a small message.
  • RLP provides an indication of the start of Layer 210 messages.
  • the frame formats defined below are carried in the signaling part of traffic channel frames. These frame formats are implementation specific and are given by way of example, not limitation.
  • RLP control frames are distinguished by the CTL field. RLP control frames are used to initialize the RLP protocol.
  • CTL field is defined as follows:
  • FCS Frame Check Sequence. The contents shall be as generated by the 16-bit FCS polynomial specified in 3.1 of RFC 1662. The FCS shall cover a 16-bit field consisting of a single bit of value '0', followed by the contents of CTL and RSVD fields.
  • Padding - Padding bits As required to fill the remainder of the signaling part of the traffic channel frame. These bits shall be set to '0'.
  • RLP data frames carry a variable number of bits of signaling Layer 210 message data.
  • the CTL field shall be one bit in length, and shall be set to '0'. Otherwise, the CTL field shall be three bits in length, and shall be set to '100'. SEQ - RLP data frame sequence number.
  • Data - Data bits shall contain signaling Layer 210 message data.
  • padding bits shall be added as required to fill the remainder of the frame. These bits shall be set to '0'. 8c. RLP Idle Frames
  • RLP idle frames are distinguished by the CTL field.
  • RLP idle frames are not themselves sequence numbered, but contain the next data sequence number, in order that erased RLP data frames may be detected.
  • the sequence number is not incremented after an RLP idle frame.
  • the CTL field shall be set to '11000'.
  • SEQ - RLP frame sequence number This field shall be set to the current RLP transmit frame sequence number. The sequence number shall not be incremented following transmission of an RLP idle frame.
  • FCS - Frame Check Sequence The contents shall be as generated by the 16-bit FCS polynomial specified in 3.1 of Internet RFC 1662.
  • the FCS shall cover a 16-bit field consisting of a single bit of value '0', followed by the contents of the CTL, SEQ, and RSVD fields.
  • Padding - Padding bits As required to fill the remainder of the signaling part of the traffic channel frame. These bits shall be set to '0'.
  • RLP NAK frames are distinguished by the CTL field, RLP NAK frames are used to request retransmission of RLP data frames.
  • the CTL field shall be set to '101'.
  • the FIRST field shall contain the sequence number of the first RLP data frame for which retransmission is requested.
  • N_FR For RLP NAK frames, the N_FR field shall contain one less than the number of RLP data frames, starting with the frame whose sequence number is indicated by the FIRST field, for which retransmission is requested.
  • FCS - Frame Check Sequence The contents shall be as generated by the 16-bit FCS polynomial specified in 3.1 of Internet RFC 1662.
  • the FCS shall cover a 16-bit field consisting of a single bit of value '0', followed by the contents of the CTL, FIRST, and N_FR fields.
  • Padding - Padding bits As required to fill the remainder of the signaling part of the traffic channel frame. These bits shall be set to '0'.
  • the RLP protocol is established with a bi-directional handshake, after initialization of the traffic channel, to synchronize the connection.
  • the multiplex sublayer shall perform the RLP initialization/reset procedure below.
  • the multiplex sublayer shall perform the following:
  • RLP When RLP is initialized or reset, it shall transmit a continuous stream of SYNC RLP control frames. When RLP receives a SYNC RLP control frame it shall respond with a SYNC/ACK RLP control frame, and shall continue sending SYNC/ACK RLP control frames until the next valid frame which is not a SYNC RLP control frame is received. When RLP receives a SYNC/ACK RLP control frame it shall respond with an ACK RLP control frame, and shall continue sending ACK RLP control frames until the next valid frame which is not a SYNC/ACK control frame is received. When RLP receives an ACK RLP control frame, it shall send no more SYNC, SYNC/ACK or ACK RLP control frames, and may begin sending RLP data frames.
  • the multiplex sublayer shall store in RLP_DELAY g the number of frames received between the sending of the last SYNC or SYNC/ACK RLP control frame and reception of the first valid frame that is not an ACK or SYNC/ACK RLP control frame.
  • RLP_DELAY g is used in NAK retransmission timing.
  • RLP is a pure NAK-based protocol. That is, the receiver does not acknowledge correct RLP data frames; it only requests the retransmission of RLP data frames that were not received.
  • RLP frame sequence numbers shall be carried out in unsigned modulo 256 arithmetic. Comparisons of two RLP frame sequence numbers shall also be modulo 256: for any RLP frame sequence number N, those sequence numbers from (N+l) modulo 256 to (N+127) modulo 256, inclusive, shall be considered greater than N while all sequence numbers from (N-128) modulo 256 to (N-l) modulo 256, inclusive, shall be considered less than N. (Note that (N-l) modulo 256 is equal to (N+255) modulo 256, and (N-128) modulo 256 is equal to (N+128) modulo 256.)
  • RLP shall maintain an 8-bit sequence number count V(S) for all transmitted RLP data frames.
  • RLP data frame sent and in each RLP idle frame sent shall be set to V(S).
  • V(S) shall be incremented, modulo 256, after formatting each new RLP data frame sent.
  • V(S) shall not be incremented after an RLP idle frame is sent.
  • RLP shall maintain two 8-bit sequence number variables for receiving, V(R) and V(N).
  • V(R) contains the expected value of the RLP frame sequence number field in the next new traffic channel frame to be received.
  • V(N) contains the sequence number of the next needed traffic channel frame not received in sequence.
  • RLP shall provide a storage buffer for resequencing of out-of-sequence
  • RLP data frames both on the transmitting and on the receiving side. (I.e., two such buffers are required in a mobile station or base station.) These buffers shall each be able to store no fewer than 128 RLP data frames of the maximum size allowed for the multiplex subchannel carrying RLP.
  • RLP For each valid received RLP data frame, RLP shall compare the sequence number to V(R) and V(N).
  • the RLP data frame shall be discarded as a duplicate.
  • the received RLP frame sequence number is greater than or equal to V(N) and less than V(R), and the RLP data frame is not already stored in the resequencing buffer, then:
  • RLP shall store the received RLP data frame in the resequencing buffer.
  • RLP shall pass the data in all contiguous RLP data frames in the resequencing buffer, from V(N) upward, to Layer 210, and shall remove the passed frames from the resequencing buffer.
  • RLP shall then set V(N) to (LAST+1) modulo 256 where LAST is the sequence number of the last RLP data frame passed to Layer 210 from the resequencing buffer.
  • V(R) If the received RLP frame sequence number equals V(R), then: A. If V(R) equals V(N), RLP shall increment V(N) and V(R), modulo 256, and shall pass all data bits in the RLP data frame to Layer 210. B. If V(R) is not equal to V(N), RLP shall increment V(R), modulo 256, and shall store the received RLP data frame in the resequencing buffer.
  • RLP shall store the received RLP data frame in the resequencing buffer and shall set V(R) equal to the received sequence number.
  • RLP shall then send one or more RLP NAK frames requesting the retransmission of all unreceived RLP data frames from V(N) to (V(R)-l) modulo 256, inclusive.
  • RLP data frames requested in a previous RLP NAK frame whose NAK retransmission counter or NAK abort counter has not expired should not be included in these RLP NAK frames.
  • RLP shall then increment V(R), modulo 256.
  • RLP shall also compare the sequence number in each valid received
  • RLP shall take no further action.
  • RLP shall set V(R) to the received frame sequence number, and shall then send one or more NAK frames requesting the retransmission of all unreceived RLP data frames with sequence numbers V(N) to (V(R)-l) modulo 256, inclusive.
  • RLP data frames requested in a previous RLP NAK frame whose NAK retransmission counter or NAK abort counter has not expired should not be included in these NAK frames.
  • RLP On receiving a NAK, RLP shall insert copies of the requested RLP data frame(s) into its output stream. If the NAK includes any sequence number greater than or equal to V(S) (this would indicate that the NAK process has fallen behind the sequence numbering by more than 128 frames), RLP shall perform the initialization/reset procedures. If the size of a retransmitted frame exceeds the number of bits available at the highest traffic channel frame rate allowed at the time of retransmission, RLP shall ignore the NAK. Further recovery is the responsibility of the Layer 210 protocol.
  • RLP shall maintain a NAK retransmission timer for each RLP data frame requested in an RLP NAK frame.
  • the NAK retransmission timer shall be implemented as a frame counter.
  • the NAK retransmission counter shall be incremented for the following traffic channel frame types:
  • Valid traffic channel frames that do not contain signaling data 3. Valid traffic channel frames containing an RLP idle frame.
  • the NAK retransmission counter shall not be incremented on receiving RLP control frames, NAK frames, nor old RLP data frames (sequence number less than V(R)).
  • the NAK retransmission counter shall be considered expired when it is incremented to an implementation dependent value greater than RLP_DELAY g . (It is recommended that a guard interval of five frames be added to the retransmission timeout to account for buffering within the mobile station or base station.) If any RLP data frame requested has not arrived when its NAK retransmission timer expires, RLP shall send one or more RLP NAK frames requesting the retransmission of all unreceived RLP data frames from V(N) upward.
  • RLP shall send one or more RLP NAK frames requesting the retransmission of all unreceived RLP data frames from V(N) upward.
  • RLP data frames requested in a previous RLP NAK frame whose NAK retransmission timer or NAK abort timer has not expired should not be included in these NAK frames.
  • RLP shall then start a NAK abort timer for the RLP data frames requested.
  • the NAK abort timer shall be implemented, and shall be considered expired, according to the same rules as a NAK retransmission timer.
  • RLP shall set V(N) to the sequence number of the next missing frame, or to V(R) if there are no remaining missing frames, and shall pass any preceding RLP data frames in the resequencing buffer, in order of sequence number, to Layer 210. (Note that the preceding approach has been modified relative to that of TIA/EIA/IS-99 Data Services Option
  • RLP should provide an indication to Layer 210. Further recovery is the responsibility of the Layer 210 protocol.
  • RLP Whenever a new RLP data frame is sent, RLP shall start an idle timer with duration T ⁇ (100 ms). RLP shall also maintain an idle frame transmission counter, which shall initially be set to zero. If new Layer 210 signaling data are received at any time after the timer is started or after the timer has expired, the timer shall be disabled, any pending RLP idle frame shall be discarded, and the idle frame transmission counter shall be reset to zero. When the idle timer expires, RLP shall form an RLP idle frame containing the current data frame sequence number V(S), shall increment the idle frame transmission count, and shall restart the idle timer. If the idle frame transmission count equals N ⁇ (2), the idle timer shall be disabled.
  • N ⁇ and T ⁇ are numerical constants and their values are determined based on the system requirements.
  • RLP shall discard as erasures all traffic channel frames received for which any of the following applies: 1.
  • the traffic channel frame has insufficient frame quality or is classified as zero rate.
  • FCS field does not check.
  • Any RLP frame field value is not within the allowable range. All other traffic channel frames shall be considered valid, and shall be processed by RLP if they contain signaling data.
  • RLP shall maintain a count E of the consecutive frames classified as erasures. If the consecutive erasure count E exceeds 127, RLP shall perform an initialization /reset procedure. 11. Conclusion

Landscapes

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

Abstract

L'invention concerne un système et un procédé qui placent des trames de messages de signalisation dans une voie de trafic comportant des trames vocales afin que la transmission des messages de signalisation ne nuise pas gravement à la qualité vocale. On réalise le procédé en produisant un premier train de paquets de voix-données codés et un deuxième train de paquets de messages de signalisation. Les paquets de messages de signalisation sont placés en priorité dans le deuxième train par rapport aux paquets de voix-données codés acheminés dans le premier train. Un élément d'arbitrage départage les paquets de voix-données codés et les paquets de messages de signalisation prioritaires, lesdits paquets étant multiplexés conformément à cet arbitrage. Après multiplexage, les paquets de voix-données codés et les paquets de messages de signalisation prioritaires sont ensuite transmis.
EP00919989A 1999-04-02 2000-03-31 Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic Withdrawn EP1166502A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US12759799P 1999-04-02 1999-04-02
US127597P 1999-04-02
1999-05-06
PCT/US2000/008627 WO2000060813A1 (fr) 1999-04-02 2000-03-31 Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic

Publications (1)

Publication Number Publication Date
EP1166502A1 true EP1166502A1 (fr) 2002-01-02

Family

ID=22430930

Family Applications (1)

Application Number Title Priority Date Filing Date
EP00919989A Withdrawn EP1166502A1 (fr) 1999-04-02 2000-03-31 Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic

Country Status (3)

Country Link
EP (1) EP1166502A1 (fr)
AU (1) AU4059300A (fr)
WO (1) WO2000060813A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003085934A1 (fr) * 2002-04-08 2003-10-16 Mitsubishi Denki Kabushiki Kaisha Appareil et procede de transmission de donnees
US20030202475A1 (en) * 2002-04-25 2003-10-30 Qingxin Chen Multiplexing variable-rate data with data services
AU2003236779A1 (en) * 2002-05-16 2003-12-02 Siemens Aktiengesellschaft Method for processing measurement events, which are executed in at least one radio communications network, in addition to a corresponding radio communications device
EP1416683A1 (fr) * 2002-10-31 2004-05-06 Mitsubishi Electric Information Technology Centre Europe B.V. Allocation de la priorité de transmission modifiée en mode confirmé dans un réseau UMTS
DE102004027142A1 (de) * 2004-06-03 2005-12-22 Siemens Ag Verfahren zur Übertragung von zeitlich hoch priorisierten Daten
US7751404B2 (en) * 2006-10-06 2010-07-06 Broadcom Corporation Method, system, and computer program product for high performance bonding resequencing
CN116112598A (zh) * 2022-11-17 2023-05-12 北京小米移动软件有限公司 信令发送方法及装置、电子设备、存储介质

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MX9301888A (es) * 1992-04-10 1993-11-30 Ericsson Telefon Ab L M Acceso multiple de division de tiempo para acceso de un movil en un sistema de acceso multiple de division de codigo.
US5311516A (en) * 1992-05-29 1994-05-10 Motorola, Inc. Paging system using message fragmentation to redistribute traffic
FI92787C (fi) * 1993-03-30 1994-12-27 Nokia Telecommunications Oy Ryhmäpuhelumenetelmä, järjestelmäohjain ja tilaaja-asema radiojärjestelmässä
US5771459A (en) * 1994-06-21 1998-06-23 U.S. Philips Corporation Communication system for use with stationary and second entities, via a wireless intermediate network with gateway devices, a gateway device for use with such system, and a mobile entity provided with such gateway device
GB9418772D0 (en) * 1994-09-16 1994-11-02 Ionica L3 Limited Digital telephony
US5745860A (en) * 1994-12-16 1998-04-28 Telefonaktiebolaget Lm Ericsson Method and system of data transmission and reception in a mobile station within a radio telecommunications system
GB2301749B (en) * 1995-06-01 1999-07-28 Motorola Ltd Communications system and method of operation
US5729536A (en) * 1996-04-10 1998-03-17 Lucent Technologies Cellular system architectures supporting data services
FI101920B (fi) * 1996-06-07 1998-09-15 Nokia Telecommunications Oy Kanavanvarausmenetelmä pakettiverkkoa varten
FI972039A (fi) * 1997-05-13 1998-11-14 Nokia Telecommunications Oy Menetelmä pakettivälitteiseen tiedonsiirtoon
US5886993A (en) * 1997-05-30 1999-03-23 Motorola, Inc. System, device, and method for sharing contention mini-slots among multiple priority classes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0060813A1 *

Also Published As

Publication number Publication date
WO2000060813A1 (fr) 2000-10-12
AU4059300A (en) 2000-10-23

Similar Documents

Publication Publication Date Title
US6781971B1 (en) System and method for prioritizing traffic channel messages
US7924891B2 (en) Method and apparatus for allocating data streams onto a single channel
US9072115B2 (en) MAC architecture in wireless communication systems supporting H-ARQ
EP1495554B1 (fr) Action sur noeud b et sur controleur rnc pendant un changement de cellule de systeme hcspa serveur
KR20050037494A (ko) 무선 통신 시스템에서 패킷 데이터 전송들을 스케줄링하기위한 방법 및 장치
WO2000074259A2 (fr) Ameliorations de protocole de liaison radio pour canaux de donnees sans fil a capacite dynamique
EP1959709B1 (fr) Priorisation et contrôle de flux d'un canal multiutilisateur à dispersion spectrale
AU2002225808A1 (en) Method and apparatus for allocating data streams onto a single channel
US6738368B1 (en) Prioritization and flow control of a spread spectrum multiuser channel
EP1166502A1 (fr) Systeme et procede pour classer par ordre de priorite des messages dans une voie de trafic
AU2004203324A1 (en) System and method for prioritizing traffic channel messages
WO2006035408A1 (fr) Procede et appareil d'emission de donnees et systeme de communication
US7126912B2 (en) Methods for sequencing datagram transmissions

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20011016

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

RIN1 Information on inventor provided before grant (corrected)

Inventor name: QUICK, FRANK

Inventor name: YEGANI, PARVIZ C/O QUALCOMM INCORPORATED

Inventor name: DAVIS, ROY

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: QUALCOMM INCORPORATED

17Q First examination report despatched

Effective date: 20060804

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20110405