An infinite phase-size BMAP/M/1 queue and its application to secure group communication

Hiroshi Toyoizumi*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We derive the bounds of the mean queue length of an infinite phase size BMAP/M/1 queue which has an M/M/∞-type phase transition, and use them to evaluate the performance of secure group communication. Secure communication inside a groups on an open network is critical to enhance the internet capability. Extending the usual matrix analysis to the operator analysis, we derive a new estimation of the degradation of secure group communication model.

Original languageEnglish
Title of host publicationSECRYPT 2006 - International Conference on Security and Cryptography, Proceedings
Pages283-288
Number of pages6
Publication statusPublished - 2006 Dec 1
EventInternational Conference on Security and Cryptography, SECRYPT 2006 - Setubal, Portugal
Duration: 2006 Aug 72006 Aug 10

Publication series

NameSECRYPT 2006 - International Conference on Security and Cryptography, Proceedings

Conference

ConferenceInternational Conference on Security and Cryptography, SECRYPT 2006
Country/TerritoryPortugal
CitySetubal
Period06/8/706/8/10

Keywords

  • Markovian arrival process
  • Performance evaluation
  • Queue
  • Rekeying
  • Secure group communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'An infinite phase-size BMAP/M/1 queue and its application to secure group communication'. Together they form a unique fingerprint.

Cite this