Information Technology Reference
In-Depth Information
Fig. 7.
The framework of experimental platform
6.2
Description Performance
The description performance refers to the ability of a data structure to describe re-
sources. The non-slotted data structures can accurately describe the relationship be-
tween resources and time, while the slotted data structures can't.
A timeslot is the smallest unit to allocate resources. It is a fixed time period and the
timeslot array cannot accurately represent moments smaller than it. In other words,
the method based on timeslots cannot start and stop at any time it like, while it can
only do it at some timeslots. Dividing the time into slots will lead to fragmentation
and the reduction of available bandwidth [4].
This is the inherent defect of slotted data structures. To define a reasonable slot is
very difficult. Long slots will reduce the accuracy and waste bandwidth, and short
slots will waste time and storage space. Therefore, the size of time slots closely de-
pends on the characters of reservation requests.
In our experimental environment, one second is chosen as the timeslot unit and the
array length (LEN) is 1000. The elements of the array will be reused. So the timeslot
array can describe the resources accurately, reduce bandwidth waste and avoid time-
out thus working better.
6.3
Processing Performance
Analysis.
The processing performance means the speed to convert reservation requests and
insert them into the data structure. The processing algorithms of the timeslot array is
to deal with the array elements involved in turn and its time complexity is
O(td)
. The
processing algorithms of the resource clue tree consist of one search procedure and
the following linear processing and its time complexity is
O(logn)+O(m)
. The para-
meter
n
is the number of nodes in the tree and
m
is the number of nodes in
