10,322 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
Hierarchical self-organization of non-cooperating individuals
Hierarchy is one of the most conspicuous features of numerous natural,
technological and social systems. The underlying structures are typically
complex and their most relevant organizational principle is the ordering of the
ties among the units they are made of according to a network displaying
hierarchical features. In spite of the abundant presence of hierarchy no
quantitative theoretical interpretation of the origins of a multi-level,
knowledge-based social network exists. Here we introduce an approach which is
capable of reproducing the emergence of a multi-levelled network structure
based on the plausible assumption that the individuals (representing the nodes
of the network) can make the right estimate about the state of their changing
environment to a varying degree. Our model accounts for a fundamental feature
of knowledge-based organizations: the less capable individuals tend to follow
those who are better at solving the problems they all face. We find that
relatively simple rules lead to hierarchical self-organization and the specific
structures we obtain possess the two, perhaps most important features of
complex systems: a simultaneous presence of adaptability and stability. In
addition, the performance (success score) of the emerging networks is
significantly higher than the average expected score of the individuals without
letting them copy the decisions of the others. The results of our calculations
are in agreement with a related experiment and can be useful from the point of
designing the optimal conditions for constructing a given complex social
structure as well as understanding the hierarchical organization of such
biological structures of major importance as the regulatory pathways or the
dynamics of neural networks.Comment: Supplementary videos are to be found at
http://hal.elte.hu/~nepusz/research/supplementary/hierarchy
Pilot interaction with automated airborne decision making systems
An investigation was made of interaction between a human pilot and automated on-board decision making systems. Research was initiated on the topic of pilot problem solving in automated and semi-automated flight management systems and attempts were made to develop a model of human decision making in a multi-task situation. A study was made of allocation of responsibility between human and computer, and discussed were various pilot performance parameters with varying degrees of automation. Optimal allocation of responsibility between human and computer was considered and some theoretical results found in the literature were presented. The pilot as a problem solver was discussed. Finally the design of displays, controls, procedures, and computer aids for problem solving tasks in automated and semi-automated systems was considered
Stochastic order results and equilibrium joining rules for the Bernoulli Feedback Queue
We consider customer joining behaviour for a system that consists of a FCFS queue with Bernoulli feedback. A consequence of the feedback characteristic is that the sojourn time of a customer already in the system depends on the joining decisions taken by future arrivals to the system. By establishing stochastic order results for coupled versions of the system, we establish the existence of homogeneous Nash equilibrium joining policies for both single and multiple customer types which are distinguished through distinct quality of service preference parameters. Further, it is shown that for a single customer type, the homogeneous policy is unique
- âŠ