IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v281y2016icp39-54.html
   My bibliography  Save this article

Analysis of the scheduling mechanism for virtualization of links with partial isolation

Author

Listed:
  • Chydzinski, Andrzej

Abstract

The paper deals with the scheduler for virtualization of links with the partial performance isolation between the virtual links, meaning that the traffic on one virtual link may influence the performance of other virtual links only up to limited extent – every virtual link has guaranteed performance even in the worst case scenario. In this paper the analysis of the scheduler is carried out using the polling model of time-limited type. In particular, the queue size distribution and throughput of both privileged and normal virtual links are obtained.

Suggested Citation

  • Chydzinski, Andrzej, 2016. "Analysis of the scheduling mechanism for virtualization of links with partial isolation," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 39-54.
    • Handle: RePEc:eee:apmaco:v:281:y:2016:i:c:p:39-54
    DOI: 10.1016/j.amc.2016.01.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316300479
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.01.047?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leonard Kleinrock & Hanoch Levy, 1988. "The Analysis of Random Polling Systems," Operations Research, INFORMS, vol. 36(5), pages 716-732, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    3. Germs, Remco & Van Foreest, Nicky D., 2011. "Admission policies for the customized stochastic lot scheduling problem with strict due-dates," European Journal of Operational Research, Elsevier, vol. 213(2), pages 375-383, September.
    4. Tetsuji Hirayama, 2012. "Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms," Annals of Operations Research, Springer, vol. 198(1), pages 83-123, September.
    5. Jelmer P. Gaast & Ivo J. B. F. Adan & René B. M. Koster, 2017. "The analysis of batch sojourn-times in polling systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 313-335, April.
    6. Dieter Fiems & Eitan Altman, 2012. "Gated polling with stationary ergodic walking times, Markovian routing and random feedback," Annals of Operations Research, Springer, vol. 198(1), pages 145-164, September.
    7. Christos Langaris, 1999. "Markovian polling systems with mixed service disciplines and retrial customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 305-322, December.
    8. Mahender P. Singh & Mandyam M. Srinivasan, 2007. "Performance Bounds for Flexible Systems Requiring Setups," Management Science, INFORMS, vol. 53(6), pages 991-1004, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:281:y:2016:i:c:p:39-54. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.