(A) control-theoretic approach to flow control in communication networks통신망에서의 흐름제어에 관한 제어이론적인 접근

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 408
  • Download : 0
This thesis describes flow control algorithms achieving two kinds of max-min fairness properties, that is to say, bandwidth max-min fairness and utility max-min fairness and provides a control-theoretic approach to analyze the stability of proposed algorithms. Our algorithms are scalable in that routers do not need to store any per-flow information of each flow and they use simple first come first serve (FCFS) discipline, stable in that the stability is proven rigorously when there are flows with heterogeneous round-trip delays, and optimal in that the gains used for controllers are optimally adjusted. First, we present a network architecture for the distributed bandwidth max-min flow control of elastic flows and generalize stability conditions to enhance network performance. We suggest two closed-loop system models that approximate our flow control algorithms in continuous-time domain where the purpose of the first algorithm is to achieve the target queue length and that of the second is to achieve the target utilization. The slow convergence of many rate-based flow control algorithms, which use queue lengths as input signals, can be resolved by the second algorithm. Based on these models, we find the conditions for con-troller gains that stabilize closed-loop systems when round-trip delays are equal and extend this result to the case of heterogeneous round-trip delays with the help of Zero exclusion theorem. Second, we revise the proposed algorithms and provide application-performance oriented flow control algorithms. We present a network architecture for the distributed utility max-min flow control of elastic and non-elastic flows where utility values of users (rather than data rates of users) are enforced to achieve max-min fairness. We also provide a distributed link algorithm that does not use the information of users`` utility functions. To show that the proposed algorithm can be stabilized not locally but globally, we found that the use of nonlinear con...
Advisors
Chong, Songresearcher정송researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2005
Identifier
249359/325007  / 020025290
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2005.8, [ x, 77 p. ]

Keywords

max-min; quality of service; congestion control; flow control; utility; 효용도; 최대-최소; 서비스 품질; 혼잡 제어; 흐름 제어

URI
http://hdl.handle.net/10203/35307
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=249359&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0