Single Queueing Systems

Thomas G. Robertazzi
Additional contact information
Thomas G. Robertazzi: SUNY Stony Brook, Department of Electrical Engineering

Chapter Chapter 2 in Computer Networks and Systems, 2000, pp 19-100 from Springer

Abstract: Abstract In this chapter we will look at the case of the single queue. Even though chapters 3 and 4 will discuss networks of queues, it is probably safe to say that the majority of modeling work that has been done for queues has involved a single queue. One reason is that for any investigation into queueing theory the single queueing system is a natural starting point. Another reason is tractability: much more can easily be ascertained about single queues than about networks of queues.

Keywords: Service Time; Arrival Rate; Poisson Process; State Probability; Service Rate (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1164-8_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461211648

DOI: 10.1007/978-1-4612-1164-8_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().