Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Li, Shiyong | Sun, Wei; * | Zhang, Yaming | Chen, Yehua
Affiliations: School of Economics and Management, Yanshan University, Qinhuangdao 066004, China, e-mail: [email protected], [email protected], [email protected], [email protected]
Correspondence: [*] Corresponding author.
Abstract: In this paper we consider optimal congestion control and routing schemes for multipath networks with non-congestion related packet losses which can be caused by, for example, errors on links on the routes, and develop a relaxed multipath network utility maximization problem. In order to obtain the optimum, we present a primal algorithm which is shown to be globally stable in the absence of round-trip delays. When round-trip delays are considered, decentralized sufficient conditions for local stability of the algorithm are proposed, in both continuous-time and discrete-time forms. Finally, a window-flow control mechanism is presented which can approximate the optimum of the multipath network utility maximization model.
Keywords: resource allocation, congestion control, network utility maximization, stability
Journal: Informatica, vol. 26, no. 2, pp. 313-334, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]