Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

Stabilizing an uncertain production system

Consider a production system that consists ofm machines each of which can produce parts ofn types. When machinek is used, it produces a part of typei with probabilityp _ki . Requests arrive for parts, one at a time. With probability _i an arriving request is for a part of typei. The requests must be served without waiting. Thus, if a requested part is not available, it must be produced. We find necessary and sufficient conditions for the existence of a strategy (a choice of the machines to be used) which makes the inventory of parts stable and we provide such a strategy.Two variations of this model are also considered: the case of batch arrivals of requests, and that of a system where the requests can be queued.     

An analysis of managerialism and performance in English and Welsh male prisons

This paper fills a noticeable gap in the current economic and penology literature by proposing new performance-enhancing policies based on an efficiency analysis of a sample of male prisons in England and Wales over the period 2009/10. In addition, we advance the empirical literature by integrating the managerialism of four strategic functions of prisons, employment and accommodation, capacity utilization, quality of life in prison and the rehabilitation and re-offending of prisoners. We find that by estimating multiple models focussing on these different areas some prisons are more efficient than other establishments. In terms of policy, it is therefore necessary to consider not just an overall performance metric for individual prisons, as currently undertaken annually by the UK Ministry of Justice, but to look into the administration and managerialism of their main functions in both a business and public policy perspective. Indeed, it is further necessary to view prisons together and not as single entities, so as to obtain a best practice frontier for the different operations that management undertakes in English and Welsh prisons.     

On string topology of classifying spaces

Let G be a compact Lie group. By work of Chataur and Menichi, the homology of the space of free loops in the classifying space of G is known to be the value on the circle in a homological conformal field theory. This means in particular that it admits operations parameterized by homology classes of classifying spaces of diffeomorphism groups of surfaces. Here we present a radical extension of this result, giving a new construction in which diffeomorphisms are replaced with homotopy equivalences, and surfaces with boundary are replaced with arbitrary spaces homotopy equivalent to finite graphs. The result is a novel kind of field theory which is related to both the diffeomorphism groups of surfaces and the automorphism groups of free groups with boundaries. Our work shows that the algebraic structures in string topology of classifying spaces can be brought into line with, and in fact far exceed, those available in string topology of manifolds. For simplicity, we restrict to the characteristic 2 case. The generalization to arbitrary characteristic will be addressed in a subsequent paper.