A Two-Tiered On-Line Server-Side Bandwidth Reservation Framework for the Real-Time Delivery of Multiple Video Streams

The advent of virtualization and cloud computing technologies necessitates the development of effective mechanisms for the estimation and reservation of resources needed by content providers to deliver large numbers of video-on-demand (VOD) streams through the cloud. Unfortunately, capacity planning for the QoS-constrained delivery of a large number of VOD streams is inherently difficult as VBR encoding schemes exhibit significant bandwidth variability. In this paper, we present a novel resource management scheme to make such allocation decisions using a mixture of per-stream reservations and an aggregate reservation, shared across all streams to accommodate peak demands. The shared reservation provides capacity slack that enables statistical multiplexing of peak rates, while assuring analytically bounded frame-drop probabilities, which can be adjusted by trading off buffer space (and consequently delay) and bandwidth. Our two-tiered bandwidth allocation scheme enables the delivery of any set of streams with less bandwidth (or equivalently with higher link utilization) than state-of-the-art deterministic smoothing approaches. The algorithm underlying our proposed frame-work uses three per-stream parameters and is linear in the number of servers, making it particularly well suited for use in an on-line setting. We present results from extensive trace-driven simulations, which confirm the efficiency of our scheme especially for small buffer sizes and delay bounds, and which underscore the significant realizable bandwidth savings, typically yielding losses that are an order of magnitude or more below our analytically derived bounds.

Enhanced convolution approach for CAC in ATM networks, an analytical study and implementation

The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks. In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees. Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay. Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations. To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios. Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of traffic (CLRj), an expression for the CLRj evaluation is also presented. We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.

Does the choice of neighbourhood supermarket access measure influence associations with individual-level fruit and vegetable consumption? A case study from Glasgow

Background
Previous studies have provided mixed evidence with regards to associations between food store access and dietary outcomes. This study examines the most commonly applied measures of locational access to assess whether associations between supermarket access and fruit and vegetable consumption are affected by the choice of access measure and scale.

Method
Supermarket location data from Glasgow, UK (n = 119), and fruit and vegetable intake data from the 'Health and Well-Being' Survey (n = 1041) were used to compare various measures of locational access. These exposure variables included proximity estimates (with different points-of-origin used to vary levels of aggregation) and density measures using three approaches (Euclidean and road network buffers and Kernel density estimation) at distances ranging from 0.4 km to 5 km. Further analysis was conducted to assess the impact of using smaller buffer sizes for individuals who did not own a car. Associations between these multiple access measures and fruit and vegetable consumption were estimated using linear regression models.

Results
Levels of spatial aggregation did not impact on the proximity estimates. Counts of supermarkets within Euclidean buffers were associated with fruit and vegetable consumption at 1 km, 2 km and 3 km, and for our road network buffers at 2 km, 3 km, and 4 km. Kernel density estimates provided the strongest associations and were significant at a distance of 2 km, 3 km, 4 km and 5 km. Presence of a supermarket within 0.4 km of road network distance from where people lived was positively associated with fruit consumption amongst those without a car (coef. 0.657; s.e. 0.247; p0.008).

Conclusions
The associations between locational access to supermarkets and individual-level dietary behaviour are sensitive to the method by which the food environment variable is captured. Care needs to be taken to ensure robust and conceptually appropriate measures of access are used and these should be grounded in a clear a priori reasoning.

Identifying destination distances that support walking trips in local neighborhoods

When examining associations between local destinations and walking it is common to count local destinations using street network buffers measured at various distances to mitigate spatial data aggregation issues caused by scale and the Modifiable Areal Unit Problem. However, it remains unclear whether a particular buffer size is preferred since large buffers may mask important effects whilst small buffers may not accurately represent a neighborhood area. Furthermore, the use of various buffer distances in measuring destination counts does not yield specific information on distances where destinations could be placed in order to increase levels of walking. This paper extends current methods to address these issues by using a new method to define network buffers to identify threshold distances for walking to seven destination types using multilevel models. Donut-buffers are introduced as a method of counting destinations between distances of 401. m-800. m and 801. m-1200. m which are compared to standard network buffers at distances of 400. m, 800. m and 1200. m respectively. We found that destinations within 401. m-800. m could be responsible for associations found at a network buffer of 1200. m. Specifically, the odds of walking increased when local food outlets including supermarkets, cafés/takeaway stores, and small food stores, were located within 401. m-800. m but not 801. m-1200. m, suggesting that these destinations encourage walking when placed at 401. m-800. m away. Consequently we argue that donut-buffers offer greater specificity than standard network buffers for geographic measurement of destinations. This warrants further investigation to inform urban policy guidelines for designing walkable environments.

