Lookahead network priority protocols

  • Authors:

  • S. I. Marcus;G. J. Lipovski

  • Affiliations:

  • The University of Texas, Austin, Texas;The University of Texas, Austin, Texas

  • Venue:
  • SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new architecture for local area networks, based on the carry-lookahead circuit has been described in recent papers. It features a cost-effective hardware round-robin priority circuit, a bus and a shift register ring network that uses the same hardware. This paper shows that such an architecture can be used to minimize Σ Ui Wi where Ui is a real number urgency and Wi is the waiting time of message i, where Ui is a constant, or a time varying function which is a sequence of constant steps. Such a capability is useful in distributed real-time control systems. This paper demonstrates that a network that implements priority, bus and shift register ring-hardware can create new capabilities for local area networks.