Stochastic convex ordering for multiplicative decrease internet congestion control

Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex orderi...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2009-02, Vol.53 (3), p.365-381
Main Authors: Cai, Han, Eun, Do Young, Ha, Sangtae, Rhee, Injong, Xu, Lisong
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Convex ordering
Data transmission
Exact sciences and technology
High-speed TCP
Interconnected networks
Internet Protocol
Miscellaneous
Networks and services in france and abroad
Protocol
Stochastic models
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Teletraffic
Traffic flow
Window growth function
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. As the ordering determined by this tool is consistent with any convex function of rates, it can be applied to any unknown metric for protocol performance that consists of some high-order moments of transmission rates, as well as those already known such as rate variance. Using the tool, it is analyzed that a protocol with a growth function that starts off with a concave function and then switches to a convex function (e.g., an odd order function such as x 3 and x 5 ) around the maximum window size in the previous loss epoch, gives the smallest rate variation under a variety of network conditions. Among existing protocols, BIC and CUBIC have this window growth function. Experimental and simulation results confirm the analytical findings.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2008.10.012