会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Dynamic network load balancing using roundtrip heuristic
    • 使用往返启发式动态网络负载平衡
    • US08799918B2
    • 2014-08-05
    • US11518673
    • 2006-09-11
    • Siddhartha Sen
    • Siddhartha Sen
    • G06F9/46G06F15/173
    • G06F9/505H04L67/1002H04L67/1008H04L67/101H04L67/1012H04L67/1019H04L67/1023
    • Described is a technology by which a relative load of network traffic handling is determined between servers of a cluster, based upon time values that correspond to the time taken by each server to handle a packet. Load may then be transferred between the servers based upon the relative load, for example by having a less-loaded server take some of the responsibility for processing incoming traffic from a more-loaded server. For example, the processing time of a server may be determined by when a receiving server receives a request packet, and when that server sends a return packet. A round trip time for a request and return communication may also be established. A logical tree of nodes representing the servers may be constructed to select pairs of servers for balancing with one another, with the selection algorithm operating recursively, in parallel, and/or repeatedly, until the cluster is balanced.
    • 描述了一种技术,通过该技术,基于与每个服务器处理分组所花费的时间相对应的时间值来确定群集的服务器之间的网络流量处理的相对负载。 然后可以基于相对负载在服务器之间传送负载,例如通过使较少加载的服务器承担处理来自更加负载的服务器的传入流量的一些责任。 例如,服务器的处理时间可以由接收服务器何时接收到请求分组以及当该服务器发送返回分组时确定。 还可以建立请求和返回通信的往返时间。 可以构造表示服务器的节点的逻辑树,以选择成对的服务器以彼此平衡,并且选择算法并行地和/或重复地进行递归运算,直到该集群被平衡。
    • 3. 发明申请
    • Decentralized Sleep Management
    • 分散睡眠管理
    • US20120117404A1
    • 2012-05-10
    • US12940806
    • 2010-11-05
    • Jacob R. LorchSiddhartha SenJitendra D. PadhyeRichard L. HughesCarlos Garcia Jurado Suarez
    • Jacob R. LorchSiddhartha SenJitendra D. PadhyeRichard L. HughesCarlos Garcia Jurado Suarez
    • G06F1/32
    • G06F1/3228G06F1/3209
    • Techniques for employing a decentralized sleep management service are described herein. In some instances, each computing device of a group of computing devices periodically shares information about itself with each other computing device of the group. With this information, each computing device within the group that is awake and capable of managing other devices selects a subset of devices to probe. The devices then probe this subset to determine whether the probed devices are asleep. In response to identifying a sleeping device, the probing device takes over management of the sleeping device. Managing the sleeping device involves informing other devices of the group that the sleeping device is being managed, in addition to monitoring requests for services on the sleeping device. In response to receiving a valid request for a service hosted by the sleeping device, the managing device awakens the sleeping device and ceases managing the now-woken device.
    • 本文描述了采用分散式睡眠管理服务的技术。 在一些情况下,一组计算设备的每个计算设备周期性地与该组的每个其他计算设备共享关于其自身的信息。 利用该信息,组内的每个计算设备清醒并能够管理其他设备选择要探测的设备的子集。 然后,设备探测该子集以确定探测设备是否已经睡着了。 响应于识别睡眠设备,探测设备接管睡眠设备的管理。 管理睡眠设备除了监视睡眠设备上的服务请求之外,还涉及通知该组的其他设备正在管理睡眠设备。 响应于接收到由睡眠设备托管的服务的有效请求,管理设备唤醒睡眠设备并停止管理现在被唤醒的设备。
    • 4. 发明申请
    • Dynamic network load balancing using roundtrip heuristic
    • 使用往返启发式动态网络负载平衡
    • US20080066073A1
    • 2008-03-13
    • US11518673
    • 2006-09-11
    • Siddhartha Sen
    • Siddhartha Sen
    • G06F9/46
    • G06F9/505H04L67/1002H04L67/1008H04L67/101H04L67/1012H04L67/1019H04L67/1023
    • Described is a technology by which a relative load of network traffic handling is determined between servers of a cluster, based upon time values that correspond to the time taken by each server to handle a packet. Load may then be transferred between the servers based upon the relative load, for example by having a less-loaded server take some of the responsibility for processing incoming traffic from a more-loaded server. For example, the processing time of a server may be determined by when a receiving server receives a request packet, and when that server sends a return packet. A round trip time for a request and return communication may also be established. A logical tree of nodes representing the servers may be constructed to select pairs of servers for balancing with one another, with the selection algorithm operating recursively, in parallel, and/or repeatedly, until the cluster is balanced.
    • 描述了一种技术,通过该技术,基于与每个服务器处理分组所花费的时间相对应的时间值来确定群集的服务器之间的网络流量处理的相对负载。 然后可以基于相对负载在服务器之间传送负载,例如通过使较少加载的服务器承担处理来自更加负载的服务器的传入流量的一些责任。 例如,服务器的处理时间可以由接收服务器何时接收到请求分组以及当该服务器发送返回分组时确定。 还可以建立请求和返回通信的往返时间。 可以构造表示服务器的节点的逻辑树,以便选择一对服务器以彼此平衡,并且选择算法并行地和/或重复地进行递归运算,直到该集群被平衡。
    • 5. 发明申请
    • Maintaining Client Affinity in Network Load Balancing Systems
    • 维护网络负载平衡系统中的客户关系
    • US20100057923A1
    • 2010-03-04
    • US12201254
    • 2008-08-29
    • Vladimir PetterSiddhartha SenAndrea D'AmatoJimmy C. Yu
    • Vladimir PetterSiddhartha SenAndrea D'AmatoJimmy C. Yu
    • G06F15/16
    • G06F9/5061G06F2209/505H04L67/1002H04L67/1027H04L67/1029H04L67/1031
    • Described is a technology in a network load balancing system (node cluster), by which client affinity is preserved across cluster configuration changes, including for new connections from a previous client. Each node maintains a list of the clients that are to remain (have affinity, or “stickiness”) with that node, including following bucket redistribution resulting from convergence. Each affinity list is communicated during convergence so that other nodes may build an exception list or lists. Via a node's exception list, the node that owns a bucket corresponding to a client knows of the affinity with another node and thus drops any packets from that client. Affinity may expire, whereby the node having affinity with that client releases it and notifies the node owning the bucket for that client that the client is no longer to be treated as an exception.
    • 描述了网络负载平衡系统(节点集群)中的技术,通过该技术,可以跨集群配置更改保留客户端关联,包括来自以前客户端的新连接。 每个节点维护与该节点保持(具有亲和性或“粘性”)的客户端的列表,包括从收敛引起的后续重新分配。 每个关联列表在收敛时进行通信,以便其他节点可以构建一个例外列表或列表。 通过节点的异常列表,拥有与客户端相对应的桶的节点知道与另一个节点的亲和性,从而丢弃该客户端的任何数据包。 亲和度可能会过期,由此与该客户端具有亲和力的节点将释放它,并通知拥有该客户端的存储区的客户端不再将该客户端视为异常。
    • 6. 发明申请
    • Software testing techniques for stack-based environments
    • 基于堆栈的环境的软件测试技术
    • US20080168425A1
    • 2008-07-10
    • US11650512
    • 2007-01-05
    • Siddhartha SenAmit Date
    • Siddhartha SenAmit Date
    • G06F11/36
    • G06F11/3688
    • Techniques for testing software applications in stack-based computing environments are discussed. A tested application is executed at predetermined logical positions in a stack, such as at a layer of the OSI reference model. An expected result of an operation performed by the application is identified. A first set of computer-executable instructions is installed at a first position logically above the tested application, and a second set of computer-executable instructions is installed at a second position logically below the tested application. One or both sets of instructions simulate inputs to the application. The application is executed based on the simulated inputs, and one or both sets of instructions are used to compare outputs from the application with the expected result. Various, virtually unlimited tests can be performed on the software application without the use of extensive test infrastructure.
    • 讨论了基于堆栈的计算环境中测试软件应用的技术。 测试的应用程序在堆栈中的预定逻辑位置执行,例如在OSI参考模型的层。 识别由应用执行的操作的预期结果。 第一组计算机可执行指令安装在逻辑上在测试应用程序上方的第一位置,并且第二组计算机可执行指令安装在逻辑上低于测试应用程序的第二位置。 一个或两组指令模拟应用程序的输入。 应用程序基于模拟输入执行,并且使用一组或两组指令来将应用程序的输出与预期结果进行比较。 可以在软件应用程序上执行各种,几乎无限的测试,而无需使用广泛的测试基础设施。
    • 8. 发明授权
    • Decentralized sleep management
    • 分散睡眠管理
    • US09582062B2
    • 2017-02-28
    • US12940806
    • 2010-11-05
    • Jacob R. LorchSiddhartha SenJitendra D. PadhyeRichard L. HughesCarlos Garcia Jurado Suarez
    • Jacob R. LorchSiddhartha SenJitendra D. PadhyeRichard L. HughesCarlos Garcia Jurado Suarez
    • G06F1/32
    • G06F1/3228G06F1/3209
    • Techniques for employing a decentralized sleep management service are described herein. In some instances, each computing device of a group of computing devices periodically shares information about itself with each other computing device of the group. With this information, each computing device within the group that is awake and capable of managing other devices selects a subset of devices to probe. The devices then probe this subset to determine whether the probed devices are asleep. In response to identifying a sleeping device, the probing device takes over management of the sleeping device. Managing the sleeping device involves informing other devices of the group that the sleeping device is being managed, in addition to monitoring requests for services on the sleeping device. In response to receiving a valid request for a service hosted by the sleeping device, the managing device awakens the sleeping device and ceases managing the now-woken device.
    • 本文描述了采用分散式睡眠管理服务的技术。 在一些情况下,一组计算设备的每个计算设备周期性地与该组的每个其他计算设备共享关于其自身的信息。 利用该信息,组内的每个计算设备清醒并能够管理其他设备选择要探测的设备的子集。 然后,设备探测该子集以确定探测设备是否已经睡着了。 响应于识别睡眠设备,探测设备接管睡眠设备的管理。 管理睡眠设备除了监视睡眠设备上的服务请求之外,还涉及通知该组的其他设备正在管理睡眠设备。 响应于接收到由睡眠设备托管的服务的有效请求,管理设备唤醒睡眠设备并停止管理现在被唤醒的设备。