We propose a model of price formation in Double Auction markets which employs the strong simplifying assumption that agents neglect strategic feedback effects and regard themselves as playing a Game against Nature. Agents otherwise are strict expected utihty maximizers employing Bayesian updating procedures. We prove the optimality of simple (‘aggressive reservation price’) strategies in our ge...

In this paper we investigate filesystem support for continuous media on the Java language. We describe a prototype implementation on a Real-Time Java Server developed as an application-level server on the Real-Time Mach microkernel environment. Java virtual machine has been extended to support filesystem bandwidth reservation facilities existing on Real-Time Mach. Such facilities allow continuo...

User Services Assistant (USA) is a novel reactive QoS agent that provides facilities for managing user to user QoS in Internet environments. By being reactive, it overcomes the problems associated with QoS management schemes that have been proposed to date, such as the mapping of the QoS parameters to end system parameters, and pre-determining the optimum way of degrading/upgrading the QoS. How...

Dynamic behavior of resources is a non-negligible feature in grid system, and most research efforts on advance reservation cannot effectively deal with the negative effect resulted from the dynamic feature. In this paper, a new grid system architecture using resource pool is proposed firstly. Theoretical analysis demonstrates that resource pool can well adapt to dynamic behavior of resources. S...

It is becoming increasingly likely that in the future most vehicles will be semi-autonomous with communication capabilities and will possess diverse speed capabilities. The aim of this paper is to describe the creation of an integrated traffic simulation system for such settings. While behaviours such as crossing, overtaking, etc. are trivially exhibited, the implemented system includes an inte...

We consider cellular mobile systems where in order to limit hando blocking probability, admission control is applied to new call requests and capacity is reserved for future hando attempts. We show that due to this advance reservation the achievable e ciency of the system has an upper bound even if no constraint is speci ed on the blocking probability of new call requests. As a reference case, ...