Informatica Logo

INFORMATICA
International Journal

Main Page
Editorial Board
Abstracting/Indexing
Instructions to Authors
Subscription Information


Contents
Author Index
Papers in Production

INFORMATICA, 2015, Vol. 26, No. 2, 313-234
© Institute of Mathematics and Informatics,
DOI: http://dx.doi.org/10.15388/Informatica.2015.50

ISSN 0868-4952

Optimal Congestion Control and Routing for Multipath Networks with Random Losses

Shiyong LI, Wei SUN1, Yaming ZHANG, Yehua CHEN

School of Economics and Management, Yanshan University Qinhuangdao 066004, China E-mail: shiyongli@ysu.edu.cn, wsun@ysu.edu.cn, yaming99@ysu.edu.cn, chenyh@ysu.edu.cn

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


1Corresponding author.
To preview Lithuanian abstract see full article text

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010