JPH01166158A - Access method for decentralized resources - Google Patents

Abstract

PURPOSE:To realize the access of decentralized resources by using virtual identification data by previously registering information joining the resources controlled with the aid of a computer connected by a communication means such as a network and virtual resource control structure to one computer and referring this information by each connected computer. CONSTITUTION:The communication means 30 consists of the local area network or the respective connection equipments of wide area data networks, an exchange, a channel and the like, for example. Besides, the computer 10 respectively consists of a command analysis part 101, a distributed resource access demand part 102, a local resources access execution part 103 and a communication control part 104. A control equipment 20 consists of a control command analysis part 201, a resource position control part 202, a resource position information storage memory 203, a resource position retrieval execution part 204 and a communication control part 205. Then, the virtual identification data of the resources and the real positional information of the resources for which the access is executed by using the virtual identification data are included to resources positional information stored in the memory 203.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a system consisting of a plurality of computers connected by a communication means such as a network and capable of transmitting information to each other. The present invention relates to a distributed resource access method that is effective when using resources managed by computers.

2. Description of the Related Art In recent years, technology has become important that connects a plurality of computers through communication means such as a network and enables one computer to use resources managed by other computers. Conventionally, in methods for accessing resources distributed on a network, a user specifies the location information on the network of the computer that manages the resource that the user wants to access, and the identification information of the resource within that computer. It was often used.

In another conventional example, resources managed by other connected computers are registered on each computer in the network with different identification names, and the computer user can The resources of a remote computer were being used with an identifier.

Problems to be Solved by the Invention However, in the former access method, in order to access resources in remote locations, users of each computer must always be aware of the location information of the computer that manages the resources they wish to use. I needed to.

In addition, in the latter conventional example, it is not necessary to register an identification name for each computer, so distributed resources correspond to a different structure for each computer, and when one user uses multiple different computers, each computer The problem was that the way distributed resources were viewed differently.

Furthermore, when connecting a new computer to the network or adding new resources, it is necessary to register a new identification name for each computer, and supporting system expansion involves complicated procedures. was.

The present invention solves the problems in the conventional distributed resource access method, and allows users of each computer to
It is possible to access resources managed by other computers on the network without being aware of their location information, and the same structure can be accessed on any computer, and system expansion is possible. The purpose is to provide a method for accessing distributed resources that is highly flexible.

Means for Solving the Problems In order to solve the above problems, the present invention provides communication means such as a network, and resources distributed on a plurality of connected computers, depending on their physical locations and structures. Management information that corresponds to a structure that enables virtual resource management is maintained on one computer, and resources managed by other computers are managed by virtual identification means that have the same structure on all computers. The above purpose is achieved by making it possible to access.

By realizing the above means, a virtual resource management structure that does not depend on physical location or structure can be defined, and the virtual resource management structure can be used to connect resources managed by computers connected via communication means such as networks. By registering linking information on one computer in advance and referring to this information on each connected computer, it becomes possible to access distributed resources using a virtual identification name. Therefore, the user
There is no need to remember the location information of the resources you want to use,
Furthermore, even when different computers are used, distributed resources can be seen as a common resource management structure, making it easier for users of multiple computers to share distributed resources. Furthermore, even when the system is expanded due to the connection of new computers or the addition of new resources, all computers can access the new resources by simply executing the registration process once.

EXAMPLES Hereinafter, examples of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a functional block diagram showing the configuration of an embodiment of the present invention. In the figure, numeral 10 is a computer that processes the method proposed by the present invention, and 20 is a management device that manages information to be processed by the method proposed by the present invention. Further, 30 is a communication means by which the computer 10 or the management device 20 mutually transmit information. The communication means 30 includes, for example, various connection devices, exchanges, communication paths, etc. of a local area network or wide area data network.

