Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/375246
Title: Performance Analysis of Some Queueing Models
Researcher: Kumar, Jitendra
Guide(s): Shinde, Vikas
Keywords: Engineering
Engineering and Technology
Engineering Multidisciplinary
University: Rajiv Gandhi Proudyogiki Vishwavidyalaya
Completed Date: 2019
Abstract: In this thesis, we have developed an industrial model for textile industry with five-input,five-stage queueing network, wherein system receives order from clients that are waiting to be served. The aim of this paper is to compute the optimal path that will provide the least response newlinetime for delivery of items to the final destination, through the five stages under queueing network. The mean number of items that can be delivered is minimum response time constitute newlinethe optimal capacity of the network. The last node in each stage of the network can be executed in the least possible response time. Various performance indices were carried out such as mean number of item in the system, mean number of item in queue, mean response time, mean waiting time. We have established the equivalent queueing network to analyze the various performance measures with numerical illustration and graph and also, we proposed single server queueing model using supply chain system. We presented network model for companies which fulfill the newlinedesirer demand of row material. The aim of this paper is to compute the optimal path. Which will provide the service in minimum time for delivery of product, various performance measures have been evaluated such as the mean number of order in the system, and the average time of order spends in the system, the average waiting time and the minimum average number of order in the waiting queue. We have also obtained numerical illustration and expected cost effective function. In third chapter, we study a mathematical model for new and handoff calls with blocking under queueing system. The aim of this paper is to assign the available channel effectively to call newlineadmission control scheme, which is classified in three categories priority, non-priority and subrating. We develop an algorithm for evaluating the blocking probability for new and handoff calls. The proposed algorithm is analyzed the effectiveness of call admission control policy.Numerical illustrations have been validated our results. newline
Pagination: 20.5MB
URI: http://hdl.handle.net/10603/375246
Appears in Departments:Department of Applied Mathematics

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File187.36 kBAdobe PDFView/Open
02_declaration.pdf655.27 kBAdobe PDFView/Open
03_certificate.pdf655.27 kBAdobe PDFView/Open
04_acknowledgement.pdf355.95 kBAdobe PDFView/Open
05_contents.pdf524.31 kBAdobe PDFView/Open
06_list o figures.pdf524.41 kBAdobe PDFView/Open
06_list of tables.pdf524.42 kBAdobe PDFView/Open
07_chapter 01.pdf825.3 kBAdobe PDFView/Open
08_chapter 2 a.pdf2.12 MBAdobe PDFView/Open
08_chapter 2b.pdf1.23 MBAdobe PDFView/Open
09_chapter 3.pdf1.05 MBAdobe PDFView/Open
10_chaper-7 c.pdf363.77 kBAdobe PDFView/Open
10_chapter 4 a.pdf902.23 kBAdobe PDFView/Open
10_chapter 4 b.pdf701.63 kBAdobe PDFView/Open
10_chapter 5 a.pdf7.14 MBAdobe PDFView/Open
10_chapter 6 b.pdf1.42 MBAdobe PDFView/Open
10_chapter 8 d.pdf430.76 kBAdobe PDFView/Open
11_bibliography.pdf653.88 kBAdobe PDFView/Open
80_recommendation.pdf83.13 kBAdobe PDFView/Open
abtract.pdf275.96 kBAdobe PDFView/Open
preliminary page.pdf187.36 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: