Utility function of TCP Reno under precise end-to-end drop probability

Ying Liu; He Li; Hong Ying Liu

doi:10.1007/s11432-012-4703-7

Utility function of TCP Reno under precise end-to-end drop probability

Ying Liu^*
, He Li
, Hong Ying Liu

^*此作品的通讯作者

数学科学学院

Tsinghua University
Beihang University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.

源语言	英语
页（从-至）	1-6
页数	6
期刊	Science China Information Sciences
卷	56
期	1
DOI	https://doi.org/10.1007/s11432-012-4703-7
出版状态	已出版 - 1月 2013

访问文件

10.1007/s11432-012-4703-7

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{d9e2151557cf4c46b20ddb6bf7f16765,

title = "Utility function of TCP Reno under precise end-to-end drop probability",

abstract = "TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.",

keywords = "TCP Reno, end-to-end drop probability, utility function",

author = "Ying Liu and He Li and Liu, \{Hong Ying\}",

year = "2013",

month = jan,

doi = "10.1007/s11432-012-4703-7",

language = "英语",

volume = "56",

pages = "1--6",

journal = "Science China Information Sciences",

issn = "1674-733X",

publisher = "Science China Press ",

number = "1",

}

TY - JOUR

T1 - Utility function of TCP Reno under precise end-to-end drop probability

AU - Liu, Ying

AU - Li, He

AU - Liu, Hong Ying

PY - 2013/1

Y1 - 2013/1

N2 - TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.

AB - TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.

KW - TCP Reno

KW - end-to-end drop probability

KW - utility function

UR - https://www.scopus.com/pages/publications/84872818981

U2 - 10.1007/s11432-012-4703-7

DO - 10.1007/s11432-012-4703-7

M3 - 文章

AN - SCOPUS:84872818981

SN - 1674-733X

VL - 56

SP - 1

EP - 6

JO - Science China Information Sciences

JF - Science China Information Sciences

IS - 1

ER -

Utility function of TCP Reno under precise end-to-end drop probability

摘要

访问文件

其它文件与链接

学术指纹

引用此