Dynamic QoS queuing control mechanism for multimedia differentiated services

Kung, H. T.; Lin, Mei-Hsien; Kuo, Fu-Wen

doi:10.1016/j.ins.2006.02.005

Cited by 8 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there are also challenges in NCS analysis and synthesis, for instance, time-varying network-induced delay and packet dropout [15]. Signal quantization is also a difficult issue, which has significant impact on the performance of the networked control [7,10,13]. This paper will address the problems of signal quantization and non-ideal network quality-of-service (QoS) in NCSs.…”

Section: Introductionmentioning

confidence: 99%

Networked H∞ control of linear systems with state quantization

Chen

Tian

2007

Information Sciences

172

View full text Add to dashboard Cite

This paper addresses the problem of H 1 controller design for linear systems over digital communication networks. A new model is proposed to describe both the network conditions and the state quantization of the networked control systems in a unified framework. From this model, a quantized state feedback strategy is developed for global and asymptotical stabilization of the networked control systems. The same H 1 disturbance attenuation level as that in the case without quantization is achieved. Numerical examples are given to demonstrate the effectiveness of the proposed method.

show abstract

Section: Introductionmentioning

confidence: 99%

Networked H∞ control of linear systems with state quantization

Chen

Tian

2007

Information Sciences

172

View full text Add to dashboard Cite

show abstract

“…When data are transmitted through a flow network, it is desirable to adopt the shortest path, the least cost path, the largest capacity path, the shortest delay path, or some combination of multiple criteria [1,4,13], which are all variants of the shortest path problem. For the network with a time attribute, it is an important task to reduce the transmission time from the viewpoint of QoS [5,14,15,17,21,23,35]. Hence, Chen and Chin [10] proposed a version of the shortest path problem called the quickest path problem that finds a path with minimum transmission time to send a given amount of data through the network.…”

Section: Introductionmentioning

confidence: 99%

A method to evaluate routing policy through p minimal paths for stochastic case

Lin¹

2010

Information Sciences

View full text Add to dashboard Cite

“…Huh and Choo [16] proposed a scheme to achieve high throughput even with a small buffer size, and also derive a regression equation to predict the optimal combination of resources for a connection in TCP/IP networks. Kung et al [22] proposed the Dynamic QoS Queue Mapping (DQ2M) mechanism dynamic control queue scheduling by adaptively maximizing the utilization of queues and network resources according to the soft states of the DiffServ network. Liu et al [23] proposed a new congestion control algorithm that uses packet loss information to determine whether the window size should be increased or decreased, and uses queuing delay information to determine the amount of increment or decrement for high-speed networks.…”

Section: Introductionmentioning

confidence: 99%