Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Theses
      • Masters Degree Theses
      • View Item
      •   Research Commons
      • University of Waikato Theses
      • Masters Degree Theses
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Systems of queues parallel, series and network queueing systems with applications to communications and computing

      Camden, Mike D.
      Thumbnail
      Files
      thesis.pdf
      35.54Mb
      Citation
      Export citation
      Camden, M. D. (1972). Systems of queues parallel, series and network queueing systems with applications to communications and computing (Thesis, Master of Science). University of Waikato, Hamilton, New Zealand. Retrieved from https://hdl.handle.net/10289/10076
      Permanent Research Commons link: https://hdl.handle.net/10289/10076
      Abstract
      The need for understanding of various real-life queueing situations has caused the theory of queues to grow in various directions. One of these directions treats the class of systems where more than one service is available to, or required by, each customer, The theory for this class has progressed along a central path from which various developments branch. Multichannel poisson queues constitute the first part of the path; series and then networks of poisson stations follow. The branches from the path involve models with non-poisson or general assumptions, models with limited waiting room or limited numbers of customers, models with nonzero transit times, and others. The path leads to models for communication networks, and hence to models for computer networks. The theory of computer timesharing branches from the beginning of the path.

      The dissertation attempts to outline the present state of the theory for those models which occur on this path or its branches. The derivation of probability distributions for queue length and waiting time are presented in full for models on the central path, and in brief for the other models.
      Date
      1972
      Type
      Thesis
      Degree Name
      Master of Science (MSc)
      Publisher
      University of Waikato
      Rights
      All items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated.
      Collections
      • Masters Degree Theses [2385]
      Show full item record  

      Usage

      Downloads, last 12 months
      75
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement