We introduce here a dynamic optode for buffer capacity sensing based on photochromic spiropyran (Sp). It represents the first reversible optical sensor for buffer capacity. Sensing was possible using a non-equilibrium readout mode, a novelty for photoswitchable optical ion sensors. In addition to the buffer capacity, the final point of each measurement sequence provides the pH of the solution.

We study the problem of statistical multiplexing of cell streams which have correlations at multiple time-scales. Each stream is modeled by a singularly perturbed Markovmodulated process with some state transitions occurring much more infrequently than others. We develop a set of large deviations results to estimate the buffer overflow probabilities in various asymptotic regimes in the buffer s...

Equilibrium behavior of a store-and-forward network node with finite buffer capacity is studied via a network-of-queues model. The positive acknowledgment protocol is explicitly modeled and consumes part of the buffer pool. The principal results are the buffer overflow probability, the mean delays, and the distribution of queue lengths as functions of the buffer capacity and traffic levels. Int...

We consider an AWGN channel with a transmitter powered by an energy harvesting source. The node is equipped with a finite energy buffer. Such a system can be modelled as a channel with side information (about energy in the energy buffer) causally known at the transmitter. The receiver may or may not have the side information. We prove that Markov energy management policies are sufficient to ach...

The performance of interconnected networks is highly depenht on the performance of the gateways. Since the finite storage capability of gateways effects the throughput it has to be considered for the analysis of interwnnected networks. Different configurations of networks are studied: i) Gateways and the channels of local area networks have no buffer capacity constraints, ii) Only gateways have...

In the paper a new efficient algorithm for the allocation of storage capacity in serial production lines is derived. The proposed method aims to find out the distribution of storage capacity between machines that minimizes the total buffer space assigned to the line satisfying a target production requirement. The algorithm relies on an iterative scheme that, starting from the minimal capacity r...

Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we s...

In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity k which can store up to k requests as it reads in the sequence. The goal is to reorder the r...