The computer 10 also includes an instruction analysis unit 101, a distributed resource access request unit 102 (hereinafter referred to as an access request unit), a local resource access execution unit 103 (hereinafter referred to as an access execution unit), and a communication control unit. It consists of 104. The management device 20 includes a management command analysis unit 201. Resource location management unit 202, resource location information storage memory 203 (hereinafter referred to as information storage memory), resource location search execution unit 204
(hereinafter referred to as search execution unit), and communication control unit 20
Consists of 5. Here, the resource location information stored in the information storage memory 203 includes the virtual resource identification name, and the actual location information and resource name of the resource accessed using the virtual identification name. shall be taken as a thing.

Further, 120 is a command statement from a user requesting access to distributed resources, 121 is a response statement to the user containing the result of processing corresponding to the above command statement 120, and 111 is a command statement from the computer 10.
It is a local resource managed by Reference numeral 220 indicates a management command statement from the information manager requesting registration, modification, or deletion of resource location information, and reference numeral 221 indicates a management response statement to the information manager that includes the results of processing corresponding to the management command statement 220.

Next, processing in each functional block shown in FIG. 1 will be explained using a flowchart.

FIG. 2(a) is a flowchart showing the processing of the instruction analysis unit 101. The command analysis unit 101 analyzes a command issued by a user, starts processing, and generates and outputs a response sentence to the user based on the result.

The command analysis unit 101 reads and analyzes the command sentence 120 from the user (step 2001), and assembles a message conveying the contents of the processing request (step 2002).

After assembling the message, start the access request unit 102 (Step 2003), wait for the end of the process, create and output the response text 121 to the user based on the processing result (Steps 2004 and 2005), and write the next command statement. Waiting for input.

FIG. 2(b) is a flowchart showing the processing of the access request unit 102. The access request unit 102 is activated by the command analysis unit 101, searches for the location of the resource to be actually accessed, and searches for the location of the resource to be actually accessed, and accesses the remote resource managed by another computer connected via the communication means 30, or the local resource managed by the own computer. A request for access to the resource 111 is issued.

After accepting the process, the access request unit 102 analyzes the processing command (step 2101), extracts the virtual identifier of the distributed resource (step 2102), and requests actual access from the virtual identifier. In order to obtain the location information and resource name of the target resource, the management device 20 connected via the communication means 30 assembles a message in a format that allows conversion of the identification name (step 2103), and after activating the communication control unit 104. (Step 2104), wait for the end of the process.

When the processing of the communication control unit 104 is completed and the location information and resource name of the resource to which access is actually requested is obtained, the access execution unit 103 actually sends a request message in a format that allows access to the target resource. Assembling (step 2105), if the location of the resource to be accessed is a local resource, that is, on the own computer, the access execution unit 103 is activated. If it is on the computer 10, the communication control unit 104 is activated (step 2107). When each process is completed and a completion message is obtained, edit the process results and start the instruction analysis unit 101 again (
Step 2108), the next processing reception is in the attached state.

FIG. 2(C) is a flowchart showing the processing of the access execution unit 103. The access execution unit 103 accepts access requests from the access request unit 102 within its own computer or from other computers 10 connected through the communication means 30, and executes access to the local resources 111.

After accepting the process, if the content of the request message is valid, the access execution unit 103 executes access to the local resource 111 (step 2201), and creates a termination message based on the execution result (step 2202). If there is an error in the request message, a message indicating abnormal termination is created (step 2203). Thereafter, the access request unit 102 or the communication control unit 104 that activated the access execution unit 103 is activated while returning the termination message (steps 2204 and 2205), and the next processing is ready.

FIG. 2(d) is a flowchart showing the processing of the communication control unit 104. The communication control unit 104 communicates messages with other computers IO via the communication means 30.

If the communication control unit 104 is activated by the communication means 30, it analyzes a message received from another computer 10 connected by the communication means 30 (step 2301), and if this message indicates an access request, the access execution unit 103 (step 2302), and if it indicates the end of execution of distributed resource access or the end of resource location search, start the access request unit 102 (step 230).
3.2304).

If the access request unit 102 and the access execution unit 103 are not yet activated by the access request unit 102, a message for transmission is assembled (step 2305), and this message is sent to another computer via the communication means 30. (Step 2306).

