Method for selecting transmission speeds for transmitting data packets over a serial bus
First Claim
1. In a multi-speed serial bus having a tree topology, a method for establishing an optimal data transmission rate between a first node and a second node comprising the steps of:
- upon completion of establishing said topology, determining a common ancestor node between said first node and said second node;
comparing the data transmission rate of said first node with the data transmission rate of each node between said first and said ancestor node;
setting the data transmission rate from said first note to said ancestor node to be equal to the lowest data transmission rate associated with any node between and including said first node and said ancestor node;
comparing the data transmission rate of said second node to each node between and including said second node and said ancestor node; and
establishing the data transfer rate between said first node and said second node as being the transfer rate associated with any node between said first node and said ancestor node and between and including said second node and said ancestor node, which any node has the lowest data transmission rate amongst said nodes.
1 Assignment
0 Petitions
Accused Products
Abstract
In a tree topology network, a method for determining the maximum transfer speed for data packets transmitted over a high performance acyclic serial bus is disclosed. The acyclic serial bus, patterned along the lines of the IEEE 1394 standard, is capable of operating at multiple transmission rates, depending upon the transmission rate of any particular node. Once the transfer speeds have been determined by finding transmission rates to and from an ancestor node, an efficient storage technique for representing the transfer speeds is also disclosed. The method supports packet speed selection for all types of data packets allowed by the IEEE standard, such as, for example, asynchronous, isochronous and broadcast packets.
-
Citations
12 Claims
-
1. In a multi-speed serial bus having a tree topology, a method for establishing an optimal data transmission rate between a first node and a second node comprising the steps of:
-
upon completion of establishing said topology, determining a common ancestor node between said first node and said second node; comparing the data transmission rate of said first node with the data transmission rate of each node between said first and said ancestor node; setting the data transmission rate from said first note to said ancestor node to be equal to the lowest data transmission rate associated with any node between and including said first node and said ancestor node; comparing the data transmission rate of said second node to each node between and including said second node and said ancestor node; and establishing the data transfer rate between said first node and said second node as being the transfer rate associated with any node between said first node and said ancestor node and between and including said second node and said ancestor node, which any node has the lowest data transmission rate amongst said nodes. - View Dependent Claims (2, 3, 4, 5, 12)
-
-
6. In a computer system using a serial bus having multiple transmission rates and having a tree topology, a method for establishing an optimal data transmission rate between a first node and a second node comprising the steps of:
-
upon completion of establishing said topology, determining a common ancestor node between said first node and said second node, said step further comprising; establishing a first node path between said first node and said ancestor node and a second node path between said second node and said ancestor; traversing those nodes for said first node path that provide an optimal data transmission rate of any node between said first node and said ancestor node; traversing those nodes for said second node path that provide an optimal data transmission rate of any node between said second node and said ancestor node; establishing the data transfer rate between said first node and said second node as being the lowest transfer rate after traversing both said first node path and said second node path. - View Dependent Claims (7, 8, 9, 10, 11)
-
Specification