Routing Strategy of a Prioritized Limited Multi-Server Processor-Sharing System

Yoshiaki Shikata, Nobutane Hanayama

2014

Abstract

In this work, routing strategies of an arriving request to a server in a prioritized limited multi-server processor-sharing (PS) system are studied in order to optimize a given performance criterion. In this system, an arriving request enters the dispatcher, which routes this request to each server according to a predetermined strategy. In the prioritized limited PS server, a high-priority request is allocated a service ratio that is m (called the priority ratio) times greater than that of a low-priority request. Moreover, the sum of the number of the requests receiving service is restricted to a fixed value. The arriving request which cannot receive service will be queued (waiting system) or rejected (loss system). In this server, at the arrival (or departure) of a request, the extension (or shortening) of the remaining sojourn time of each request that is receiving service can be calculated using the number of requests and priority ratio. Employing a simulation program to execute these events and calculations enables us to analyze the performance of this system, such as the loss probability, mean sojourn time, and mean waiting time. Based on the evaluation results, the most suitable routing strategy for the loss or waiting system is clarified.

References

  1. L. Kleinrock, "Time-Shared Systems: A Theoretical Treatment", J.A.C.M Vol.1, No.14, 242-261 (1967).
  2. G.Fayolle and I.Mitrani, “Sharing a Processor Among many Job Classes”, J.A.C.M Vol.27, No.3, July 1980. Pp519-532
  3. E.Altman, K.Avrachenkov and U.Ayesta, “A survey on processor sharing”, Queueing Syst (2006) 53:53-63
  4. M.Haviv and J.Val, “Mean sojourn times for phase-type discriminatory processor sharing system”, European Journal of Operational research, 189(2008), 375-386
  5. G. Yamazaki and H. Sakasegawa, “An optimal design problem for limited sharing systems”, Management Science, vol.33(8), pp.1010--1019 (1987).
  6. Y.Shikata, W.Katagiri, and Y.Takahashi, “Prioritized Limited Processor-Sharing System with its Performance Analysis”, International Conference on Operations Research, August30 - 1, 2011 Zurich.
  7. H.L. Chen, J. Marden, and A. Wierman, “The effect of local scheduling in load balancing designs”, In Proceedings of IEEE INFOCOM, 2009.
  8. V. Gupta, M. Harchol-Balter, K. Sigman, and W. Whitt, “Analysis of join-the-shortest-queue routing for web server farms”, In Proceedings of Performance, page 180, 2007.
  9. E. Altman1, U. Ayesta, and B.J. Prabhu, “Load Balancing in Processor Sharing Systems”, Telecommunication Systems, June 2011, Volume 47, Issue 1-2, pp 35-48.
  10. M. Haviv and T. Roughgarden. “The price of anarchy in an exponential multi-server”, Operations Research Letters, 35:421-426, 2007.
  11. H. Kameda, E. Altman, O. Pourtallier, J. Li, and Y. Hosokawa. “Paradoxes in performance optimization of distributed systems”, In Proceedings of SSGRR 2000 Computer and ebusiness conference, 2000.
  12. D. Starobinski and T. Wu. “Performance of server s election algorithms for content replication networks”, In IFIP Networking, 2005.
Download


Paper Citation


in Harvard Style

Shikata Y. and Hanayama N. (2014). Routing Strategy of a Prioritized Limited Multi-Server Processor-Sharing System . In Proceedings of the 5th International Conference on Data Communication Networking - Volume 1: DCNET, (ICETE 2014) ISBN 978-989-758-042-0, pages 5-12. DOI: 10.5220/0004998900050012


in Bibtex Style

@conference{dcnet14,
author={Yoshiaki Shikata and Nobutane Hanayama},
title={Routing Strategy of a Prioritized Limited Multi-Server Processor-Sharing System},
booktitle={Proceedings of the 5th International Conference on Data Communication Networking - Volume 1: DCNET, (ICETE 2014)},
year={2014},
pages={5-12},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004998900050012},
isbn={978-989-758-042-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Data Communication Networking - Volume 1: DCNET, (ICETE 2014)
TI - Routing Strategy of a Prioritized Limited Multi-Server Processor-Sharing System
SN - 978-989-758-042-0
AU - Shikata Y.
AU - Hanayama N.
PY - 2014
SP - 5
EP - 12
DO - 10.5220/0004998900050012