中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.015 seconds)

    METHOD AND APPARATUS FOR CONCURRENT TOPOLOGY DISCOVERY
    2.
    发明专利
    METHOD AND APPARATUS FOR CONCURRENT TOPOLOGY DISCOVERY 未知

    公开(公告)号：CA2701107C

    公开(公告)日：2016-12-06

    申请号：CA2701107

    申请日：2008-11-21

    Applicant: IBM

    Inventor： VERMA DINESH C ,  MARTIN DANIEL JOSEPH

    IPC: H04L45/02 ,  H04L12/28

    Abstract: A method, system and computer-usable medium are disclosed for discovering the topology of a network by us-ing multiple discovery agents operating in parallel. A NodeList containing information about known nodes in a target network is received. The number ('K') of discovery agents to be used is determined, where 1

    Testing a virtualised network function in a network
    4.
    发明专利
    Testing a virtualised network function in a network 未知

    公开(公告)号：GB2523338A

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

    申请号：GB201403010

    申请日：2014-02-20

    Applicant: NG4T GMBH ,  IBM

    Inventor： CILLIS CANIO ,  KAPPEL JOCHEN ,  MARTIN DANIEL JOSEPH ,  MCDONALD MARTIN

    IPC: H04L12/26

    Abstract: The invention includes the steps of (i) creating a VNF (10) for deployment in the SDN-enabled network (12), (ii) retrieving metadata (14) from a configuration of the VNF, representing a network environment specific for the VNF, (iii) creating at least one Virtualised Network Tester (VNT, 16) in the network for testing the VNF, (iv) mapping the metadata to a test list (18) of the VNT, (v) performing a test suite according to the test list of the VNT on the VNF in a network environment specific for the Virtualised Network Function (10). The invention further relates to a data processing system for execution of a data processing program comprising software code portions for performing the method described above.

    Replication of a relational database
    5.
    发明专利
    Replication of a relational database 未知

    公开(公告)号：GB2524540A

    公开(公告)日：2015-09-30

    申请号：GB201405398

    申请日：2014-03-26

    Applicant: IBM

    Inventor： MARTIN DANIEL JOSEPH ,  HRLE NAMIK ,  STOLZE KNUT ,  MUELLER JENS

    IPC: G06F17/30

    Abstract: In response to receiving a request for replicating data of a source database to a relational target database, a first start position (SP1) representing the most recent log position within a transaction log is identified. After a time period, waiting to ensure that each currently executing transaction (T1.1, T2.1 etc.) has terminated, asynchronously creating a copy of the data of the source database excluding any changes by transactions not committed. After completion of copying, identifying a repair start position (RSLP) within the transaction log to identify transactions which started after the first start position and which committed before the repair start position in order to execute those transactions.

    Topology discovery comprising partitioning network nodes into groups and using multiple discovery agents operating concurrently in each group.
    6.
    发明专利
    Topology discovery comprising partitioning network nodes into groups and using multiple discovery agents operating concurrently in each group. 未知

    公开(公告)号：GB2464125A

    公开(公告)日：2010-04-07

    申请号：GB0818191

    申请日：2008-10-04

    Applicant: IBM

    Inventor： MARTIN DANIEL JOSEPH ,  VERMA DINESH C

    IPC: H04L12/24 ,  H04L12/56

    Abstract: A method, system and computer-usable medium are disclosed for discovering the topology of a network by using multiple discovery agents operating in parallel. A NodeList containing information about known nodes in a target network is received. The number (IC) of discovery agents to be used is determined and the nodes are partitioned into node groups, each of which has a group identifier respectively assigning it to a discovery agent. A GraphList is created to hold information about known and discovered nodes. Each entry in the NodeList list is processed by its assigned discovery agent, which sends probe messages to the target node to determine the node identifiers of discovered neighboring nodes. If the discovered nodes are not listed in the NodeList, then they are assigned to a node group for processing. If the connections between the target and the discovered neighboring node nodes are not listed in the GraphList, then they are added. Once all node and connection information is collected by the node discovery agents and listed in the GraphList, a network topology is generated.

Patent Agency Ranking