Skip to main content

2016 | OriginalPaper | Buchkapitel

Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals

verfasst von : Konstantin Samouylov, Eduard Sopin, Irina Gudkova

Erschienen in: Distributed Computer and Communication Networks

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Processor sharing (PS) queuing systems are widely investigated by research community and applied for the analysis of wire and wireless communication systems and networks. Nevertheless, only few works focus on finite queues with both PS discipline and service interruptions. In the paper, compared with the previous results we analyze a finite capacity PS queuing system with Markovian arrival process, unreliable server, service interruptions, and an upper limit of the number of customers it serves simultaneously. For calculating the mean sojourn time, unlike a popular but computational complex technique of inverse Laplace transform we use an effective method based on embedded Markov chain. A practical example concludes the paper.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Fredj, S.B., Bonald, T., Proutiere, A., Regnie, G., Roberts, J.W.: Statistical bandwidth sharing: a study of congestion at flow level. In: ACM SIGCOMM 2001, pp. 111–122 Fredj, S.B., Bonald, T., Proutiere, A., Regnie, G., Roberts, J.W.: Statistical bandwidth sharing: a study of congestion at flow level. In: ACM SIGCOMM 2001, pp. 111–122
2.
Zurück zum Zitat Kleinrock, L.: Time-shared systems: a theoretical treatment. J. ACM 14, 242–261 Kleinrock, L.: Time-shared systems: a theoretical treatment. J. ACM 14, 242–261
3.
Zurück zum Zitat Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote Control 68, 1662–1731 Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote Control 68, 1662–1731
4.
Zurück zum Zitat Morrison, J.A.: Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45, 152–167 Morrison, J.A.: Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45, 152–167
5.
Zurück zum Zitat Knessl, C.: On finite capacity processor-shared queues. SIAM J. Appl. Math. 50, 264–287 Knessl, C.: On finite capacity processor-shared queues. SIAM J. Appl. Math. 50, 264–287
6.
Zurück zum Zitat Zhen, Q., Knessl, C.: On sojourn times in the finite capacity M/M/1 queue with processor sharing. Oper. Res. Lett. 37, 447–450 Zhen, Q., Knessl, C.: On sojourn times in the finite capacity M/M/1 queue with processor sharing. Oper. Res. Lett. 37, 447–450
7.
Zurück zum Zitat Rege, K., Sengupta, B.: Sojourn time distribution in a multiprogrammed computer system. AT&T Tech. J. 64, 1077–1090 Rege, K., Sengupta, B.: Sojourn time distribution in a multiprogrammed computer system. AT&T Tech. J. 64, 1077–1090
8.
Zurück zum Zitat Masuyama, H., Takine, T.: Sojourn time distribution in a MAP/M/1 processor-sharing queue. Oper. Res. Lett. 31, 406–412 Masuyama, H., Takine, T.: Sojourn time distribution in a MAP/M/1 processor-sharing queue. Oper. Res. Lett. 31, 406–412
9.
Zurück zum Zitat Nunez-Queija, R.: Sojourn times in non-homogeneous QBD processes with processor-sharing. Stoch. Models 17, 61–92 Nunez-Queija, R.: Sojourn times in non-homogeneous QBD processes with processor-sharing. Stoch. Models 17, 61–92
10.
Zurück zum Zitat Zhen, Q., Knessl, C.: Asymptotic analysis of spectral properties of finite capacity processor shared queues. Stud. Appl. Math. 131, 179–210 Zhen, Q., Knessl, C.: Asymptotic analysis of spectral properties of finite capacity processor shared queues. Stud. Appl. Math. 131, 179–210
11.
Zurück zum Zitat Samouylov, K., Gudkova, I.: Recursive computation for a multi-rate model with elastic traffic and minimum rate guarantees. In: 2nd International Congress on Ultra Modern Telecommunications and Control Systems ICUMT, pp. 1065–1072 Samouylov, K., Gudkova, I.: Recursive computation for a multi-rate model with elastic traffic and minimum rate guarantees. In: 2nd International Congress on Ultra Modern Telecommunications and Control Systems ICUMT, pp. 1065–1072
12.
Zurück zum Zitat Basharin, G.P., Naumov, V.A.: Simple matrix description of peaked and smooth traffic and its applications. In: Proceedings of the 3rd International Seminar on Teletraffic Theory “Fundamentals of Teletraffic Theory”, Moscow, VINITI, pp. 38–44 Basharin, G.P., Naumov, V.A.: Simple matrix description of peaked and smooth traffic and its applications. In: Proceedings of the 3rd International Seminar on Teletraffic Theory “Fundamentals of Teletraffic Theory”, Moscow, VINITI, pp. 38–44
13.
Zurück zum Zitat Lucantoni, D.M., Meier-Hellstern, K.S., Neuts, M.F.: A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Probab. 22, 676–705 Lucantoni, D.M., Meier-Hellstern, K.S., Neuts, M.F.: A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Probab. 22, 676–705
14.
Zurück zum Zitat Asmussen, S.: Applied Probability and Queues, vol. 51. Springer, New York (2003)MATH Asmussen, S.: Applied Probability and Queues, vol. 51. Springer, New York (2003)MATH
15.
Zurück zum Zitat Naumov, V.A., Samouylov, K.E., Gaidamaka, Y.V.: Multiplicative solutions for the finite Markov chains. RUDN Naumov, V.A., Samouylov, K.E., Gaidamaka, Y.V.: Multiplicative solutions for the finite Markov chains. RUDN
16.
Zurück zum Zitat Samouylov, K., Naumov, V., Sopin, E., Gudkova, I., Shorgin, S.: Sojourn time analysis for processor sharing loss system with unreliable server. In: Wittevrongel, S., Phung-Duc, T. (eds.) ASMTA 2016. LNCS, vol. 9845, pp. 284–297. Springer, Heidelberg (2016). doi:10.1007/978-3-319-43904-4_20 CrossRef Samouylov, K., Naumov, V., Sopin, E., Gudkova, I., Shorgin, S.: Sojourn time analysis for processor sharing loss system with unreliable server. In: Wittevrongel, S., Phung-Duc, T. (eds.) ASMTA 2016. LNCS, vol. 9845, pp. 284–297. Springer, Heidelberg (2016). doi:10.​1007/​978-3-319-43904-4_​20 CrossRef
Metadaten
Titel
Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals
verfasst von
Konstantin Samouylov
Eduard Sopin
Irina Gudkova
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-51917-3_36