US 5,124,981 AGranted

Access control method for DQDB network

AssigneeInternational Business Machines Corporation

InventorNeville L. Golding

Life of this patent

Estimating the term…

Loading patent…

Abstract

A distributed queue dual bus (DQDB) network has two, oppositely-directed, unidirectional busses. A node with data to send on one bus, can request access to that bus, by sending a bus request signal to all nodes upstream on the bus. The bus request signal is sent to the nodes as part of the traffic flowing on the second bus. Each node counts the number of successive bus request signals transported on the second bus. In a multiple priority system, multiple counts are maintained, one for each priority level. When a given or local node detects an idle slot on the first node, it may write data into that slot if there are no pending downstream access requests of higher priority and if the local node has allowed enough idle slots to pass since its last write operation to service access requests existing at the time of that operation at the same or higher priority levels.

Claims2

Dependent claims

For use in a distributed queue dual bus network having

two unidirectional oppositely directed busses along which information is transmitted in successive multi-byte cells, each cell having at least one busy bit and at least one bus request bit, and a plurality of parallel nodes, each of said nodes being connected to both of said busses and being capable of reading data from and writing data to the bus, a method of equitably distributing access to the bus among contending nodes, said method being practiced at each node and comprising the steps of:
reading the bus request bit in each cell passing the node on a first bus;
counting the number of successive bus request bits having a first value;
updating a request value register to equal the count whenever the count becomes greater than the current register value or whenever a bus request bit having a second value is encountered;
altering the pattern of bus request bits being transmitted along the first bus only if the node has data to transmit on the second bus, the alteration comprising increasing the number of successive bus request bits having the first value;
reading the busy bit in each cell passing the node on the second bus;
writing data into the first passing cell on the second bus having a busy bit with a first value;
and
passing all cells having a busy bit with a second value and a number of cells having a busy bit with the first value where the number equals the count stored in the request value register before making another attempt to access the second bus.

6 more elements

Dependencies are inferred from the claim text.