EconPapers    
Economics at your fingertips  
 

MaxNet and TCP Reno/RED on Mice Traffic

Khoa T. Phan (), Tuan T. Tran, Duc D. Nguyen and Nam Thoai ()
Additional contact information
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

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2012, pp 247-255 from Springer

Abstract: 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.

Keywords: Active queue management; TCP congestion control; MaxNet (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-25707-0_20

Ordering information: This item can be ordered from
http://www.springer.com/9783642257070

DOI: 10.1007/978-3-642-25707-0_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2026-07-12
Handle: RePEc:spr:sprchp:978-3-642-25707-0_20