Distributed multimedia applications with quality of service requirements that must be guaranteed by the underlying network are evolving at a fast pace. Resource reservation protocols are essential to enable efficient resource management in internetworks. We survey existing resource reservation protocols and the reservation styles they support. Current protocols do not permit different reservati...

A bstract. T he periodic behavior of a particu lar class of dynamical sys tems , the cellular automata (CA) , is studied . A lar ge class of CAs is defined , (containing both addit ive and nonadditive CAs) in terms of the sensi tivity of t he local rule on which the CA is based . For this class , the set of configurations which ente r a cycle afte r a finit e number of it erat ions is complete ...

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry necessarily entails non associativity, hence computing rules are defined in order to deal with non associativity. We study in details computing rules, which we e...

This paper focuses on the density of the minimal subspaces generated by a class of discrete linear Hamiltonian systems. It is shown that the minimal subspace is densely defined if and only if the maximal subspace is an operator; that is, it is single valued. In addition, it is shown that, if the interval on which the systems are defined is bounded from below or above, then the minimal subspace ...

Perfect (v,K, 1) difference families ((v,K, 1)-PDF in short, and (v, k, 1)-PDF when K = {k}) were introduced by Ge et al. for their useful application to the construction of properly centered permutations, which can be used to construct new radar arrays. Some works had been done on the existences of (v, k, 1)-PDFs, while little is known when |K| ≥ 2 except for partial results by Ge et al. In 19...

Cellular auto mata (CA) models have historically included only a bounded amo unt of state information. Giving cells the ab ility to send and receive a possibly unb ounded number of finite size messages creates three possible CA programming models: bounded state only, unb ounded messaging only, and both bounded state and un bound ed messaging. It is shown t hat the lat ter , alt hough computat i...