2004•Unpublished venueRequires access

A lossless algorithm for BSSGP flow control in GPRS and EDGE

Anand Bedekar, Rajeev K. Agrawal, Rakesh Ranjan

Open publisher page 2 citations

Abstract

In a GPRS or EDGE system, fluctuations in the wireless link rate can cause the buffer in the BSS to either overflow or underflow if the data flow into the BSS buffer from the SGSN is not controlled properly. Currently available algorithms for controlling this data flow rely on imperfect estimates of the wireless link rate and cannot ensure that the BSS buffer will never overflow or underflow. We present a new low-complexity algorithm that ensures that the BSS buffer will never overflow or underflow, without requiring any estimate of the wireless link rate. If there is no feedback delay between the SGSN and BSS, the algorithm is optimal: among all algorithms that ensure that the BSS buffer will never overflow or underflow, it requires the smallest amount of buffering in the BSS. The algorithm also has a fixed point, i.e. if the wireless link rate remains constant, the BSS buffer remains in equilibrium and no flow control updates are required.

About this research paper

What this paper is about

In a GPRS or EDGE system, fluctuations in the wireless link rate can cause the buffer in the BSS to either overflow or underflow if the data flow into the BSS buffer from the SGSN is not controlled properly. Currently available algorithms for controlling this data flow rely on imperfect estimates of the wireless link rate and cannot ensure that the BSS buffer will never overflow or underflow. We present a new low-complexity algorithm that ensures that the BSS buffer will never overflow or underflow, without requiring any estimate of the wireless link rate. If there is no feedback delay between the SGSN and BSS, the algorithm is optimal: among all algorithms that ensure that the BSS buffer will never overflow or underflow, it requires the smallest amount of buffering in the BSS. The algorithm also has a fixed point, i.e. if the wireless link rate remains constant, the BSS buffer remains in equilibrium and no flow control updates are required.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In a GPRS or EDGE system, fluctuations in the wireless link rate can cause the buffer in the BSS to either overflow or underflow if the data flow into the BSS buffer from the SGSN is not controlled properly. Currently available algorithms for controlling this data flow rely on imperfect estimates of the wireless link rate and cannot ensure that the BSS buffer will never overflow or underflow. We present a new low-complexity algorithm that ensures that the BSS buffer will never overflow or underflow, without requiring any estimate of the wireless link rate. If there is no feedback delay between the SGSN and BSS, the algorithm is optimal: among all algorithms that ensure that the BSS buffer will never overflow or underflow, it requires the smallest amount of buffering in the BSS. The algorithm also has a fixed point, i.e. if the wireless link rate remains constant, the BSS buffer remains in equilibrium and no flow control updates are required.

Key concepts: Arithmetic underflow, Buffer overflow, Computer science, Algorithm, Wireless, Computer network, Flow control (data), Real-time computing

Related papers

Back to paper searchBrowse research topicsOriginal source
A lossless algorithm for BSSGP flow control in GPRS and EDGE — Research Paper | ScholarLens