FIG. 2(e) shows the processing of the management command analysis unit 201.
It is a flowchart. The management command analysis unit 201 analyzes a management command issued by an information manager, starts processing, and generates and outputs a management response sentence 221 to the information manager based on the result.

The management command analysis unit 201 first reads and analyzes the management command statement 220 from the information manager (step 2401).
, assemble a message conveying the contents of the processing request (step 2402). After assembling the message, start the resource location management unit 202 (step 2403), wait for the end of processing, and create and output a management response text 221 to the information manager based on the processing results (step 2404).
2405), the next management command is awaited.

FIG. 2(f) shows the processing of the resource location management unit 202.
It is a flowchart. The resource location management unit 202 is activated by the management command analysis unit 201 and stores information in the information storage memory 20.
Register, change, or delete the resource location information stored in 3.

The resource location management unit 202 extracts the processing command from the input message after assigning the processing fee (step 2501);
Depending on the retrieved processing command, the resource location information is registered (step 2502), changed (step 2503), or deleted (step 2504), and when the processing is completed, the management command analysis unit 201 is started again (step 2505).
), the next processing fee will be available.

FIG. 2(g) is a flowchart showing the processing of the search execution unit 204. The search execution unit 204 accepts information search requests from other computers 10 connected through the communication means 30 and searches for location information of resources to which access is actually requested.

After paying the processing fee, if the content of the request message is valid, the search execution unit 204 executes a search for resource location information (step 2601), creates a termination message based on the execution result (step 2602), and sends the request message. If there is an error in the message, a message indicating abnormal termination is created (step 2603). Thereafter, the communication control unit 205 that activated the search execution unit 204 returns the above-mentioned termination message and is activated again (step 2604), and the next processing fee is not paid.

FIG. 2(h) is a flowchart showing the processing of the communication control unit 205. The communication control unit 205 communicates messages with other computers via the communication means 30.

When activated by the communication means 30, the communication control unit 205 analyzes messages received from other computers connected by the communication means 30 (step 2701), and activates the search execution unit 204 (step 2702).

Furthermore, when activated by the search execution unit 204, this message is transmitted to another computer via the communication means 30 (step 2703).

Next, an example of the information storage memory 203 that realizes the virtual resource management structure in FIG. 1 will be shown.

FIG. 3(a) is an example of the information storage memory 203 described above. 301 is a virtual identification name for identifying a remote distributed resource, 302 is the location information of a computer that manages the resource corresponding to the virtual identification name 301, and 303 is a virtual identification name for identifying the resource corresponding to the virtual identification name 301. Indicates the resource name required to perform the access.

FIG. 3(b) shows the results shown in FIG. 2(a) using the above management information.
) to (h) on the requesting computer 1 when executing the processes shown in (h)
0 shows the flow of messages.

Reference numeral 120 indicates a command statement from the user, which here represents an access command to the resource corresponding to the virtual identification name "inventory file". The access command 120 is analyzed by the command analysis unit 101 and determined to be a resource access request command, assembled into a message 310 format in step 2002 of FIG. 2(a), and passed to the access request unit 102. The access request unit 102 sends a request message 310
The virtual identification name “Inventory File” is extracted from
), a virtual identification name search request message 311 is assembled and sent to the communication control unit 104. The communication control unit 104 performs step 230 in FIG. 2(d).
5, a transmission frame including the message 312 is assembled and transmitted to the management device 20 via the communication means 30.

The communication control unit 205, which has received the frame containing the search request message 312, activates the search execution unit 204 in step 2702 of FIG. 2(h) and passes the search request message 313. The search execution unit 204 passes a search request message 313. The search execution unit 204 analyzes the search request message 312, determines that it is a search request, searches the information storage memory 203 shown in FIG.
``Computer A'' and resource name ``File a'' are obtained. As a result, in step 2602 of FIG. 2(g), a response message 314 is assembled and sent to the communication control section 205. The communication control unit 205 assembles a communication frame including the message 314 in step 2704 of FIG. 2(h),
This frame is transmitted to the computer 10 via the communication means 30. The communication control unit 104, which has received the frame including the message 314, activates the access request unit 102 in step 2304 of FIG. 2(d), and sends the response message 3
Pass 14. The access request unit 102 performs step 210
5, assemble the access request message, 31
5 is sent to the communication control unit 104 as a transmission request message. The communication control unit 104 performs step 230 in FIG. 2(d).
5, a transmission frame including the message 316 is assembled and transmitted to the computer A via the communication means 30.

