This abstract describes a new approach to token management for in-home digital networks, which we call RTnet. The proposed network offers a guaranteed quality-of-service, based on a distributed token mechanism to schedule communication streams. RTnet is based on the CSMA/CD Ethernet protocol [1]. In effect this means that RTnet can be built on any existing Ethernet specification and regular Eth...

This paper proposes the application of finite-state approximation techniques on a unification-based grammar of word formation for a language like German. A refinement of an RTN-based approximation algorithm is proposed, which extends the state space of the automaton by selectively adding distinctions based on the parsing history at the point of entering a context-free rule. The selection of his...

This paper presents an algorithm for labeling curvilinear structure at multiple scales in line drawings and edge images Symbolic CURVE-ELEMENT tokens residing in a spatially-indexed and scale-indexed data structure denote circular arcs fit to image data. Tokens are computed via a small-to-large scale grouping procedure employing a “greedy”, best-first, strategy for choosing the support of new t...

For an arbitrary initial configuration of indivisible (discrete) loads over vertices of a distributed network (graph), we consider the problem of minimizing the discrepancy between the maximum and minimum load among all vertices. For this problem, diffusion-based algorithms are well studied because of its simplicity. In diffusion-based algorithms, each vertex distributes its loads as evenly as ...

We study the problem of all-to-all information exchange, also known as gossip, in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to every node. O...

Problem statement: Causality among events, more formally the causal ordering relation, is a powerful tool for analyzing and drawing inferences about distributed systems. The knowledge of the causal ordering relation between processes helps designers and the system itself solve a variety of problems in distributed systems. In distributed algorithms design, such knowledge helped ensure fairness a...

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the ac...

The paper presents a token based distributed mutual exclusion algorithm. The algorithm assumes a fully connected, reliable physical network and a directed acyclic graph (dag) structured logical network. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes. Using the best topology, the algorithm attains comparable performance to ...

Denial of Service (DoS) attacks present a serious problem for Internet communications. IP source address spoofing is used by DoS and DDoS attacks on targeted victim. IP spoofing to forge the source IP address of the packet, and thereby hide the identity of source. This makes hard to detect and defend against such attack. This paper presents a token based authentication and Packet Marking mechan...

Schedulers for real-time distributed replicated databases must satisfy timing constraints of transactions and preserve data consistency. In this paper, we present a replication control algorithm, which integrates real-time scheduling and replication control. The algorithm adopts a token-based scheme for replication control and attempts to incorporate the urgency of real-time transactions into t...