Method and apparatus for resource allocation for stream data processing
    1.
    发明申请
    Method and apparatus for resource allocation for stream data processing 失效
    用于流数据处理的资源分配方法和装置

    公开(公告)号:US20080062886A1

    公开(公告)日:2008-03-13

    申请号:US11519764

    申请日:2006-09-12

    IPC分类号: H04J1/16

    CPC分类号: H04L47/70

    摘要: Resource allocations in stream data processing systems are performed to allocate the resources in a cost-effective manner by formulating the resource allocation problem as a linear program. For a problem with a single output, a backward algorithm or method is used that produces an optimal solution in linear time. For a problem with multiple outputs and the network has a tree structure, a backward shrink algorithm or method is used to provide an optimal solution in linear time. These algorithms are fully distributed, they require only local exchange of parameters between neighboring nodes, and are adaptive to the dynamic changes in network conditions and flow rate fluctuations.

    摘要翻译: 执行流数据处理系统中的资源分配,通过以资源分配问题作为线性程序,以成本有效的方式分配资源。 对于单个输出的问题,使用向后算法或方法,其产生线性时间的最优解。 对于多个输出的问题,网络具有树结构,使用向后收缩算法或方法来提供线性时间的最优解。 这些算法是完全分布的,它们只需要相邻节点之间的本地参数交换,并且适应网络条件和流量波动的动态变化。

    Method and apparatus for resource allocation for stream data processing
    2.
    发明授权
    Method and apparatus for resource allocation for stream data processing 失效
    用于流数据处理的资源分配方法和装置

    公开(公告)号:US07826365B2

    公开(公告)日:2010-11-02

    申请号:US11519764

    申请日:2006-09-12

    IPC分类号: H04L1/00

    CPC分类号: H04L47/70

    摘要: Resource allocations in stream data processing systems are performed to allocate the resources in a cost-effective manner by formulating the resource allocation problem as a linear program. For a problem with a single output, a backward algorithm or method is used that produces an optimal solution in linear time. For a problem with multiple outputs and the network has a tree structure, a backward shrink algorithm or method is used to provide an optimal solution in linear time. These algorithms are fully distributed, they require only local exchange of parameters between neighboring nodes, and are adaptive to the dynamic changes in network conditions and flow rate fluctuations.

    摘要翻译: 执行流数据处理系统中的资源分配,通过以资源分配问题作为线性程序,以成本有效的方式分配资源。 对于单个输出的问题,使用向后算法或方法,其产生线性时间的最优解。 对于多个输出的问题,网络具有树结构,使用向后收缩算法或方法来提供线性时间的最优解。 这些算法是完全分布的,它们只需要相邻节点之间的本地参数交换,并且适应网络条件和流量波动的动态变化。