Computer Science – Data Structures and Algorithms
Scientific paper
2002-05-18
Computer Science
Data Structures and Algorithms
Proceedings IEEE Symp. Foundations of Computer Science, 2002
Scientific paper
Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. Here we analyze a particular end-to-end, MIMD (multiplicative-increase, multiplicative-decrease) protocol. We show that if all users of the network use the protocol, and all connections last for at least logarithmically many rounds, then the total weighted throughput (value of all packets received) is near the maximum possible. Our analysis includes round-trip-times, and (in contrast to most previous analyses) gives explicit convergence rates, allows connections to start and stop, and allows capacities to change.
Garg Naveen
Young Neal E.
No associations
LandOfFree
On-Line End-to-End Congestion Control does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On-Line End-to-End Congestion Control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-Line End-to-End Congestion Control will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-599123