Flow control within a virtual circuit on a high-speed network is modeled using fluid-flow queues with a fixed propagation delay for each channel. Data from other virtual circuits are modeled as disturbances of the available service capacities. The resulting dynamics are shown to form a linear hybrid system. This model allows the design of flow control mechanisms on a mathematical basis. Simulation results show a marked improvement over window flow control for a single channel, and a marginal improvement over window flow control for a virtual circuit of three tandem channels.>

A distributed optimal one-level routing algorithm is presented. The algorithm is based on Newton's method. Using the variable reduction method, the Hessian matrix becomes diagonal. An example shows that the algorithm has a much faster convergence rate, more accurate results, and better transient behavior than previous work. The algorithm is shown to be convergent, stable, robust, and loop free.>

A method is proposed for conflict-free access of a broadcast channel. The method uses a variable-length coding scheme to determine which user gains access to the channel. For an idle channel, an equation for optimal expected overhead is derived and a coding scheme that produces optimal codes is presented. Algorithms for generating optimal codes for access on a busy channel are discussed. Suboptimal schemes are found that perform in a nearly optimal fashion. The method is shown to be superior in performance to previously developed conflict-free channel access schemes.>