Abstract

Unexpected large packet delays are often observed in cellular networks due to huge network queuing caused by excessive traffic coming into the network. To deal with the large queue problem, many congestion control algorithms try to find out how much traffic the network can accommodate, either by measuring network performance or by directly providing explicit information. However, due to the nature of the control in which queue growth should be observed or the necessity to modify the overall network architecture, existing algorithms are experiencing difficulties in keeping queues within a strict bound. In this paper, we propose a novel congestion control algorithm based on simple feedback, ECLAT which can provide bounded queuing delay using only one-bit signaling already available in traditional network architecture. To do so, a base station or a router running ECLAT 1) calculates how many packets each flow should transmit and 2) analyzes when congestion feedback needs to be forwarded to adjust the flow’s packet transmission to the desired rate. Our extensive experiments in our testbed demonstrate that ECLAT achieves strict queuing delay bounds, even in the dynamic cellular network environment.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call