• DocumentCode
    1679009
  • Title

    Beyond AIMD: explicit fair-share calculation

  • Author

    Attie, Paul C. ; Lahanas, Adrian ; Tsaoussidis, Vassilis

  • Author_Institution
    Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA
  • fYear
    2003
  • Firstpage
    727
  • Abstract
    We introduce an alternative approach to congestion avoidance and control, which has the potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal congestion avoidance and control, is based on the principles of TCP´s additive increase multiplicative decrease. It is designed to better exploit the system properties during equilibrium, without trading off responsiveness for smoothness. In addition, it is capable of achieving convergence to fairness in only two congestion cycles. As a result, both efficiency and fairness are improved, responsiveness is not degraded, and smoothness is significantly improved when the system is in equilibrium. We provide a theoretical analysis and we discuss the potential of our approach for packet networks. Our experiments confirm that bimodal congestion avoidance and control as a component of the transmission control protocol outperforms the traditional scheme.
  • Keywords
    packet radio networks; telecommunication channels; telecommunication congestion control; transport protocols; TCP; additive increase multiplicative decrease; bimodal congestion avoidance; bimodal congestion control; explicit fair-share calculation; multiplexed channels; packet networks; transmission control protocol; Additives; Availability; Bandwidth; Computer science; Convergence; Degradation; Delay; Educational institutions; Protocols; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on
  • ISSN
    1530-1346
  • Print_ISBN
    0-7695-1961-X
  • Type

    conf

  • DOI
    10.1109/ISCC.2003.1214204
  • Filename
    1214204