Method and system for determining maximum cable segments between all possible node to node paths on a serial bus

Claim 2

In a computer system comprising an acyclic serial bus having a plurality of nodes forming a tree topology with a root node, each node being coupled to at least another node via a transmission cable, a method for determining the maximum cable segments between all possible node to node paths on said acyclic serial bus and optimizing transmission gap -- time for the acyclic serial bus, comprising the steps of: upon establishing a node mapping of said topology, selecting a first node and a second node in the plurality of nodes forming the tree topology; determining the number of node connections from said first node to a common ancestor node to said second node; establishing the number of node connections from said second node to said common ancestor node; establishing said maximum cable segments as equal to the sum of the number of node connections as between both said first node and said second node to said common ancestor node; associating said maximum cable segments with a transmission gap time for optimum performance of said serial bus; encoding said transmission gap time into a bus configuration packet; sending said bus configuration packet to said plurality of nodes on said serial bus to establish said transmission gap time as the serial bus interpacket gap time; upon a serial bus reset, comparing said bus configuration packet containing said transmission gap time to a new optimum transmission gap time; and replacing said transmission gap time with said new transmission gap time if said new transmission gap time is less than said transmission gap time to optimize transmission gap time for the serial bus.

Claim 3

The method according to claim 1, wherein said node connections between said first node and second node to said common ancestor node are parental link nodes between said first node and said common ancestor node, and between said second node and said common ancestor node.

Claim 4

In a computer system comprising an acyclic serial bus having a plurality of nodes forming a tree topology with a mot node, each node being coupled to at least another node via a transmission cable, a method for determining the maximum cable hop counts on said serial bus and optimizing transmission gap time for the acyclic serial bus, comprising the steps of: upon establishing a node mapping of said topology, selecting a source node and a destination node in the plurality of nodes forming the tree topology; starting with said source node, following a parental node path to determine the number of rode connections along said parental node path from said source node to a common ancestor node; starting with said destination node, following a second parental node path back to said common ancestor node; determining the number of node connections along said second parental node path from said destination node to said common ancestor node; establishing said maximum cable hop count as equal to the sum of the number of node connections along both parental node paths from said source node and said destination node to said common ancestor node; performing the above steps for each leaf-node-to-leaf-node and leaf-node-to-root-node combination; determining the maximum hop count based on all evaluated paths; associating said maximum hop count with a transmission gap time; encoding said transmission gap time into a bus configuration packet; sending said bus configuration packet to said plurality of nodes on said acyclic serial bus to establish said transmission gap time as the acyclic serial bus gap time; upon a serial bus reset, comparing said bus configuration packet containing said transmission gap time to a new transmission gap time; and replacing said transmission gap time with said new transmission gap time if said new transmission gap time is less than said transmission gap time to optimize the transmission gap time for the acyclic serial bus.

Claim 5

In a computer system comprising an acyclic serial bus having a plurality of nodes forming a tree topology with a mot node, each node being coupled to at least another node via a transmission cable, a method for determining the maximum cable hop counts on said serial bus and optimizing transmission gap time for the acyclic serial bus, comprising the steps of: upon establishing a node mapping of said topology, selecting a source node and a destination node in the plurality of nodes forming the tree topology; starting with said source node, following a parental node path to determine the number of rode connections along said parental node path from said source node to a common ancestor node; starting with said destination node, following a second parental node path back to said common ancestor node; determining the number of node connections along said second parental node path from said destination node to said common ancestor node; establishing said maximum cable hop count as equal to the sum of the number of node connections along both parental node paths from said source node and said destination node to said common ancestor node; performing the above steps for each leaf-node-to-leaf-node and leaf-node-to-root-node combination; determining the maximum hop count based on all evaluated paths; associating said maximum hop count with a transmission gap time; encoding said transmission gap time into a bus configuration packet; sending said bus configuration packet to said plurality of nodes on said acyclic serial bus to establish said transmission gap time as the acyclic serial bus gap time; upon a serial bus reset, comparing said bus configuration packet containing said transmission gap time to a new transmission gap time; and replacing said transmission gap time with said new transmission gap time if said new transmission gap time is less than said transmission gap time to optimize the transmission gap time for the acyclic serial bus.

Claim 6

The method according to claim 3, wherein said node connections between said source node and said destination node to said common ancestor node are parental link nodes between said source node and said common ancestor node, and between said destination node and said common ancestor node.

Claim 7

The method according to claim 3, wherein said parental node paths include only leaf-to-leaf node paths and leaf-to-root node paths.

Claim 8

In a computer system comprising an acyclic serial bus having a plurality of nodes forming a tree topology with a root node, each node being coupled to at least another node via a transmission cable, a system for determining the maximum cable segments on said acyclic serial bus and optimizing transmission gap time for the acyclic serial bus, comprising: means for selecting a first node and a second node based upon a node mapping of said tree topology; means for determining the number of node connections from said first node to a common ancestor node to said second node; means for establishing the number of node connections from said second node to said common ancestor node; means for establishing said maximum cable segments number as equal to the maximum number of node connections between all possible leaf to leaf paths or leaf to root paths; means for associating said maximum cable segments number with a transmission gap time; means for encoding said transmission gap time into a physical configuration packet; means for sending said physical configuration packet to said plurality of nodes on said serial bus to establish said transmission gap time as the serial bus gap time; means for comparing said physical configuration packet with said transmission gap time to a new transmission gap time; and means for replacing said transmission gap time with said new transmission gap time if said new transmission gap time is less than said transmission gap time to optimize the transmission gap time for the acyclic serial bus.

Claim 9

In a computer system comprising an acyclic serial bus having a plurality of nodes forming a tree topology with a root node, each node being coupled to at least another node via a transmission cable, a system for determining the maximum cable segments on said acyclic serial bus and optimizing transmission gap time for the acyclic serial bus, comprising: means for selecting a first node and a second node based upon a node mapping of said tree topology; means for determining the number of node connections from said first node to a common ancestor node to said second node; means for establishing the number of node connections from said second node to said common ancestor node; means for establishing said maximum cable segments number as equal to the maximum number of node connections between all possible leaf to leaf paths or leaf to root paths; means for associating said maximum cable segments number with a transmission gap time; means for encoding said transmission gap time into a physical configuration packet; means for sending said physical configuration packet to said plurality of nodes on said serial bus to establish said transmission gap time as the serial bus gap time; means for comparing said physical configuration packet with said transmission gap time to a new transmission gap time; and means for replacing said transmission gap time with said new transmission gap time if said new transmission gap time is less than said transmission gap time to optimize the transmission gap time for the acyclic serial bus.

Claim 10

The system according to claim 6, wherein said node connections between said first node and said second node to said common ancestor node are parental link nodes between said first node and said common ancestor node and between said second node and said common ancestor node.

Claim 11

The system according to claim 6, wherein said means for comparing operates upon the occurrence of a serial bus reset.