simulate tollbooth station traffic in java with ds - open to bidding
$10-30 USD
Κλειστή
Αναρτήθηκε πάνω από 9 χρόνια πριν
$10-30 USD
Πληρωμή κατά την παράδοση
Write a program that will use queues to simulate tollbooth station traffic. Cars arrive at the toll station at an average
rate (probability). Each toll transaction will take a certain amount of time, according to a user-entered distribution.
As each car arrives it is placed in the queue. If the queue is filled to capacity, a second queue is opened and the queues
share the accumulated load. A newly arriving car will always go into the shortest queue, thereby acting as a natural
balancing method. Whenever all open queues are filled to capacity, a new queue is opened, and the entire load is
redistributed. Once a queue is open it is never closed. The object then is to find a minimum “correct” number of
queues that will maintain servicing incoming traffic without overloading any of the queues. Since probability is a
factor, we will assume that “one hour” of operation without any queue overload satisfies our objective.
I am very good at algorithms and I already had such problems resolved in the past. I can assure you that your project will look very good if I will do it. I know that I have no reviews,but that's because I am a new user on this site. We can even talk on skype about the project. Java is my favourite programming language,so this project suits like a glove. I am looking forward to work on this project.
Dear Sir/Madam,
My name is Leon Swinkels and I am a senior developer with almost 20 years of development experience. For the past 10 years I have been mostly active in Java developments and I have both a BSc and a MSc in Computer Science.
Your project is concise and clear. I would like to ask for some clarifications:
a. which distributions will be allowed for the incoming traffic? How are these scheduled?
b. for the time-duration of the tollbooth processing, which distributions will be allowed?
I would also assume that the queues follow each-other seamlessly, meaning that incoming 'cars' in a queue follow-each other fast enough that there is no noticeable delay between the departure of a processed car and the arrival of a new car.
Regards,
Leon Swinkels
Hi there, I am Noman Rafi from Pakistan, your neighbor. Your project sounds interesting to me and the reason it caught my eye is because I have done assignments and projects in my Algorithms course in java last semester, and I can easily do this project in very little time. Hope to hear from you!