# AiS Challenge Team Interim

Team Number: 077

School Name: Santa Fe High School

Area of Science: Computer Science

Project Title: The Programming of the Queuing Theorem

PROBLEM DEFINITION:
Modern day economics and businesses have developed well beyond expectation in the past. Today it seems the slightest mistake can cost millions of dollars. In our rapid paced society, time is money. Customers standing in line restrict the time of flow of money and increases customer frustration levels. The result is less business for the company.

Aware of this problem we undertook the project of creating a computer program based on the queuing theory. The queuing theory in short is basically the coming and going of waiting lines. Cars waiting at a stoplight or customers being served at a cash register are great examples. We will write a program that models movement of random queues. We will increase the factors affecting the queue to enhance the original program.

PROBLEM SOLUTION:
We are going to take a current queuing math model and develop it into a program using C++ programming. The program will have an internal clock and random number generator to create to model an actual queue. We will run the program for a certain amount of time then take the results and plot it out. When the program gets advanced enough we could compare to actual queuing data and one day run real life queuing problems.

PROGRESS TO DATE:
So far we have a program that is a single-channel queue in progress and are working out some of the math problems. We hope to expand on this project to handle multi-channel queues. We plan on doing this by making much of the interior of the main loop into a procedure and calling it multiple times with different head and tail pointers. The head and tail pointers are two variables that will point to the first and last queue entry. The head points to the first queue entry and once that one is finished being served it will take the value of that entry's next member. As for the tail will point to the last queue entry and when a new queue entry arrives. The memory is then allocated by the new operator and its address is assigned to the current tail's next member, and then the value of the tail is also changed to that address.

EXPECTED RESULTS:
When the program is complete, we expect this program to run accurately, efficiently, and be able to handle multiply queues at once. If we continue this project we may adapt the programs to meet specific purposes rather than general ones. One day we hope for this program to be used commercially or as a managing tool.

BIBLIOGRAPH:
Shalgi, Ran, etc. "Queuing Theory Project" 20 Sept. 2001.

White Steve. Personal Interview on programming the math model. Santa Fe, New Mexico. 15 Nov. 2001.

Hlynka, Myron. "Myron Hlynka's Queuing Theory Page." 12 Oct. 2001.

Killough, Lee. "Priority Queues" 12 Oct. 2001.

Team Members

Team Mail