Furthermore, as another embodiment, an example will be shown in which the identifiers of distributed resources are managed using a virtual tree structure. FIG. 4(a) shows a virtual tree structure in the above embodiment. 40 represents the root in the virtual tree structure, and is assigned the identification name "Sales". 41, 42, and 43 are nodes branching from the root 40, and are assigned the identification names "customer", "inventory", and "sales", respectively. The node 41 has a leaf 44 with the identifier "Osaka" and a node 45 with the identifier "Tokyo",
Furthermore, the node 45 has a leaf 46 with the identifier "West District" and a leaf 47 with the identifier "East District". Node 42 has a leaf 48 with the identifier "Inventory," and node 43 has leaves 49, 50, . . . with the identifiers "Osaka Office,""NagoyaOffice,""TokyoOffice," respectively. 51. Each node is an intermediate part of the path to reach other nodes or leaves; it has a distinguished name but does not correspond to an actual resource.A leaf is a virtual It is the terminal in the target tree structure,
It has an identification name and corresponds to any of the resources distributed among the computers on the actual network.

FIG. 4(b) shows an example of the information storage memory 203 on the management device 20 that implements the virtual tree structure shown in FIG. 4(a). Here, roots and nodes are referred to as "(
'' is used to represent nodes and leaves branched from there in a structure format, and leaves are used with identification names and r'->J to realize location information and access of computers that manage the corresponding resources. represents the resource name.

Effects of the Invention As described above, the present invention allows a computer user to access resources managed by other computers connected via a communication means such as a network without memorizing their location information or uniform identification name. Even when one user uses a plurality of different computers, distributed resources can be seen as a common resource management structure, making it easy for users of a plurality of computers to share distributed resources. Furthermore, since distributed resources are managed on one management device, it is possible to easily handle the connection of new computers and the addition of new resources.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram showing the configuration of an embodiment of the present invention, FIGS. 2(a) to (h) are flowcharts showing the processing of each functional block in FIG. 1, and FIG. 3(a), (b)
Figure 1 shows an example of the distributed resource identification name management table stored in the memory and a message flowchart when processing is executed using it. FIG. 7 is a diagram showing an example of a virtual tree structure diagram and an identification name management table expressing it in another embodiment. IO...Computer, 20...Management device, 30...Communication means, 101...Instruction analysis unit, 102...Distributed resource access request unit, 103...Local resource access execution unit, 104... ...Communication control unit, 111...Local resources, 201...Management command analysis unit, 202...Resource location management unit, 203...Resource location information storage memory,
204...Resource location search execution unit, 205...Communication control unit, 301...Virtual identification name, 302...Location information of the computer that manages the access resource, 303...Resource of the access resource name, 310...Request message to the access request unit, 311...Request message to the communication control unit, 312...Response message to the search execution unit,
313...Response message to communication control unit, 314.
...Response message to access request section, 315...
Transmission request message to communication control unit, 316... Processing request message to computer A, 40... Root of virtual tree structure, 41.42.43.45... Clause of virtual tree structure, 44 .46.47.48.49.50.51... Leaves of virtual diary structure. Name of agent: Patent attorney Toshio Nakao and one other person
Mizu Ou -ko stock

Claims (1)

[Claims] Management that realizes virtual resource management in which resources distributed on each computer are made to appear as if they were resources on a single computer, in multiple computer systems that are connected by communication means and have the ability to transmit information to each other. Information is held on one computer in the computer system, and access to distributed resources in remote locations is performed using virtual identification means having the same resource management structure on all computers. How to access distributed resources.