Abstract: In this paper, control methodology based on the selection of the type of traffic light and the period of the green phase to accomplish an optimum balance at intersections is proposed. This balance should be flexible to the static behavior of time, and randomness in a traffic situation; the goal of the proposed method is to reduce traffic volume in transportation, the average delay for each vehicle, and control over the crash of cars. The proposed method was specifically investigated at the intersection through an appropriate timing of traffic lights by sampling a multi-agent system. It consists of a large number of intersections, each of which is considered as an independent agent that exchanges information with each other, and the stability of each agent is provided separately. The robustness against uncertainties, scalability, and stability of the closed-loop overall system are the main merits of the proposed methodology. The simulation results show that the fuzzy intelligent controller in this multi-factor system which is a Takagi-Sugeno (TS) fuzzy is more useful than scheduling in the fixed-time method and it reduces the lengths of vehicles queuing.
Abstract: Based on activity method, this paper focuses on morning commuting behavior when commuters travel with autonomous vehicles (AVs). Firstly, a net utility function of commuters is constructed by the activity utility of commuters at home, in car and at workplace, and the disutility of travel time cost and that of schedule delay cost. Then, this net utility function is applied to build an equilibrium model. Finally, under the assumption of constant marginal activity utility, the properties of equilibrium are analyzed. The results show that, in autonomous driving, the starting and ending time of morning peak and the number of commuters who arrive early and late at workplace are the same as those in manual driving. In automatic driving, however, the departure rate of arriving early at workplace is higher than that of manual driving, while the departure rate of arriving late is just the opposite. In addition, compared with manual driving, the departure time of arriving at workplace on time is earlier and the number of people queuing at the bottleneck is larger in automatic driving. However, the net utility of commuters and the total net utility of system in automatic driving are greater than those in manual driving.
Abstract: The aim of optimization of store management is not
only designing the situation of store management itself including its
equipment, technology and operation. In optimization of store
management we need to consider also synchronizing of
technological, transport, store and service operations throughout the
whole process of logistic chain in such a way that a natural flow of
material from provider to consumer will be achieved the shortest
possible way, in the shortest possible time in requested quality and
quantity and with minimum costs. The paper deals with the
application of the queuing theory for optimization of warehouse
processes. The first part refers to common information about the
problematic of warehousing and using mathematical methods for
logistics chains optimization. The second part refers to preparing a
model of a warehouse within queuing theory. The conclusion of the
paper includes two examples of using queuing theory in praxis.
Abstract: Supply chains are the backbone of trade and
commerce. Their logistics use different transport corridors on regular
basis for operational purpose. The international supply chain
transport corridors include different infrastructure elements (e.g.
weighbridge, package handling equipments, border clearance
authorities, and so on). This paper presents the use of multi-agent
systems (MAS) to model and simulate some aspects of transportation
corridors, and in particular the area of weighbridge resource
optimization for operational profit. An underlying multi-agent model
provides a means of modeling the relationships among stakeholders
in order to enable coordination in a transport corridor environment.
Simulations of the costs of container unloading, reloading, and
waiting time for queuing up tracks have been carried out using data
sets. Results of the simulation provide the potential guidance in
making decisions about optimal service resource allocation in a trade
corridor.
Abstract: Cloud computing is the innovative and leading
information technology model for enabling convenient, on-demand
network access to a shared pool of configurable computing resources
that can be rapidly provisioned and released with minimal
management effort. In this paper, we aim at the development of
workflow management system for cloud computing platforms based
on our previous research on the dynamic allocation of the cloud
computing resources and its workflow process. We took advantage of
the HTML5 technology and developed web-based workflow interface.
In order to enable the combination of many tasks running on the cloud
platform in sequence, we designed a mechanism and developed an
execution engine for workflow management on clouds. We also
established a prediction model which was integrated with job queuing
system to estimate the waiting time and cost of the individual tasks on
different computing nodes, therefore helping users achieve maximum
performance at lowest payment. This proposed effort has the potential
to positively provide an efficient, resilience and elastic environment
for cloud computing platform. This development also helps boost user
productivity by promoting a flexible workflow interface that lets users
design and control their tasks' flow from anywhere.
Abstract: The idea of the asynchronous transmission in
wavelength division multiplexing (WDM) ring MANs is studied in
this paper. Especially, we present an efficient access technique to
coordinate the collisions-free transmission of the variable sizes of IP
traffic in WDM ring core networks. Each node is equipped with a
tunable transmitter and a tunable receiver. In this way, all the
wavelengths are exploited for both transmission and reception. In
order to evaluate the performance measures of average throughput,
queuing delay and packet dropping probability at the buffers, a
simulation model that assumes symmetric access rights among the
nodes is developed based on Poisson statistics. Extensive numerical
results show that the proposed protocol achieves apart from high
bandwidth exploitation for a wide range of offered load, fairness of
queuing delay and dropping events among the different packets size
categories.
Abstract: The purpose of this work is examining the multiproduct
multi-stage in a battery production line. To improve the
performances of an assembly production line by determine the
efficiency of each workstation. Data collected from every
workstation. The data are throughput rate, number of operator, and
number of parts that arrive and leaves during part processing. Data
for the number of parts that arrives and leaves are collected at least at
the amount of ten samples to make the data is possible to be analyzed
by Chi-Squared Goodness Test and queuing theory. Measures of this
model served as the comparison with the standard data available in
the company. Validation of the task time value resulted by comparing
it with the task time value based on the company database. Some
performance factors for the multi-product multi-stage in a battery
production line in this work are shown.
The efficiency in each workstation was also shown. Total
production time to produce each part can be determined by adding
the total task time in each workstation. To reduce the queuing time
and increase the efficiency based on the analysis any probably
improvement should be done. One probably action is by increasing
the number of operators how manually operate this workstation.
Abstract: The growth of wireless devices affects the availability
of limited frequencies or spectrum bands as it has been known that
spectrum bands are a natural resource that cannot be added.
Meanwhile, the licensed frequencies are idle most of the time.
Cognitive radio is one of the solutions to solve those problems.
Cognitive radio is a promising technology that allows the unlicensed
users known as secondary users (SUs) to access licensed bands
without making interference to licensed users or primary users (PUs).
As cloud computing has become popular in recent years, cognitive
radio networks (CRNs) can be integrated with cloud platform. One of
the important issues in CRNs is security. It becomes a problem since
CRNs use radio frequencies as a medium for transmitting and CRNs
share the same issues with wireless communication systems. Another
critical issue in CRNs is performance. Security has adverse effect to
performance and there are trade-offs between them. The goal of this
paper is to investigate the performance related to security trade-off in
CRNs with supporting cloud platforms. Furthermore, Queuing
Network Models with preemptive resume and preemptive repeat
identical priority are applied in this project to measure the impact of
security to performance in CRNs with or without cloud platform. The
generalized exponential (GE) type distribution is used to reflect the
bursty inter-arrival and service times at the servers. The results show
that the best performance is obtained when security is disabled and
cloud platform is enabled.
Abstract: It is practically significant to research the traffic flow of intersection because the capacity of intersection affects the efficiency of highway network directly. This paper analyzes the traffic conditions of an intersection in certain urban by the methods of queuing theory and statistical experiment, sets up a corresponding mathematical model and compares it with the actual values. The result shows that queuing theory is applied in the study of intersection traffic flow and it can provide references for the other similar designs.
Abstract: The drastic increase in the usage of SMS technology
has led service providers to seek for a solution that enable users of
mobile devices to access services through SMSs. This has resulted in
the proposal of solutions towards SMS-based service invocation in
service oriented environments. However, the dynamic nature of
service-oriented environments coupled with sudden load peaks
generated by service request, poses performance challenges to
infrastructures for supporting SMS-based service invocation. To
address this problem we adopt load balancing techniques. A load
balancing model with adaptive load balancing and load monitoring
mechanisms as its key constructs is proposed. The load balancing
model then led to realization of Least Loaded Load Balancing
Framework (LLLBF). Evaluation of LLLBF benchmarked with round
robin (RR) scheme on the queuing approach showed LLLBF
outperformed RR in terms of response time and throughput.
However, LLLBF achieved better result in the cost of high
processing power.
Abstract: How to maintain the service speeds for the business
to make the biggest profit is a problem worthy of study, which is
discussed in this paper with the use of queuing theory. An M/M/1/N
queuing model with variable input rates, variable service rates and
impatient customers is established, and the following conclusions
are drawn: the stationary distribution of the model, the relationship
between the stationary distribution and the probability that there are n
customers left in the system when a customer leaves (not including
the customer who leaves himself), the busy period of the system,
the average operating cycle, the loss probability for the customers
not entering the system while they arriving at the system, the mean
of the customers who leaves the system being for impatient, the
loss probability for the customers not joining the queue due to the
limited capacity of the system and many other indicators. This paper
also indicates that the following conclusion is not correct: the more
customers the business serve, the more profit they will get. At last,
this paper points out the appropriate service speeds the business
should keep to make the biggest profit.
Abstract: In this paper, SFQ (Start Time Fair Queuing)
algorithm is analyzed when this is applied in computer networks to
know what kind of behavior the traffic in the net has when different
data sources are managed by the scheduler. Using the NS2 software
the computer networks were simulated to be able to get the graphs
showing the performance of the scheduler. Different traffic sources
were introduced in the scripts, trying to establish the real scenario.
Finally the results were that depending on the data source, the traffic
can be affected in different levels, when Constant Bite Rate is
applied, the scheduler ensures a constant level of data sent and
received, but the truth is that in the real life it is impossible to ensure
a level that resists the changes in work load.
Abstract: A simple network model is developed in OPNET to
study the performance of the Wi-Fi protocol. The model is simulated
in OPNET and performance factors such as load, throughput and delay
are analysed from the model. Four applications such as oracle, http, ftp
and voice are applied over the Wireless LAN network to determine the
throughput. The voice application utilises a considerable amount of
bandwidth of up to 5Mbps, as a result the 802.11g standard of the
Wi-Fi protocol was chosen which can support a data rate of up to
54Mbps. Results indicate that when the load in the Wi-Fi network is
increased the queuing delay on the point-to-point links in the Wi-Fi
network significantly reduces until it is comparable to that of WiMAX.
In conclusion, the queuing delay of the Wi-Fi protocol for the network
model simulated was about 0.00001secs comparable to WiMAX
network values.
Abstract: Packet switched data network like Internet, which has
traditionally supported throughput sensitive applications such as email
and file transfer, is increasingly supporting delay-sensitive
multimedia applications such as interactive video. These delaysensitive
applications would often rather sacrifice some throughput
for better delay. Unfortunately, the current packet switched network
does not offer choices, but instead provides monolithic best-effort
service to all applications. This paper evaluates Class Based Queuing
(CBQ), Coordinated Earliest Deadline First (CEDF), Weighted
Switch Deficit Round Robin (WSDRR) and RED-Boston scheduling
schemes that is sensitive to delay bound expectations for variety of
real time applications and an enhancement of WSDRR is proposed.
Abstract: This paper proposes a bi-objective model for the
facility location problem under a congestion system. The idea of the
model is motivated by applications of locating servers in bank
automated teller machines (ATMS), communication networks, and so
on. This model can be specifically considered for situations in which
fixed service facilities are congested by stochastic demand within
queueing framework. We formulate this model with two perspectives
simultaneously: (i) customers and (ii) service provider. The
objectives of the model are to minimize (i) the total expected
travelling and waiting time and (ii) the average facility idle-time.
This model represents a mixed-integer nonlinear programming
problem which belongs to the class of NP-hard problems. In addition,
to solve the model, two metaheuristic algorithms including nondominated
sorting genetic algorithms (NSGA-II) and non-dominated
ranking genetic algorithms (NRGA) are proposed. Besides, to
evaluate the performance of the two algorithms some numerical
examples are produced and analyzed with some metrics to determine
which algorithm works better.
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: How to efficiently assign system resource to route the
Client demand by Gateway servers is a tricky predicament. In this
paper, we tender an enhanced proposal for autonomous recital of
Gateway servers under highly vibrant traffic loads. We devise a
methodology to calculate Queue Length and Waiting Time utilizing
Gateway Server information to reduce response time variance in
presence of bursty traffic.
The most widespread contemplation is performance, because
Gateway Servers must offer cost-effective and high-availability
services in the elongated period, thus they have to be scaled to meet
the expected load. Performance measurements can be the base for
performance modeling and prediction. With the help of performance
models, the performance metrics (like buffer estimation, waiting
time) can be determined at the development process.
This paper describes the possible queue models those can be
applied in the estimation of queue length to estimate the final value
of the memory size. Both simulation and experimental studies using
synthesized workloads and analysis of real-world Gateway Servers
demonstrate the effectiveness of the proposed system.
Abstract: This paper focuses on cost and profit analysis of
single-server Markovian queuing system with two priority classes. In
this paper, functions of total expected cost, revenue and profit of the
system are constructed and subjected to optimization with respect to
its service rates of lower and higher priority classes. A computing
algorithm has been developed on the basis of fast converging
numerical method to solve the system of non linear equations formed
out of the mathematical analysis. A novel performance measure of
cost and profit analysis in view of its economic interpretation for the
system with priority classes is attempted to discuss in this paper. On
the basis of computed tables observations are also drawn to enlighten
the variational-effect of the model on the parameters involved
therein.
Abstract: This paper presents an alternative strategy of queuing
handover called Pseudo Last Useful Instant PLUI scheme for Low
Earth Orbit Mobile Satellite Systems LEO MSSs. The PLUI scheme
uses the same approach as the Last Useful Instant LUI scheme
previously proposed in literature, with less complex implementation.
Simulation tests were carried out using Dynamic Channel Allocation
DCA in order to evaluate the performance of this scheme and also an
analytical approach has been presented to allow the performance
evaluation of Fixed Channel Allocation FCA, with different
handover queuing disciplines. The results show that performances
achieved by the proposed strategy are close to those achieved using
the LUI scheme.
Abstract: Wireless channels are characterized by more serious
bursty and location-dependent errors. Many packet scheduling
algorithms have been proposed for wireless networks to guarantee
fairness and delay bounds. However, most existing schemes do not
consider the difference of traffic natures among packet flows. This
will cause the delay-weight coupling problem. In particular, serious
queuing delays may be incurred for real-time flows. In this paper, it
is proposed a scheduling algorithm that takes traffic types of flows
into consideration when scheduling packets and also it is provided
scheduling flexibility by trading off video quality to meet the
playback deadline.