59 research outputs found
Performance Modelling and Optimisation of Multi-hop Networks
A major challenge in the design of large-scale networks is to predict and optimise the
total time and energy consumption required to deliver a packet from a source node to a
destination node. Examples of such complex networks include wireless ad hoc and sensor
networks which need to deal with the effects of node mobility, routing inaccuracies, higher
packet loss rates, limited or time-varying effective bandwidth, energy constraints, and the
computational limitations of the nodes. They also include more reliable communication
environments, such as wired networks, that are susceptible to random failures, security
threats and malicious behaviours which compromise their quality of service (QoS) guarantees.
In such networks, packets traverse a number of hops that cannot be determined
in advance and encounter non-homogeneous network conditions that have been largely
ignored in the literature. This thesis examines analytical properties of packet travel in
large networks and investigates the implications of some packet coding techniques on both
QoS and resource utilisation.
Specifically, we use a mixed jump and diffusion model to represent packet traversal
through large networks. The model accounts for network non-homogeneity regarding
routing and the loss rate that a packet experiences as it passes successive segments of a
source to destination route. A mixed analytical-numerical method is developed to compute
the average packet travel time and the energy it consumes. The model is able to capture
the effects of increased loss rate in areas remote from the source and destination, variable
rate of advancement towards destination over the route, as well as of defending against
malicious packets within a certain distance from the destination. We then consider sending
multiple coded packets that follow independent paths to the destination node so as to
mitigate the effects of losses and routing inaccuracies. We study a homogeneous medium
and obtain the time-dependent properties of the packet’s travel process, allowing us to
compare the merits and limitations of coding, both in terms of delivery times and energy
efficiency. Finally, we propose models that can assist in the analysis and optimisation
of the performance of inter-flow network coding (NC). We analyse two queueing models
for a router that carries out NC, in addition to its standard packet routing function. The
approach is extended to the study of multiple hops, which leads to an optimisation problem
that characterises the optimal time that packets should be held back in a router, waiting
for coding opportunities to arise, so that the total packet end-to-end delay is minimised
Recommended from our members
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be sufficiently realistic. The purpose of this research is to extend the work done on vacation queues and on unreliable queues by studying queueing systems which take into consideration both phenomena. We study the behavior of a batch arrival queueing system with a single server, where the system is subject to random breakdowns which require a repair process, and on the other hand, the server is allowed to take a vacation after finishing a service. The breakdowns are assumed to occur while serving a customer, and when the system breaks down, it enters a repair process immediately while the customer whose service is interrupted comes back to the head of the queue waiting for the service to resume. Server vacations are assumed to follow a Bernoulli schedule under single vacation policy. We consider the above assumptions for different queueing models: queues with generalized service time, queues with two-stages of heterogeneous service, queues with a second optional service, and queues with two types of service. For all the models mentioned above, it is assumed that the service times, vacation times, and repair times all have general arbitrary distributions. Applying the supplementary variable technique, we obtain probability generating functions of queue size at a random epoch for different states of the system, and some performance measures such as the mean queue length, mean waiting time in the queue, proportion of server's idle time, and the utilization factor. The results obtained in this research, show the effect of vacation and breakdown parameters upon main performance measures of interest. These effects are also illustrated using some numerical examples and graphs.This work is funded by the Ministry of Education, Kingdom of Bahrain
Recommended from our members
Analysis of some batch arrival queueing systems with balking, reneging, random breakdowns, fluctuating modes of service and Bernoulli schedulled server vacations.
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonThe purpose of this research is to investigate and analyse some batch arrival queueing systems with Bernoulli scheduled vacation process and single server providing service. The study aims to explore and extend the work done on vacation and unreliable queues with a combination of assumptions like balking and re-service, reneging during vacations, time homogeneous random breakdowns and fluctuating modes of service. We study the steady state properties, and also transient behaviour of such queueing systems. Due to vacations the arriving units already in the system may abandon the system without receiving any service (reneging). Customers may decide not to join the queue when the server is in either working or vacation state (balking). We study this phenomenon in the framework of two models; a single server with two types of parallel services and two stages of service. The model is further extended with re-service offered instantaneously. Units which join the queue but leave without service upon the absence of the server; especially due to vacation is quite a natural phenomenon. We study this reneging behaviour in a queueing process with a single server in the context of Markovian and non-Markovian service time distribution. Arrivals are in batches while each customer can take the decision to renege independently. The non-Markovian model is further extended considering service time to follow a Gamma distribution and arrivals are due to Geometric distribution. The closed-form solutions are derived in all the cases. Among other causes of service interruptions, one prime cause is breakdowns. We consider breakdowns to occur both in idle and working state of the server. In this queueing system the transient and steady state analysis are both investigated. Applying the supplementary variable technique, we obtain the probability generating function of queue size at random epoch for the different states of the system and also derive some performance measures like probability of server‟s idle time, utilization factor, mean queue length and mean waiting time. The effect of the parameters on some of the main performance measures is illustrated by numerical examples to validate the analytical results obtained in the study. The Mathematica 10 software has been used to provide the numerical results and presentation of the effects of some performance measures through plots and graphs
Modelling activities in a Critical Care Unit
The Critical Care Unit (CCU) is the sector of the hospital where, as the name suggests, critically ill patients receive treatment. The main aim of this research is to identify and apply suitable Operational Research techniques to model patient flow in the CCU at the University Hospital of Wales, Cardiff. The Operational Research techniques employed in this thesis include queueing theory and simulation. These methods have been utilised previously in the field of healthcare with much success. The thesis begins by considering two aspects of queueing theory, namely batch service queueing theory and batch arrival queueing theory. The latter of these is utilised to model patient flow within the CCU. Although queueing theory may be used as a good approximation to activities in the Unit, it does not incorporate all aspects of real-life. Thus discrete-event simulation is suggested as an alternative approach. Two types of statistical analysis, CART and Regression, are applied to both length of stay and mortality variables. The results from these statistical tests are compiled and investigated in more depth. Finally, a discrete event simulation model is built in Visual Basic for Applications, for Microsoft Excel. This simulation model incorporates many of the complexities of a CCU, such as patient priority and cancellation of scheduled patients if all beds on the Unit are occupied. The model is then used to test various "what-if type" scenarios, including the possibility of funding additional beds, the concept of ring-fencing of beds for different levels of care, and the likely effect of reducing the impact of bed-blocking
Unreliable Retrial Queues in a Random Environment
This dissertation investigates stability conditions and approximate steady-state performance measures for unreliable, single-server retrial queues operating in a randomly evolving environment. In such systems, arriving customers that find the server busy or failed join a retrial queue from which they attempt to regain access to the server at random intervals. Such models are useful for the performance evaluation of communications and computer networks which are characterized by time-varying arrival, service and failure rates. To model this time-varying behavior, we study systems whose parameters are modulated by a finite Markov process. Two distinct cases are analyzed. The first considers systems with Markov-modulated arrival, service, retrial, failure and repair rates assuming all interevent and service times are exponentially distributed. The joint process of the orbit size, environment state, and server status is shown to be a tri-layered, level-dependent quasi-birth-and-death (LDQBD) process, and we provide a necessary and sufficient condition for the positive recurrence of LDQBDs using classical techniques. Moreover, we apply efficient numerical algorithms, designed to exploit the matrix-geometric structure of the model, to compute the approximate steady-state orbit size distribution and mean congestion and delay measures. The second case assumes that customers bring generally distributed service requirements while all other processes are identical to the first case. We show that the joint process of orbit size, environment state and server status is a level-dependent, M/G/1-type stochastic process. By employing regenerative theory, and exploiting the M/G/1-type structure, we derive a necessary and sufficient condition for stability of the system. Finally, for the exponential model, we illustrate how the main results may be used to simultaneously select mean time customers spend in orbit, subject to bound and stability constraints
Discrete-time queueing models with priorities
This PhD-dissertation contains analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system contents and packet delays of both classes.
The results are applicable in heterogeneous telecommunication networks, when delay-sensitive traffic gets transmission priority over best-effort traffic. Our results predict the influence of priority scheduling on the QoS (Quality-of-Service) of the different types of traffic
- …