中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.018 seconds)

    ROUTING COSTS IN DATA NETWORKS
    1.
    发明申请
    ROUTING COSTS IN DATA NETWORKS 审中-公开
    数据网络中的路由成本

    公开(公告)号：WO0243324A3

    公开(公告)日：2002-09-06

    申请号：PCT/IB0102078

    申请日：2001-11-12

    Applicant: IBM ,  BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

    Inventor： BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

    IPC: H04L12/18 ,  H04L12/721 ,  H04Q11/04 ,  H04L12/56

    CPC classification number: H04Q11/0478 ,  H04L45/124

    Abstract: A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.

    Abstract translation: 一种用于导出包括数据通信网络中的源节点和多个目的地节点的节点组的一组有效路径成本的方法，其中，所述组中的节点之间的路径的路径开销在网络中定义，并且每个路径 成本包括限制性成本和附加成本，包括首先迭代地识别较高带宽的路径，并且当遇到两个或更多个相等带宽的路径时，选择具有与之相关联的较低传输延迟的路径。

    Computer mounting method, system and computer program, for verifying correctness of execution history including multiple operations operated in parallel to data structure
    2.
    发明专利
    Computer mounting method, system and computer program, for verifying correctness of execution history including multiple operations operated in parallel to data structure 有权
    计算机安装方法，系统和计算机程序，用于验证执行历史的正确性，包括与数据结构并行运行的多个操作

    公开(公告)号：JP2010186476A

    公开(公告)日：2010-08-26

    申请号：JP2010025026

    申请日：2010-02-08

    Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

    Inventor： DRAGICEVIC KRISTIJAN ,  BAUER DANIEL ,  GARCES-ERICE LUIS

    IPC: G06F11/28

    CPC classification number: G06F11/3636

    Abstract: PROBLEM TO BE SOLVED: To provide a computer mounting method, system and computer program for verifying correctness of execution history including multiple operations operated in parallel to a data structure. SOLUTION: Since multi-core processors have become the standard architecture for general purpose machines, programmers are required to write software optimized for parallelism. Verification of correctness is an important issue for parallel code because of its complexity. There are still tools missing that provide verification for complex code (for instance, testing the execution of code). Consequently, the system and method for evaluating the correctness of program traces are disclosed. Furthermore, the system and method disclosed in this technology do not demand excessive computational requirements even when the size of the program trace being evaluated increases. COPYRIGHT: (C)2010,JPO&INPIT

    Abstract translation: 要解决的问题：提供一种用于验证包括与数据结构并行操作的多个操作的执行历史的正确性的计算机安装方法，系统和计算机程序。 解决方案：由于多核处理器已成为通用机器的标准架构，因此程序员需要编写针对并行化优化的软件。 验证正确性是并行代码的一个重要问题，因为它的复杂性。 还有一些工具缺少提供复杂代码的验证（例如，测试代码的执行）。 因此，公开了用于评估程序迹线的正确性的系统和方法。 此外，即使当被评估的程序跟踪的大小增加时，该技术中公开的系统和方法也不需要过多的计算需求。 版权所有（C）2010，JPO＆INPIT

    5.
    发明专利
    未知

    公开(公告)号：AT380431T

    公开(公告)日：2007-12-15

    申请号：AT03753868

    申请日：2003-10-28

    Applicant: IBM

    Inventor： ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

    IPC: H04L29/08 ,  H04L12/24 ,  H04L29/06

    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.

    NETWORK TRAFFIC CONTROL IN PEER-TO-PEER ENVIRONMENTS
    6.
    发明专利
    NETWORK TRAFFIC CONTROL IN PEER-TO-PEER ENVIRONMENTS 未知

    公开(公告)号：AU2003272028A1

    公开(公告)日：2004-06-15

    申请号：AU2003272028

    申请日：2003-10-28

    Applicant: IBM

    Inventor： ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

    IPC: H04L12/24 ,  H04L29/06 ,  H04L29/08

    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.

    NETWORK TRAFFIC CONTROL IN PEER-TO-PEER ENVIRONMENTS
    7.
    发明专利
    NETWORK TRAFFIC CONTROL IN PEER-TO-PEER ENVIRONMENTS 未知

    公开(公告)号：CA2505630A1

    公开(公告)日：2004-06-03

    申请号：CA2505630

    申请日：2003-10-28

    Applicant: IBM

    Inventor： WALDVOGEL MARCEL ,  ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL

    IPC: H04L12/24 ,  H04L29/06 ,  H04L29/08

    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic the n manages a request represented by an intercepted message subject to its conte nt and subject to peering specific information.

    Costs in data networks
    8.
    发明专利
    Costs in data networks 未知

    公开(公告)号：AU1259602A

    公开(公告)日：2002-06-03

    申请号：AU1259602

    申请日：2001-11-12

    Applicant: IBM

    Inventor： BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

    IPC: H04L12/18 ,  H04L12/721 ,  H04Q11/04 ,  H04L12/56

    Abstract: A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.

    9.
    发明专利
    未知

    公开(公告)号：DE60317925T2

    公开(公告)日：2008-11-27

    申请号：DE60317925

    申请日：2003-10-28

    Applicant: IBM

    Inventor： ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

    IPC: H04L29/08 ,  H04L12/24 ,  H04L29/06

    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.

    10.
    发明专利
    未知

    公开(公告)号：DE60317925D1

    公开(公告)日：2008-01-17

    申请号：DE60317925

    申请日：2003-10-28

    Applicant: IBM

    Inventor： ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

    IPC: H04L29/08 ,  H04L12/24 ,  H04L29/06

    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.

Patent Agency Ranking