IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-25707-0_20.html
   My bibliography  Save this book chapter

MaxNet and TCP Reno/RED on Mice Traffic

In: Modeling, Simulation and Optimization of Complex Processes

Author

Listed:
  • Khoa T. Phan

    (Ho Chi Minh City University of Technology, Faculty of Computer Science and Engineering)

  • Tuan T. Tran

    (Ho Chi Minh City University of Technology, Faculty of Computer Science and Engineering)

  • Duc D. Nguyen

    (Ho Chi Minh City University of Technology, Faculty of Computer Science and Engineering)

  • Nam Thoai

    (Ho Chi Minh City University of Technology, Faculty of Computer Science and Engineering)

Abstract

Congestion control is a distributed algorithm to share network bandwidth among competing users on the Internet. In the common case, quick response time for mice traffic (HTTP traffic) is desired when mixed with elephant traffic (FTP traffic). The current approach using loss-based with Additive Increase, Multiplicative Decrease (AIMD) is too greedy and eventually, most of the network bandwidth would be consumed by elephant traffic. As a result, it causes longer response time for mice traffic because there is no room left at the routers. MaxNet is a new TCP congestion control architecture using an explicit signal to control transmission rate at the source node. In this paper, we show that MaxNet can control well the queue length at routers and therefore the response time to HTTP traffic is several times faster than with TCP Reno/RED.

Suggested Citation

  • Khoa T. Phan & Tuan T. Tran & Duc D. Nguyen & Nam Thoai, 2012. "MaxNet and TCP Reno/RED on Mice Traffic," Springer Books, in: Hans Georg Bock & Xuan Phu Hoang & Rolf Rannacher & Johannes P. Schlöder (ed.), Modeling, Simulation and Optimization of Complex Processes, edition 127, pages 247-255, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-25707-0_20
    DOI: 10.1007/978-3-642-25707-0_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-25707-0_20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.