Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Exponential backoff


Related Topics

In the News (Wed 9 Dec 09)

  
 [No title]
backoff model The backoff model computes the delay to transmit m bytes of data from between a receiver and sender in a single hop network with M hosts.
Backoff delay = E[Nc] E[Coll]   The packet size is modeled with a geometric distribution parameter, q; the packet size is measured as number of time slots and slots = 1/(1-q).
My intuition is that geometric distribution approximates the exponential backoff; as the backoff time increases the probability of a collision falls off exponentially.
www.cs.unc.edu /~dorianm/academics/comp290mc/cali_backoff.doc   (678 words)

  
 NNRPD Exponential Backoff
Clearly an exponential backoff algorithm would be sufficient to allow me to post at my prolific rate, and still slow down a spammer's posting robot.
Exponential backoff was installed on EarthLink news servers sometime in July of 1997.
Nevertheless, I feel that the consistency of this metric coupled with the dramatic drop in Usenet volume abuse indicate that exponential backoff is quite successful at preventing the abuse of resources that occurs when ISP customers post too much.
www.jetcafe.org /~dave/usenet/backoff.html   (855 words)

  
 RFC 2001 (rfc2001) - TCP Slow Start, Congestion Avoidance, Fast Retransmit
This provides an exponential growth, although it is not exactly exponential because the receiver may delay its ACKs, typically sending one ACK for every two segments that it receives.
Congestion avoidance dictates that cwnd be incremented by segsize*segsize/cwnd each time an ACK is received, where segsize is the segment size and cwnd is maintained in bytes.
This is a linear growth of cwnd, compared to slow start's exponential growth.
www.faqs.org /rfcs/rfc2001.html   (1753 words)

  
 Adversarial Analyses of Window Backoff Strategies
Backoff strategies have typically been analyzed by making statistical assumptions on the distribution of problem inputs.
Although these analyses have provided valuable insights into the efficacy of various backoff strategies, they leave open the question as to which backoff algorithms perform best in the worst case or on inputs, such as bursty inputs, that are not covered by the statistical models.
In this model, to evaluate a given backoff algorithm (which does not know λ or Τ), we analyze the worst-case behavior of the algorithm over the class of (λ, Τ)-streams.
csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/ipdps/2004/2132/11/2132toc.xml&DOI=10.1109/IPDPS.2004.1303230   (680 words)

  
 Citations: Stochastic models of computer communication systems - Kelly (ResearchIndex)
Binary Exponential Backoff is Stable for High Arrival Rates - Al-Ammal, Goldberg..
Next, we mention that the binary exponential backo protocol is known to be unstable in the in nitely many users Poisson arrivals model.
showed that, for any 0, any backoff protocol with a backoff function f(i) that is smaller than any exponential function is unstable in the sense that the expected number of successful transmissions to the channel is finite.
citeseer.ist.psu.edu /context/75566/0   (3437 words)

  
 Journal of Research of the National Institute of Standards and Technology: On the stability of exponential backoff   (Site not responding. Last check: 2007-10-10)
A widely used collision resolution protocol is the exponential backoff (EB).
We also obtain the analytical expressions for the saturation throughput for a given number of nodes, N. The analysis considers the general case of EB with backoff factor r, where BEB is the special case with r = 2.
The binary exponential backoff (BEB), a widely used backoff algorithm, adjusts the contention window size by indirectly estimating the traffic in the communication medium at individual nodes, in effect by counting consecutive collisions involving the same packet.
www.findarticles.com /p/articles/mi_m0IKZ/is_4_108/ai_111734060   (1470 words)

  
 Analysis of Backoff Protocols for Mulitiple AccessChannels
In particular, we prove that binary exponential backoff is unstable if the arrival rate of new messages at each station is $\lam/N$ for any $\lam >{1\over 2}$ and the number of stations N, is sufficiently large.
More importantly, we also prove that any superlinear polynomial backoff protocol (e.g., quadratic backoff) is stable for any set of arrival rates that sum to less than one, and any number of stations.
The results also disprove a popular assumption that exponential backoff is the best choice among acknowledgment based protocols for systems with large overall arrival rates.
epubs.siam.org /sam-bin/dbq/article/23382   (225 words)

  
 INTRODUCTION
6], exponential backoff has been dropped from the standard and a preference has been given to a scheme that allows nodes to choose randomly when they transmit during an enlarged window of opportunity, termed discovery slot or discovery window.
The main argument for this decision was the reduction in the average wait for the registration.
The scheme does not suffer from the increase in wait time that has been observed in the exponential backoff-based schemes that were a part of the earlier version the standard.
www.cs.unh.edu /cnrg/epon/spie04-html/node1.html   (451 words)

  
 Random access schemes   (Site not responding. Last check: 2007-10-10)
