Abstract: This paper deals with the random access procedure in next-generation networks and presents the solution to reduce total service time (TST) which is one of the most important performance metrics in current and future internet of things (IoT) based networks. The proposed solution focuses on the calculation of optimal transmission probability which maximizes the success probability and reduces TST. It uses the information of several idle preambles in every time slot, and based on it, it estimates the number of backlogged IoT devices using Naïve Bayes estimation which is a type of supervised learning in the machine learning domain. The estimation of backlogged devices is necessary since optimal transmission probability depends on it and the eNodeB does not have information about it. The simulations are carried out in MATLAB which verify that the proposed solution gives excellent performance.
Abstract: A sequence of finite tandem queue is considered for
this study. Each one has a single server, which operates under the
egalitarian processor sharing discipline. External customers arrive at
each queue according to a renewal input process and having a general
service times distribution. Upon completing service, customers leave
the current queue and enter to the next. Under mild assumptions,
including critical data, we prove the existence and the uniqueness
of the fluid solution. For asymptotic behavior, we provide necessary
and sufficient conditions for the invariant state and the convergence
to this invariant state. In the end, we establish the convergence of a
correctly normalized state process to a fluid limit characterized by a
system of algebraic and integral equations.
Abstract: Over the last decade, the over population that has happened in urban areas has been reflecting on the services that various local institutions provide to car users in the form of car parks, which is becoming a daily necessity in our lives. This study focuses on car parks at Jordan University of Science and Technology, in Irbid, Jordan, to understand the university parking needs. Data regarding arrival and departure times of cars and the parking utilization were collected, to find various options that the university can implement to solve and develop an efficient car parking system. Arena software was used to simulate a parking model. This model allows measuring the different solutions that solve the parking problem at Jordan University of Science and Technology.
Abstract: In traditional integrated berth allocation with quay crane assignment models, time dimension is usually assumed in hourly based. However, nowadays, transshipment becomes the main business to many container terminals, especially in Southeast Asia (e.g. Hong Kong and Singapore). In these terminals, vessel arrivals are usually very frequent with small handling volume and very short staying time. Therefore, the traditional hourly-based modeling approach may cause significant berth and quay crane idling, and consequently cannot meet their practical needs. In this connection, a 15-minute-based modeling approach is requested by industrial practitioners. Accordingly, a Three-level Genetic Algorithm (3LGA) with Quay Crane (QC) shifting heuristics is designed to fulfill the research gap. The objective function here is to minimize the total service time. Preliminary numerical results show that the proposed 15-minute-based approach can reduce the berth and QC idling significantly.
Abstract: In this paper, the flow of different classes of patients
into a hospital is modelled and analyzed by using the queueing
network analyzer (QNA) algorithm and discrete event simulation.
Input data for QNA are the rate and variability parameters of the
arrival and service times in addition to the number of servers in each
facility. Patient flows mostly match real flow for a hospital in Egypt.
Based on the analysis of the waiting times, two approaches are
suggested for improving performance: Separating patients into
service groups, and adopting different service policies for sequencing
patients through hospital units. The separation of a specific group of
patients, with higher performance target, to be served separately from
the rest of patients requiring lower performance target, requires the
same capacity while improves performance for the selected group of
patients with higher target. Besides, it is shown that adopting the
shortest processing time and shortest remaining processing time
service policies among other tested policies would results in,
respectively, 11.47% and 13.75% reduction in average waiting time
relative to first come first served policy.
Abstract: By applying coating onto a structural component, the corrosion and/or wear resistance requirements of the surface can be fulfilled. Since the layer adhesion of the coating influences the mechanical integrity of the coat/substrate interface during the service time, it should be examined accurately. At the present work, the tensile bonding strength of the 316 stainless steel plasma sprayed coating on aluminum substrate was determined by using tensile adhesion test, TAT, specimen. The interfacial fracture toughness was specified using four-point bend specimen containing a saw notch and modified chevron-notched short-bar (SB) specimen. The coating microstructure and fractured specimen surface were examined by using scanning electron- and optical-microscopy. The investigation of coated surface after tensile adhesion test indicates that the failure mechanism is mostly cohesive and rarely adhesive type. The calculated value of critical strain energy release rate proposes relatively good interface status. It seems that four-point bending test offers a potentially more sensitive means for evaluation of mechanical integrity of coating/substrate interfaces than is possible with the tensile test. The fracture toughness value reported for the modified chevron-notched short-bar specimen testing cannot be taken as absolute value because its calculation is based on the minimum stress intensity coefficient value which has been suggested for the fracture toughness determination of homogeneous parts in the ASTM E1304-97 standard.
Abstract: Good service design can increase organization revenue and consumer satisfaction while reducing labor and time costs. The problems facing consumers in the original serve model for eyewear and optical industry includes the following issues: 1. Insufficient information on eyewear products 2. Passively dependent on recommendations, insufficient selection 3. Incomplete records on progression of vision conditions 4. Lack of complete customer records. This study investigates the case of Kobayashi Optical, applying the Theory of Inventive Problem Solving (TRIZ) to develop innovative solutions for eyewear and optical industry. Analysis results raise the following conclusions and management implications: In order to provide customers with improved professional information and recommendations, Kobayashi Optical is suggested to establish customer purchasing records. Overall service efficiency can be enhanced by applying data mining techniques to analyze past consumer preferences and purchase histories. Furthermore, Kobayashi Optical should continue to develop a 3D virtual trial service which can allow customers for easy browsing of different frame styles and colors. This 3D virtual trial service will save customer waiting times in during peak service times at stores.
Abstract: This paper addresses a cutting edge method of
business demand forecasting, based on an empirical probability
function when the historical behavior of the data is random.
Additionally, it presents error determination based on the numerical
method technique ‘propagation of errors.’ The methodology was
conducted characterization and process diagnostics demand planning
as part of the production management, then new ways to predict its
value through techniques of probability and to calculate their mistake
investigated, it was tools used numerical methods. All this based on
the behavior of the data. This analysis was determined considering
the specific business circumstances of a company in the sector of
communications, located in the city of Bogota, Colombia. In
conclusion, using this application it was possible to obtain the
adequate stock of the products required by the company to provide its
services, helping the company reduce its service time, increase the
client satisfaction rate, reduce stock which has not been in rotation
for a long time, code its inventory, and plan reorder points for the
replenishment of stock.
Abstract: Non-destructive testing and evaluation techniques for
assessing the integrity of composite structures are essential to both
reduce manufacturing costs and out of service time of transport means
due to maintenance. In this study, Analyze into non-destructive test
characterization of carbon fiber reinforced plastics (CFRP) internal
and external defects using thermo-graphic camera and transient
thermography method. non-destructive testing were characterized by
defect size (Ø8, Ø10, Ø12, Ø14) and depth (1.2mm, 2.4mm).
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: This paper studies a random fuzzy queueing system
that the interarrival times of customers arriving at the server and
the service times are independent and identically distributed random
fuzzy variables. We match the random fuzzy queueing system with
the random fuzzy alternating renewal process and we do not use from
α-pessimistic and α-optimistic values to estimate the average chance
of the event ”random fuzzy queueing system is busy at time t”, we
employ the fuzzy simulation method in practical applications. Some
theorem is proved and finally we solve a numerical example with
fuzzy simulation method.
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: 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: 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: 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: In the queueing theory, it is assumed that customer
arrivals correspond to a Poisson process and service time has the
exponential distribution. Using these assumptions, the behaviour of
the queueing system can be described by means of Markov chains
and it is possible to derive the characteristics of the system. In the
paper, these theoretical approaches are presented on several types of
systems and it is also shown how to compute the characteristics in a
situation when these assumptions are not satisfied
Abstract: The use of buffer thresholds, blocking and adequate
service strategies are well-known techniques for computer networks
traffic congestion control. This motivates the study of series queues
with blocking, feedback (service under Head of Line (HoL) priority
discipline) and finite capacity buffers with thresholds. In this paper,
the external traffic is modelled using the Poisson process and the
service times have been modelled using the exponential distribution.
We consider a three-station network with two finite buffers, for
which a set of thresholds (tm1 and tm2) is defined. This computer
network behaves as follows. A task, which finishes its service at
station B, gets sent back to station A for re-processing with
probability o. When the number of tasks in the second buffer exceeds
a threshold tm2 and the number of task in the first buffer is less than
tm1, the fed back task is served under HoL priority discipline. In
opposite case, for fed backed tasks, “no two priority services in
succession" procedure (preventing a possible overflow in the first
buffer) is applied. Using an open Markovian queuing schema with
blocking, priority feedback service and thresholds, a closed form
cost-effective analytical solution is obtained. The model of servers
linked in series is very accurate. It is derived directly from a twodimensional
state graph and a set of steady-state equations, followed
by calculations of main measures of effectiveness. Consequently,
efficient expressions of the low computational cost are determined.
Based on numerical experiments and collected results we conclude
that the proposed model with blocking, feedback and thresholds can
provide accurate performance estimates of linked in series networks.
Abstract: The transient analysis of a queuing system with fixed-size batch Poisson arrivals and a single server with exponential service times is presented. The focus of the paper is on the use of the functions that arise in the analysis of the transient behaviour of the queuing system. These functions are shown to be a generalization of the modified Bessel functions of the first kind, with the batch size B as the generalizing parameter. Results for the case of single-packet arrivals are obtained first. The similarities between the two families of functions are then used to obtain results for the general case of batch arrival queue with a batch size larger than one.
Abstract: The paper considers a single-server queue with fixedsize
batch Poisson arrivals and exponential service times, a model
that is useful for a buffer that accepts messages arriving as fixed size
batches of packets and releases them one packet at time. Transient
performance measures for queues have long been recognized as
being complementary to the steady-state analysis. The focus of the
paper is on the use of the functions that arise in the analysis of the
transient behaviour of the queuing system. The paper exploits
practical modelling to obtain a solution to the integral equation
encountered in the analysis. Results obtained indicate that under
heavy load conditions, there is significant disparity in the statistics
between the transient and steady state values.
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.