Waiting times when service times are stable laws : tamed and wild
Bookreader Item Preview
Share or Embed This Item
texts
Waiting times when service times are stable laws : tamed and wild
- Publication date
- 1996-08
- Publisher
- Monterey, California : Naval Postgraduate School
- Collection
- navalpostgraduateschoollibrary; fedlink; americana
- Contributor
- Naval Postgraduate School, Dudley Knox Library
- Language
- en_US
Cover title
"NPS-OR-96-009."
"August 1996."
AD A315 665
Includes bibliographical references (p. 14)
Modern telecommunication systems must accommodate tasks or messages of extremely variable time duration. Understanding of that variability, and appropriate stochastic models are needed to describe the resulting queues or buffer contents. To this end, consider an M/G/1 queue with service times having a positive stable law distribution. Such service times are extremely long (and short) tailed, and thus do not have finite first and second moments; classical queue-theoretic results do not apply directly. Here we suggest two procedures for initially taming stable laws, i.e. so that they possess finite mean and variance. We apply the tamed laws to calculate certain familiar queuing properties, such as the transform of the stationary distribution of the long-run virtual waiting time and mean thereof. We show that, by norming or scaling traffic intensity, waiting times, and other measures of congestion, we can obtain bona fide limiting distributions as the underlying service times become untamed, i.e. return to the wild. Simulations support the theory
aq/aq cc:9116 01/22/97
"NPS-OR-96-009."
"August 1996."
AD A315 665
Includes bibliographical references (p. 14)
Modern telecommunication systems must accommodate tasks or messages of extremely variable time duration. Understanding of that variability, and appropriate stochastic models are needed to describe the resulting queues or buffer contents. To this end, consider an M/G/1 queue with service times having a positive stable law distribution. Such service times are extremely long (and short) tailed, and thus do not have finite first and second moments; classical queue-theoretic results do not apply directly. Here we suggest two procedures for initially taming stable laws, i.e. so that they possess finite mean and variance. We apply the tamed laws to calculate certain familiar queuing properties, such as the transform of the stationary distribution of the long-run virtual waiting time and mean thereof. We show that, by norming or scaling traffic intensity, waiting times, and other measures of congestion, we can obtain bona fide limiting distributions as the underlying service times become untamed, i.e. return to the wild. Simulations support the theory
aq/aq cc:9116 01/22/97
Notes
some content may be lost due to the binding of the book.
- Addeddate
- 2013-01-16 18:37:58
- Associated-names
- Jacobs, Patricia A; Naval Postgraduate School (U.S.). Dept. of Operations Research
- Call number
- a181267
- Camera
- Canon EOS 5D Mark II
- Contributor_corporate
- Naval Postgraduate School (U.S.). Dept. of Operations Research.
- External-identifier
-
urn:handle:10945/30283
urn:oclc:record:1102152181
- Foldoutcount
- 0
- Format_extent
- 28 p. : ill. ; 28 cm.
- Identifier
- waitingtimeswhen00gave
- Identifier-ark
- ark:/13960/t6d237w5z
- Identifier_npsreport
- NPS-OR-96-009
- Identifier_oclc
- a181267
- Ocr_converted
- abbyy-to-hocr 1.1.37
- Ocr_module_version
- 0.0.21
- Openlibrary_edition
- OL25496560M
- Openlibrary_work
- OL16873857W
- Page-progression
- lr
- Page_number_confidence
- 63
- Page_number_module_version
- 1.0.3
- Pages
- 40
- Ppi
- 350
- Republisher_date
- 20130117160520
- Republisher_operator
- associate-karina-martinez@archive.org
- Scandate
- 20130116185105
- Scanner
- scribe14.sanfrancisco.archive.org
- Scanningcenter
- sanfrancisco
- Type
- Technical Report
- Full catalog record
- MARCXML
comment
Reviews
There are no reviews yet. Be the first one to
write a review.
355 Views
DOWNLOAD OPTIONS
For users with print-disabilities
IN COLLECTIONS
Naval Postgraduate School FEDLINK - United States Federal Collection American LibrariesUploaded by Jacob-QA on