In extending fast digital clock synchronization to the bounded-delay model, expected constant time Byzantine pulse resynchronization problem is investigated. this problem, synchronized state of system should not only be deterministically maintained but reached from arbitrary states with in presence faults. An intuitive geometric representation introduced, which classical approximate agreement, ...

Abstract We consider a scheduling problem where set of known jobs needs to be assigned given parallel resources such that the expected waiting time for uncertain emergency is kept as small possible. On basis structural insights from queuing theory, we develop deterministic policies reserve resource capacity in order increase likelihood availability whenever an job arrives. Applications this par...

In this paper, we describe a method for intrusion detection applied to real-time database systems. The novel idea pursued in this study is to exploit the real-time properties of data in intrusion detection. Data objects will be tagged with “time semantics” that capture expectations about update rates that are unknown to the intruders. This is not simply timestamping data. Our notion of time sig...

A digital search tree (DST) is a fundamental data structure on words that finds myriad of applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. It is a digital tree in which strings (keys, words) are stored directly in (internal) nodes. The profile of a DST measures the number of nodes at the same distance from the root; it is a function of the number o...

In this paper we use an agent-based modelling and simulation approach to model a queuing system with autonomous customers who routinely choose a facility for service. We propose a Cellular Automata model to represent the customers’ interactions and study how customers use their own experience and that of their neighbours in order to update their memory and decide what facility to join the next ...

A digital search tree (DST) – one of the most fundamental data structures on words – is a digital tree in which keys (strings, words) are stored directly in (internal) nodes. Such trees find myriad of applications from the popular LempelZiv’78 data compression scheme to distributed hash tables. The profile of a DST measures the number of nodes at the same distance from the root; it is a functio...