Abstract: Large patients’ queues at pharmacies and hospitals are a problem that faces the supposedly smooth and healthy environment in United Arab Emirates. As this sometimes leads to dissatisfaction from visiting patients, we tried to solve this problem with additional beneficial functions by developing the Hospital-Pharmacy Management System. The primary purpose of this research is to develop a system that joins the databases of a hospital and a pharmacy together for a better integrated system that provides a better coherent working environment. Three methods are used to design the system. These methods are detailed literature review, an extensive feasibility study and surveys for doctors, hospital IT managers and End-users. Interviews and surveys with related stakeholders were done to depict system’s requirements; design and prototype. The prototype illustrates system’s features and its client and server architecture. The system has a mobile application for visiting patients to, mainly, keep track of their prescriptions and access to their personal information. The server side allows doctors to submit the prescriptions online to pharmacists who will process them. This system is expected to reduce the long waiting queues of patients and increase their satisfaction while also reducing doctors and pharmacists’ stress and facilitating their work. It will be deployed to users of Android devices only. This limitation will be resolved, as one of main future enhancements, once the system finds acceptance from hospitals and pharmacies in United Arab Emirates.
Abstract: This paper presents a finite buffer renewal input single working vacation and vacation interruption queue with state dependent services and state dependent vacations, which has a wide range of applications in several areas including manufacturing, wireless communication systems. Service times during busy period, vacation period and vacation times are exponentially distributed and are state dependent. As a result of the finite waiting space, state dependent services and state dependent vacation policies, the analysis of these queueing models needs special attention. We provide a recursive method using the supplementary variable technique to compute the stationary queue length distributions at pre-arrival and arbitrary epochs. An efficient computational algorithm of the model is presented which is fast and accurate and easy to implement. Various performance measures have been discussed. Finally, some special cases and numerical results have been depicted in the form of tables and graphs.
Abstract: Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in wireless mesh networks (WMNs). In this paper, we present asynchronous multiple-state based power control for MRMC WMNs. First, WMN is represented as a set of disjoint Unified Channel Graphs (UCGs). Second, each network interface card (NIC) or radio assigned to a unique UCG adjusts transmission power using predicted multiple interaction state variables (IV) across UCGs. Depending on the size of queue loads and intra- and inter-channel states, each NIC optimizes transmission power locally and asynchronously. A new power selection MRMC unification protocol (PMMUP) is proposed that coordinates interactions among radios. The efficacy of the proposed method is investigated through simulations.
Abstract: In this paper, we study statistical multiplexing of VBR
video in ATM networks. ATM promises to provide high speed realtime
multi-point to central video transmission for telemedicine
applications in rural hospitals and in emergency medical services.
Video coders are known to produce variable bit rate (VBR) signals
and the effects of aggregating these VBR signals need to be
determined in order to design a telemedicine network infrastructure
capable of carrying these signals. We first model the VBR video
signal and simulate it using a generic continuous-data autoregressive
(AR) scheme. We carry out the queueing analysis by the Fluid
Approximation Model (FAM) and the Markov Modulated Poisson
Process (MMPP). The study has shown a trade off: multiplexing
VBR signals reduces burstiness and improves resource utilization,
however, the buffer size needs to be increased with an associated
economic cost. We also show that the MMPP model and the Fluid
Approximation model fit best, respectively, the cell region and the
burst region. Therefore, a hybrid MMPP and FAM completely
characterizes the overall performance of the ATM statistical
multiplexer. The ramifications of this technology are clear: speed,
reliability (lower loss rate and jitter), and increased capacity in video
transmission for telemedicine. With migration to full IP-based
networks still a long way to achieving both high speed and high
quality of service, the proposed ATM architecture will remain of
significant use for telemedicine.
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: This work presents the Risk Threshold RED (RTRED)
congestion control strategy for TCP networks. In addition to the
maximum and minimum thresholds in existing RED-based strategies,
we add a third dropping level. This new dropping level is the risk
threshold which works with the actual and average queue sizes to
detect the immediate congestion in gateways. Congestion reaction
by RTRED is on time. The reaction to congestion is neither too
early, to avoid unfair packet losses, nor too late to avoid packet
dropping from time-outs. We compared our novel strategy with RED
and ARED strategies for TCP congestion handling using a NS-2
simulation script. We found that the RTRED strategy outperformed
RED and ARED.
Abstract: Traditionally, Internet has provided best-effort service to every user regardless of its requirements. However, as Internet becomes universally available, users demand more bandwidth and applications require more and more resources, and interest has developed in having the Internet provide some degree of Quality of Service. Although QoS is an important issue, the question of how it will be brought into the Internet has not been solved yet. Researches, due to the rapid advances in technology are proposing new and more desirable capabilities for the next generation of IP infrastructures. But neither all applications demand the same amount of resources, nor all users are service providers. In this way, this paper is the first of a series of papers that presents an architecture as a first step to the optimization of QoS in the Internet environment as a solution to a SMSE's problem whose objective is to provide public service to internet with certain Quality of Service expectations. The service provides new business opportunities, but also presents new challenges. We have designed and implemented a scalable service framework that supports adaptive bandwidth based on user demands, and the billing based on usage and on QoS. The developed application has been evaluated and the results show that traffic limiting works at optimum and so it does exceeding bandwidth distribution. However, some considerations are done and currently research is under way in two basic areas: (i) development and testing new transfer protocols, and (ii) developing new strategies for traffic improvements based on service differentiation.
Abstract: IEEE 802.16 is a new wireless technology standard, it
has some advantages, including wider coverage, higher bandwidth,
and QoS support. As the new wireless technology for last mile
solution, there are designed two models in IEEE 802.16 standard. One
is PMP (point to multipoint) and the other is Mesh. In this paper we
only focus on IEEE 802.16 Mesh model. According to the IEEE
802.16 standard description, Mesh model has two scheduling modes,
centralized and distributed. Considering the pros and cons of the two
scheduling, we present the combined scheduling QoS framework that
the BS (Base Station) controls time frame scheduling and selects the
shortest path from source to destination directly. On the other hand, we
propose the Expedited Queue mechanism to cut down the transmission
time. The EQ mechanism can reduce a lot of end-to-end delay in our
QoS framework. Simulation study has shown that the average delay is
smaller than contrasts. Furthermore, our proposed scheme can also
achieve higher performance.
Abstract: This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival, arbitrary and outside observer-s observation epochs. We also present probability generation function (p.g.f.) of actual waiting-time distribution in the system and some performance measures.
Abstract: A Simultaneous Multithreading (SMT) Processor is
capable of executing instructions from multiple threads in the same
cycle. SMT in fact was introduced as a powerful architecture to
superscalar to increase the throughput of the processor.
Simultaneous Multithreading is a technique that permits multiple
instructions from multiple independent applications or threads to
compete limited resources each cycle. While the fetch unit has been
identified as one of the major bottlenecks of SMT architecture, several
fetch schemes were proposed by prior works to enhance the fetching
efficiency and overall performance.
In this paper, we propose a novel fetch policy called queue situation
identifier (QSI) which counts some kind of long latency instructions of
each thread each cycle then properly selects which threads to fetch
next cycle. Simulation results show that in best case our fetch policy
can achieve 30% on speedup and also can reduce the data cache level 1
miss rate.
Abstract: Dynamic bandwidth allocation in EPONs can be
generally separated into inter-ONU scheduling and intra-ONU scheduling. In our previous work, the active intra-ONU scheduling
(AS) utilizes multiple queue reports (QRs) in each report message to cooperate with the inter-ONU scheduling and makes the granted
bandwidth fully utilized without leaving unused slot remainder (USR).
This scheme successfully solves the USR problem originating from the
inseparability of Ethernet frame. However, without proper setting of
threshold value in AS, the number of QRs constrained by the IEEE
802.3ah standard is not enough, especially in the unbalanced traffic
environment. This limitation may be solved by enlarging the threshold
value. The large threshold implies the large gap between the adjacent QRs, thus resulting in the large difference between the best granted bandwidth and the real granted bandwidth. In this paper, we integrate
AS with a cooperative prediction mechanism and distribute multiple
QRs to reduce the penalty brought by the prediction error.
Furthermore, to improve the QoS and save the usage of queue reports,
the highest priority (EF) traffic which comes during the waiting time is
granted automatically by OLT and is not considered in the requested
bandwidth of ONU. The simulation results show that the proposed
scheme has better performance metrics in terms of bandwidth
utilization and average delay for different classes of packets.
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, we investigate multihop polling and data gathering schemes in layered sensor networks in order to extend the life time of the networks. A network consists of three layers. The lowest layer contains sensors. The middle layer contains so called super nodes with higher computational power, energy supply and longer transmission range than sensor nodes. The top layer contains a sink node. A node in each layer controls a number of nodes in lower layer by polling mechanism to gather data. We will present four types of data gathering schemes: intermediate nodes do not queue data packet, queue single packet, queue multiple packets and aggregate data, to see which data gathering scheme is more energy efficient for multihop polling in layered sensor networks.
Abstract: In this paper, we deal with the Steiner tree problem
(STP) on a graph in which a fuzzy number, instead of a real number,
is assigned to each edge. We propose a modification of the shortest
paths approximation based on the fuzzy shortest paths (FSP)
evaluations. Since a fuzzy min operation using the extension
principle leads to nondominated solutions, we propose another
approach to solving the FSP using Cheng's centroid point fuzzy
ranking method.
Abstract: Performance of a limited Round-Robin (RR) rule is
studied in order to clarify the characteristics of a realistic sharing
model of a processor. Under the limited RR rule, the processor
allocates to each request a fixed amount of time, called a quantum, in a
fixed order. The sum of the requests being allocated these quanta is
kept below a fixed value. Arriving requests that cannot be allocated
quanta because of such a restriction are queued or rejected. Practical
performance measures, such as the relationship between the mean
sojourn time, the mean number of requests, or the loss probability and
the quantum size are evaluated via simulation. In the evaluation, the
requested service time of an arriving request is converted into a
quantum number. One of these quanta is included in an RR cycle,
which means a series of quanta allocated to each request in a fixed
order. The service time of the arriving request can be evaluated using
the number of RR cycles required to complete the service, the number
of requests receiving service, and the quantum size. Then an increase
or decrease in the number of quanta that are necessary before service is
completed is reevaluated at the arrival or departure of other requests.
Tracking these events and calculations enables us to analyze the
performance of our limited RR rule. In particular, we obtain the most
suitable quantum size, which minimizes the mean sojourn time, for the
case in which the switching time for each quantum is considered.
Abstract: Waiting times and queues are a daily problem for theme parks. Fast lines or priority queues appear as a solution for a specific segment of customers, that is, tourists who are willing to pay to avoid waiting. This paper analyzes the fast line system and explores the factors that affect the decision to purchase a fast line pass. A greater understanding of these factors may help companies to design appropriate products and services. This conceptual paper was based on a literature review in marketing and consumer behavior. Additional research was identified in related disciplines such as leisure studies, psychology, and sociology. A conceptual framework of the factors influencing the decision to purchase a fast line pass is presented.
Abstract: This paper treats a discrete-time batch arrival queue with single working vacation. The main purpose of this paper is to present a performance analysis of this system by using the supplementary variable technique. For this purpose, we first analyze the Markov chain underlying the queueing system and obtain its ergodicity condition. Next, we present the stationary distributions of the system length as well as some performance measures at random epochs by using the supplementary variable method. Thirdly, still based on the supplementary variable method we give the probability generating function (PGF) of the number of customers at the beginning of a busy period and give a stochastic decomposition formulae for the PGF of the stationary system length at the departure epochs. Additionally, we investigate the relation between our discretetime system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on some crucial performance characteristics of the system.
Abstract: Manufacturing Industries face a crucial change as products and processes are required to, easily and efficiently, be reconfigurable and reusable. In order to stay competitive and flexible, situations also demand distribution of enterprises globally, which requires implementation of efficient communication strategies. A prototype system called the “Broadcaster" has been developed with an assumption that the control environment description has been engineered using the Component-based system paradigm. This prototype distributes information to a number of globally distributed partners via an adoption of the circular-based data processing mechanism. The work highlighted in this paper includes the implementation of this mechanism in the domain of the manufacturing industry. The proposed solution enables real-time remote propagation of machine information to a number of distributed supply chain client resources such as a HMI, VRML-based 3D views and remote client instances regardless of their distribution nature and/ or their mechanisms. This approach is presented together with a set of evaluation results. Authors- main concentration surrounds the reliability and the performance metric of the adopted approach. Performance evaluation is carried out in terms of the response times taken to process the data in this domain and compared with an alternative data processing implementation such as the linear queue mechanism. Based on the evaluation results obtained, authors justify the benefits achieved from this proposed implementation and highlight any further research work that is to be carried out.
Abstract: In communication networks where communication nodes are connected with finite capacity transmission links, the packet inter-arrival times are strongly correlated with the packet length and the link capacity (or the packet service time). Such correlation affects the system performance significantly, but little attention has been paid to this issue. In this paper, we propose a mathematical framework to study the impact of the correlation between the packet service times and the packet inter-arrival times on system performance. With our mathematical model, we analyze the system performance, e.g., the unfinished work of the system, and show that the correlation affects the system performance significantly. Some numerical examples are also provided.
Abstract: We present a new numerical method for the computation of the steady-state solution of Markov chains. Theoretical analyses show that the proposed method, with a contraction factor α, converges to the one-dimensional null space of singular linear systems of the form Ax = 0. Numerical experiments are used to illustrate the effectiveness of the proposed method, with applications to a class of interesting models in the domain of tandem queueing networks.