Fault-tolerant routing protocols in modern interconnection networks rely heavily on the network flow control mechanisms used. Optimistic flow control mechanisms such as wormhole routing (WR) realize very good performance, but are prone to deadlock in the presence of faults. Conservative flow

/delay. In this work, we propose token flow control (TFC), a flow control mechanism in which nodes in the network send out tokens in their local neighborhood to communicate information about their available resources. These tokens are then used in both routing and flow control: to choose less congested paths

Another version of TCP called TCP Vegas has been proposed and studied in the literature. It can achieve better performance than the current TCP Reno. In our previous studies, steady-state behavior of a windowbased flow control mechanism based on TCP Vegas has been analyzed for a simple network

in previous models: a decentralized label model, label polymorphism, run-time label checking, and automatic label inference. JFlow also supports many language features that have never been integrated successfully with static information flow control, including objects, subclassing, dynamic type tests, access

to be used for cooperative motion. We prove a separation principle that states that formation stability is achieved if the information flow is stable for the given graph and if the local controller stabilizes the vehicle. The information flow can be rendered highly robust to changes in the graph, thus

We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm

of end-to-end congestion control in the design of future protocols using best-effort traffic, we argue that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion. The paper discusses several general approaches

In this paper we propose a flow control algorithm for k-ary n-cube networks which avoids the deadlock problems without using virtual channels. Some basic definitions and theorems are proposed in order to establish the necessary and sufficient conditions to verify that an algorithm is deadlock

Graduate Recently, a new version of the TCP mechanism, called TCP Vegas, is proposed, and has potential to achieve better performance than current mechanisms such as TCP Tahoe and Reno. This paper considers a windowbased flow control mechanism based on a slightly modified congestion avoidance

Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a