COMPUTER SYSTEM AND NODE SEARCH METHOD

• US 20140032753A1
• Filed: 05/16/2011
• Published: 01/30/2014
• Est. Priority Date: 05/16/2011
• Status: Abandoned Application

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Watanabe, Kentaro, Takamoto, Yoshifumi, Tameshige, Takashi, Ichikawa, Yujiro
• Application Number:
  US14/110,867
• Publication Number:
  US 20140032753A1
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: H04L 41/022 Multivendor or multi-standard integration
• CPC Class Codes: H04L 41/0853 by actively collecting configuration information or by backing up configuration information
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

A computer system and node search method capable of reducing node discovery time in the computer system with a large number of nodes and a large number of supported protocols is proposed. The computer system includes a management server which is connected to each of first and second nodes via a network and collects and manages first information for each of the first and second nodes including network addresses of the first and second nodes and a protocol type of a communication protocol to be used when communicating with the first or second node. When the management server searches the first and second nodes over the network and detects the second node, it acquires the network address of each first node managed by the second node and the protocol type of the communication protocol to be used when communicating with the first node.

Claims

1. A computer system comprising:

a plurality of first nodes connected to a network;

one or more second nodes which are connected to the network and manage part or all of the plurality of first nodes; and

a management server which is connected to each of the first and second nodes via the network and collects and manages first information for each of the first and second nodes, including a network address of each of the first and second nodes and a protocol type of a communication protocol to be used when communicating with the first or second node,

wherein the second node manages second information including a network address of each management target first node among the plurality of first nodes and a protocol type of a communication protocol to be used when communicating with the first node, and

wherein when the management server searches the first and second nodes on the network and detects the second node, it acquires the network address of each of the first nodes managed by the second node and the protocol type of the communication protocol to be used when communicating with the first node, from the second node and manages the acquired network address and the acquired protocol type for each of the first nodes by associating them with each other.

2. A computer system according to claim 1,

wherein when the management server searches the first and second nodes and detects the first or second node, it acquires the protocol type of the communication protocol to be used when communicating with the first or second node and manages the acquired protocol type by associating it with the network address of the first or second node;

on the other hand, when the management server detects the second node, it acquires the network address of each of the first nodes managed by the second node and the protocol type of the communication protocol to be used when communicating with the first node, from the second node and verifies whether the corresponding first node can be accessed or not, by using the acquired network address and the acquired protocol type.

3. A computer system according to claim 1,

wherein when the first node is created by replicating another first node, the second node retains first relationship information indicating a correspondence relationship between the first node which is a replication source and the first node which is a replication destination, and

wherein the management server acquires the protocol type of the communication protocol for the first node replicated from the other first node by using the first relationship information and tries access to the first node, which is a target, by prioritizing the acquired protocol type.

4. A computer system according to claim 1,

wherein when the first node is created based on a template, the second node retains second relationship information indicating a correspondence relationship between the template and the first node created based on the template, and

wherein the management server acquires the protocol type of the communication protocol for the first node replicated from the other first node by using the second relationship information and tries access to the first node, which is a target, by prioritizing the acquired protocol type.

5. A computer system according to claim 1,

wherein the management server manages the network address of the second node in advance, and

wherein when searching the first and second nodes on the network, the management server prioritizes searching of the second node corresponding to the network address.

6. A computer system according to claim 1,

wherein when searching the first and second nodes on the network, the management server acquires the protocol type of the communication protocol to be used to access the first or second node detected by the search by executing trial processing for trying access sequentially to the detected first or second node by using a plurality of protocol types supported by the management server, and

wherein the trial processing is executed to try access to the first or second node, which is a target, by prioritizing the protocol type acquired for the first or second node detected last time.

7. A node search method for a computer system including:

a plurality of first nodes connected to a network;

one or more second nodes which are connected to the network and manage part or all of the plurality of first nodes; and

a management server which is connected to each of the first and second nodes via the network and collects and manages first information for each of the first and second nodes, including a network address of each of the first and second nodes and a protocol type of a communication protocol to be used when communicating with the first or second node,

wherein the second node manages second information including a network address of each management target first node among the plurality of first nodes and a protocol type of a communication protocol to be used when communicating with the first node,

the node search method comprising;

a first step executed by the management server searching the first and second nodes on the network; and

a second step executed by the management server, when detecting the second node, acquiring the network address of each of the first nodes managed by the second node and the protocol type of the communication protocol to be used when communicating with the first node, from the second node and managing the acquired network address and the acquired protocol type for each of the first nodes by associating them with each other.

8. A node search method according to claim 7,

wherein when the management server detects the first or second node in the first step, it acquires the protocol type of the communication protocol to be used when communicating with the first or second node and manages the acquired protocol type by associating it with the network address of the first or second node, and

wherein in the second step, the management server verifies whether the corresponding first node can be accessed or not, by using the network address and the protocol type of each of the first nodes acquired from the second node and managed by the second node.

9. A node search method according to claim 7,

wherein when the first node is created by replicating another first node, the second node retains first relationship information indicating a correspondence relationship between the first node which is a replication source and the first node which is a replication destination, and

wherein in the second step, the management server acquires the protocol type of the communication protocol for the first node replicated from the other first node by using the first relationship information and tries access to the first node, which is a target, by prioritizing the acquired protocol type.

10. A node search method according to claim 7,

wherein when the first node is created based on a template, the second node retains second relationship information indicating a correspondence relationship between the template and the first node created based on the template, and

wherein in the second step, the management server acquires the protocol type of the communication protocol for the first node replicated from the other first node by using the second relationship information and tries access to the first node, which is a target, by prioritizing the acquired protocol type.

11. A node search method according to claim 7,

wherein in the first step, the management server manages the network address of the second node in advance, and

wherein when searching the first and second nodes on the network, the management server prioritizes searching of the second node corresponding to the network address.

12. A node search method according to claim 7,

wherein when searching the first and second nodes on the network in the first step, the management server acquires the protocol type of the communication protocol to be used to access the first or second node detected by the search by executing trial processing for trying access sequentially to the detected first or second node by using a plurality of protocol types supported by the management server, and

wherein the trial processing is executed to try access to the first or second node, which is a target, by prioritizing the protocol type acquired for the first or second node detected last time.