東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Optimal network flow control: Time-o...

Iyer, Mahadevan Kulathu.

Linked to FindBook

Google Book

Amazon

博客來

Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation./
Author:	Iyer, Mahadevan Kulathu.
Description:	184 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0286.
Contained By:	Dissertation Abstracts International65-01B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3119739

Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation.
Iyer, Mahadevan Kulathu.

Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation. - 184 p.

Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0286.

Thesis (Ph.D.)--University of California, Irvine, 2004.

Rate-based feedback flow control at the network layer has the potential to dramatically alleviate the Internet's artificial bottleneck problems created by bursty, uncoordinated and uncontrolled traffic flows. A good feedback flow control scheme will control traffic rates entering the network such as to keep network queue sizes stably close to a targeted ideal value while maximizing bandwidth utilizations and allocating the bandwidths fairly among different users. Moreover, it will be robust in achieving these objectives in the face of dynamic and unpredictable available link bandwidth and flow routes.Subjects--Topical Terms:

626642
Computer Science.

Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation.
LDR:04055nmm 2200325 4500 001 1865037
005 20041216133914.5
008 130614s2004 eng d
035 $a (UnM)AAI3119739
035 $a AAI3119739
040 $a UnM $c UnM
100 1 $a Iyer, Mahadevan Kulathu. $3 1952500
245 1 0 $a Optimal network flow control: Time-optimal queue control and max-min fair bandwidth allocation.
300 $a 184 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0286.
500 $a Chair: Wei Kang Tsai.
502 $a Thesis (Ph.D.)--University of California, Irvine, 2004.
520 $a Rate-based feedback flow control at the network layer has the potential to dramatically alleviate the Internet's artificial bottleneck problems created by bursty, uncoordinated and uncontrolled traffic flows. A good feedback flow control scheme will control traffic rates entering the network such as to keep network queue sizes stably close to a targeted ideal value while maximizing bandwidth utilizations and allocating the bandwidths fairly among different users. Moreover, it will be robust in achieving these objectives in the face of dynamic and unpredictable available link bandwidth and flow routes.
520 $a This thesis contributes news results towards a fundamental understanding of how to achieve these objectives jointly. Specifically it formulates queue and link bandwidth utilization control as a time-optimal control problem: starting from any initial condition, control the traffic rates entering the network so as to converge the network queue sizes to a desired level in the minimum possible time while still keeping at least one link fully utilized in the path of every flow at all times. The robustness goal is automatically satisfied by the time-optimal control law; we formally prove this for case of a single-queue. Traditional control-theoretic approaches have been based on simplified linear models of the network invalid under severe bandwidth and route disturbances and yet have been intractable for general network topologies, delays and congestion conditions. Typically they lead to local stability or robustness results. In contrast, the time-optimal approach leads to exact global solutions valid even under nonlinear queue dynamics. Formal proofs are given for all results. Moreover, these solutions are computationally simple and lend themselves nicely to designing distributed asynchronous protocols.
520 $a With a gradual approach, we first solve for time-optimal control of a single queue shared by multiple flows and of a single flow crossing multiple queues. From these, the solution for a general network of queues, with a target queue size of zero, is intuited. The heart of this solution is a spatio-temporal link capacity allocation among the flows: to guarantee time-optimality, it is sufficient for the allocation to be both feasible and maximally-utilizing with respect to "queue-reduced" link capacities. To these two conditions, different fairness criteria can be added thereby resulting in different specific control laws. Thus fairness is neatly separated out from queue control.
520 $a Specifically, we focus on the max-min fairness criterion. We formally analyze convergence speeds of max-min fair link capacity allocation algorithms and show that previous estimates of their worst-case convergence speeds have been very pessimistic.
520 $a We also develop a theory of spatio-temporal bandwidth allocation. For networks with consistent link delay differences as seen at different flows, we show how to construct spatio-temporal bandwidth allocation protocols from any available distributed algorithm for a spatially defined allocation such as max-min fair allocation.
590 $a School code: 0030.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, System Science. $3 1018128
690 $a 0984
690 $a 0544
690 $a 0790
710 2 0 $a University of California, Irvine. $3 705821
773 0 $t Dissertation Abstracts International $g 65-01B.
790 1 0 $a Tsai, Wei Kang, $e advisor
790 $a 0030
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3119739