When congestion occurs in VDSL networks, it will drop incoming frames because the buffer fills up frames until it overflows. In backpressure algo-rithm suitable for low traffic [1], it prevents buffer overflows. In backoff time in leaky bucket over traf-fic policing mechanism suitable for high

algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated

When a trigram backoff language model is created from a large body of text, trigrams and bigrams that occur few times in the training text are often excluded from the model in order to decrease the model size. Generally, the elimination of n-grams with very low counts is believed

in time, provided the rates of new packet arrivals are small enough? It is assumed n 2 stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable

When a trigram backoff language model is created from a large body of text, trigrams and bigrams that occur few times in the training text are often excluded from the model in order to decrease the model size. Generally, the elimination of n-grams with very low counts is believed

Abstract. We consider the impact of transmission errors on the backoff algorithm behavior in the IEEE 802.11 protocol. Specifically, since the backoff algorithm assumes that all packet losses are due to collisions, it unnecessarily backs off when a packet is lost due to a transmission error. Two

into each other. This in turn can cause a major slowdown in communication, as the Ethernet hardware generates unnecessarily long backoff times. A solution to this problem, called programmed backoff, has been proposed earlier and shown to work well on Ethernets which are dedicated to the particular

-eration in the frequency domain. Our basic idea leverages the observation that OFDM subcarriers can be treated as integer numbers. Thus, instead of picking a random backoff duration in time, a contending node can signal on a randomly cho-sen subcarrier. By employing a second antenna to listen to all the subcarriers, each

When a trigram backoff language model is created from a large body of text, trigrams and bigrams that occur few times in the training text are often excluded from the model in order to decrease the model size. Generally, the elimination of n-grams with very low counts is believed

to the packet just prior to transmission. When a station hears packets which have older finish tags than the station, the station increases its backoff time counter. Therefore, the backoff time counter depends on the number of active stations in a wireless network; the more stations there are, the larger