Optimización del proceso de empaque de BANAFRUTS S.A.S. desde el punto de vista de la Teoría de Restricciones

Como resultado de la Misión Empresarial Caribe realizada por la Escuela de Administración de la Universidad del Rosario en abril de 2016, se realizó el presente documento donde se plantea una propuesta de mejora para el proceso de empaque de BanaFruts S.A.S. mediante el uso de teorías administrativas enfocadas a la gestión de calidad del producto como: Teoría de Restricciones, Kaizen y Cero defectos. La propuesta consiste en tener un proceso de control de calidad mucho menos repetitivo y más eficiente a lo largo del empaque del producto, donde solo los operarios de desmane se deberán encargar de definir cuáles bananos cumplen o no con las especificaciones de DOLE en esa etapa y además se aseguren de cumplir con nuevos límites de saturación de los frutos en las piscinas. Éstos se encontrarán en donde se alcanza el 90% de la capacidad de cada tanque. Para el de desmane estará a una altura de 0.54m; y para el de saneo estará a una altura de 0.49m. Así se actuará der manera preventiva y no reactiva como sucede actualmente, garantizando que los bananos no se lastimen y se reduzca el exceso de revisión a lo largo del proceso. Este cambio de gestión de calidad permitirá en primera instancia que los trabajadores en etapas diferentes a las de desmane se enfoquen en una sola tarea y no tengan que volver a verificar los aspectos de calidad del producto, seguido de un aumento de productividad en el procesamiento de los bananos por parte de éstos. Adicionalmente, se hace énfasis en la importancia de la mejora continua del proceso en general para asegurar un incremento gradual en la productividad. Para esto se propone un nuevo modelo de gestión de los recursos humanos donde los operarios serán más proactivos, tendrán una mayor participación en la identificación y solución de problemas y se encargarán de llevar a cabo sus labores de manera más eficiente. En este sentido, las acciones a tomar serán: seleccionar, organizar, limpiar y estandarizar. Finalmente, hay que estandarizar el proceso, es decir que debe existir una revisión continua para no permitir que los errores se repitan. Todas estas acciones estarán a cargo de un equipo líder llamado “Equipo BanaFruts”. Éste tendrá la responsabilidad de acompañar a los trabajadores en la realización de las actividades mencionadas y medir sus resultados.

Automatic Data Allocation and Buffer Management for Multi-GPU Machines

Multi-GPU machines are being increasingly used in high-performance computing. Each GPU in such a machine has its own memory and does not share the address space either with the host CPU or other GPUs. Hence, applications utilizing multiple GPUs have to manually allocate and manage data on each GPU. Existing works that propose to automate data allocations for GPUs have limitations and inefficiencies in terms of allocation sizes, exploiting reuse, transfer costs, and scalability. We propose a scalable and fully automatic data allocation and buffer management scheme for affine loop nests on multi-GPU machines. We call it the Bounding-Box-based Memory Manager (BBMM). BBMM can perform at runtime, during standard set operations like union, intersection, and difference, finding subset and superset relations on hyperrectangular regions of array data (bounding boxes). It uses these operations along with some compiler assistance to identify, allocate, and manage data required by applications in terms of disjoint bounding boxes. This allows it to (1) allocate exactly or nearly as much data as is required by computations running on each GPU, (2) efficiently track buffer allocations and hence maximize data reuse across tiles and minimize data transfer overhead, and (3) and as a result, maximize utilization of the combined memory on multi-GPU machines. BBMM can work with any choice of parallelizing transformations, computation placement, and scheduling schemes, whether static or dynamic. Experiments run on a four-GPU machine with various scientific programs showed that BBMM reduces data allocations on each GPU by up to 75% compared to current allocation schemes, yields performance of at least 88% of manually written code, and allows excellent weak scaling.

