560 research outputs found
Architecture for Mobile Heterogeneous Multi Domain Networks
Multi domain networks can be used in several scenarios including military, enterprize networks, emergency networks and many other cases. In such networks, each domain might be under its own administration. Therefore, the cooperation among domains is conditioned by individual domain policies regarding sharing information, such as network topology, connectivity, mobility, security, various service availability and so on. We propose a new architecture for Heterogeneous Multi Domain (HMD) networks, in which one the operations are subject to specific domain policies. We propose a hierarchical architecture, with an infrastructure of gateways at highest-control level that enables policy based interconnection, mobility and other services among domains. Gateways are responsible for translation among different communication protocols, including routing, signalling, and security. Besides the architecture, we discuss in more details the mobility and adaptive capacity of services in HMD. We discuss the HMD scalability and other advantages compared to existing architectural and mobility solutions. Furthermore, we analyze the dynamic availability at the control level of the hierarchy
Queueing Networks for Vertical Handover
PhDIt 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 a mix of cellular networks (GSM/GPRS and WCDMA) and
wireless local area networks (WLANs) to provide complementary features in terms
of coverage, capacity and mobility support. If cellular/ WLAN interworking is to be
the basis for a heterogeneous network then the analysis of complex handover traffic
rates in the system (especially vertical handover) is one of the most essential issues to
be considered.
This thesis describes the application of queueing-network theory to the modelling of
this heterogeneous wireless overlay system. A network of queues (or queueing
network) is a powerful mathematical tool in the performance evaluation of many
large-scale engineering systems. It has been used in the modelling of hierarchically
structured cellular wireless networks with much success, including queueing
network modelling in the study of cellular/ WLAN interworking systems. In the
process of queueing network modelling, obtaining the network topology of a system
is usually the first step in the construction of a good model, but this topology
analysis has never before been used in the handover traffic study in heterogeneous
overlay wireless networks. In this thesis, a new topology scheme to facilitate the
analysis of handover traffic is proposed.
The structural similarity between hierarchical cellular structure and heterogeneous
wireless overlay networks is also compared. By replacing the microcells with
WLANs in a hierarchical structure, the interworking system is modelled as an open
network of Erlang loss systems and with the new topology, the performance
measures of blocking probabilities and dropping probabilities can be determined.
Both homogeneous and non-homogeneous traffic have been considered, circuit
switched and packet-switched. Example scenarios have been used to validate the
models, the numerical results showing clear agreement with the known validation
scenarios
Recommended from our members
Optimization for Urban Mobility Systems
In the recent decades, new modes of transportation have been developed due to urbanization, highly dense population, and technological advancement. As a result, design and operation of urban transportation have become increasingly important to better utilize the resources and efficiently meet demand. This dissertation was motivated by two problems on optimizing design and control of urban transportation. In the first one, we consider a problem of dynamically matching heterogeneous market parcitipants so as to maximize the total number of matching, which was motivated by practices of ride-sharing platforms. In the other problem, we study efficient design of elevator zoning system in high-rises with uncertainty in customer batching.In Chapter 1, we consider a multiperiod stochastic optimization of a market that matches heterogeneous and impatient agents. The model was mainly motivated from carpooling products run by ride-sharing platforms such as Uber and Lyft, and kidney exchange market, where market participants are heterogeneous in terms of how likely they can be matched with others. In the case of a ride-sharing platform, one of the key operational decisions for carpooling is to efficiently match riders and clear the market in a timely manner. In doing so, the platform needs to take into account the heterogeneity of riders in terms of their trip types(e.g origin-destination pair) and different matching compatibility. For example, some customers may request rides within San Francisco, while others may request rides from San Francisco to outside the city. Since picking up and dropping off a customer within the city can be done within relatively short amount of time, those who want to travel within the city can be matched with any other riders for carpooling. However, the destinations of those who want to travel to outside the city may be very different, and in order to maintain customers' additional transit time due to carpooling, it is likely that they can be only matched with those who want to travel within the city. In the case of kidney exchange where market participants arrive in the form of patient-donor pair, pairs with donor who can donate her kidney to most of patients (for example, blood type O) and patient who can get kidney from most of donors (for example, blood type AB) can be easily matched to other pairs. The opposite case would be hard-to-match pair that is incompatible for matching with most of other pairs. Our model is an abstraction of these two motivating examples, and considers two types of agents: easy-to-match agents that can be matched with either type of agents, and hard-to-match agents that can be only matched with easy-to-match ones. We first formulate a dynamic program to solve for optimal matching decisions over infinite time horizon in a discrete time setting, and characterize structure of optimal stationary policies. Inspired by practices in kidney exchange where the market is cleared for every fixed time interval, we connect the discrete time model to a continuous time setting by investigating the effect of the length of matching intervals on the matching performance. Results from numerical experiments indicate certain patterns in the relationship between the length of matching intervals and the maximum number of matching achieved, and provides valuable insights for future direction of research. In Chapter 2, we consider a zoning problem for elevator dispatching systems in high-rises. In practice, zoning is frequently used to improve efficiency of elevator systems. The idea of zoning is to prevent different elevators from stopping at common floors, which may result in long service times of elevators and thus long waiting times of customers. Our goal is to provide a mathematical framework that can help a system planner decide optimal zoning design with some performance guarantee. To this end, we focus on uppeak traffic situation during morning rush hour, which is in general the heaviest traffic during the day. The performance in the uppeak traffic situation can be considered as the system's capacity, because if the system can handle uppeak traffic well, it can also serve other types of traffic with good performance. Thus, the performance measure in the uppeak traffic situation can be used as a metric to choose the optimal zoning configuration. One of the components that complicate the problem is customer batching, on which the system may not have a control. In view of this, we formulate an adversarial optimization problem that can measure the system performance of different zoning decisions. By considering the heaviest traffic situation of the day and using the adversarial framework, we provide a model that can be used for capacity planning of elevator systems. We formulate mixed-integer linear program(MILP)s to find the optimal zoning configuration. To solve the MILPs, we show that we can use simple greedy algorithms and solve smaller linear programs. We also provide a few illustrative examples as well as numerical experiments to verify the theoretical results and obtain insights for further analysis
Operational Analysis Revisited: Error Measure Limits of Assumptions
The assumptions used to develop operational analysiscomputer performance measures, such as number of jobs at adevice or response times, are stated in terms of the data itself,rather than the underlying system which produces the data. Inspite of claims of validity and as an aid in introducing queueingtheory in teaching, little has been written about operationalanalysis in the past ten years. Accuracy of operational analysisperformance measures depend on data behavior assumptionswhich can be validated with data based error measures.Increased soundness of the operational analysis approach may beobtained by determining the limits of assumption errors as thetime period of observation increases. Part I of this paper is areview of operational analysis and addresses some of the previousconcerns with its approach. Part II develops furtherunderstanding of operational analysis assumption errors byexamining their limits. Limits are found for the assumptionerrors of job flow balance, homogeneous arrivals andhomogenous services. While the job flow balance assumptionerror measure is shown to approach zero over time, thehomogeneity assumption error measures, in general, do not
Recommended from our members
Performance and Security Trade-offs in High-Speed Networks. An investigation into the performance and security modelling and evaluation of high-speed networks based on the quantitative analysis and experimentation of queueing networks and generalised stochastic Petri nets.
Most used security mechanisms in high-speed networks have been adopted without adequate quantification of their impact on performance degradation. Appropriate quantitative network models may be employed for the evaluation and prediction of ¿optimal¿ performance vs. security trade-offs. Several quantitative models introduced in the literature are based on queueing networks (QNs) and generalised stochastic Petri nets (GSPNs). However, these models do not take into consideration Performance Engineering Principles (PEPs) and the adverse impact of traffic burstiness and security protocols on performance.
The contributions of this thesis are based on the development of an effective quantitative methodology for the analysis of arbitrary QN models and GSPNs through discrete-event simulation (DES) and extended applications into performance vs. security trade-offs involving infrastructure and infrastructure-less high-speed networks under bursty traffic conditions. Specifically, investigations are carried out focusing, for illustration purposes, on high-speed network routers subject to Access Control List (ACL) and also Robotic Ad Hoc Networks (RANETs) with Wired Equivalent Privacy (WEP) and Selective Security (SS) protocols, respectively. The Generalised Exponential (GE) distribution is used to model inter-arrival and service times at each node in order to capture the traffic burstiness of the network and predict pessimistic ¿upper bounds¿ of network performance.
In the context of a router with ACL mechanism representing an infrastructure network node, performance degradation is caused due to high-speed incoming traffic in conjunction with ACL security computations making the router a bottleneck in the network. To quantify and predict the trade-off of this degradation, the proposed quantitative methodology employs a suitable QN model consisting of two queues connected in a tandem configuration. These queues have single or quad-core CPUs with multiple-classes and correspond to a security processing node and a transmission forwarding node. First-Come-First-Served (FCFS) and Head-of-the-Line (HoL) are the adopted service disciplines together with Complete Buffer Sharing (CBS) and Partial Buffer Sharing (PBS) buffer management schemes. The mean response time and packet loss probability at each queue are employed as typical performance metrics. Numerical experiments are carried out, based on DES, in order to establish a balanced trade-off between security and performance towards the design and development of efficient router architectures under bursty traffic conditions.
The proposed methodology is also applied into the evaluation of performance vs. security trade-offs of robotic ad hoc networks (RANETs) with mobility subject to Wired Equivalent Privacy (WEP) and Selective Security (SS) protocols. WEP protocol is engaged to provide confidentiality and integrity to exchanged data amongst robotic nodes of a RANET and thus, to prevent data capturing by unauthorised users. WEP security mechanisms in RANETs, as infrastructure-less networks, are performed at each individual robotic node subject to traffic burstiness as well as nodal mobility. In this context, the proposed quantitative methodology is extended to incorporate an open QN model of a RANET with Gated queues (G-Queues), arbitrary topology and multiple classes of data packets with FCFS and HoL disciplines under bursty arrival traffic flows characterised by an Interrupted Compound Poisson Process (ICPP). SS is included in the Gated-QN (G-QN) model in order to establish an ¿optimal¿ performance vs. security trade-off. For this purpose, PEPs, such as the provision of multiple classes with HoL priorities and the availability of dual CPUs, are complemented by the inclusion of robot¿s mobility, enabling realistic decisions in mitigating the performance of mobile robotic nodes in the presence of security. The mean marginal end-to-end delay was adopted as the performance metric that gives indication on the security improvement.
The proposed quantitative methodology is further enhanced by formulating an advanced hybrid framework for capturing ¿optimal¿ performance vs. security trade-offs for each node of a RANET by taking more explicitly into consideration security control and battery life. Specifically, each robotic node is represented by a hybrid Gated GSPN (G-GSPN) and a QN model. In this context, the G-GSPN incorporates bursty multiple class traffic flows, nodal mobility, security processing and control whilst the QN model has, generally, an arbitrary configuration with finite capacity channel queues reflecting ¿intra¿-robot (component-to-component) communication and ¿inter¿-robot transmissions. Two theoretical case studies from the literature are adapted to illustrate the utility of the QN towards modelling ¿intra¿ and ¿inter¿ robot communications. Extensions of the combined performance and security metrics (CPSMs) proposed in the literature are suggested to facilitate investigating and optimising RANET¿s performance vs. security trade-offs.
This framework has a promising potential modelling more meaningfully and explicitly the behaviour of security processing and control mechanisms as well as capturing the robot¿s heterogeneity (in terms of the robot architecture and application/task context) in the near future (c.f. [1]. Moreover, this framework should enable testing robot¿s configurations during design and development stages of RANETs as well as modifying and tuning existing configurations of RANETs towards enhanced ¿optimal¿ performance and security trade-offs.Ministry of Higher Education in Libya and the Libyan Cultural Attaché bureau in Londo
Size-Based Routing Policies: Non-Asymptotic Analysis and Design of Decentralized Systems
Size-based routing policies are known to perform well when the variance of the distribution of the job size is very high. We consider two size-based policies in this paper: Task Assignment with Guessing Size (TAGS) and Size Interval Task Assignment (SITA). The latter assumes that the size of jobs is known, whereas the former does not. Recently, it has been shown by our previous work that when the ratio of the largest to shortest job tends to infinity and the system load is fixed and low, the average waiting time of SITA is, at most, two times less than that of TAGS. In this article, we first analyze the ratio between the mean waiting time of TAGS and the mean waiting time of SITA in a non-asymptotic regime, and we show that for two servers, and when the job size distribution is Bounded Pareto with parameter α=1, this ratio is unbounded from above. We then consider a system with an arbitrary number of servers and we compare the mean waiting time of TAGS with that of Size Interval Task Assignment with Equal load (SITA-E), which is a SITA policy where the load of all the servers are equal. We show that in the light traffic regime, the performance ratio under consideration is unbounded from above when (i) the job size distribution is Bounded Pareto with parameter α=1 and an arbitrary number of servers as well as (ii) for Bounded Pareto distributed job sizes with α∈(0,2)\{1}
and the number of servers tends to infinity. Finally, we use the result of our previous work to show how to design decentralized systems with quality of service constraints.Josu Doncel has received funding from the Department of Education of the Basque Government through the Consolidated Research Group MATHMODE (IT1294-19), from the Marie Sklodowska-Curie grant agreement No 777778, and from the Spanish Ministry of Science and Innovation with reference PID2019-108111RB-I00 (FEDER/AEI). Eitan Bachmat’s work was supported by the German Science Foundation (DFG) through the grant, Airplane Boarding, (JA 2311/3-1)
- …