Multiplex communications – Network configuration determination – In a bus system
Reexamination Certificate
1999-06-14
2002-12-17
Cangialosi, Salvatore (Department: 2664)
Multiplex communications
Network configuration determination
In a bus system
C370S447000, C370S461000, C370S462000
Reexamination Certificate
active
06496485
ABSTRACT:
The present invention generally relates to communication busses, and more particularly relates to a method for breaking loops during a tree identification process of a system bus.
Bus interconnects allow a wide range of devices, for example computers and peripherals, to share a same media. Communication between attached devices which share the same media can be problematic, however, due to known bus protocols which require a node to arbitrate for control of the bus before transmitting data. Some existing bus architectures provide protocols that define an arbitration process for a bus topology which is tree-like. In such a tree-like topology, a hierarchy of nodes must be specified to accommodate the arbitration process.
To achieve a high speed bus, IEEE 1394 Standards utilize a tree-identification (ID) process using an algorithm that quickly locates peripheral devices connected on the bus. The tree-ID process establishes a hierarchy of nodes, including a root node to accommodate arbitration. The root node is the highest node in the hierarchy. To maintain the hierarchy, the tree-ID process occurs whenever a new device is added to the bus or turned on.
A problem exists with tree-like topologies similar to IEEE 1394 Standards since, by definition, they only work when there is no loop of devices on the bus. A loop occurs whenever more than one path connects any two nodes. According to the Standard, a looped topology will hang the bus during the tree-ID process, thus not all of the nodes can proceed with the tree-ID process. When a looped topology exists, no node will become the root node, and in the absence of a root node, no requests for arbitration will be granted. Unfortunately, nodes are often connected in a loop, even if inadvertently.
Accordingly, in response to the problems discussed above, a primary object of the present invention is to provide an improved method of determining system bus hierarchy.
Another object of the present invention is to provide an improved method that handles looped topologies within a maximum predetermined time period.
REFERENCES:
patent: 4516205 (1985-05-01), Eing et al.
patent: 5784557 (1998-07-01), Oprescu
patent: 5892769 (1999-04-01), Lee
LandOfFree
Method of loop breaking tree indentification in a system bus... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of loop breaking tree indentification in a system bus..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of loop breaking tree indentification in a system bus... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2971384