公开(公告)号：US5504757A

公开(公告)日：1996-04-02

申请号：US313483

申请日：1994-09-27

申请人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

发明人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

IPC分类号： H04L12/24 ,  H04L12/40 ,  H04L12/64 ,  H04L12/02

CPC分类号： H04L12/40078 ,  H04L41/0896

摘要： 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.

摘要翻译： 在树形拓扑网络中，公开了一种用于确定通过高性能非循环串行总线传输的数据分组的最大传送速度的方法。 根据IEEE 1394标准线路图案化的非循环串行总线能够以多个传输速率工作，这取决于任何特定节点的传输速率。 一旦通过发送到祖先节点的传输速率来确定传送速度，则还公开了用于表示传送速度的有效存储技术。 该方法支持IEEE标准允许的所有类型的数据分组的分组速度选择，例如异步，同步和广播分组。

公开(公告)号：US5724517A

公开(公告)日：1998-03-03

申请号：US313679

申请日：1994-09-27

申请人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

发明人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

IPC分类号： G06F15/173 ,  H04L12/40 ,  H04L12/56 ,  H04L12/64 ,  G06F13/00

CPC分类号： H04L12/40078 ,  G06F15/17337 ,  H04L12/44 ,  H04L45/48

摘要： A method and system for mapping a node topology is disclosed. The node topology is based on a computer system comprised of a high performance acyclic serial bus and a plurality of nodes coupled to the acyclic serial bus. Each node further includes an identification packet. The mapping topology establishes a root node based upon information found in each identification packet and establishes at least one branch node among the nodes based on the information. Next, the topology mapping method selects a first available branch node among the available branch nodes based on the information. The system then identifies any of the nodes that are child nodes to the first available branch node. Upon identifying all child nodes of the branch node, the system selects a next available branch node based upon the information. The processing continues until the root node is processed as a branch node.

摘要翻译： 公开了一种用于映射节点拓扑的方法和系统。 节点拓扑基于由高性能非循环串行总线和耦合到非循环串行总线的多个节点组成的计算机系统。 每个节点还包括识别分组。 映射拓扑基于每个标识分组中发现的信息建立根节点，并且基于该信息在节点中建立至少一个分支节点。 接下来，拓扑映射方法基于该信息选择可用分支节点中的第一可用分支节点。 然后，系统将任何作为子节点的节点标识到第一可用分支节点。 在识别分支节点的所有子节点时，系统基于该信息来选择下一可用分支节点。 处理继续，直到根节点被处理为分支节点。

公开(公告)号：US5687319A

公开(公告)日：1997-11-11

申请号：US761058

申请日：1996-12-05

申请人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

发明人： Sherri E. Cook ,  Andrew B. McNeill, Jr.

IPC分类号： H04L12/40 ,  H04L12/64 ,  G06F15/163

CPC分类号： H04L12/40078 ,  H04L12/40065 ,  H04L12/44

摘要： A method and system for determining the maximum number of cable segments between all possible node to node paths on a high performance serial bus. The method for determining the maximum cable hops on the serial bus, which is acyclic and based upon the IEEE 1994 standard, consists of traversing a direct path between two nodes via the parent links. Further, the number of traversed paths is reduced from all possible node-to-node paths to only leaf-to-leaf node paths and leaf-to-root node paths for efficiently identifying the maximum number of cable segments between any two nodes within the serial bus.

摘要翻译： 一种用于确定高性能串行总线上所有可能的节点到节点路径之间的电缆段的最大数量的方法和系统。 用于确定串行总线上最大电缆跳数的方法是非循环的并且基于IEEE 1994标准，包括通过父链路遍历两个节点之间的直接路径。 此外，遍历路径的数量从所有可能的节点到节点路径减少到仅叶子到叶节点路径和叶到根节点路径，用于有效地标识在线间路径内的任何两个节点之间的最大数量的电缆段 串行总线