VC merging allows many routes to be mapped to the same VC label, thereby providing a scalable mapping method that can support thousands of edge routers. VC merging requires reassembly buffers so that cells belonging to different packets intended for the same destination do not interleave with each other. This document investigates the impact of VC merging on the additional buffer required for t...

Mounting evidence of wildlife population gains from targeted conservation practices has prompted the need to develop and evaluate practices that are integrated into production agriculture systems and targeted toward specific habitat objectives. However, effectiveness of targeted conservation actions across broader landscapes is poorly understood. We evaluated multiregion, multispecies avian den...

Riparian forest buffers can improve stream water quality, provided they intercept and remove contaminants from surface runoff and/or shallow groundwater. Soils, topography, hydrology, and surficial geology detemine the capability of forest buffers to intercept and treat these flows. This paper describes landscape analysis techniques for identifying and mapping locations where forest buffers can...

We analyze a model of heavily utilized bottleneck buffer in this paper. We show that the nature of traffic leaving the buffer is determined by the buffer length/number of TCPs ratio. If this ratio is above a critical value, TCP can stay in the congestion avoidance phase and it can generate periodic traffic after a transient period. If the ratio is below a critical value then the congestion wind...

Matthew J. Helmers, Department of Agricultural and Biosystems Engineering, Iowa State University Thomas M. Isenhart, Department of Natural Resource Ecology and Management, Iowa State University Michael G. Dosskey, USDA Forest Service, National Agroforestry Center, Lincoln, Nebraska Seth M. Dabney, USDA-ARS National Sedimentation Laboratory, Oxford, Mississippi Jeffrey S. Strock, Department of S...

The sorting buffers problem is motivated by many applications in manufacturing processes and computer science, among them car-painting and file servers architecture. The input is a sequence of items of various types. All the items must be processed, one by one, by a service station. We are given a random-access sorting buffer with a limited capacity. Whenever a new item arrives it may be moved ...

All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algorithm. In particular, the goal is to make sure that when a link is congested, it is busy 100% of the time; which is equivalent to making sure its buffer never goes empty. A widely used rule-of-thumb states that each link ne...

We investigate experimentally several routing algorithms for asynchronous deflection networks, i.e., ones that operate in an unslotted manner. We determine the impact of an extra input buffer space on the quality of routing decisions. Finally, we compare the performance of asynchronous and synchronous deflection networks.

We propose a method that robustly combines color and feature buffers to denoise Monte Carlo renderings. On one hand, feature buffers, such as per pixel normals, textures, or depth, are effective in determining denoising filters because features are highly correlated with rendered images. Filters based solely on features, however, are prone to blurring image details that are not well represented...

Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Correctness means that our encodings preserve and reflect the observations of mayand must-convergence, and as a consequence also yields soundness of the encodings...