Modeling and Analysis Using Computational Tools

PDF Version Also Available for Download.

Description

This book chapter presents two special algorithms, Mean Value Analysis and Convolution Algorithm, for the analysis of closed queuing networks, and an introduction to simulation techniques that are widely used in analyzing queuing systems in general.

Physical Description

26 p.

Creation Information

Akl, Robert G. & Kavi, Krishna M. 2007.

Context

This chapter is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 285 times , with 12 in the last month . More information about this chapter can be viewed below.

Who

People and organizations associated with either the creation of this chapter or its content.

Authors

Publisher

Provided By

UNT College of Engineering

The UNT College of Engineering promotes intellectual and scholarly pursuits in the areas of computer science and engineering, preparing innovative leaders in a variety of disciplines. The UNT College of Engineering encourages faculty and students to pursue interdisciplinary research among numerous subjects of study including databases, numerical analysis, game programming, and computer systems architecture.

Contact Us

What

Descriptive information to help identify this chapter. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

This book chapter presents two special algorithms, Mean Value Analysis and Convolution Algorithm, for the analysis of closed queuing networks, and an introduction to simulation techniques that are widely used in analyzing queuing systems in general.

Physical Description

26 p.

Notes

Abstract: This book chapter presents two special algorithms, Mean Value Analysis and Convolution Algorithm, for the analysis of closed queuing networks, and an introduction to simulation techniques that are widely used in analyzing queuing systems in general. In the illustration of special algorithms, the authors use simplifying assumptions that also show how they provide practical solutions to systems that are interactable or when their behaviors cannot be easily modeled using simple probability distributions.

Source

  • Introduction to Queuing Theory: Modeling and Analysis, 2007. Cambridge: Birkhäuser Boston, pp. 295-320.

Language

Item Type

Identifier

Unique identifying numbers for this chapter in the Digital Library or other systems.

Collections

This chapter is part of the following collection of related materials.

UNT Scholarly Works

Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.

What responsibilities do I have when using this chapter?

When

Dates and time periods associated with this chapter.

Creation Date

  • 2007

Added to The UNT Digital Library

  • Jan. 24, 2011, 2:10 p.m.

Description Last Updated

  • April 28, 2014, 1:58 p.m.

Usage Statistics

When was this chapter last used?

Yesterday: 0
Past 30 days: 12
Total Uses: 285

Interact With This Chapter

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Akl, Robert G. & Kavi, Krishna M. Modeling and Analysis Using Computational Tools, chapter, 2007; [Cambridge, Massachusetts]. (digital.library.unt.edu/ark:/67531/metadc30841/: accessed June 26, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.