Here $b>1$ is the backoff factor and the case $b=2$ is termed binary exponential backoff [11].
In this paper we prove that for a general collision detect random access scheme there exists a critical value $\nu_c\in [0,\infty ]$, with the property that the number of packets successfully transmitted is finite with probability 0 or 1 according as $\nu
For the Ethernet scheme with backoff factor $b$ we prove that $\nu_c=\log b$.
www.statslab.cam.ac.uk /~frank/PAPERS/nptcdras.html   (582 words)

  
 Binary Exponential Backoff in Ethernet: Origin
The first backoff algorithm for multiple access was proposed and investigated in our 1973 paper in National Computer Conference for the slotted ALOHA protocol.
We showed that the channel throughput increases with K and, only in the limit as K goes to infinity, does the channel throughput approach the 1/e value predicted by analysis based upon the Poisson process assumption.
The binary exponential backoff algorithm used in Ethernet is a special case of Heuristic RCP with the function K
www.cs.utexas.edu /users/lam/NRL/backoff.html   (581 words)

  
 Poster abstract, 2001 autumn, HSN Workshop   (Site not responding. Last check: 2007-10-10)
We experienced that in this case some of TCPs are in Karn's exponential backoff state with maximum backoff level while the others are in congestion avoidance state.
The queue length on links that ended in a TCP that is in congestion avoidance state has a relatively low Hurst exponent and the queue length on other links has a high Hurst exponent.
In future we would like to investigate the relationship between the number of TCPs which are in exponential backoff state and the ratio of Hurst exponent.
www.physik.uni-marburg.de /~bozso/publications/hsn4.html   (388 words)

  
 Bina from FOLDOC   (Site not responding. Last check: 2007-10-10)
The counter may be either a synchronous counter or a ripple counter.
Confusingly, some word processor files, and rich text files, are actually binary files because they contain non-printable characters and require special programs to view, edit and print them.
A BLOB has no structure which can be interpreted by the database management system but is known only by its size and location.
wombat.doc.ic.ac.uk /foldoc/foldoc.cgi?query=Bina   (1134 words)

  
 [No title]   (Site not responding. Last check: 2007-10-10)
At this point, the station generates a random backoff interval before transmitting (this is the collision avoidance feature of the protocol), to minimize the probability of collision with packets being transmitted by other stations.
The backoff time counter is decremented as long as the channel is sensed idle, “frozen” when a transmission is detected on the channel, and reactivated when the channel is sensed idle again for more than a DIFS.
Since the CSMA/CA does not rely on the capability of the stations to detect a collision by hearing their own transmission, an ACK is transmitted by the destination station to signal the successful packet reception.
www.cs.nps.navy.mil /people/faculty/bmichael/cs4554/Team_H.doc   (2705 words)

  
 Ott Glossary
So called because the backoff delay expands exponentially (becomes longer) with repeated collisions.
A proposed enhancement of the Binary Exponential Backoff algorithm designed to eliminate the unfairness caused by the "capture effect".
A condition where the backoff delays selected by different stations following the same collision can become very lopsided, resulting in an unfairness problem.
www.femf.org /education/Summit2000syll/ottglossary.htm   (8533 words)

  
 LASS Security
If your LAP is vulnerable to brute force attacks, it is good practice to have the LAP implement the LASS Exponential Backoff mechanism.
This mechanism is designed to deter brute force attacks that rapidly try several authentications on a LAP by introducing an exponentially increasing time delay between unsuccessful consecutive application attempts to call VerifyUser.
For more information about the exponential backoff mechanism, see LASS Exponential Backoff.
msdn.microsoft.com /library/en-us/wcesecurity5/html/wce50grfLASSSecurity.asp?frame=true   (384 words)

  
 [No title]   (Site not responding. Last check: 2007-10-10)
The queue manager implements exponential backoff by doubling the time between delivery attempts.
exponential backoff Mail that cannot be delivered upon the first attempt is deferred.
The time interval between delivery attempts is doubled after each attempt.
www.styx.org /postfix/qmgr.8.html   (1197 words)

  
 [No title]
Ethernet protocol uses CSMA/CD principle in which it continuously senses the carrier before transmitting the frame on the bus.
If the collision is detected then the transmission is delayed implementing EXPONENTIAL BACKOFF ALGORITHM.
The Exponential Back off algorithm is implemented as follows: Whenever there is a collision, the stations involved in the collision will execute the binary exponential back off algorithm to reduce the possibility of further collisions as follows: 1.
www.cs.uml.edu /~rbshah/temp/Obstable.doc   (254 words)

  
 Introduction
