Some aspects of queueing and storage processes : a thesis in partial fulfilment of the requirements for the degree of Master of Science in Statistics at Massey University

In this study the nature of systems consisting of a single queue are first considered. Attention is then drawn to an analogy between such systems and storage systems. A development of the single queue viz queues with feedback is considered after first considering feedback processes in general. The behaviour of queues, some with feedback loops, combined into networks is then considered. Finally, the application of such networks to the analysis of interconnected reservoir systems is considered and the conclusion drawn that such analytic methods complement the more recently developed mathematical programming methods by providing analytic solutions for sub systems behaviour and thus guiding the development of a system model

Design of robust service operations using cybernetic principles and simulation

Information flows in a service organisation allow business units to co-ordinate their response to changes in the operating environment. Processes and interactions can be designed so that the right information flows to the right people, at the right time to make effective decisions regarding job priorities and allocation of limited resource. This paper develops an analysis framework and simulation approach to identify the internal information flows an organisation needs to “tune itself” for changing conditions, thus making itself more robust to uncertainties. The ideas are developed and illustrated through a case study with a major telecoms company.International Design Conference - DESIGN 201

Cooperation and Storage Tradeoffs in Power-Grids with Renewable Energy Resources

One of the most important challenges in smart grid systems is the integration of renewable energy resources into its design. In this work, two different techniques to mitigate the time varying and intermittent nature of renewable energy generation are considered. The first one is the use of storage, which smooths out the fluctuations in the renewable energy generation across time. The second technique is the concept of distributed generation combined with cooperation by exchanging energy among the distributed sources. This technique averages out the variation in energy production across space. This paper analyzes the trade-off between these two techniques. The problem is formulated as a stochastic optimization problem with the objective of minimizing the time average cost of energy exchange within the grid. First, an analytical model of the optimal cost is provided by investigating the steady state of the system for some specific scenarios. Then, an algorithm to solve the cost minimization problem using the technique of Lyapunov optimization is developed and results for the performance of the algorithm are provided. These results show that in the presence of limited storage devices, the grid can benefit greatly from cooperation, whereas in the presence of large storage capacity, cooperation does not yield much benefit. Further, it is observed that most of the gains from cooperation can be obtained by exchanging energy only among a few energy harvesting sources

A Hybrid Dynamic System Assessment Methodology for Multi-Modal Transportation-Electrification

In recent years, electrified transportation, be it in the form of buses, trains, or cars have become an emerging form of mobility. Electric vehicles (EVs), especially, are set to expand the amount of electric miles driven and energy consumed. Nevertheless, the question remains as to whether EVs will be technically feasible within infrastructure systems. Fundamentally, EVs interact with three interconnected systems: the (physical) transportation system, the electric power grid, and their supporting information systems. Coupling of the two physical systems essentially forms a nexus, the transportation-electricity nexus (TEN). This paper presents a hybrid dynamic system assessment methodology for multi-modal transportation-electrification. At its core, it utilizes a mathematical model which consists of a marked Petri-net model superimposed on the continuous time microscopic traffic dynamics and the electrical state evolution. The methodology consists of four steps: (1) establish the TEN structure; (2) establish the TEN behavior; (3) establish the TEN Intelligent Transportation-Energy System (ITES) decision-making; and (4) assess the TEN performance. In the presentation of the methodology, the Symmetrica test case is used throughout as an illustrative example. Consequently, values for several measures of performance are provided. This methodology is presented generically and may be used to assess the effects of transportation-electrification in any city or area; opening up possibilities for many future studies

Destination-based Routing and Circuit Allocation for Future Traffic Growth

Internet traffic continues to grow relentlessly, driven largely by increasingly high- \\ resolution video streaming, the increasing adoption of cloud computing, the emergence of 5G networks, and the ever-growing reach of social media and social networks. Existing networks use packet switching to route packets on a hop-by-hop basis from the source to the destination. However, they suffer from two shortcomings. First, in existing networks, packets are routed along a fixed shortest path using the Open Shortest Path First (OSPF) protocol or obliviously load-balanced across equal-cost paths using the Equal-Cost Multi-Path (ECMP) protocol. These routing protocols do not fully utilize the network capacity because they do not adapt to network congestions in their routing decisions. Second, although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, packets nonetheless have to be queued and routed at every hop in existing networks, which unnecessarily adds substantial delays and processing costs.In this thesis, we present two new approaches to overcome these shortcomings. First, we propose new backpressure-based routing algorithms which use only shortest-path routes when they are sufficient to accommodate the given traffic load, but will incrementally expand routing choices as needed to accommodate increasing traffic loads. This avoids the poor delay performance inherent in backpressure-based routing algorithms where packets may take long detours under light or moderate loads, and still retains the notable advantage, the network-wide optimal throughput, because packets are adaptively routed along less congested paths.Second, we propose a unified packet and circuit switched network in which the underlying optical transport is used to circuit-switch pass-through traffic by means of pre-established circuits. This avoids unnecessary packet queuing delays and processing costs at each hop. We propose a novel convex optimization framework based on a new destination-based multicommodity flow formulation for the allocation of circuits in such unified networks