Stability of Switched Server Systems with Constraints on Service-Time and Capacity of Buffers

Li Wang, Zhonghe He and Chi Zhang

Mathematical Problems in Engineering, 2015, vol. 2015, 1-10

Abstract:

The execution of emptying policy ensures the convergence of any solution to the system to a unique periodic orbit, which does not impose constraints on service-time and capacity of buffers. Motivated by these problems, in this paper, the service-time-limited policy is first proposed based on the information resulted from the periodic orbit under emptying policy, which imposes lower and upper bounds on emptying time for the queue in each buffer, by introducing lower-limit and upper-limit service-time factors. Furthermore, the execution of service-time-limited policy in the case of finite buffer capacity is considered. Moreover, the notion of feasibility of states under service-time-limited policy is introduced and then the checking condition for feasibility of states is given; that is, the solution does not exceed the buffer capacity within the first cycle of the server. At last, a sufficient condition for determining upper-limit service-time factors ensuring that the given state is feasible is given.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/347931.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/347931.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:347931

DOI: 10.1155/2015/347931

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().