2,197 research outputs found
Modelling and performance evaluation of wireless and mobile communication systems in heterogeneous environments
It is widely expected that next generation wireless communication systems will be heterogeneous, integrating a wide variety of wireless access networks. Of particular interest recently is the integration of cellular networks (GSM, GPRS, UMTS, EDGE and LTE) and wireless local area networks (WLANs) to provide complementary features in terms of coverage, capacity and mobility support. These different networks will work together using vertical handover techniques and hence understanding how well these mechanisms perform is a significant issue. In this thesis, these networks are modelled to yield performance results such as mean queue lengths and blocking probabilities over a range of different conditions. The results are then analysed using network constraints to yield operational graphs based on handover probabilities to different networks. Firstly, individual networks with horizontal handover are analysed using performability techniques. The thesis moves on to look at vertical handovers between cellular networks using pure performance models. Then the integration of cellular networks and WLAN is considered. While analysing these results it became clear that the common models that were being used were subjected to handover hysteresis resulting from feedback loops in the model. A new analytical model was developed which addressed this issue but was shown to be problematic in developing state probabilities for more complicated scenarios. Guard channels analysis, which is normally used to give priority to handover traffic in mobile networks, was employed as a practical solution to the observed handover hysteresis. Overall, using different analytical techniques as well as simulation, the results of this work form an important part in the design and development of future mobile systems
Towards Deterministic Communications in 6G Networks: State of the Art, Open Challenges and the Way Forward
Over the last decade, society and industries are undergoing rapid
digitization that is expected to lead to the evolution of the cyber-physical
continuum. End-to-end deterministic communications infrastructure is the
essential glue that will bridge the digital and physical worlds of the
continuum. We describe the state of the art and open challenges with respect to
contemporary deterministic communications and compute technologies: 3GPP 5G,
IEEE Time-Sensitive Networking, IETF DetNet, OPC UA as well as edge computing.
While these technologies represent significant technological advancements
towards networking Cyber-Physical Systems (CPS), we argue in this paper that
they rather represent a first generation of systems which are still limited in
different dimensions. In contrast, realizing future deterministic communication
systems requires, firstly, seamless convergence between these technologies and,
secondly, scalability to support heterogeneous (time-varying requirements)
arising from diverse CPS applications. In addition, future deterministic
communication networks will have to provide such characteristics end-to-end,
which for CPS refers to the entire communication and computation loop, from
sensors to actuators. In this paper, we discuss the state of the art regarding
the main challenges towards these goals: predictability, end-to-end technology
integration, end-to-end security, and scalable vertical application
interfacing. We then present our vision regarding viable approaches and
technological enablers to overcome these four central challenges. Key
approaches to leverage in that regard are 6G system evolutions, wireless
friendly integration of 6G into TSN and DetNet, novel end-to-end security
approaches, efficient edge-cloud integrations, data-driven approaches for
stochastic characterization and prediction, as well as leveraging digital twins
towards system awareness.Comment: 22 pages, 8 figure
Recommended from our members
Capacity Planning for Heterogeneous Patient Populations in Primary Care and Specialty Networks
Access to primary care has a direct impact on morbidity and mortality, and is strongly influenced by indirect waiting time: the delay between the requested and allotted appointment day. Our models describe the heterogeneous appointment seeking patterns of a primary care patient panel using stochastic processes parameterized to reflect the diversity of primary care visit rates in the US. For capacity planning, we estimate the distribution of daily appointments, and show that the distribution variability can be reduced by heuristics that use patient flexibility regarding the day of the appointment. For delays, we demonstrate that in a first-come, first-served system, patients who need the most frequent appointments suffer the greatest delays, motivating the need to reserve slots for high-visit patient classes. To further understand the inequity in delay, we model the primary care appointment system as a Discrete-Time Markov Chain. We derive an analytical expression for delay in terms of the patient’s probability of daily visit. We show that conditions for monotone mapping of the probability of visit to delay are intractable and give numerical results that support monotonicity. In our last chapter, we expand our scope to include specialty care networks. Using patient-level longitudinal data from the Medical Expenditure Panel Survey, we model the sequence of appointments with multiple specialty types and the time intervals between such appointments as a Markov Renewal Process (MRP). We use comorbidity count to model patient heterogeneity and extract the MRP parameters for each patient subgroup. Next, we adapt the steady state results to provide an analytical expression of the expected appointment fill-rate by specialty and patient subgroups. Our analytical results demonstrate that patients with higher comorbidity count typically have a lower fill-rate because of shorter lead time between appointments thereby necessitating either overtime or reserved slots to ensure timely access. We further simulate appointment seeking patterns of a nationally representative panel of patients in the specialty network and estimate the distribution of daily appointment requests for each specialty. Similar to the primary care case, we show that heuristics that leverage patient flexibility regarding the day of the appointment can reduce variability in appointment requests for each specialty
Recommended from our members
Personal mobile grids with a honeybee inspired resource scheduler
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The overall aim of the thesis has been to introduce Personal Mobile Grids (PMGrids)
as a novel paradigm in grid computing that scales grid infrastructures to mobile devices and extends grid entities to individual personal users. In this thesis, architectural designs as well as simulation models for PM-Grids are developed.
The core of any grid system is its resource scheduler. However, virtually all current conventional grid schedulers do not address the non-clairvoyant scheduling problem, where job information is not available before the end of execution. Therefore, this thesis proposes a honeybee inspired resource scheduling heuristic for PM-Grids (HoPe) incorporating a radical approach to grid resource scheduling to tackle this problem. A detailed design and implementation of HoPe with a decentralised self-management and adaptive policy are initiated.
Among the other main contributions are a comprehensive taxonomy of grid systems as well as a detailed analysis of the honeybee colony and its nectar acquisition process (NAP), from the resource scheduling perspective, which have not been presented in any previous work, to the best of our knowledge.
PM-Grid designs and HoPe implementation were evaluated thoroughly through a strictly controlled empirical evaluation framework with a well-established heuristic in high throughput computing, the opportunistic scheduling heuristic (OSH), as a benchmark algorithm. Comparisons with optimal values and worst bounds are conducted to gain a clear insight into HoPe behaviour, in terms of stability, throughput, turnaround time and speedup, under different running conditions of number of jobs and grid scales.
Experimental results demonstrate the superiority of HoPe performance where it
has successfully maintained optimum stability and throughput in more than 95%
of the experiments, with HoPe achieving three times better than the OSH under
extremely heavy loads. Regarding the turnaround time and speedup, HoPe has
effectively achieved less than 50% of the turnaround time incurred by the OSH, while doubling its speedup in more than 60% of the experiments.
These results indicate the potential of both PM-Grids and HoPe in realising futuristic grid visions. Therefore considering the deployment of PM-Grids in real life scenarios and the utilisation of HoPe in other parallel processing and high throughput computing systems are recommended
Modeling and Control of Server-based Systems
When deploying networked computing-based applications, proper resource management of the server-side resources is essential for maintaining quality of service and cost efficiency. The work presented in this thesis is based on six papers, all investigating problems that relate to resource management of server-based systems. Using a queueing system approach we model the performance of a database system being subjected to write-heavy traffic. We then evaluate the model using simulations and validate that it accurately mimics the behavior of a real test bed. In collaboration with Ericsson we model and design a per-request admission control scheme for a Mobile Service Support System (MSS). The model is then validated and the control scheme is evaluated in a test bed. Also, we investigate the feasibility to estimate the state of a server in an MSS using an event-based Extended Kalman Filter. In the brownout paradigm of server resource management, the amount of work required to serve a client is adjusted to compensate for temporary resource shortages. In this thesis we investigate how to perform load balancing over self-adaptive server instances. The load balancing schemes are evaluated in both simulations and test bed experiments. Further, we investigate how to employ delay-compensated feedback control to automatically adjust the amount of resources to deploy to a cloud application in the presence of a large, stochastic delay. The delay-compensated control scheme is evaluated in simulations and the conclusion is that it can be made fast and responsive compared to an industry-standard solution
- …