• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Binomial Congestion Control Algorithms (2001)

Cached

  • Download as a PDF

Download Links

  • [www.ieee-infocom.org]
  • [www.ecse.rpi.edu]
  • [www.cs.cmu.edu]
  • [inat.lcs.mit.edu]
  • [www.cs.cmu.edu]
  • [nms.lcs.mit.edu]
  • [wwwx.cs.unc.edu]
  • [www.cs.cmu.edu]
  • [nms.csail.mit.edu]
  • [wind.lcs.mit.edu]
  • [www.cs.unc.edu]
  • [www.ecse.rpi.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [nms.lcs.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Deepak Bansal , Hari Balakrishnan
Citations:217 - 11 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Bansal01binomialcongestion,
    author = {Deepak Bansal and Hari Balakrishnan},
    title = {Binomial Congestion Control Algorithms},
    year = {2001}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or loss) is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a power of the current window (for TCP, ) ; they generalize TCP-style multiplicative-decrease by decreasing proportional to a power of the current window (for TCP, ). We show that there are an infinite number of deployable TCP-compatible binomial algorithms, those which satisfy , and that all binomial algorithms converge to fairness under a synchronized-feedback assumption provided . Our simulation results show that binomial algorithms interact well with TCP across a RED gateway. We focus on two particular algorithms, IIAD ( ) and SQRT ( !" ), showing that they are well-suited to applications that do not react well to large TCP-style window reductions. Keywords--- Congestion control, TCP-friendliness, TCP-compatibility, nonlinear algorithms, transport protocols, TCP, streaming media, Internet. I.

Keyphrases

binomial congestion control algorithm    current window    tcp-style multiplicative-decrease    binomial algorithm converge    infinite number    red gateway    particular algorithm    deployable tcp-compatible binomial algorithm    video application    synchronized-feedback assumption    nonlinear algorithm    binomial algorithm    binomial algorithm interact    nonlinear congestion control algorithm    paper introduces    large tcp-style window reduction    keywords congestion control    transmission rate    congestion indication    simulation result    drastic reduction    tcp-style additive-increase    transport protocol   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University