We consider a single server queue in which multi-class customers arrive ac-cording to Poisson process and service times are exponentially distributed. The server works following a gate mechanism in which arriving customers do not en-ter service immediately and wait to form a batch. This batch of customers get service after the completion of service to the previous batch. We also assume that after the service time of all customers, a customer of one class may join the next batch to get the service of another or the same class. The number of customers in a batch, duration of service time to a batch and the probability for the busy period to end in ¯nite time are obtained. Elegant expressions are obtained when there are only two classes. These results are extended to multi-class customers in a varying environment. The connections between queues and branching processes is exploited to obtain these results. Numerical illustrations are presented.
목차
Abstract 1. Introduction 2. Multi-class queue 3. Duration of service time 4. References
보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Future Generation Communication and Networking
간기
격월간
pISSN
2233-7857
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking vol.2 no.2