The only problem is that commodity Ethernet hardware can not provide any performance guarantee, for the following two reasons.
First, Ethernet's media access control protocol is CSMA/CD, which relies on an exponential backoff algorithm to resolve link collision among multiple nodes when they attempt to send data simultaneously.
Due to the probabilistic nature of the exponential backoff algorithm, network access delay is inherently non-deterministic.
www.usenix.org /publications/library/proceedings/es99/full_papers/chiueh/chiueh_html/node2.html   (529 words)

  
 Scheduler RPC timing and retry policies   (Site not responding. Last check: 2007-10-10)
Use random exponential backoff if a project's scheduling servers are down (i.e.
Resource debt is a measure of how much work the client owes the project, and in general the project with the greatest resource debt is the one from which work should be requested.
An exponential backoff policy is used to prevent a cycle of rapid failures.
boinc.berkeley.edu /rpc_policy.php   (415 words)

  
 backoff - OneLook Dictionary Search
We found 3 dictionaries with English definitions that include the word backoff:
Tip: Click on the first link on a line below to go directly to a page where "backoff" is defined.
Phrases that include backoff: binary exponential backoff, truncated binary exponential backoff
www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=backoff   (88 words)

  
 search.cpan.org: TipJar::MTA - outgoing SMTP with exponential random backoff.   (Site not responding. Last check: 2007-10-10)
search.cpan.org: TipJar::MTA - outgoing SMTP with exponential random backoff.
TipJar::MTA - outgoing SMTP with exponential random backoff.
This module implements outgoing SMTP with exponentially deferred random backoffs on temporary failure.
search.cpan.org /~davidnico/TipJar-MTA-0.14/MTA.pm   (1056 words)

  
 [No title]   (Site not responding. Last check: 2007-10-10)
By dynamically tuning backoff algorithm, DCF can be made to operate close to theoretical limit.
DCF and SD are unable to distinguish between high and low load conditions.
Is it possible to select a stage with highest chances of successful transmission and minimum backoff overhead?¡ŽZ¦ZëZ"¦""&"*""""ªt  ™     º    óIŸ¨Adaptive DCF (ADCF)¡ ª  Ÿ¨ñDCF requires nodes to monitor state of the medium during backoff procedure.
www.utdallas.edu /~ksrikant/pub_files/WCNC05/WCNC05.ppt   (830 words)

  
 CMSC 406, MSCS 560 Computer Networks
  Let       T = 51.2 ms be the exponential backoff base unit.
    choose backoff times of 0 x T and 1 x T, respectively, meaning A wins and transmits,
            b) What is the probability that A wins the third backoff race after the first
www.academic.marist.edu /~jzbv/networks/Hw3b.htm   (796 words)

  
 [No title]
The arrival process follows a negative exponentially distribution (same as Phase I of the project).
When hosts collide, they will schedule their retransmission using a backoff algorithm.
The following are the three backoff algorithms you will use: Binary Exponential Backoff — The number of slots to delay after the nth retransmission attempt is chosen as a uniformly distributed integer in the range of 0
www.cs.ucdavis.edu /~prasant/ECS152A/project2.doc   (621 words)

  
 timers throttle spf
Description: The OSPF SPF exponential backoff functionality limits the number of SPF computations during times of network instability by doubling the delay associated with the SPF run, up to a maximum delay, for the period of instability.
When the period of instability ends, the delay is reset to the original value.
Three timers are associated SPF exponential backoff: Start Time, Initial Hold Time, and Max Hold Time.
www.avici.com /documentation/HTMLDocs/02223-10_revAB/ospf35.html   (346 words)

  
 Len's Page Two
"Performance of Exponential Backoff," accepted by IEEE Transactions on Networks (co-author with B. Kwak and N. Song).
"Enhancement of IEEE 802.11 Distributed Coordination Function with Exponential Increase Exponential Decrease Backoff Algorithm," Proc.
"Analysis of the Stability and Performance of Exponential Backoff," Proc.
www.antd.nist.gov /wctg/people/lmiller2.html   (1230 words)

  
 backoff from FOLDOC   (Site not responding. Last check: 2007-10-10)
A random backoff minimises the probability that the same nodes will collide again, even if they are using the same backoff algorithm.
Increasing the backoff period after each collision also helps to prevent repeated collisions, especially when the network is heavily loaded.
Previous: Back End Generator Language, backgammon, background, backing store, back link
www.instantweb.com /foldoc/foldoc.cgi?backoff   (90 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.