Partial Server Pooling in Redundancy Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Partial Server Pooling in Redundancy Systems

(1) , (1) , (1) , (2)
1
2

Abstract

Partial sharing allows providers to possibly pool a fraction of their resources when full pooling is not beneficial to them. Recent work in systems without sharing has shown that redundancy can improve performance considerably. In this paper, we combine partial sharing and redundancy by developing partial sharing models for providers operating multi-server systems with redundancy. Two M/M/N queues with redundant service models are considered. Copies of an arriving job are placed in the queues of servers that can serve the job. Partial sharing models for cancel-on-complete and cancel-on-start redundancy models are developed. For cancel-on-complete, it is shown that the Pareto efficient region is the full pooling configuration. For a cancel-on-start policy, we conjecture that the Pareto frontier is always non-empty and is such that at least one of the two providers is sharing all of its resources. For this system, using bargaining theory the sharing configuration that the providers may use is determined. Mean response time and probability of waiting are the performance metrics considered.

Dates and versions

hal-02390451 , version 1 (03-12-2019)

Identifiers

Cite

Akshay Mete, D. Manjunath, Jayakrishnan Nair, Balakrishna Prabhu. Partial Server Pooling in Redundancy Systems. 2019 31st International Teletraffic Congress (ITC 31), Aug 2019, Budapest, Hungary. pp.106-114, ⟨10.1109/ITC31.2019.00024⟩. ⟨hal-02390451⟩
19 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More