On the Relationship Between File Sizes, Transport Protocols, and Self-Similar Network Traffic

Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales self-similarity. In this paper, we examine a mechanism that gives rise to self-similar network traffic and present some of its performance implications. The mechanism we study is the transfer of files or messages whose size is drawn from a heavy-tailed distribution. We examine its effects through detailed transport-level simulations of multiple TCP streams in an internetwork. First, we show that in a "realistic" client/server network environment i.e., one with bounded resources and coupling among traffic sources competing for resources the degree to which file sizes are heavy-tailed can directly determine the degree of traffic self-similarity at the link level. We show that this causal relationship is not significantly affected by changes in network resources (bottleneck bandwidth and buffer capacity), network topology, the influence of cross-traffic, or the distribution of interarrival times. Second, we show that properties of the transport layer play an important role in preserving and modulating this relationship. In particular, the reliable transmission and flow control mechanisms of TCP (Reno, Tahoe, or Vegas) serve to maintain the long-range dependency structure induced by heavy-tailed file size distributions. In contrast, if a non-flow-controlled and unreliable (UDP-based) transport protocol is used, the resulting traffic shows little self-similar characteristics: although still bursty at short time scales, it has little long-range dependence. If flow-controlled, unreliable transport is employed, the degree of traffic self-similarity is positively correlated with the degree of throttling at the source. Third, in exploring the relationship between file sizes, transport protocols, and self-similarity, we are also able to show some of the performance implications of self-similarity. We present data on the relationship between traffic self-similarity and network performance as captured by performance measures including packet loss rate, retransmission rate, and queueing delay. Increased self-similarity, as expected, results in degradation of performance. Queueing delay, in particular, exhibits a drastic increase with increasing self-similarity. Throughput-related measures such as packet loss and retransmission rate, however, increase only gradually with increasing traffic self-similarity as long as reliable, flow-controlled transport protocol is used.

Variability in life-history and ecological traits is a buffer against extinction in mammals

Anthropogenic degradation of the world's ecosystems is leading to a widespread and accelerating loss of biodiversity. However, not all species respond equally to existing threats, raising the question: what makes a species more vulnerable to extinction? We propose that higher intraspecific variability may reduce the risk of extinction, as different individuals and populations within a species may respond differently to occurring threats. Supporting this prediction, our results show that mammalian species with more variable adult body masses, litter sizes, sexual maturity ages and population densities are less vulnerable to extinction. Our findings reveal the role of local variation among populations, particularly of large mammals, as a buffering mechanism against extinction, and emphasise the importance of considering trait variation in comparative analyses and conservation management.

Development of a sewerage infrastructure buffer assessment tool for local authorities

Urban expansion continues to encroach on existing or newly implemented sewerage infrastructure. In this context, legislation and guidelines, both national and international, provide limited direction to the amenity allocation of appropriate buffering distances for land use planners and infrastructure providers. A review of published literature suggests the dominant influences include topography, wind speed and direction, temperature, humidity, existing land uses and vegetation profiles. A statistical criteria review of these factors against six years of sewerage odour complaint data was undertaken to ascertain their influence and a complaint severity hierarchy was established. These hierarchical results suggested the main criteria were: topographical location, elevation relative to the odour source and wind speed. Establishing a justifiable criterion for buffer zone allocations will assist in analytically determining a basis for buffer separations and will assist planners and infrastructure designers in assessing lower impact sewerage infrastructure locations.

Catalyst-free growth and optical properties of vertically aligned ZnO Nanorod Arrays on Si substrates covered with thin buffer layers

Vertically aligned ZnO nanorods have been grown on silicon substrates pre-coated with thin, less than 10 nm, textured ZnO seeding layers via a vapor-solid mechanism. The ZnO seeding layers, which were essential for vertical alignment of ZnO nanorods without using any metal catalyst, were prepared by decomposing zinc acetate. The structure and the luminescence properties of the ZnO nanorods synthesized onto ZnO seeding layers were investigated and their morphologies were compared with those of single-crystalline GaN substrates and silicon substrates covered with sputtered ZnO flms. Patterning of ZnO seed layers using photolithography allowed the fabrication of patterned ZnO-nanorod arrays.

Preliminary development of a sewerage infrastructure buffer assessment tool for engineering risk and strategic land use planning

Urban expansion continues to encroach on once isolated sewerage infrastructure. In this context,legislation and guidelines provide limited direction to the amenity allocation of appropriate buffer distances for land use planners and infrastructure providers. Topography, wind speed and direction,temperature, humidity, existing land uses and vegetation profiles are some of the factors that require investigation in analytically determining a basis for buffer separations. This paper discusses the compilation and analysis of six years of Logan sewerage odour complaint data. Graphically,relationships between the complaints, topographical features and meteorological data are presented. Application of a buffer sizing process could assist planners and infrastructure designers alike, whilst automatically providing extra green spaces. Establishing a justifiable criterion for buffer zone allocations can only assist in promoting manageable growth for healthier and more sustainable communities.

Scheduling a flow-shop with combined buffer conditions

In this paper, No-Wait, No-Buffer, Limited-Buffer, and Infinite-Buffer conditions for the flow-shop problem (FSP) have been investigated. These four different buffer conditions have been combined to generate a new class of scheduling problem, which is significant for modelling many real-world scheduling problems. A new heuristic algorithm is developed to solve this strongly NP-hard problem. Detailed numerical implementations have been analysed and promising results have been achieved.