Patent Application
20070223383
1. Field
The present invention generally relates to the field of wireless communication systems, and more specifically to flow control between a base station controller and a base transceiver station.
2. Background
High Data Rate (“HDR”) technology is a high-speed, high-capacity wireless technology optimized for packet data services. Using a single, data-dedicated 1.25 MHz channel for operation, HDR can deliver data at a peak data rate of 2.4 Mbps, which is significantly faster than many accesses provided over landline networks. Thus, the advantages of HDR include, among others, high-speed data transmission and high spectral efficiency.
HDR is the basis for the 1x Evolution Data Only (1xEV-DO) standard, which has been standardized by the Telecommunications Industry Association as TIA/EIA/IS-856. HDR is designed to be interoperable with existing wireless communication systems, for example a code division multiple access (“CDMA”) system. In CDMA systems, each signal is separated from those of other users by coding the signal. Each user uniquely encodes its information signal into a transmission signal, which is then transmitted over a 1.25 MHz channel. The intended receiver, knowing the code sequences of the user, can decode the transmission signal to receive the information. The fact that a CDMA channel is 1.25 MHz simplifies the integration of HDR technology into the present CDMA framework.
Using CDMA for illustrative purposes, HDR technology can utilize existing CDMA infrastructure and architecture, including CDMA base station controllers (“BSC”) and base transceiver stations (“BTS”). For example, in a CDMA system configured to be interoperable with HDR technology, data downloaded from the Internet by a user is routed through the BSC to the BTS, which transmits the data to the user via a data-dedicated 1.25 MHz channel or air-link. The BSC packetizes the stream of data it receives into individual 128-byte HDR packets (or “data packets”) before transmitting the data packets to the BTS. The data packets are received by the BTS and placed in a buffer (or “queue”) of fixed size to be transmitted to the user using an HDR protocol.
To reduce the possibility of overflowing or overrunning the buffer at the BTS, i.e. the BTS receiving more data from the BSC than the buffer can accommodate and/or transmit to the user, as well as the possibility of “starving” the buffer, i.e. the BTS not receiving data from the BSC when the buffer is empty, mechanisms to control the data flow between the BSC and the BTS are commonly employed. Generally, flow control mechanisms are based on the BTS advertising to the BSC the amount of space, or “window”, available at the buffer for receiving more data in order for the BSC to determine how much data to transmit to the BTS.
One conventional method for flow control between the BSC and the BTS involves the BTS advertising its window size to the BSC at certain, preset, buffer capacity threshold points. For example, when the buffer nears capacity and reaches a preset high watermark threshold, the flow control mechanism is triggered, and the BTS sends a signal informing the BSC to stop transmitting additional data packets so as not to overrun the buffer. Overrunning the buffer can lead to problems such as data packets being dropped and lost at the buffer and having to be retransmitted, leading to less reliable data transmission. Further, having to retransmit dropped or lost data means incurring more overhead and slowing of communication. In the other instance when the buffer is nearing empty and hits a preset low watermark threshold, the flow control mechanism is triggered, and the BTS sends a signal telling the BSC to send more data packets. An empty buffer translates to wasted system resources, because it can result in frames of unused air-link that could be utilized to transmit data from the buffer.
A drawback to the conventional flow control mechanism described above is that feedback signals may not be received by the BSC in time to prevent overrunning and/or starving the buffer. For instance, by the time the BSC receives a signal from the BTS to stop sending more data, the BSC may have already put too much data “in flight” to avoid overrunning the buffer, leading to data packets being dropped at the buffer. In the case of an emptying buffer, a signal to send more data may not be received by the BSC in time for it to get data to the buffer before the buffer is completely empty, resulting in wasted air-link frames. Further, a flow control mechanism which is triggered by buffer capacity threshold points may result in the transmission of a high number of feedback signals which puts more strain on the system and increases system overhead.
There is thus a need in the art for an improved method for flow control between BSC and BTS. More particularly, there is a need for a method to reduce the likelihood of data overrun at a buffer, as well as the possibility of a starving buffer.
Embodiments disclosed herein address the above stated needs by tying the flow of data between a base station controller and a base transceiver station directly to the rate of data transmitted from the base transceiver station to a wireless receiving unit such as a mobile unit.
In one aspect of the invention, a flow indication counter responsible for tracking the rate of data flowing out of a buffer at a base transceiver station is incremented each time a data packet is transmitted from the buffer. For example, the updated number of data packets transmitted from the buffer is compared to a threshold number which can be fifty. When the updated number of packets transmitted equals or exceeds the threshold number, the buffer window size is determined, and a flow indication message comprising the buffer window size is generated and transmitted to the base station controller. The buffer window size, which represents the amount of buffer space available for receiving more data, is used by the base station controller to determine the amount of data to transmit to the base transceiver station. Additionally, the flow indication message can further comprise a data packet ID of the last data packet received by the buffer, and this data packet ID is used by the base station controller to determine the proper order of data packets to transmit next.
In another aspect of the invention, a timer keeps track of an elapsed time since the transmission of the last message and triggers the generation and transmission of a flow indication message when the elapsed time equals or exceeds a threshold time interval. The threshold time interval can be, for example, 0.5 seconds. In this manner, the timer ensures that a flow indication message is sent at least every threshold time interval independently of the number of data packets transmitted from the buffer.
In another aspect of the invention, a system for flow control can be constructed comprising a flow indication counter module configured to provide an updated number of data packets transmitted from a buffer at a base station. The system can further comprise a window size monitoring module which determines the buffer window size when the updated number of data packets transmitted from the buffer equals or exceeds a threshold number. As an example, the threshold number can be set at fifty. The buffer window size is used by a message generating module which generates a flow indication message comprising the window size. Subsequently, the flow indication message is transmitted to a base station controller which uses the buffer window size to determine the amount of data to transmit to the base transceiver station.
The present invention is directed to method and system for flow control between a base station controller and a base transceiver station. Although the invention is described with respect to specific embodiments, the principles of the invention, as defined by the claims appended herein, can obviously be applied beyond the embodiments of the description described specifically herein. Moreover, certain details have been left out in order to not obscure the inventive aspects of the invention. The specific details not described in the present application are within the knowledge of a person of ordinary skill in the art.
The drawings in the present application and their accompanying detailed description are directed to merely example embodiments of the invention. To maintain brevity, other embodiments of the invention that use the principles of the present invention are not specifically described in the present application and are not specifically illustrated by the present drawings.
The word “exemplary” is used exclusively herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
Continuing with
Exemplary wireless communication system 100 illustrates how Internet data can be communicated to mobile unit 110 by being routed from data server 126 through Internet 124 and BSC 122, and to BTS 116 which transmits the data to mobile unit 110 via, for example, a 1.25 MHz air-link channel. Data server 126 can be, for example, an HTTP or FTP server. The Internet data can be transmitted from BTS 116 to mobile unit 110 using an HDR protocol.
Continuing with
Continuing with
According to one embodiment, flow control module 120 utilizes the number of data packets transmitted from buffer 118 to determine an appropriate time to send feedback to BSC 122. It is noted that the feedback sent from flow control module 120 to BSC 122 is also referred to as a “flow indication message” in the present application. As an example, flow control module 120 can be configured to send a flow indication message after the transmission of every fifty data packets from buffer 118. However, it is apparent to a person of ordinary skill in the art that the threshold number of data packets transmitted from buffer 118 needed to trigger the transmission of a flow indication message can be set to some number other than fifty, depending on the requirements and resources of the system. The flow indication message advertises to BSC 122 how much data should be transmitted to buffer 118, based on the window size of buffer 118. In this manner, the control of how much data BSC 122 transmits to BTS 116 is based on how quickly data is transmitted from buffer 118. Thus,
Continuing with
Continuing with
Referring again to
In one embodiment, the unique packet ID of the last data packet received by the buffer, i.e. the data packet received most recently, is included in the flow indication message transmitted to the base station controller. The packet ID of the data packet received most recently is also referred to as a “last packet ID” in the present application. As discussed above, the flow indication message is transmitted after a threshold number of data packets have been transmitted from the buffer. In the present embodiment, the flow indication message can also comprise the buffer window size in addition to the last packet ID.
The base station controller can utilize the information in such a flow indication message to determine not only how much data to send to the base transceiver station based on the buffer window size, but also the correct sequence of data packets to send next based on the last packet ID. In this manner, the flow of data from the base station controller to the base transceiver station is regulated by both the buffer window size and the identification of the last data packet received by the buffer. Thus,
Continuing with
Continuing with
Continuing with
The information received by message generating module 310 from flow indication counter module 302, data packet ID monitoring module 304 and window size monitoring module 306, is utilized by message generating module 310 to generate a flow indication message. Message generating module 310 is triggered by flow indication counter module 302 when a threshold number of data packets has been transmitted from the buffer. Once triggered, message generating module 310 generates a flow indication message comprising the buffer window size and the packet ID of the data packet received most recently by the buffer.
The flow indication message is then transmitted to the base station controller which utilizes the information, i.e. the buffer window size and the packet ID, to determine how much data it can transmit to the buffer and which data packet should be transmitted next. Transmission of the flow indication message can be performed, for example, by a transmit module at the base station. It is noted that the base station transmit module is not shown in any of the FIGS. Further, message generating module 310 notifies flow indication counter module 302 each time a flow indication message is transmitted so that flow indication counter module 302 can reset the updated number of data packets transmitted from the buffer to zero. By tying the flow control mechanism directly to the rate of data flowing out of the buffer, the present embodiment provides a more reliable method for flow control than conventional flow control methods. Further, the possibility of overrunning the buffer is reduced because the base station controller receives information on the rate of data leaving the buffer and can adjust the amount of data it sends to the buffer accordingly.
In another instance, message generating module 310 is triggered to generate and transmit a flow indication message after a threshold time interval has elapsed since the transmission of a last flow indication message, even if the threshold number of data packets transmitted from the buffer has not been reached, i.e. even if flow indication counter module 302 does not trigger message generating module 310. Timer 308 in flow control module 300 keeps track of the elapsed time between flow indication messages sent from message generating module 310. If a threshold time interval elapses without a flow indication message being sent, timer 308 triggers message generating module 310 to generate and transmit a flow indication message. As an example, the threshold time interval can be 0.5 seconds. The flow indication message can comprise information message generating module 310 receives from data packet ID monitoring module 304, i.e. the last packet ID, and window size monitoring module 306, i.e. the buffer window size. Thus, timer 308 triggers message generating module 310 to send a flow indication message independently of the number of data packets transmitted from the buffer.
Continuing with
Thus,
Referring to
Continuing with flowchart 400 in
If instead the timer determines at step 404 that less than time T has elapsed since the last message was sent, then the flow control process proceeds to step 406. At step 406, it is determined whether or not a new or “next” data packet has been transmitted from the buffer. This determination can be performed by software in a flow indication counter module such as flow indication counter module 302. When a next data packet has not been transmitted, then the process returns to step 404 to determine again whether time T has elapsed since the last flow indication message was sent. In this manner, i.e. looping back to step 404 when a next data packet has not been transmitted from the buffer, a safeguard mechanism is available to make certain that flow indication messages will be sent at least every time T.
If it is determined at step 406 that a next data packet has been sent, then the process proceeds to step 408, and the flow indication counter, such as flow indication counter module 302, is incremented to update the number of data packets transmitted from the buffer. The updated number of data packets transmitted from the buffer can be stored in a memory device in the flow indication module.
At step 410, the updated number of data packets transmitted from the buffer is compared to a threshold number of data packets transmitted. The threshold number of data packet transmitted, which can be set at 50, for example, is also referred to as a “threshold number” in the present application. Comparison of the updated number of data packets transmitted with the threshold number can be performed, for example, by software in flow indication counter 302. When the updated number of data packets transmitted from the buffer is less than the threshold number, the process returns to step 404. By looping back to step 404 when the updated number of data packets transmitted is less than the threshold number, the process makes certain that flow indication messages are sent at least every time T, even when the flow of data out of the buffer is relatively slow, and the time interval before the threshold number is reached is increased.
If it is determined at step 410 that the updated number of data packets transmitted from the buffer is equal to or greater than the threshold number, then the process proceeds to step 412. At step 412, a flow indication message is generated and sent to the base station controller. The flow indication message can comprise the buffer window size and the packet ID of the last data packet received by the buffer, i.e. last packet ID. The flow indication message can be generated and sent by message generating module 310 which receives the buffer window size from window size monitoring module 306 and the last packet ID from packet ID monitoring module 304. The steps of generating and transmitting the flow indication message to the base station controller are also referred to as “advertising” in the present application. Thus, the flow indication message advertises the information to the base station controller which uses the information to determine how much data to transmit to the buffer, as well as the proper sequence of data packets to transmit next.
Continuing with flowchart 400, the process then proceeds to step 414 where the updated number of data packets transmitted and time T are reset to zero. The process then returns to step 404 in order to continue controlling the flow of data from the base station controller to the base transceiver station. It is noted that the process does not terminate, or “end”, until the connection between the base station controller and the base transceiver station is severed. Thus,
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (“DSP”), an application specific integrated circuit (“ASIC”), a field programmable gate array (“FPGA”) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software module, also called a computer program in the present application, may contain a number of source code or object code segments and may reside in any computer readable medium such as a RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, a DVD-ROM or any other form of computer readable medium known in the art. An exemplary computer readable medium is coupled to the processor where the processor can read information from, and write information to, the computer readable medium. In the alternative, the computer readable medium may be integral to the processor. The processor and the computer readable medium may reside in an Application Specific Integrated Circuit (“ASIC”). The processor and the computer readable medium may reside in a flow control module. In the alternative, the processor and the computer readable medium may reside as discrete components in the flow control module.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10010990 | Dec 2001 | US |
| Child | 11748412 | May 2007 | US |
