Method and apparatus for preventing loops in a full-duplex bus
    1.
    发明申请
    Method and apparatus for preventing loops in a full-duplex bus 有权
    用于防止全双工总线中的环路的方法和装置

    公开(公告)号:US20050117528A1

    公开(公告)日:2005-06-02

    申请号:US11021337

    申请日:2004-12-21

    摘要: A method and apparatus is disclosed for preventing loops in a full-duplex bus. One method has the acts of: selecting at least two candidates to join said bus; establishing a dominant candidate from one of said at least two candidates; testing for loops in said bus; and joining said dominant candidate if no loops are found in said bus. Another method has the acts of: selecting a plurality candidates to join said bus; establishing at least one dominant candidate; testing for loops in said bus; and joining said at least one dominant candidate if no loops are found in said bus. Alternative embodiments are shown that utilize unique identifiers to facilitate candidate selection and to establish dominance on the bus.

    摘要翻译: 公开了一种用于防止全双工总线中的环路的方法和装置。 一种方法有:选择至少两个候选人加入所述总线; 从所述至少两个候选人之一建立主要候选人; 测试所述总线中的回路; 并且如果在所述总线中没有发现循环,则加入所述主要候选者。 另一方法具有以下动作:选择多个候选以加入所述总线; 建立至少一个优势候选人; 测试所述总线中的回路; 以及如果在所述总线中没有发现循环,则加入所述至少一个主要候选者。 示出了替代实施例,其利用唯一标识符来促进候选者选择并在总线上建立优势。

    Method and apparatus for border node behavior on a full-duplex bus
    2.
    发明申请
    Method and apparatus for border node behavior on a full-duplex bus 有权
    全双工总线上边界节点行为的方法和装置

    公开(公告)号:US20070294449A1

    公开(公告)日:2007-12-20

    申请号:US11895871

    申请日:2007-08-27

    IPC分类号: G06F12/00

    摘要: A method and apparatus relating to the behavior of border nodes within a high performance serial bus system is disclosed. A method for determining and communicating the existence of a hybrid bus is disclosed. A method for determining a path to a senior border node is disclosed, as is a method for identifying a senior border node Various methods for properly issuing gap tokens within a beta cloud are disclosed.

    摘要翻译: 公开了一种与高性能串行总线系统内的边界节点的行为有关的方法和装置。 公开了一种用于确定和传达混合总线的存在的方法。 公开了一种用于确定到高级边界节点的路径的方法,以及用于识别高级边界节点的方法。 公开了在beta云中正确发出间隙令牌的各种方法。

    Method and apparatus for loop breaking in a data bus
    3.
    发明申请
    Method and apparatus for loop breaking in a data bus 有权
    数据总线中环路断线的方法和装置

    公开(公告)号:US20070255871A1

    公开(公告)日:2007-11-01

    申请号:US11725711

    申请日:2007-03-19

    IPC分类号: G06F13/00

    摘要: A method and apparatus is disclosed for preventing loops in a full-duplex bus. One method has the acts of: selecting at least two candidates to join said bus; establishing a dominant candidate from one of said at least two candidates; testing for loops in said bus; and joining said dominant candidate if no loops are found in said bus. Another method has the acts of: selecting a plurality candidates to join said bus; establishing at least one dominant candidate; testing for loops in said bus; and joining said at least one dominant candidate if no loops are found in said bus. Alternative embodiments are shown that utilize unique identifiers to facilitate candidate selection and to establish dominance on the bus.

    摘要翻译: 公开了一种用于防止全双工总线中的环路的方法和装置。 一种方法有:选择至少两个候选人加入所述总线; 从所述至少两个候选人之一建立主要候选人; 测试所述总线中的回路; 并且如果在所述总线中没有发现循环,则加入所述主要候选者。 另一方法具有以下动作:选择多个候选以加入所述总线; 建立至少一个优势候选人; 测试所述总线中的回路; 以及如果在所述总线中没有发现循环,则加入所述至少一个主要候选者。 示出了替代实施例,其利用唯一标识符来促进候选者选择并在总线上建立优势。

    Method and apparatus for border node behavior on a full-duplex bus
    4.
    发明申请
    Method and apparatus for border node behavior on a full-duplex bus 有权
    全双工总线上边界节点行为的方法和装置

    公开(公告)号:US20070067523A1

    公开(公告)日:2007-03-22

    申请号:US11601487

    申请日:2006-11-16

    IPC分类号: G06F13/42

    摘要: A method and apparatus relating to the behavior of border nodes within a high performance serial bus system is disclosed. A method for determining and communicating the existence of a hybrid bus is disclosed. A method for determining a path to a senior border node is disclosed, as is a method for identifying a senior border node Various methods for properly issuing gap tokens within a beta cloud are disclosed.

    摘要翻译: 公开了一种与高性能串行总线系统内的边界节点的行为有关的方法和装置。 公开了一种用于确定和传达混合总线的存在的方法。 公开了一种用于确定到高级边界节点的路径的方法,以及用于识别高级边界节点的方法。公开了用于在beta云内正确发出间隙令牌的各种方法。

    Method and apparatus for ensuring compatibility on a high performance serial bus
    5.
    发明申请
    Method and apparatus for ensuring compatibility on a high performance serial bus 有权
    确保高性能串行总线兼容性的方法和装置

    公开(公告)号:US20060072590A1

    公开(公告)日:2006-04-06

    申请号:US11284674

    申请日:2005-11-21

    IPC分类号: H04L12/56

    摘要: A data communications system is disclosed having at least one Legacy cloud coupled to at least one Beta cloud. The system further having at least one BOSS node and at least one border node. A method for ensuring compatibility is disclosed comprising determining when the BOSS node is idle, determining whether the last packet transmitted by any border node was an Alpha format packet if the BOSS node is idle, and unlocking the Legacy cloud if the last packet transmitted by the border node was not an Alpha format packet.

    摘要翻译: 公开了一种数据通信系统,其具有耦合到至少一个Beta云的至少一个Legacy云。 该系统还具有至少一个BOSS节点和至少一个边界节点。 公开了一种用于确保兼容性的方法,包括确定BOSS节点何时空闲,如果BOSS节点空闲,则确定由任何边界节点发送的最后一个分组是否是Alpha格式分组,如果由 边界节点不是Alpha格式数据包。

    Method and apparatus for gap count determination
    6.
    发明授权
    Method and apparatus for gap count determination 失效
    差距计数确定方法和装置

    公开(公告)号:US06212171B1

    公开(公告)日:2001-04-03

    申请号:US09102097

    申请日:1998-06-22

    IPC分类号: H04L1240

    摘要: A method and apparatus for determining a gap count for a serial bus network is described. A round-trip delay time for transmitting a packet from a first leaf node to a second leaf node and back over a communication path between the nodes for each pair of leaf nodes in the network is determined. A maximum round-trip delay time for each communication path is calculated. A node latency delay time for each leaf node in the network is determined. A longest maximum round-trip delay time and a longest node latency delay time is selected for the network, and a gap count is calculated using the selected times.

    摘要翻译: 描述了用于确定串行总线网络的间隙计数的方法和装置。 确定用于从第一叶节点向第二叶节点传送分组并在网络中的每对叶节点的节点之间的通信路径上的往返延迟时间。 计算每个通信路径的最大往返延迟时间。 确定网络中每个叶节点的节点等待时间延迟时间。 为网络选择最长的最大往返延迟时间和最长的延迟延迟时间,并使用所选择的时间计算间隙计数。