Queueing system topologies with limited flexibility

Tsitsiklis, John N.; Xu, Kuang

doi:10.1145/2494232.2465757

Cited by 20 publications

(13 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The design and performance of flexible server systems has been studied in [6,[31][32][33]. In a flexible server system, traditionally, when a server becomes available it chooses the queue from which to take its next job according to some policy.…”

Section: Flexible Server Systemsmentioning

confidence: 99%

Queueing with redundant requests: exact analysis

et al. 2016

View full text Add to dashboard Cite

Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However, there is no exact analysis of systems with redundancy. This paper presents the first exact analysis of systems with redundancy. We allow for any number of classes of redundant requests, any number of classes of non-redundant requests, any degree of redundancy, and any number of heterogeneous servers. In all cases we derive the limiting distribution of the state of the system. In small (two or three server) systems, we derive simple forms for the distribution of response time of both the redundant classes and non-redundant classes, and we quantify the "gain" to redundant classes and "pain" to non-redundant classes caused by redundancy. We find some surprising results. First, the response time of a fully redundant class follows a simple exponential distribution and that of the non-redundant class follows a generalized hyperexponential. Second, fully redundant classes are "immune" to any pain caused by other classes becoming redundant. We also compare redundancy with other approaches for reducing latency, such as optimal probabilistic splitting of a class among servers (Opt-Split) and join-the-shortest-queue (JSQ) routing of a class. We find that, in many cases, redundancy outperforms JSQ and Opt-Split with respect to overall response time, making it an attractive solution.

show abstract

Section: Flexible Server Systemsmentioning

confidence: 99%

Queueing with redundant requests: exact analysis

et al. 2016

View full text Add to dashboard Cite

show abstract

“…The problem of content replication for the case where each request can only be served by one cache has been widely studied [6]- [10], [14]. In [6]- [8] the focus is on the setting where each request can be served by any one cache and the central server communicates with each user separately.…”

Section: Related Workmentioning

confidence: 99%

Resource pooling in large-scale content delivery systems

Reddy

Moharir

Karamchandani

2017

2017 Twenty-Third National Conference on Communications (NCC)

View full text Add to dashboard Cite

Content delivery networks are a key infrastructure component used by Video on Demand (VoD) services to deliver content over the Internet. We study a content delivery system consisting of a central server and multiple co-located caches, each with limited storage and service capabilities. This work evaluates the performance of such a system as a function of the storage capacity of the caches, the content replication strategy, and the service policy. This analysis can be used for a system-level optimization of these design choices.The focus of this work is on understanding the benefits of allowing caches to pool their resources to serve user requests. We show that the benefits of resource pooling depend on the popularity profile of the contents offered by the VoD service. More specifically, if the popularity does not vary drastically across contents, resource pooling can lead to significant improvements in the system performance. In contrast, if the content popularity is uneven, the benefits of resource pooling are negligible.

show abstract

“…Finding the optimal discipline of queuing [7] is of great importance, as it maximizes revenue from servicing requests of military medical institutions [8].…”

Section: Description Of the Queuing Systemmentioning

confidence: 99%

Modelling of accounting information system for military medical institutions

Milojević¹,

Andzic²,

Ignjatijevic³

2016

Vojno delo

View full text Add to dashboard Cite

he complexity of the accounting system as the subsystem of management information system requires the continuous arrival of different types of data in different intervals which leads to an increase in complexity during its processing and presentation to management. Promoting the work and operations of military medical institutions requires the use of just such modern accounting information systems. Methods -Queuing system is used in this paper as the basis for positioning of information which needs to be processed within the accounting process, by adhering to certain limitations which are imposed by the specificity of the military medical system which is established. Conclusion -Basis of this information system is comprised of three subsystems, which are financial accounting, managerial accounting and cost accounting. Conditioning processing of data in the accounting process, adhering to accounting principles, primarily the principle of realization, it is very significant that this system supports information which is objectified in the form of accounting documents, so it can be processed and given to its users u military medical institutions.

show abstract

Queueing system topologies with limited flexibility

Cited by 20 publications

References 23 publications

Queueing with redundant requests: exact analysis

Queueing with redundant requests: exact analysis

Resource pooling in large-scale content delivery systems

Modelling of accounting information system for military medical institutions

Contact Info

Product

Resources

About