会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Mechanism for implementing load balancing in a network
    • 在网络中实现负载均衡的机制
    • US08223634B2
    • 2012-07-17
    • US11732601
    • 2007-04-03
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • G01R31/08
    • H04L47/10H04L12/4641H04L12/4691H04L45/125H04L45/22H04L45/24H04L47/11H04L47/122H04L47/125H04L47/283
    • A mechanism is disclosed for enabling load balancing to be achieved in a network. In one implementation, load balancing is implemented on a “per flow” basis. At the time that a new flow starts, a path is selected. Packets associated with the flow are thereafter sent along that particular path. As the packets associated with the flow are forwarded along the particular path, a congestion metric is determined for the particular path as well as for a set of one or more other paths. Based at least partially upon the congestion metrics, a determination is made as to whether the flow should be moved. If so, then the flow is moved to an alternate path. By determining the congestion metrics for the multiple paths, and by moving the flow in response, it is possible to adapt to changing traffic conditions to keep the loads on the paths relatively balanced.
    • 公开了一种用于在网络中实现负载平衡的机制。 在一个实现中,负载均衡是在“每流”的基础上实现的。 在新流程开始的时候,选择一个路径。 与流相关联的包随后沿着该特定路径发送。 当与流相关联的分组沿着特定路径转发时,为特定路径以及一组一个或多个其他路径确定拥塞度量。 至少部分地基于拥塞度量,确定是否应该移动流。 如果是这样,则流程被移动到备用路径。 通过确定多个路径的拥塞度量,并且通过响应流动来移动,可以适应不断变化的业务状况,以使路径上的负载相对平衡。
    • 3. 发明申请
    • Mechanism for determining a congestion metric for a path in a network
    • 确定网络中路径拥塞度量的机制
    • US20090304007A1
    • 2009-12-10
    • US11732599
    • 2007-04-03
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • H04L12/28
    • H04L47/125H04L12/4641H04L12/4645H04L45/02H04L45/12H04L45/121H04L45/22H04L45/26H04L45/38H04L45/66H04L47/12
    • A mechanism is disclosed for determining a congestion metric for a path in a network. In one implementation, a congestion metric for a path includes one or more latency values and one or more latency variation values. A latency value for a path may be determined by exchanging latency packets with another component. For example, to determine the latency for a particular path, a first component may send a latency request packet to a second component via the particular path. In response, the second component may send a latency response packet back to the first component. Based upon timestamp information in the latency response packet, the latency on the particular path may be determined. From a plurality of such latencies, a latency variation may be determined. Taken individually or together, the latency value(s) and the latency variation value(s) provide an indication of how congested the particular path currently is.
    • 公开了一种用于确定网络中的路径的拥塞度量的机制。 在一个实现中,路径的拥塞度量包括一个或多个延迟值和一个或多个延迟变化值。 可以通过与另一个组件交换延迟分组来确定路径的等待时间值。 例如,为了确定特定路径的延迟,第一组件可以经由特定路径向第二组件发送延迟请求分组。 作为响应,第二组件可以将延迟响应分组发回到第一组件。 基于延迟响应分组中的时间戳信息,可以确定特定路径上的等待时间。 从多个这样的延迟,可以确定延迟变化。 单独或一起采用延迟值和延迟变化值提供当前特定路径拥塞程度的指示。
    • 4. 发明授权
    • Performing rate limiting within a network
    • 在网络中执行速率限制
    • US08374089B2
    • 2013-02-12
    • US12848169
    • 2010-07-31
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • H04J1/16
    • H04L47/125H04L12/4641H04L12/4645H04L45/02H04L45/12H04L45/121H04L45/22H04L45/26H04L45/38H04L45/66H04L47/12
    • Methods and systems for performing rate limiting are provided. According to one embodiment, multiple paths are provided between each pair of multi-path load balancing (MPLB) components within a Layer 2 network by establishing overlapping loop-free topologies in which each MPLB component is reachable by any other via each overlapping topology. A first MPLB component receives packets associated with a flow sent by a source component at a particular rate. The first MPLB component forwards the packets to a second MPLB component along a particular path in a network. A congestion metric for the particular path is determined. Based upon the congestion metric for the particular path, it is determined whether the particular path has reached a congestion threshold. In response to an affirmative determination, the source component is instructed to limit the rate at which it sends packets associated with the flow.
    • 提供了用于执行速率限制的方法和系统。 根据一个实施例,通过建立重叠的无环路拓扑,通过每个重叠拓扑可以由任何其他的路由到达每个MPLB分量,在第二层网络内的每对多径负载平衡(MPLB)组件之间提供多个路径。 第一MPLB组件以特定速率接收与源组件发送的流相关联的分组。 第一个MPLB组件将数据包沿网络中的特定路径转发到第二个MPLB组件。 确定特定路径的拥塞度量。 基于特定路径的拥塞度量,确定特定路径是否已经达到拥塞阈值。 响应于肯定的确定,指示源组件限制其发送与流相关联的分组的速率。
    • 6. 发明申请
    • DETERMINING A CONGESTION METRIC FOR A PATH IN A NETWORK
    • 确定网络路径的约束公式
    • US20100309811A1
    • 2010-12-09
    • US12848167
    • 2010-07-31
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • H04L12/26
    • H04L47/125H04L12/4641H04L12/4645H04L45/02H04L45/12H04L45/121H04L45/22H04L45/26H04L45/38H04L45/66H04L47/12
    • Methods and systems for determining a congestion metric for a path in a network are provided. According to one embodiment, multiple paths are provided between each pair of multi-path load balancing (MPLB) components within a Layer 2 network by establishing overlapping loop-free topologies in which each MPLB component is reachable by any other via each of the overlapping topologies. A first MPLB component associated with a first network device sends a latency request packet, including a first timestamp provided by a first clock associated with the first MPLB component, to a second MPLB component associated with a second network device via the path. Responsive thereto, the first MPLB component receives, from the second MPLB component, a latency response packet, including a second timestamp provided by a second clock associated with the second MPLB component. The first MPLB component derives a one-way latency value for the path based upon the timestamps.
    • 提供了用于确定网络中的路径的拥塞度量的方法和系统。 根据一个实施例,通过建立重叠的无环路拓扑结构,通过建立重叠的无环路拓扑,在每个多路径负载平衡(MPLB)组件之间提供多条路径,其中每个MPLB分量可通过每个重叠拓扑 。 与第一网络设备相关联的第一MPLB组件将包括由与第一MPLB组件相关联的第一时钟提供的第一时间戳的等待时间请求包发送到经由路径与第二网络设备相关联的第二MPLB组件。 响应于此,第一MPLB组件从第二MPLB组件接收延迟响应分组,其包括由与第二MPLB分量相关联的第二时钟提供的第二时间戳。 第一个MPLB组件基于时间戳导出路径的单向延迟值。
    • 7. 发明授权
    • Mechanism for determining a congestion metric for a path in a network
    • 确定网络中路径拥塞度量的机制
    • US07774461B2
    • 2010-08-10
    • US11732599
    • 2007-04-03
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • G06F15/173G06F15/16
    • H04L47/125H04L12/4641H04L12/4645H04L45/02H04L45/12H04L45/121H04L45/22H04L45/26H04L45/38H04L45/66H04L47/12
    • A mechanism is disclosed for determining a congestion metric for a path in a network. In one implementation, a congestion metric for a path includes one or more latency values and one or more latency variation values. A latency value for a path may be determined by exchanging latency packets with another component. For example, to determine the latency for a particular path, a first component may send a latency request packet to a second component via the particular path. In response, the second component may send a latency response packet back to the first component. Based upon timestamp information in the latency response packet, the latency on the particular path may be determined. From a plurality of such latencies, a latency variation may be determined. Taken individually or together, the latency value(s) and the latency variation value(s) provide an indication of how congested the particular path currently is.
    • 公开了一种用于确定网络中的路径的拥塞度量的机制。 在一个实现中,路径的拥塞度量包括一个或多个延迟值和一个或多个延迟变化值。 可以通过与另一个组件交换延迟分组来确定路径的等待时间值。 例如,为了确定特定路径的延迟,第一组件可以经由特定路径向第二组件发送延迟请求分组。 作为响应,第二组件可以将延迟响应分组发回到第一组件。 基于延迟响应分组中的时间戳信息,可以确定特定路径上的等待时间。 从多个这样的延迟,可以确定延迟变化。 单独或一起采用延迟值和延迟变化值提供当前特定路径拥塞程度的指示。
    • 8. 发明授权
    • Determining link failure within a network
    • 确定网络中的链路故障
    • US08331227B2
    • 2012-12-11
    • US12848168
    • 2010-07-31
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • G01R31/08
    • H04L47/125H04L12/4641H04L12/4645H04L45/02H04L45/12H04L45/121H04L45/22H04L45/26H04L45/38H04L45/66H04L47/12
    • Methods and systems for determining link failure in a network are provided. According to one embodiment, multiple paths are provided between each pair of multi-path load balancing (MPLB) components within a Layer 2 network by establishing overlapping loop-free topologies in which each MPLB component is reachable by any other via each loop-free topology. A first MPLB component sends latency requests to a second MPLB component via a particular path. Responsive thereto, the first MPLB component receives latency responses. Based on timestamp information in the latency responses, an estimated latency between the first and second MPLB components is determined. A link failure timeout period is derived based upon the estimated latency. An additional latency request is sent. If an additional latency response is not received by the first MPLB component prior to expiration of the link failure timeout period, then it is concluded that a link failure has occurred.
    • 提供了确定网络中链路故障的方法和系统。 根据一个实施例,通过建立重叠的无环路拓扑,通过每个无环路拓扑可以通过任何其他的路由到达每个MPLB分量,在第二层网络内的每对多径负载平衡(MPLB)组件之间提供多条路径 。 第一个MPLB组件通过特定路径向第二个MPLB组件发送延迟请求。 响应于此,第一MPLB组件接收延迟响应。 基于延迟响应中的时间戳信息,确定第一和第二MPLB分量之间的估计等待时间。 基于估计的等待时间导出链路故障超时周期。 发送额外的延迟请求。 如果在链路故障超时时间到期之前第一个MPLB组件没有接收到额外的延迟响应,则可以断定发生了链路故障。
    • 9. 发明授权
    • Mechanism for enabling memory transactions to be conducted across a lossy network
    • 允许在有损网络上进行内存交易的机制
    • US07702742B2
    • 2010-04-20
    • US11333877
    • 2006-01-17
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • H04L12/26H04L12/56G06F15/167G06F15/16G06F13/28
    • G06F15/16G06F9/466G06F9/546G06F15/167H04L47/24
    • A network interface is disclosed for enabling remote programmed I/O to be carried out in a “lossy” network (one in which packets may be dropped). The network interface: (1) receives a plurality of memory transaction messages (MTM's); (2) determines that they are destined for a particular remote node; (3) determines a transaction type for each MTM; (4) composes, for each MTM, a network packet to encapsulate at least a portion of that MTM; (5) assigns a priority to each network packet based upon the transaction type of the MTM that it is encapsulating; (6) sends the network packets into a lossy network destined for the remote node; and (7) ensures that at least a subset of the network packets are received by the remote node in a proper sequence. By doing this, the network interface makes it possible to carry out remote programmed I/O, even across a lossy network.
    • 公开了一种网络接口,用于使得能够在“有损”网络中执行远程编程I / O(其中分组可能被丢弃)。 网络接口:(1)接收多个存储器事务消息(MTM); (2)确定它们是用于特定的远程节点; (3)确定每个MTM的交易类型; (4)为每个MTM组成一个网络包以封装该MTM的至少一部分; (5)根据其正在封装的MTM的事务类型,为每个网络分组分配一个优先级; (6)将网络数据包发送到远程节点的有损网络; 和(7)确保网络分组的至少一个子集以适当的顺序由远程节点接收。 通过这样做,网络接口使得可以执行远程编程的I / O,甚至在有损网络上。
    • 10. 发明申请
    • Mechanism for enabling memory transactions to be conducted across a lossy network
    • 允许在有损网络上进行内存交易的机制
    • US20090319634A1
    • 2009-12-24
    • US11333877
    • 2006-01-17
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • Bert H. TanakaDaniel J. MaltbieJoseph R. Mihelich
    • G06F15/16G06F15/167
    • G06F15/16G06F9/466G06F9/546G06F15/167H04L47/24
    • A network interface is disclosed for enabling remote programmed I/O to be carried out in a “lossy” network (one in which packets may be dropped). The network interface: (1) receives a plurality of memory transaction messages (MTM's); (2) determines that they are destined for a particular remote node; (3) determines a transaction type for each MTM; (4) composes, for each MTM, a network packet to encapsulate at least a portion of that MTM; (5) assigns a priority to each network packet based upon the transaction type of the MTM that it is encapsulating; (6) sends the network packets into a lossy network destined for the remote node; and (7) ensures that at least a subset of the network packets are received by the remote node in a proper sequence. By doing this, the network interface makes it possible to carry out remote programmed I/O, even across a lossy network.
    • 公开了一种网络接口,用于使得能够在“有损”网络中执行远程编程I / O(其中分组可能被丢弃)。 网络接口:(1)接收多个存储器事务消息(MTM); (2)确定它们是用于特定的远程节点; (3)确定每个MTM的交易类型; (4)为每个MTM组成一个网络包以封装该MTM的至少一部分; (5)根据其正在封装的MTM的事务类型,为每个网络分组分配一个优先级; (6)将网络数据包发送到远程节点的有损网络; 和(7)确保网络分组的至少一个子集以适当的顺序由远程节点接收。 通过这样做,网络接口使得可以执行远程编程的I / O,甚至在有损网络上。