Scribd
Upload
11 views10 pages

Event Scheduling Simulation Techniques

The document discusses the Event Scheduling Time Advance Algorithm, focusing on exogenous events such as arrivals in a queueing system and how they are scheduled using a Future Event List (FEL). It introduces the concept of bootstrapping for generating external arrival streams and explains how service completion events are scheduled. The overall emphasis is on how events impact the system state in simulations.

Uploaded by

homeimran0335
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views10 pages

Event Scheduling Simulation Techniques

The document discusses the Event Scheduling Time Advance Algorithm, focusing on exogenous events such as arrivals in a queueing system and how they are scheduled using a Future Event List (FEL). It introduces the concept of bootstrapping for generating external arrival streams and explains how service completion events are scheduled. The overall emphasis is on how events impact the system state in simulations.

Uploaded by

homeimran0335
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Modeling and Simulation

The Event Scheduling


Time Advance Algorithm-
III

1
Exoge­nous Events

– If t = O, then the
state (5, I, 6) might
represent the initial
number of customers
at three different
points in the system
– An Exogenous Event
is a happening
"outside the system"
that impinges on the
system

2
Exoge­nous Events

• An important example
is an arrival to a
queueing system
• At time 0, the first
arrival event is
generated and is
scheduled on the FEL
(mean­ing that its
event notice is placed
on the FEL).
• The interarrival time
is an example of an
activity
3
Exoge­nous Events

• When the clock


eventually is advanced
to the time of this first
arrival, a second arrival
event is generated.
First, an interarrival
time is generated, a*;
• It is added to the
current time, CLOCK= t;
the resulting (future)
event time, t +a* = t*,
is used to position the
new arrival event
notice on the FEL 4
Bootstrapping

• This method of
generating an
external arrival
stream is called
bootstrapping ; it
provides one
example of how
future events are
generated in step 4
of the event­
scheduling time-
advance algorithm.

5
The Event Scheduling Time Advance Algorithm II

• The method of
generating an
external arrival
stream is called
bootstrapping
• Bootstrapping is
illustrated in Figure
given. The first three
interarrival times
generated are 3.7,
0.4, and 3.3 time
units.

6
Bootstrapping

• The end of an
interarrival interval is
an example of a
primary event.
• A second example of
how future events
are generated is
provided by a service
completion event in
a queueing
simulation

7
Service Completion

• When one
customer
completes service,
at current time
CLOCK= t, if the
next customer is
present, then a
new service time,
s*, will be
generated for the
next customer.

8
Service Completion

• The next Service


completion event
will be scheduled to
occur at future time
t* = t + s*, by
placing onto the FEL
a new event notice,
of type service
completion, with
event time t*

9
Summary

• To summarize the
discussion, when using
the Event-scheduling
Approach, a simulation
analyst concentrates on
events and their effect
on system state

10

You might also like