Abstract: In wireless and mobile communications, this progress
provides opportunities for introducing new standards and improving
existing services. Supporting multimedia traffic with wireless networks
quality of service (QoS). In this paper, a grey-fuzzy controller for radio
resource management (GF-RRM) is presented to maximize the number
of the served calls and QoS provision in wireless networks. In a
wireless network, the call arrival rate, the call duration and the
communication overhead between the base stations and the control
center are vague and uncertain. In this paper, we develop a method to
predict the cell load and to solve the RRM problem based on the
GF-RRM, and support the present facility has been built on the
application-level of the wireless networks. The GF-RRM exhibits the
better adaptability, fault-tolerant capability and performance than other
algorithms. Through simulations, we evaluate the blocking rate, update
overhead, and channel acquisition delay time of the proposed method.
The results demonstrate our algorithm has the lower blocking rate, less
updated overhead, and shorter channel acquisition delay.
Abstract: In this paper, an attempt is made to compute the total
optimal cost of interdependent queuing system with controllable
arrival rates as an important performance measure of the system. An
example of application has also been presented to exhibit the use of
the model. Finally, numerical demonstration based on a computing
algorithm and variational effects of the model with the help of the
graph have also been presented.
Abstract: A modified Saleh-Valenzuela channel model has been
adapted for Ultra Wideband (UWB) system. The suggested realistic
channel is assessed by its distribution of fading amplitude and time of
arrivals. Furthermore, the propagation characteristic has been distinct
into four channel models, namely CM 1 to 4. Each are differentiate in
terms of cluster arrival rates, rays arrival rate within each cluster and
its respective constant decay rates. This paper described the
multiband OFDM system performance simulates under these
multipath conditions. Simulation work described in this paper is
based on WiMedia ECMA-368 standard, which has been deployed
for practical implementation of low cost and low power UWB
devices.
Abstract: In this paper, we use an M/G/C/C state dependent
queuing model within a complex network topology to determine the
different performance measures for pedestrian traffic flow. The
occupants in this network topology need to go through some source
corridors, from which they can choose their suitable exiting
corridors. The performance measures were calculated using arrival
rates that maximize the throughputs of source corridors. In order to
increase the throughput of the network, the result indicates that the
flow direction of pedestrian through the corridors has to be restricted
and the arrival rates to the source corridor need to be controlled.
Abstract: Continuously growing needs for Internet applications
that transmit massive amount of data have led to the emergence of
high speed network. Data transfer must take place without any
congestion and hence feedback parameters must be transferred from
the receiver end to the sender end so as to restrict the sending rate in
order to avoid congestion. Even though TCP tries to avoid
congestion by restricting the sending rate and window size, it never
announces the sender about the capacity of the data to be sent and
also it reduces the window size by half at the time of congestion
therefore resulting in the decrease of throughput, low utilization of
the bandwidth and maximum delay. In this paper, XCP protocol is
used and feedback parameters are calculated based on arrival rate,
service rate, traffic rate and queue size and hence the receiver
informs the sender about the throughput, capacity of the data to be
sent and window size adjustment, resulting in no drastic decrease in
window size, better increase in sending rate because of which there is
a continuous flow of data without congestion. Therefore as a result of
this, there is a maximum increase in throughput, high utilization of
the bandwidth and minimum delay. The result of the proposed work
is presented as a graph based on throughput, delay and window size.
Thus in this paper, XCP protocol is well illustrated and the various
parameters are thoroughly analyzed and adequately presented.
Abstract: Whereas cellular wireless communication systems are
subject to short-and long-term fading. The effect of wireless channel
has largely been ignored in most of the teletraffic assessment
researches. In this paper, a mathematical teletraffic model is proposed
to estimate blocking and forced termination probabilities of cellular
wireless networks as a result of teletraffic behavior as well as the
outage of the propagation channel. To evaluate the proposed
teletraffic model, gamma inter-arrival and general service time
distributions have been considered based on wireless channel fading
effect. The performance is evaluated and compared with the classical
model. The proposed model is dedicated and investigated in different
operational conditions. These conditions will consider not only the
arrival rate process, but also, the different faded channels models.
Abstract: A real time distributed computing has
heterogeneously networked computers to solve a single problem. So
coordination of activities among computers is a complex task and
deadlines make more complex. The performances depend on many
factors such as traffic workloads, database system architecture,
underlying processors, disks speeds, etc. Simulation study have been
performed to analyze the performance under different transaction
scheduling: different workloads, arrival rate, priority policies,
altering slack factors and Preemptive Policy. The performance metric
of the experiments is missed percent that is the percentage of
transaction that the system is unable to complete. The throughput of
the system is depends on the arrival rate of transaction. The
performance can be enhanced with altering the slack factor value.
Working on slack value for the transaction can helps to avoid some
of transactions from killing or aborts. Under the Preemptive Policy,
many extra executions of new transactions can be carried out.
Abstract: The increasing importance of data stream arising in a
wide range of advanced applications has led to the extensive study of
mining frequent patterns. Mining data streams poses many new
challenges amongst which are the one-scan nature, the unbounded
memory requirement and the high arrival rate of data streams. In this
paper, we propose a new approach for mining itemsets on data
stream. Our approach SFIDS has been developed based on FIDS
algorithm. The main attempts were to keep some advantages of the
previous approach and resolve some of its drawbacks, and
consequently to improve run time and memory consumption. Our
approach has the following advantages: using a data structure similar
to lattice for keeping frequent itemsets, separating regions from each
other with deleting common nodes that results in a decrease in search
space, memory consumption and run time; and Finally, considering
CPU constraint, with increasing arrival rate of data that result in
overloading system, SFIDS automatically detect this situation and
discard some of unprocessing data. We guarantee that error of results
is bounded to user pre-specified threshold, based on a probability
technique. Final results show that SFIDS algorithm could attain
about 50% run time improvement than FIDS approach.
Abstract: In the present communication, we have studied
different variations in the entropy measures in the different states of
queueing processes. In case of steady state queuing process, it has
been shown that as the arrival rate increases, the uncertainty
increases whereas in the case of non-steady birth-death process, it is
shown that the uncertainty varies differently. In this pattern, it first
increases and attains its maximum value and then with the passage of
time, it decreases and attains its minimum value.