JP4890412B2 - Network distributed sharing system, network distributed sharing method, and network distributed sharing program - Google Patents

Description

  The present invention relates to a data transfer technique for sharing data via a network with distributed applications.

  In applications in ubiquitous environments such as ubiquitous networks and ubiquitous computing systems (hereinafter referred to as ubiquitous applications), various device groups such as sensors and actuators, and computer groups such as sensor data servers and actuator control servers are connected to the network. Services are provided by exchanging data with each other. Such a ubiquitous application is composed of each device and each application program arranged on the computer.

  A ubiquitous application is developed and operated as a distributed program in which each application program performs processing in parallel. At this time, a large number of device groups exist, and the devices themselves are added / renewed as needed. In addition, a device installed in a mobile body is not always able to communicate constantly or change its location or accommodated network. On the other hand, with the development of new services, computers that communicate with devices can be added or changed at any time.

  In application development and operation in such a dynamically changing ubiquitous environment, there is an environment in which programming and execution can be performed without being aware of the communication address and status of the partner with which data is exchanged (the network connection status and existence itself). Necessary. As a method for realizing this environment, the use of a tuple space proposed by the parallel programming concept Linda is effective (see Non-Patent Document 1 and Non-Patent Document 2).

  The entity of data management in Linda is called Tuple Space, which provides a cooperative mechanism similar to distributed memory suitable for distributed system development. The application communicates by writing transmission / reception data as Tuple and writing it to Tuple Space or reading Tuple from Tuple Space.

D. Gelernter, “Generative Communication in Linda”, ACM Transactions on Programming Language and Systems, Vol.7, No.1, January 1985, Pages 80-112. Toshiyuki Masui, Koji Tsukada. “World Programming” IPSJ Summer 2006 Programming Symposium, September 2006

  However, the communication device disclosed in Patent Document 1 or 2 has a problem that the amount of communication increases because all information is written to and read from the Tuple Space as Tuples.

  The present invention has been made in view of such circumstances, and an object of the present invention is to provide a network distributed sharing system that is communication using Tuple Space and that can reduce the amount of communication.

The present invention has been made to solve the above-described problems, and is a network distributed sharing system in which a plurality of communication devices are connected via a network, and each of the plurality of communication devices stores at least a destination tuple storage. The tuple information including the part identification information is stored, and the tuple storage unit identified by the tuple storage unit identification information and the tuple information stored in the tuple storage unit are transmitted, or the received tuple information is the tuple. A relay proxy unit for storing in the storage unit, wherein the relay proxy unit reads tuple information from a tuple storage unit included in the communication apparatus, and the read tuple information is included in the read tuple information as the destination tuples storage unit corresponding to the destination tuple storage unit identification information, and sending transfer unit to be transmitted through the network, the Tuple information received via the Ttowaku a network distributed sharing system characterized by having a a receiving-side transfer unit for storing the tuple storage unit the own communication apparatus.

  Further, according to the present invention, the tuple storage unit includes a tuple information storage unit that stores the tuple information, a tuple search information storage unit that stores tuple search information for searching the tuple information, and the tuple. When information is stored in the tuple information storage unit, it is determined whether or not the stored tuple information corresponds to the tuple search information stored in the tuple search information storage unit. And a tuple information extraction unit that outputs the corresponding tuple information to the transmission side transfer unit.

  In the present invention, the tuple information extraction unit is configured to store the tuple search information stored in the tuple information storage unit when the tuple search information is stored in the tuple search information storage unit. 3. The network distributed sharing according to claim 2, wherein it is determined whether or not the information corresponds to the information, and if the determined result corresponds, the corresponding tuple information is output to the transmission side transfer unit. System.

  In the present invention, the tuple search information includes transmission source tuple storage unit identification information, and the tuple storage unit stores tuple meta search information for searching the tuple search information in advance. Whether the stored tuple search information corresponds to the tuple meta search information stored in the tuple meta search information storage unit when the tuple search information is stored in the tuple search information storage unit. A tuple search information extraction unit that outputs the relevant tuple search information to the transmission side transfer unit when the determination result is applicable, and the transmission side transfer unit includes the tuple search information Information is transmitted to the tuple storage unit corresponding to the transmission source tuple storage unit identification information included in the tuple search information via the network, and the reception-side transfer unit Tuple search information received via the Ttowaku, stores the tuple retrieval information storage unit which the own communication device has a network distributed sharing system, characterized in that.

  Further, according to the present invention, one communication device among the plurality of communication devices is a server device, and the other plurality of communication devices of the server device are terminal devices, and the tuple search information storage unit of the terminal device Is stored in advance as a tuple search information in which the tuple storage unit corresponding to the destination tuple storage unit identification information is the tuple storage unit of the server device, and the terminal device stores the tuple information storage unit of the terminal device. When the tuple information is stored in the terminal device, the tuple information extraction unit of the terminal device, when the stored tuple information corresponds to the tuple search information, Output to the transmission side transfer unit of the device, and the transmission side transfer unit of the terminal device transmits the tuple information to the server via the network based on the destination tuple storage unit identification information. And the tuple information stored in the tuple information storage unit of the server device is stored in the tuple information received from the terminal device via the network by the receiving side transfer unit of the server device. A distributed shared system.

  In the present invention, the tuple meta search information storage unit of the terminal device stores in advance tuple meta search information in which the tuple storage unit corresponding to the transmission source tuple storage unit identification information is used as the tuple storage unit of the server device. In response to the tuple search information being stored in the tuple search information storage unit of the terminal device, the terminal device has the tuple search information extraction unit of the terminal device store the tuple search information stored in the terminal device. When the tuple meta search information is applicable, the stored tuple search information is output to the transmission side transfer unit of the terminal device, and the transmission side transfer unit of the terminal device transmits the tuple search information to the transmission side transfer unit. Transmitting to the server device via the network based on the transmission source tuple storage unit identification information, the receiving side transfer unit of the server device, the network via the network The tuple search information received from the end device is used as the tuple storage unit identification information for identifying the tuple storage unit of the terminal device that has transmitted the tuple search information as the destination tuple storage unit identification information of the received tuple search information. A network distributed sharing system is characterized in that it is stored in a tuple search information storage section of the tuple storage section of a server device.

  Further, according to the present invention, the tuple information extraction unit of the server device stores the tuple search information stored in the server device in response to the tuple search information stored in the tuple search information storage unit of the server device. Is read from the tuple information storage unit included in the server device, and the read tuple information is output to the transmission side transfer unit included in the server device. Based on the destination tuple storage unit identification information, the tuple information is transmitted to the terminal device via the network, and the reception side transfer unit of the terminal device receives the tuple information received via the network. Is stored in a tuple information storage unit included in the network distributed sharing system.

  The present invention is the network distributed sharing system, wherein the tuple information storage unit of the server device is a hard disk or has a power backup unit.

Further, according to the present invention, a plurality of communication devices are connected via a network, and each of the plurality of communication devices stores tuple information including at least transmission destination tuple storage unit identification information, and is identified by the tuple storage unit identification information. And a relay proxy unit that transmits the tuple information stored in the tuple storage unit or stores the received tuple information in the tuple storage unit. The relay proxy unit reads the tuple information from the tuple storage unit included in the communication apparatus, and the tuple storage corresponding to the destination tuple storage unit identification information included in the read tuple information. the part as the destination, and transmitted over the network, the tuple information received via the network, the own communication device Stored in the tuple memory unit having a network distributed shared wherein the.

Further, according to the present invention, a plurality of communication devices are connected via a network, and each of the plurality of communication devices stores tuple information including at least transmission destination tuple storage unit identification information, and is identified by the tuple storage unit identification information. Used in a network distributed sharing system including: a tuple storage unit that is configured to transmit the tuple information stored in the tuple storage unit; or a relay proxy unit that stores the received tuple information in the tuple storage unit Read out the tuple information from the tuple storage unit included in the communication device, and the read tuple information corresponds to the destination tuple storage unit identification information included in the read tuple information. tuple storage unit as the destination, and sending transfer instructions to be transmitted through the network, said net Tuple information received via chromatography click a network distributed sharing program for executing a receiving transfer procedure to be stored in the tuple memory unit the own communication apparatus.

  According to the present invention, there is an effect that it is possible to provide a network distributed sharing system that is a communication using Tuple and that can reduce the amount of communication.

<Overview of Tuple Space>
First, an overview of Tuple Space will be described. Tuple Space is a conceptual shared memory, and application programs communicate with each other by writing data as Tuple into this Tuple Space and reading data as Tuple from this Tuple Space. For example, this Tuple Space serves as a bulletin board.
For example, the sending application program writes data to the Tuple Space, which is this bulletin board. On the other hand, the receiving-side application program searches the Tuple Space, which is a bulletin board, by specifying the necessary data conditions, and reads data that matches the conditions. Through indirect communication via the Tuple Space on the bulletin board, the application program can communicate without being aware of the communication partner by simply reading and writing data to and from the Tuple Space, which is the bulletin board. Since data transmission / reception can be simplified in this way, each application program can be independently developed and operated regardless of environmental changes.

  Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a schematic block diagram showing the configuration of a network distributed sharing system according to an embodiment of the present invention. As shown in FIG. 1, a communication terminal 1 and a communication terminal 2 are connected via a connection NW (connection network) 3. Each of the communication terminal 1 and the communication terminal 2 includes a plurality of applications 11 that operate on the own communication terminal, a uTupleSpace 12 that is a Tuple Space, and a Relay Agent 13 that connects each communication terminal to the connection NW 3.

  The application 11 operates on the communication terminal, and writes data to and reads data from the uTupleSpace 12 included in the communication terminal, thereby allowing the applications 11 on the communication terminal to communicate with each other and between other communication terminals. The communication is executed.

  The uTupleSpace 12 is a Tuple Space used in this embodiment, and provides a data transmission / reception function (uTupleSpace-API) by Tuple to the application 11. However, the uTupleSpace 12 alone can only share data between applications connected to the same uTupleSpace 12. For example, in the communication terminal 1, data can be shared only between the applications 11 of the communication terminal 1 via the uTupleSpace 12 of the communication terminal 1. Therefore, communication can be performed only between the applications 11 of the communication terminal 1. Therefore, as will be described later, by connecting a plurality of uTupleSpaces 12 with a RelayAgent 13 via a connection NW3, one uTupleSpace 12 is logically configured for the application 11 of each communication terminal, and seamless data sharing is performed. Realize. Note that if the uTupleSpae-API supports the distributed object technology, the application 11 may not necessarily operate on the same terminal as the uTuleSpace 12. On the other hand, the connection NW3 is intended for a network in which the distributed object technology is difficult to implement.

  The RelayAgent 13 provides a function of connecting the uTupleSpaces 12 and transferring data between communication terminals. The RelayAgent 13 is realized as one application 11 on the uTupleSpace 12 for the following reason.

  In general, the connection NW3 that connects the uTupleSpaces 12 is diverse. Also, the connection form can be variously varied such as a flat configuration and a hierarchical configuration. In addition, a data transfer method according to the configuration is required. Furthermore, it is necessary to define a data transfer method according to the function sharing between the uTupleSpaces 12. Therefore, the following merit can be obtained by mounting the connection function between uTupleSpaces 12 as an application separately from uTupleSpace 12 itself.

(A) Extensibility
When changing / adding the connection NW3 between uTupleSpaces 12, the connection form, or changing the function sharing, an appropriate RelayAgent 13 may be prepared.
(A) Portability Therefore, even if the connection NW3, the connection form, and the function sharing differ, the RelayAgent 13 conceals the difference, so the portability of the uTupleSpace 12 and its application 11 is high.

  Data is read and written between RelayAgent 13 and uTupleSpace 12 using uTupleSpace-API, and data is transferred between RelayAgent 13 using the communication interface of connection NW3.

  Next, the operation of a specific processing procedure will be described. In the following, it is assumed that the uTupleSpaces 12 are connected between the communication terminal 1 and the communication terminal 2, that is, there is one uTupleSpace 12 to be connected.

(1) First, in the communication terminal 1, the application 11 writes Tuple in its (first) uTupleSpace 12.
(2) Next, in the communication terminal 1, the (first) RelayAgent 13 on the first uTupleSpace 12 acquires the Tuple to be transferred from the first uTupleSpace 12, and passes to the (second) RelayAgent 13 via the connection NW3. Forward.

(3) Next, in the communication terminal 2, the second RelayAgent 13 writes the received Tuple into its (second) uTupleSpace 12.
(4) Next, in the communication terminal 2, the application 11 on the second uTupleSpace 12 reads the necessary Tuple.
In addition, said 1st is the communication terminal 1 and 2nd is the communication terminal 2. FIG.

<Communication between communication terminals: Data transfer method>
Next, the operation when transferring a Tuple shared between a plurality of uTupleSpaces 12 will be described with reference to FIGS. There are roughly the following two modes for transferring Tuple shared between a plurality of uTupleSpaces 12. Method 1 is a completely shared data transfer method, and method 2 is a partially shared data transfer method. This method 2 is further divided into two methods from the viewpoint of specifying a search condition for a shared Tuple on the transmission side or the reception side.

  Next, each method will be described. First, method 1 is a completely shared data transfer method. This method 1 is a method in which mirroring is performed between connected uTupleSpaces 12 (all Tuples are copied to match the set of Tuples held individually).

  The operation in the case of Tuple transfer according to method 1 will be described with reference to FIG. Here, as will be described later, a Tuple to be written as data is called actual. First, the RelayAgent 13 reads (reads) all actual data written in the local uTupleSpace 12, and writes the same actual data in the remote uTupleSpace 12 (see (3) and (4) in FIG. 2).

  As a result, the writing of the transmitting application and the reading of the receiving application (actual condition matching) are completed locally. In this case, the condition (formal-1 in FIG. 2) for the relay agent 13 on the transmission side to read the actual needs to match all the actual written locally. In addition, when the actual is acquired (taken) by the application in one uTupleSpace 12 or deleted based on the expiration date, a synchronization process such as deleting the other is also required. Note that formal is a search condition for searching for actual. This formal will be described later.

  Next, method 2 is a partially shared data transfer method. This method 2 is a method for transferring data by transferring only necessary Tuples between the connected uTupleSpaces 12 from one to the other. This method 2 further includes a case of remote writing and local reading as method 2-1 and a case of local writing and remote reading as method 2-2.

  First, the case of performing local writing and remote reading in method 2-1 will be described. In this method 2-1, the actual to be shared is written to the remote uTupleSpace 12 where the receiving side application can exist (remote writing). Next, the receiving side application reads the necessary actual from its uTupleSpace 12 (local reading).

  With reference to FIG. 3, the operation in the case of Tuple transfer according to this method 2-1 will be described. The operation in this case is almost the same as the operation of method 1 described with reference to FIG. The difference between the operation of the method 2-1 in FIG. 3 and the operation of the method 1 in FIG. 2 is that only the ones to be shared among the actuals written in (1) in FIG. 3 are transferred. Further, at this time, the actual search condition (formal-3) to be transferred is characterized in that it is determined by the transfer source (transmission side) regardless of the application on the reading side.

  Next, description will be made on the case of local writing and remote reading in method 2-2. In this method 2-2, in contrast to the method 2-1, the actual to be shared is not transferred arbitrarily from the transmission side. In Method 2-2, the remote side uTupleSpace 12 is indirectly accessed from the receiving side application, and the necessary actual is read. In other words, remote reading.

  The operation in the case of Tuple transfer according to this method 2-2 will be described with reference to FIG. First, for remote reading, it is necessary to transfer the actual search condition (formal-2) of the receiving side application to the transmitting side. Therefore, in this method, the transmission-side RelayAgent 13 acquires formal-2 in advance and searches for a local actual based on the acquired formal-2 condition. For the transfer of formal-2, meta-formal-1 described later is used to read the formal-2 of the receiving side RelayAgent 13. Thus, this method is characterized in that the actual to be transferred is determined by the transfer destination (reception side).

  In the case of method 2, the case is divided for each of the two uTupleSpaces 12 to be connected, depending on which method is used in each scene of transmission and reception. Therefore, a total of four combinations are possible. The selection of which combination is appropriate from the four combinations is selected based on the calculation resources of each communication terminal, the communication resources and communication costs provided by the connection NW3, and the assumed application contents. Is possible.

  Next, Tuple will be described. Tuple is a transmission / reception data or reception data format between the application program and the uTupleSpace 12. This Tuple is described by a set of fields. This field is a pair of key and value, and has a pre-defined essential field and a field that can be freely described by the user as will be described later. Also, in principle, the Tuple written in the uTupleSpace 12 is made permanent. Therefore, it can be recovered even when the device is restarted. Further, it is possible to set an expiration date that can hold the Tuple in the uTupleSpace 12. Therefore, Tuples whose expiration date has passed can be deleted from uTupleSpace 12.

  Tuple has three types of Tuples: actual, formal, and meta-formal. actual is a Tuple that the application writes to the uTupleSpace 12 as data. The formal is a Tuple that is registered in the uTupleSpace 12 as an actual search condition when reading (reading) or acquiring the actual from the uTupleSpace 12. The meta-formal is a formal for searching a formal, and is a Tuple that is registered in the uTupleSpace 12 as a formal search condition when reading (reading) or acquiring (take) the formal from the uTupleSpace 12, just like the formal .

  Next, with reference to FIG. 5, the operation when the application 11 writes and reads the Tuple in the uTupleSpace 12 using the three types of Tuples described above, actual, and meta-formal. explain. Here, for example, in the communication terminal 1 shown in FIG. 1, a plurality of applications 11 of the communication terminal 1 write Tuple to the uTupleSpace 12 of the communication terminal 1 and read Tuple from the uTupleSpace 12 of the communication terminal 1. Will be described.

First, the application 11 (AP11) indicated by reference numeral B51 writes actual into the uTupleSpace 12 (step S51). Next, the application 11 indicated by reference numeral B52 writes formal in the uTupleSpace 12 (step S52). Next, the application 11 indicated by reference numeral B52 reads from the uTupleSpace 12 the actual that matches the formal conditions written in the uTupleSpace 12 (step S53).
In addition, the application 11 indicated by reference numeral B53 writes the meta-formal into the uTupleSpace 12 (step S53). Next, the application 11 indicated by reference numeral B53 reads a formal that matches the meta-formal condition written in the uTupleSpace 12 from the uTupleSpace 12 (step S54).
Note that there are two types of reading (read / take): search type and notification type, and the above description is based on the notification type. In the case of the search type, the order of step S51 and step S52, and step S52 and step S53 may be switched.

  Next, fields that are constituent elements of Tuple will be described with reference to FIG. Tuple has at least (1) transmission source uTupleSpace identification information and (2) transmission destination uTupleSpace identification information as fields. Further, as a field for efficiently performing Tuple transmission / reception between the applications 11, (3) sensor / actuator type, (4) command / event type, and (5) parameter may be included. Other information may include (6) time stamp information and (7) quality class.

  The source uTuleSpace identification information is an identifier for identifying the uTupleSpace that is the sending side of the Tuple transfer, has “from” as a key, and, for example, a name, address, arbitrary character string or number identifying uTupleSpace Have binary data. The destination uTuleSpace identification information is an identifier for identifying the uTupleSpace that is the receiving side of the Tuple transfer. Have binary data. For example, when only one uTupleSpace is held in a terminal, the terminal identification information may be used as an identifier of uTupleSpace.

The sensor / actuator type is a field indicating an element that constitutes an application such as a sub-application or a device, has a subject as a key, and a value, for example, a name or address for identifying the type of the application or sensor / actuator , Have any string or number. This meaning is defined in advance between applications.
The command / event type is a field indicating processing required for an application or application component, and has type as a key. The value is, for example, a character string “SET” representing setting or acquisition of a parameter or data, a response, or an event. , “GET”, “RESPONSE”, and “TRAP”. The specific value and meaning are defined in advance between applications.
The parameter indicates data or a set of data required for performing the process indicated by the command / event type for the application indicated by the sensor / actuator type, has a body as a key, and the value is an arbitrary value. A set of fields. Keys and values are defined in advance between applications.
The time stamp information includes date as a key and information indicating time as a value, for example, a character string “YYYYMMDDHHMMSS” composed of year / month / day / hour / minute / second.
Further, when a quality class for data transfer exists in the connection NW3, a field for designating the quality class may be added. The quality class has priority as a key, and has a character string “HIGH” or “LOW” as a value, for example, when a wide area ubiquitous NW is applied to the connection NW3. This “HIGH” means immediate communication, and “LOW” means delay-tolerant communication.
It should be noted that fields such as sensor / actuator type, command / event type, or time stamp information may be divided into individual fields as described above, or may be included in parameters.

Next, the from key, which is the transmission source uTupleSpace identification information described above, and the to key, which is the transmission destination uTupleSpace identification information, will be described.
The transmission source uTupleSpace identification information and the transmission destination uTupleSpace identification information are used for transfer between RelayAgents, and identify (local) uTupleSpaces on the transmission side and reception side. As will be described later, when this embodiment is applied to a wide area ubiquitous NW, the IP-TE side is main and the TE is subordinate based on the characteristics of the wide area ubiquitous NW. The uTupleSpace of the TE side is represented by “PARENT”, and the uTupleSpace on the TE side viewed from the uTupleSpace on the IP-TE side is represented by TE terminal identification information. In addition, uTupleSpace of its own terminal is represented by “SELF”. Note that the above assumes that there is only one uTupleSpace in each terminal device. If there are a plurality of uTupleSpaces in the terminal device, an identifier that uniquely identifies uTupleSpace is used. The RelayAgent checks the values of the Tuple's transmission source uTupleSpace identification information and the transmission source uTupleSpace identification information, and transfers the Tuple.

Next, a transfer rule using the transmission source uTupleSpace identification information and the transmission destination uTupleSpace identification information will be described.
The RelayAgent 13 is paired as a pair, and when a Tuple is received from the other, the Tuple is used to write / read the local uTupleSpace 12 as the other agent. The read Tuple is transferred to the other. The TE RelayAgent 13 acquires the next Tuple from the TE uTupleSpace 12 and transfers it to the IP-TE RelayAgent 13. For example, in the case of “actual” in which to = “PARENT” is set, it is acquired with the formal set in to = “PARENT”, and is transferred by the operations shown in sequence diagrams (1-5) to (2-3) described later. . Also, in the case of a formal where from = “PARENT” is set, the meta-formal that is set from = “PARENT” is acquired, and the operations shown in the sequence diagrams 15 (1-4) to (3-3) described later are performed. Forward. The IP-TE RelayAgent 13 transfers the actual matched with the formal transferred from the TE RelayAgent 13 to the corresponding TE RelayAgent 13 (sequence diagrams (3-4) to (3-7)).

  Here, when data is transferred by the method 2 described above, conditions for determining actual transfer are divided into a case of specifying on the transmitting side and a case of specifying on the receiving side. To enable this, Tuple is provided with transmission source uTupleSpace identification information and transmission destination uTupleSpace identification information as fields for transfer between uTupleSpaces 12.

  When the transfer condition is determined on the transmission side, the receiving side uTupleSpace 12 serving as the transfer destination is set in the transmission destination uTupleSpace identification information field of the formal (formal-3 in FIG. 3) registered as the condition. Conversely, when the transfer conditions are determined by the receiving side, the formal is set by setting the sending side uTupleSpace 12 in the source uTupleSpace identification information field of formal and meta-formal (formal-2 and meta-formal-1 in FIG. 4). Transfer to the transmitting side, set the receiving side uTupleSpace 12 in the destination uTupleSpace identification information field, and record in the transmitting side uTupleSpace 12. Furthermore, in the latter case, information on the receiving side application is described in the sensor / actuator type, command / event type, etc. fields, so that the actual to be transferred is limited to only what the receiving side application really needs. It becomes possible.

  Next, a configuration when the network distributed sharing system according to the present embodiment is applied to wide area ubiquitous will be described with reference to FIG. In the figure, components corresponding to those in FIG. 1 are denoted by the same reference numerals and description thereof is omitted. Here, the communication terminal 1 is described as IP-TE1 (Internet Protocol-Terminal Equipment), and the communication terminal 2 is described as TE2 (Terminal Equipment). In wide area ubiquitous, this IP-TE1 is, for example, a server, and TE2 is, for example, a plurality of sensor devices having a communication function. Here, a case where there is one IP-TE 1 will be described. The connection NW3 corresponds to the wide area ubiquitous NW3.

  The IP-TE1 and TE2 in FIG. 7 have an application 11, a uTupleSpace 12, and a RelayAgent 13, respectively, like the communication terminal 1 and the communication terminal 2 in FIG. In IP-TE1, an IP-TE application operates as the application 11, and in TE2, a TE application operates as the application 11. Note that the Relay Agent 13 of the IP-TE 1 is connected to the wide area ubiquitous NW 3 via the IP-GW (Internet Protocol-Gateway) 4, and the Relay Agent 13 of the TE 2 is wide area via the WTU (Wireless Terminal for Ubiquitous network service) 5. Connected to Ubiquitous NW3.

  IP-TE1 and TE2 have uTupleSpace 12 and RelayAgent 13, respectively. In the following, when uTupleSpace 12 and RelayAgent 13 are described separately for each device type of communication terminals of IP-TE1 and TE2, uTupleSpace12 and RelayAgent13 are described with IP-TE or TE in front. For example, uTupleSpace 12 included in IP-TE1 is referred to as IP-TE uTupleSpace12, and uTupleSpace12 included in TE2 is referred to as TE uTupleSpace12.

  The IP-TE / TE RelayAgent 13 performs data transfer using each wide area ubiquitous NW communication interface, thereby constructing a uTupleSpace spanning a plurality of apparatuses having the wide area ubiquitous NW3 as the connection NW3. At this time, the characteristics of the wide area ubiquitous NW3 to be considered in defining the data transfer method realized between the Relay Agents 13 of the IP-TE1 and the TE2 will be described below.

<Connection type>
In the wide area ubiquitous NW3, since one IP-TE1 that accommodates a certain TE2 is always determined as one, the number of IP-TE RelayAgents 13 paired with a certain TE RelayAgent13 is limited to one. On the other hand, since IP-TE1 accommodates a plurality of TE2, the IP-TE RelayAgent 13 can be connected to a plurality of types of TE RelayAgent13. At this time, terminal identification information (service ID) used as a communication destination in the wide area ubiquitous NW 3 is used to distinguish the TE Relay Agent 13 serving as a transfer destination.

<Assumed application>
In the wide area ubiquitous NW3, the TE2 side application (TE application) 11 is, for example, a sensor / actuator drive application. The IP-TE 1 application (IP-TE application) 11 is, for example, a data collection and data processing application or a device control application.

  Therefore, since most of the communication terminals that are the communication counterparts of the TE application 11 are the IP-TE application 11, almost all Tuples generated by the TE application 11 need to be transferred to the IP-TE1 side. On the other hand, the communication partner of the IP-TE application 11 is a plurality of TE applications 11, and another IP-TE application 11 may be a communication partner. Therefore, it is necessary to selectively transfer the Tuple from IP-TE1 to TE2.

<Connection NW3>
Since the wide area ubiquitous NW3 accommodates a huge number of TE2, communication resources such as a communication band between the IP-TE1 and the TE2 are very limited. Therefore, in data transfer between uTupleSpaces 12, it is preferable to avoid useless transfers that are not required by the receiving application 11. In transferring, it is preferable to reduce the amount of data by data compression or the like.

<TE>
In the wide area ubiquitous NW3, a communication device equivalent to a PC having a high processing capability, a communication device having a low function such as an embedded microcomputer and a limited calculation capability and memory capacity, and a 1-bit processing terminal such as a disposable terminal are used. There is TE2, which is various communication devices such as communication devices. Therefore, it is important to select which of the data transfer methods between the IP-TE1 and TE1 described above is to be applied in consideration of computing capacity, memory capacity, and power consumption.

  If TE2 is a low-performance device with severe resource conditions such as a microcomputer that has low functionality and limited computing power and memory capacity, it is difficult to make Tuple permanent or search Tuple recorded in the past. . In addition, since such a device can be easily reset, the Tuple on the TE2 side may be deleted by resetting or the like. That is, there is a large resource gap between IP-TE1 and TE2 of the wide area ubiquitous NW.

  Next, a data transfer method between the IP-TE 1 and the TE 2 will be described based on the characteristics of the wide area ubiquitous NW 3 described above. In the data transfer method between IP-TE1 and TE2, the following method is applied as a combination that can reduce communication traffic and resources required on the TE2 side as much as possible.

(A) The data transfer method from TE2 to IP-TE1 selects (method 2-1: TE remote write-> IP-TE local read) described above. That is, all actuals for the IP-TE application 11 written by the TE application 11 are transferred to the IP-TE 1 side. In addition, on the IP-TE1 side, actual is maintained and made permanent.

(B) As the data transfer method from IP-TE1 to TE2, the above-described method (method 2-2: IP-TE local write-> TE remote read) is selected. That is, for the actual written by the IP-TE application 11, the actual search that matches the search condition of the TE application 11 is performed on the IP-TE1 side and transferred to the TE2 side.

  By adopting this combination, the following advantages can be obtained. First, IP-TE1 with abundant resources and persistence function holds all Tuples that should be shared, including actual, all at once, so even if TE2 with severe resource conditions is connected, It is possible to search the generated past data and to recover at the time of failure or reset.

  Further, from the viewpoint of traffic saving, the actual to be transferred to the TE 2 side can be limited to only those that require each application 11. On the other hand, the formal which is the search condition of the TE application 11 is transferred to the IP-TE side. However, since the number of times this formal is transferred is only once at the time of activation, there is almost no increase in traffic due to the formal transfer.

  Next, the configuration of a communication terminal that is IP-TE1 or TE2 will be described in detail with reference to FIG. In addition, since IP-TE1 and TE2 which are communication terminals have the same structure as a structure, only the structure of one communication terminal 1 is demonstrated here.

  In the following, the actual transfer from TE2 to IP-TE1 is referred to as an upload process, and the actual transfer from IP-TE1 to TE2 or the formal transmission from TE2 to IP-TE1 causes the transmission. The fact that TE2 reads the actual corresponding to the formal obtained from IP-TE1 will be referred to as download processing.

  The communication terminal 1 has an application 11, a uTupleSpace 12, and a RelayAgent 13. The application 11 includes an application unit 111 and a uTupleSpace input / output processing unit 112. The uTupleSpace 12 includes an actual storage unit 121, a formal storage unit 122, a meta-formal storage unit 123, an actual extraction unit 124, and a formal extraction unit 125. The RelayAgent 13 includes an NW communication processing unit 131, an initialization function unit 132, a main processing unit 133, and a uTupleSpace input / output processing unit 134. The main processing unit 133 includes a reset processing unit 1331, an upload processing unit 1332, and a download processing unit 1333.

  The RelayAgent 13 is a module that performs Tuple transfer processing between nodes in order to exchange data via the uTupleSpace 12 between applications 11 on nodes that are different communication terminals via the connection NW3. Exists in both.

  As a function of the RelayAgent 13, it has an NW communication processing unit 131 that is an interface unit for the uTupleSpace 12 and the connection NW3, and the application 11 that the own communication terminal has acquired actual or formal written in the uTupleSpace 12 that the own communication terminal has, It transmits to RelayAgent13 of the other communication terminal via connection NW3. Also, the RelayAgent 13 writes the data received from the RelayAgent 13 of the other communication terminal via the connection NW3 as actual or formal in the uTupleSpace 12 of the own communication terminal. The RelayAgent 13 performs mutual conversion between a Tuple format used in the uTupleSpace 12 and a format according to the communication specifications between the RelayAgents 13 when transferring the Tuple in transmission or reception.

  In order to implement the relay function, the RelayAgent 13 operates as an application on the uTupleSpace 12 and performs an operation for acquiring data from the uTupleSpace 12 when the communication terminal is activated.

  Next, each configuration of the application 11 will be described. In the application unit 111, a plurality of applications operate. Each of the plurality of applications writes or reads a Tuple from the uTupleSpace 12 via the uTupleSpace input / output processing unit 112.

  Next, each configuration of the uTupleSpace 12 will be described. The actual storage unit 121 stores actual. The formal storage unit 122 stores formal. The meta-formal storage unit 123 stores meta-formal.

  In response to the formal being written and stored in the formal storage unit 122, the actual extraction unit 124 extracts the actual that matches the written formal search condition from the actual storage unit 121, and extracts the extracted actual. , Send to the destination identified by this actual or this formal. Further, the actual extraction unit 124 stores the formal in advance in the formal storage unit 122, and in response to the actual being written and stored in the actual storage unit 121, the actual extraction unit 124 stores the formal in advance. It is determined whether or not it matches the formal stored in 122, and if it matches, the written actual is sent to this actual or a destination identified by this formal. Alternatively, in the actual extraction unit 124, the actual is written in the actual storage unit 121, and the written formal is stored in the actual storage unit 121 in advance when the formal is stored in the formal storage unit 122. It is determined whether or not it matches the actual, and if it matches, the actual that matches the written formal is sent to the actual or a destination identified by the formal.

  The formal extraction unit 125 extracts the formal that matches the written meta-formal search condition from the formal storage unit 122 in response to the meta-formal being written and stored in the meta-formal storage unit 123. The extracted formal is sent to a destination identified by formal or meta-formal. Further, the formal extraction unit 125 stores meta-formal in the meta-formal storage unit 123 in advance, and the written foraml is stored in response to the formal being written and stored in the formal storage unit 122. It is determined whether or not it matches the meta-formal stored in the meta-formal storage unit 123 in advance, and if it matches, the written formal is sent to the destination identified by formal or meta-formal. To do. Alternatively, the formal extraction unit 125, when the formal is written in the formal storage unit 122, and the meta-formal is stored in the meta-formal storage unit 123, the written meta-formal is previously stored in the formal storage unit 122. It is determined whether or not it matches with the formal stored in the storage unit 122, and if it matches, the formal that matches the written meta-formal is identified as the destination identified by this formal or this meta-formal. To send.

  Next, each configuration of the RelayAgent 13 will be described. The NW communication processing unit 131 connects the RelayAgent 13 to the connection NW3. When the own terminal is the TE2 via the connection NW3, the NW communication processing unit 131 is connected between the RelayAgent13 of the own terminal and the IP-TE1, and the own terminal is the IP-TE1. In this case, the Tuple is received or transmitted between the RelayAgent 13 of the terminal itself and the TE2.

  The initialization function unit 132 executes initialization of the main processing unit 133 and the like in response to receiving a reset request or a reset notification. In particular, in the case of TE2, formal / meta-formal necessary for each processing is registered in the upload processing unit 1332 and the download processing unit 1333. Note that these formal and meta-formal are stored in advance in an initial setting storage unit included in the initialization function unit 132, and the initialization function unit 132 reads out from the initial setting storage unit and registers in the uTupleSpace 12.

  The configuration of the main processing unit 133 will be described in the following description of the startup process, the reset process, the upload process, and the download process.

  Next, the operation of the communication terminal, particularly the operation of the RelayAgent 13 in each of the activation process, reset process, upload process, and download process will be described. Here, the operation of RelayAgent 13 in IP-TE1 and the operation of RelayAgent13 in TE2 will be described. In the description of each process, the processes corresponding to FIGS. 13 to 15 described later are denoted by the same step number.

<Startup process>
First, the operation of the RelayAgent 13 in the startup process will be described with reference to FIG. When the RelayAgent 13 is activated, the NW communication processing unit 131 is initialized. This initial setting is a setting for transmitting data received by the NW communication processing unit 131 to an appropriate processing unit in the main processing unit 133. Thereafter, a reset request or reset notification is transmitted to the opposite node.
In the case of TE2, the upload processing unit 1332 and the download processing unit 1333 are activated, and formal / meta-formal necessary for each processing is registered (1-5 and 1-4 in FIG. 13).

<Reset processing>
Next, the operation of the RelayAgent 13 in the reset process will be described using FIG. In the case of the Relay Agent 13 of IP-TE1, when the NW communication processing unit 131 receives a reset notification, the reset processing unit 1331 is activated. The reset processing unit 1331 deletes the formal from the corresponding TE 2 registered in the uTupleSpace 12 via the uTupleSpace 12 input / output processing unit 134. On the other hand, in the case of the TE RelayAgent 13, when the NW communication processing unit 131 receives a reset request, the reset processing unit 1331 is activated. The reset processing unit 1331 restarts the communication terminal that is TE2.

<Upload process>
Next, the operation of the RelayAgent 13 in the upload process will be described with reference to FIG. In the case of the IP-TE RelayAgent 13, when the NW communication processing unit 131 receives, for example, actual data, the upload processing unit 1332 is activated. When the upload processing unit 1332 is activated, the upload processing unit 1332 is activated as a thread for each actual. Next, the upload processing unit 1332 converts the received actual data into actual and writes it in the uTupleSpace 12 (2-4 in FIG. 14). At the time of conversion, the from element is converted into terminal identification information (service ID).

  On the other hand, in the case of TE RelayAgent13, when the upload processing unit 1332 receives the actual that matches the formal registered at the time of activation (2-2 in FIG. 14), the received actual is converted into the format of the communication specification between RelayAgent13, It is transmitted to the IP-TE RelayAgent 13 via the NW communication processing unit 131.

<Download process>
Next, the operation of the RelayAgent 13 in the download process will be described using FIG. In the case of the IP-TE RelayAgent 13, when the NW communication processing unit 131 receives, for example, formal data, the download processing unit 1333 is activated. When the download processing unit 1333 is activated, the download processing unit 1333 is activated as a thread for each formal. Next, the download processing unit 1333 converts the received formal data (relay agent 13 communication specification format) into the formal format handled by the uTupleSpace 12, and acquires the actual by the formal for the uTupleSpace 12 (3-4 in FIG. 15). 3-6). The IP-TE RelayAgent 13 replaces the from element with the to element and converts the value “PARENT” and the terminal identification information (when the actual communication specification format between Relay Agents 13 is converted into formal or actual into the communication specification format between Relay Agents 13. Service ID) is converted.
Thereafter, the IP-TE RelayAgent 13 transmits the result obtained by converting the actual acquired from the uTupleSpace 12 to the communication specification format between RelayAgents 13 from the NW communication processing unit 131 to the TE RelayAgent 13 as download data (3-7).

  On the other hand, in the case of TE RelayAgent13, when the download processing unit 1333 receives a formal that matches the meta-formal registered at the time of startup (3-2), the formal is converted into the format of the communication specification between RelayAgent13, and the NW communication processing It is transmitted to the IP-TE RelayAgent 13 via the unit 131. When the NW communication processing unit 131 receives actual data from the IP-TE, the NW communication processing unit 131 converts the actual data to the actual handled by the uTupleSpace 12 and writes it to the uTupleSpace 12 (3-8).

  Next, the operation of the network distributed sharing system in each of the startup process, the reset process, the upload process, and the download process will be described with reference to FIGS. In the following drawings, “read” is referred to as “reference”. Whether or not it is a notification type indicates whether or not reference / acquisition is performed by a callback (interrupt).

  First, the operation of the network distributed sharing system in the startup process and the reset process will be described with reference to FIG. First, IP-TE1 transmits a reset request to all the connected TE2 at the time of starting or restarting (1-1). This is a process when the IP-TE RelayAgent 13 is activated. The TE2 that has received the reset request performs a restart process in each TE2. This is realized as a trigger from the TE RelayAgent 13, for example.

  Next, when the TE Relay Agent 13 is restarted, a reset notification is transmitted to the opposing IP-TE Relay Agent 13 (1-2). Next, the TE RelayAgent 13 performs the following two processes for data transfer based on information designated in advance. As a first process, the TE RelayAgent 13 sends a search request for the actual search condition (formal) to be transferred for the remote reading (download process) of the TE application 11 to the TE uTupleSpace 12 (1-4). Specifically, meta-formal, which is a condition for formal search, is registered in TE uTupleSpace 12. As a second process, the TE RelayAgent 13 makes an actual search request to the TE uTupleSpace 12 to be transferred for remote writing (upload process) of the TE application 11 (1-5). Specifically, the formal which is a condition for the actual search is registered in the TE uTupleSpace 12.

  On the other hand, the IP-TE RelayAgent 13 that has received the reset notification deletes the formal registered for remote reading (download processing) from the corresponding TE (1-3) and newly registers it after resetting. Prepare. Note that when the TE2 is reset alone, the same operation is performed according to the sequence after the above (1-2).

  Next, the operation of the network distributed sharing system in the upload process will be described with reference to FIG. First, when the TE application 11 writes actual (2-1), the actual that matches the formal registered (see (1-5) in FIG. 13) when TE2 is started is notified to the TE RelayAgent 13 (2-2). ). This condition matching is performed, for example, in the transmission destination uTupleSpace identification information field in the Tuple field described with reference to FIG.

  Next, the TE RelayAgent 13 transfers (Upload) the actual to the facing IP-TE RelayAgent 13 (2-3). Next, the IP-TE RelayAgent 13 that has received the actual transfer writes the actual into the IP-TE uTupleSpace 12 (2-4). Next, the IP-TE application requests reference / acquisition of the necessary actual (2-5), and reads the actual that matches the corresponding condition (2-6). When actual reference / acquisition is requested in a notification type, there may be a reference / acquisition request (2-5) before writing (2-4). Moreover, since the actual written to the IP-TE uTupleSpace 12 is made permanent, it can be repeatedly referenced until it is acquired (taken) or its expiration date expires. This permanent means that the actual written to the IP-TE uTupleSpace 12 is not erased even when the power of the IP-TE 1 is turned off. For example, the storage unit that is the IP-TE uTupleSpace 12 is a hard disk device, or the IP-TE 2 has a power backup unit so that the power backup unit can back up the IP-TE uTupleSpace 12 even during a power failure. To make it persistent.

  Next, the operation of the network distributed sharing system in the download process will be described with reference to FIG. First, when the TE application 11 writes an actual search condition (formal) for remote reading (3-1), a formal that matches the meta-formal registered when TE2 is started (FIG. 13 (1-4)) is displayed. Is notified to the TE RelayAgent 13 (3-2). This condition matching is performed in, for example, the transmission source uTupleSpace identification information field in the Tuple field described with reference to FIG.

  Next, the TE RelayAgent 13 transfers the corresponding formal to the opposing IP-TE RelayAgent 13 (3-3). Next, the IP-TE RelayAgent 13 that has received the formal transfer registers the formal in the IP-TE uTupleSpace 12. That is, an actual search request is made (3-4).

  The IP-TE RelayAgent 13 reads the actual (3-5) that has been written by the IP-TE application so far and matches the actual condition (3-6). Or, after that, the actual (3-5) written by the IP-TE application is read that matches the corresponding condition (3-6). This condition matching uses, for example, a transmission destination uTupleSpace identification information field and a sensor / actuator type, command / event type field, etc., defined between applications, among the Tuple fields described with reference to FIG.

  Next, when receiving the actual notification (3-6), the IP-TE RelayAgent 13 transfers the actual to the corresponding TE RelayAgent 13 based on the content of the transmission destination uTupleSpace identification information field (3-7). Next, when the TE Relay Agent 13 receives the actual from the opposing IP-TE Relay Agent 13, the TE Relay Agent 13 writes the received actual into the TE uTupleSpace 12 (3-8). Then, condition matching is performed in the TE uTupleSpace 12, and the actual corresponding to formal (3-1) registered by the TE application is notified to the TE application 11 (3-9).

  In this series of sequences, the formal written in the IP-TE uTupleSpace 12 is also made permanent, so that repeated condition matching is possible until it is taken or expired. Therefore, since formal is also made permanent, the sequence after (3-5) is repeated.

  Next, FIG. 16 to FIG. 18 show field information of transmission information such as actual in each of the start processing, reset processing, upload processing, and download processing of the network distributed sharing system described with reference to FIG. 9 to FIG. FIG. FIG. 16 is a diagram for explaining in detail Tuple field information in the start-up process and the reset process. FIG. 17 is a diagram for explaining in detail the Tuple field information in the upload process. FIG. 18 is a diagram for explaining in detail the Tuple field information in the download process. In FIG. 16 to FIG. 18, processing steps corresponding to the processing steps of FIG. 13 to FIG.

FIG. 19 shows a terminal identification for identifying a plurality of TE2s or IP-TE1 in the transmission data when the transmission data is transferred via the wide area ubiquitous NW3 by the wide area ubiquitous NW device 31 included in the wide area ubiquitous NW3. It is a figure explaining that information is added or deleted as header information. As shown in the figure, terminal identification information is added to or deleted from transmission data as header information by the wide area ubiquitous NW device 31. Thereby, when receiving transmission data from TE2, such as actual, based on the header information, IP-TE1 can identify which transmission data is transmitted from which TE2. This terminal identification information is a service ID.
In the above description, the case where the wide area ubiquitous NW is applied as the connection NW 3 has been described. However, the Tuple data transfer method described above can be applied to a wireless or wired data communication NW other than the wide area ubiquitous NW. In this case, the terminal identification information is a terminal identifier (for example, an address, a serial number, or management information associated with another terminal) used in the applied NW.

  As described above, in a network distributed sharing system in which a plurality of communication devices (communication terminals 1 or 2 or the like) are connected via a network (connection NW3), each of the plurality of communication devices is at least a destination tuple. Tuple information (actual) including storage unit identification information (destination uTupleSpace identification information) is stored, and the tuple storage unit (uTupleSpace12) identified by the tuple storage unit identification information, and the tuple information stored in the tuple storage unit A relay proxy unit (RelayAgent 13) that stores the received tuple information in the tuple storage unit, and the relay proxy unit reads the tuple information from the tuple storage unit of the communication device and reads the tuple information The tuple information is sent to the tuple storage unit corresponding to the destination tuple storage unit identification information included in the read tuple information via the network. Transmission side transfer unit (upload processing unit 1332 or download processing unit 1333) to transmit, and reception side transfer unit (upload processing unit) that stores the tuple information received via the network in the tuple storage unit of the own communication device 1332 or download processing unit 1333).

  The tuple storage unit includes a tuple information storage unit (actual storage unit 121) that stores tuple information, and a tuple search information storage unit (formal) in which tuple search information (formal) for searching for tuple information is stored in advance. A storage unit 122), and when the tuple information is stored in the tuple information storage unit, it is determined whether the stored tuple information corresponds to the tuple search information stored in the tuple search information storage unit, When the determined result is applicable, the apparatus has a tuple information extraction unit (actual extraction unit 124) that outputs the corresponding tuple information to the transmission side transfer unit.

  Further, the tuple information extraction unit determines whether the stored tuple search information corresponds to the tuple information stored in the tuple information storage unit when the tuple search information is stored in the tuple search information storage unit. If the result of the determination is appropriate, the corresponding tuple information is output to the transmission unit on the transmission side.

  The tuple search information includes transmission source tuple storage unit identification information, and the tuple storage unit stores tuple meta search information (meta-formal) for searching for tuple search information in advance. (Meta-formal storage unit 123) and, when tuple search information is stored in the tuple search information storage unit, whether the stored tuple search information corresponds to the tuple meta search information stored in the tuple meta search information storage unit A tuple search information extraction unit (formal extraction unit 125) for outputting the corresponding tuple search information to the transmission side transfer unit when the determined result is true, and transmitting side transfer Unit transmits the tuple search information to the tuple storage unit corresponding to the transmission source tuple storage unit identification information included in the tuple search information via the network. The tuple search information received via the work is stored in the tuple search information storage unit included in the communication apparatus.

  In addition, one communication device among the plurality of communication devices is a server device (IP-TE1), and a plurality of other communication devices of the server device are terminal devices (TE2), which are stored in the tuple search information storage unit of the terminal device. Is stored in advance as tuple search information in which the tuple storage unit corresponding to the destination tuple storage unit identification information is the tuple storage unit of the server device, and the terminal device stores the tuple information in the tuple information storage unit of the terminal device. When the stored tuple information corresponds to the tuple search information, the tuple information extraction unit of the terminal device outputs the stored tuple information to the transmission side transfer unit of the terminal device in response to the storage. Then, the transmitting side transfer unit of the terminal device transmits the tuple information to the server device via the network based on the destination tuple storage unit identification information, and the receiving side transfer unit of the server device transmits the tuple information via the network. The tuple information received from the terminal device is stored in the tuple information storage unit of the server device itself.

  In addition, in the tuple meta search information storage unit of the terminal device, tuple meta search information in which the tuple storage unit corresponding to the transmission source tuple storage unit identification information is used as the tuple storage unit of the server device is stored in advance. In response to the tuple search information stored in the tuple search information storage unit of the terminal device, the tuple search information extraction unit of the terminal device stores the tuple search information when the stored tuple search information corresponds to the tuple meta search information. Output the tuple search information to the transmission side transfer unit of the own terminal device, and the transmission side transfer unit of the own terminal device sends the tuple search information to the server device via the network based on the source tuple storage unit identification information. The tuple of the terminal device that has transmitted the tuple search information transmitted from the terminal device via the network by the receiving side transfer unit of the server device. Tuple storage unit identification information identifying the 憶部 as destination tuple storage unit identification information of the tuple retrieval information received said, is stored in the tuple retrieval information storage unit of the tuple memory unit which the own server apparatus.

  In addition, in response to the tuple search information stored in the tuple search information storage unit of the server device, the server device extracts the tuple information corresponding to the stored tuple search information. Read from the tuple information storage unit of the server device, and output the read tuple information to the transmission side transfer unit of the server device, and the transmission side transfer unit of the server device sends the tuple information to the destination tuple storage unit identification information. And the tuple information received by the receiving side transfer unit of the terminal device via the network is stored in the tuple information storage unit of the terminal device.

  The tuple information storage unit of the server apparatus (IP-TE1) is a hard disk or has a power backup unit.

  In the present embodiment described above, in the network distributed sharing system that performs communication using Tuple Space, each of the plurality of communication devices has a tuple storage unit and a relay proxy unit, the relay proxy unit, Transmission of reading tuple information from the tuple storage unit of the communication device and transmitting the read tuple information to the tuple storage unit corresponding to the destination tuple storage unit identification information included in the read tuple information via the network For an application that operates on a plurality of communication devices, it includes a side transfer unit and a reception side transfer unit that stores tuple information received via a network in a tuple storage unit included in the communication device. The tuple storage unit on the communication device can be used as one tuple storage unit in the network. Only tuple information relay proxy unit is read out from the tuple memory unit of the communication device, to be transferred to another communication device by a relay proxy unit, an effect that may reduce the amount of communication between the communication device.

  Next, a wide area ubiquitous NW (hereinafter, wide area ubiquitous network) that can be applied to the connection NW3 described above will be described. As for wide area ubiquitous network, Hiroshi Saito, Masahiro Umehira, Masahiro Morikura, “Discussion for Wide Area Ubiquitous Network Infrastructure”, IEICE Transactions 2005/11 Vol. J88-B No. 11 etc.

  Wide-area ubiquitous networks are broadly divided into two types: mobile terminal services that are assumed to carry mobile phones and other terminals, and embedded environment services that are based on an environment where sensors and other objects are attached to people and objects. Separated. The former is based on mobile phones that are mature in terms of population penetration, but it is also assumed that mobile phones will be used as gateways to accommodate ultra-small sensors, and in reality these boundaries are not clear. .

FIG. 20 is a diagram illustrating a configuration of a currently assumed ubiquitous network.
From the viewpoint of wide-area network infrastructure, the terminal accommodation form is divided into two, direct accommodation (direct acquisition) and accommodation via a gateway, and the latter is the form of the network (described as “local network”) beyond the gateway. Thus, it is divided into gateway accommodation and gateway network accommodation. The terminal accommodation in the gateway is a form in which the terminal in the local network communicates only with the gateway, and the network accommodation in the gateway is a form in which the terminal in the local network communicates with other terminals in the local network.

In the case of direct acquisition, the terminal needs an end-to-end communication function and a unique address on the network. In the case of gateway accommodation, the terminal only needs to be able to communicate with only the gateway (gateway terminal accommodation) or with the gateway and other terminals in the local network (gateway network accommodation). Therefore, it is easy to apply a local address or a special protocol suitable for the local network. The difference between network accommodation and terminal accommodation depends on the protocol used in the local network. In order to accommodate the network, it is necessary to use a multi-hop such as Bluetooth or ZigBee or introduce a routing protocol. Although it is easier to accommodate terminals, when a wireless link is used, network accommodation is necessary to physically cover a wide area with one local network.
At present, the mobile phone network is the most powerful network infrastructure for direct acquisition. The network infrastructure in the case of accommodating a gateway is assumed to be an Internet access network and an Internet / IP network or a mobile phone network.

  In the wide area ubiquitous network, compared to the currently assumed ubiquitous network described above, the “scalability” regarding the number of terminals, the “wide area” capable of covering a physically wide range, the “mobility management” corresponding to the mobile terminal, the terminal Because of the large number of terminals, low-capacity terminals with low functionality and limited computing capacity and memory capacity are assumed from the viewpoint of total terminal cost, so "low-capacity terminal support" that can accommodate them, many terminals Since it is connected to the network, it is necessary to provide "economics" that reduce network costs. Therefore, the wide area ubiquitous network is realized by a complex network set as shown in FIG.

Next, a specific implementation example of the wide area ubiquitous network system will be described.
FIG. 22 shows a configuration example of a wide area ubiquitous network system. In the figure, the wide area ubiquitous network system holds a wireless terminal 101, gateway nodes (hereinafter referred to as GW nodes) 102 to 105 capable of wireless communication with the wireless terminal 101, and position information of the wireless terminal 101. A mobile communication network having a location registration database 109 and a personal computer (hereinafter referred to as a PC) 1111 and 1112 as message destinations from the wireless terminal 101 are connected to an Internet gateway (hereinafter referred to as a PC). This is a network system connected via the Internet GW.

In addition, the network system includes relay nodes 106 and 107 and a registration management system 108 that holds the address of the PC 101 as a terminal that is a transmission destination determined in advance for each wireless terminal 101.
Communication between the wireless terminal 101 and the PC 1111 or the PC 1112 is roughly performed as follows.
When transmitting a message from the wireless terminal 101 to the PC 1111 or the PC 1112, when any of the GW nodes 102 to 105 receives the wireless frame from the wireless terminal 101, the GW nodes 102 to 105 access the registration management system 108 for each wireless terminal. The terminal address of the message transmission destination is specified, and the message is transmitted to the PC 1111 or PC 1112 which is the specified transmission destination terminal via the Internet GW 113.

  Further, when a message is transmitted from the PC 1111 or the PC 1112 to the wireless terminal 101, the Internet GW 113 accesses the location registration database 109, acquires location information from the ID of the wireless terminal 101, and applies the corresponding location information from the acquired location information. The gateway node transfers the message to the wireless terminal.

  The wireless terminal 101 can perform wireless communication with the GW nodes 102 to 105. The GW nodes 102 to 105, the registration management system 108, and the location registration database 109 are connected to each other via the relay nodes 106 and 107, and can communicate with each other. The wireless terminal 101, the GW nodes 102 to 105, the registration management system 108, the location registration database 109, and the relay nodes 106 and 107 constitute a mobile communication network.

The mobile communication network is also connected to the Internet 110 via the Internet GW 113 and can communicate with personal computers (PCs) 1111 and 1112 connected to the Internet 110.
Here, the GW nodes 102 to 105, the relay nodes 106 and 107, and the Internet GW 113 all have IP addresses and can communicate with the PCs 1111 and 1112 via the Internet 110.

  The wireless terminal 101 determines the message transmission destination in advance and registers it in the registration management system 108. The registration management system 108 stores a set of {wireless terminal ID, partner address} shown in FIG. Here, the transmission destination of the wireless terminal 101 is assumed to be the PC 1111 as an example. Also, the wireless terminal 101 needs to register its location when moving.

  Each of the GW nodes 102 to 105 wirelessly broadcasts the paging area number, and the wireless terminal 101 receives a number different from the paging area number held by itself and recognizes the change of the area in which it is located. When the service area changes, the wireless terminal 101 (1) updates the paging area number held by itself, and (2) the paging area number (service area) that the user has visited via the GW node / relay node. Number) is notified to the location registration database 109. The location registration database 109 stores a set of {wireless terminal ID, area number} shown in FIG. 24 as location information.

  Next, information transmission processing from the wireless terminal 101 will be described. When the wireless terminal 101 satisfies a predetermined activation condition (for example, when the sensor value sensed at a certain time exceeds a fixed value), a predetermined communication partner (for example, the PC 1111) It puts its own ID and sensing information in a radio frame as a message and transmits it.

  The GW nodes 102 to 105 hold a set (referred to as a visited terminal list) of an ID of a wireless terminal estimated to be located in the area, its destination address, and a reference time (FIG. 25). The GW nodes 102 to 105 receive the wireless frame, and check whether the wireless terminal ID in the received message is in the visited terminal list. If not, the registration management system 108 is accessed, and the destination address for the wireless terminal ID is inquired. (If there is no corresponding terminal even if the inquiry is made, it is an unauthorized terminal and the received message is discarded.)

Then, the current time is set as a reference time, and a pair of destination addresses obtained by referring to the wireless terminal ID is added to the in-zone terminal list. (Thus, when there is no area change, the destination address can be grasped without referring to the registration management system 108.)
If the terminal list originally exists, the reference time is updated to the current time and held.

The destination address thus obtained is set as the destination address, the source address is set as the GW node address, and the message is sent to the destination by the TCP / IP packet in the payload. At this time, the message is retained.
The PC that has received the TCP / IP packet extracts the message and returns an ACK to the GW node. The GW node that has received the ACK specifies the corresponding retained message from the IP address and deletes it.

  Further, when the reference time of the in-zone terminal list becomes older than the time point that is predetermined time-out from the current time, the {set of the wireless terminal ID and its destination address, reference time} is deleted.

  Note that the wireless terminal 101 of the network of FIG. 22 is assumed as WTU5 and TE2 of this embodiment, the PCs 1111 and 1112 as IP-TE1, the relay nodes 107 and 106 as the wide area ubiquitous NW3, and the Internet GW113 as the IP-GW4. Can do.

  The storage unit in the uTupleSpace 12 in FIG. 1, particularly the IP-TE uTupleSpace 12 in FIG. 7, is a non-volatile memory such as a hard disk device, a magneto-optical disk device, or a flash memory, or a storage medium that can only be read from a CD-ROM or the like. , Volatile memory such as RAM (Random Access Memory), or a combination thereof

  The RelayAgent 13 in FIG. 1 may be realized by dedicated hardware, or may be realized by a memory and a microprocessor.

  The RelayAgent 13 in FIG. 1 may be realized by dedicated hardware, and the RelayAgent 13 is configured by a memory and a CPU (central processing unit), and a program for realizing the functions of the RelayAgent 13 The function may be realized by loading the program into a memory and executing it.

  Further, the program for realizing the function of RelayAgent 13 in FIG. 1 is recorded on a computer-readable recording medium, and the program recorded on this recording medium is read into the computer system and executed to execute the function of RelayAgent 13. You may make it do. Here, the “computer system” includes an OS and hardware such as peripheral devices.

Further, the “computer system” includes a homepage providing environment (or display environment) if a WWW system is used.
The “computer-readable recording medium” refers to a portable medium such as a flexible disk, a magneto-optical disk, a ROM, and a CD-ROM, and a storage device such as a hard disk built in the computer system. Furthermore, the “computer-readable recording medium” dynamically holds a program for a short time like a communication line when transmitting a program via a network such as the Internet or a communication line such as a telephone line. In this case, a volatile memory in a computer system serving as a server or a client in that case, and a program that holds a program for a certain period of time are also included. The program may be a program for realizing a part of the functions described above, and may be a program capable of realizing the functions described above in combination with a program already recorded in a computer system.

  The embodiment of the present invention has been described in detail with reference to the drawings. However, the specific configuration is not limited to this embodiment, and includes design and the like within a scope not departing from the gist of the present invention.

It is a block diagram which shows the structure of the network distributed sharing system by one Embodiment of this invention. It is an operation | movement figure explaining the data transfer system by the system 1 of the network distributed sharing system of FIG. It is an operation | movement diagram explaining the data transfer system by the system 2-1 of the network distributed sharing system of FIG. It is an operation | movement figure explaining the data transfer system by the system 2-2 of the network distributed sharing system of FIG. It is explanatory drawing explaining the classification | category of Tuple. It is explanatory drawing explaining the component of Tuple. It is a block diagram which shows the structure of the network distributed sharing system at the time of adapting to a wide area ubiquitous network. It is a block diagram which shows the structure of a communication terminal. It is an operation | movement diagram explaining the operation | movement at the time of starting of the communication terminal of FIG. It is an operation | movement diagram explaining the operation | movement at the time of reset of the communication terminal of FIG. It is an operation | movement diagram explaining the operation | movement at the time of upload of the communication terminal of FIG. It is an operation | movement diagram explaining the operation | movement at the time of download of the communication terminal of FIG. It is an operation | movement diagram explaining the operation | movement at the time of starting or reset of the network distributed sharing system of FIG. It is an operation | movement figure explaining the operation | movement at the time of upload of the network distributed sharing system of FIG. It is an operation | movement figure explaining the operation | movement at the time of download of the network distributed sharing system of FIG. It is explanatory drawing explaining the information of the field of Tuple in FIG. 13 in detail. It is explanatory drawing explaining the information of the field of Tuple in FIG. 14 in detail. It is explanatory drawing explaining the information of the field of Tuple in FIG. 15 in detail. It is explanatory drawing explaining the header information in wide area ubiquitous NW3. It is a figure which shows the ubiquitous network currently assumed. It is a figure which shows wide area ubiquitous network infrastructure. It is a figure which shows the structural example of a wide area ubiquitous network. It is explanatory drawing which shows the memory content of the registration management system in the network system shown in FIG. Explanatory drawing which shows the memory content of the location registration database in the network system shown in FIG. Explanatory drawing which shows the memory content of the GW node in the network system shown in FIG.

Explanation of symbols

1 Communication terminal, IP-TE
2 Communication terminal, TE
3 connection NW,
11 Application, TE application, IP-TE application 12 uTupleSpace, TE uTupleSpace, IP-TE uTupleSpace
13 RelayAgent, TE RelayAgent, IP-TE RelayAgent
101 Wireless terminal 102 to 105 GW node 106, 107 Relay node 108 Registration management system 109 Location registration database 110 Internet 1111, 1112 PC
113 Internet GW

Claims (10)

A network distributed sharing system in which a plurality of communication devices are connected via a network,
Each of the plurality of communication devices
Storing tuple information including at least destination tuple storage unit identification information, and a tuple storage unit identified by the tuple storage unit identification information;
A relay proxy unit that transmits the tuple information stored in the tuple storage unit, or stores the received tuple information in the tuple storage unit;
Have
The relay agent is
The read tuple information from the tuple memory unit which the own communication device has, the read-out tuple information, the tuple storage unit as the destination corresponding to the destination tuple storage unit identification information included in the read tuple information, the network A transmitting side transfer unit for transmitting via
A receiving side transfer unit that stores tuple information received via the network in a tuple storage unit included in the communication device;
A network distributed sharing system characterized by comprising: The tuple storage unit
A tuple information storage unit for storing the tuple information;
A tuple search information storage unit for storing tuple search information for searching the tuple information;
When the tuple information is stored in the tuple information storage unit, it is determined whether or not the stored tuple information corresponds to the tuple search information stored in the tuple search information storage unit. If the result is true, a tuple information extraction unit that outputs the relevant tuple information to the transmission side transfer unit;
The network distributed sharing system according to claim 1, comprising: The tuple information extraction unit includes:
When the tuple search information is stored in the tuple search information storage unit, it is determined whether the stored tuple search information corresponds to the tuple information stored in the tuple information storage unit, and the determination 3. The network distributed sharing system according to claim 2, wherein when the result is true, the relevant tuple information is output to the transmission side transfer unit. The tuple search information includes transmission source tuple storage unit identification information,
The tuple storage unit
A tuple meta search information storage unit in which tuple meta search information for searching the tuple search information is stored in advance;
When the tuple search information is stored in the tuple search information storage unit, it is determined whether the stored tuple search information corresponds to the tuple meta search information stored in the tuple meta search information storage unit, When the determined result is applicable, the relevant tuple search information is output to the transmitting side transfer unit;
Have
The transmission side transfer unit
Transmitting the tuple search information to the tuple storage unit corresponding to the transmission source tuple storage unit identification information included in the tuple search information via the network;
The receiving side transfer unit
Storing the tuple search information received via the network in the tuple search information storage unit of the communication device;
4. The network distributed sharing system according to claim 2, wherein the network is distributed. One of the plurality of communication devices is a server device,
A plurality of other communication devices of the server device are terminal devices,
In the tuple search information storage unit of the terminal device,
Tuple search information in which the tuple storage unit corresponding to the transmission destination tuple storage unit identification information is the tuple storage unit of the server device is stored in advance.
The terminal device
In response to the tuple information being stored in the tuple information storage unit of the terminal device,
The tuple information extraction unit of the terminal device,
When the stored tuple information corresponds to the tuple search information, the stored tuple information is output to the transmission side transfer unit of the terminal device,
The transmission side transfer unit of the terminal device transmits the tuple information to the server device via the network based on the destination tuple storage unit identification information,
The receiving side transfer unit of the server device,
Storing the tuple information received from the terminal device via the network in the tuple information storage unit of the server device;
The network distributed sharing system according to claim 2, wherein the network is distributed. In the tuple meta search information storage unit of the terminal device,
Tuple meta search information in which the tuple storage unit corresponding to the transmission source tuple storage unit identification information is the tuple storage unit of the server device is stored in advance.
The terminal device
In response to the tuple search information stored in the tuple search information storage unit of the terminal device,
The tuple search information extraction unit of the terminal device,
When the stored tuple search information corresponds to the tuple meta search information, the stored tuple search information is output to the transmission side transfer unit of the terminal device,
The transmission side transfer unit of the terminal device transmits the tuple search information to the server device via the network based on the transmission source tuple storage unit identification information,
The receiving side transfer unit of the server device,
The tuple search information received from the terminal device via the network, the tuple storage unit identification information for identifying the tuple storage unit of the terminal device that has transmitted the tuple search information, the destination tuple storage of the received tuple search information As part identification information, store in the tuple search information storage unit of the tuple storage unit of the server device itself,
The network distributed sharing system according to claim 5. The server device
In response to the tuple search information stored in the tuple search information storage unit of the server device,
The tuple information extraction unit of the server device,
The tuple information corresponding to the stored tuple search information is read from the tuple information storage unit included in the local server device, and the read tuple information is output to the transmission side transfer unit included in the local server device.
The transmission side transfer unit of the server device,
Transmitting the tuple information to the terminal device via the network based on the destination tuple storage unit identification information;
The receiving side transfer unit of the terminal device,
The tuple information received via the network is stored in the tuple information storage unit of the terminal device.
The network distributed sharing system according to claim 6. The tuple information storage unit of the server device is
The network distributed sharing system according to any one of claims 4 to 7, wherein the network is a hard disk or has a power backup unit. A plurality of communication devices are connected via a network, and each of the plurality of communication devices stores tuple information including at least destination tuple storage unit identification information, and is identified by the tuple storage unit identification information. And a relay proxy unit that transmits the tuple information stored in the tuple storage unit or stores the received tuple information in the tuple storage unit,
The relay agent is
The read tuple information from the tuple memory unit which the own communication device has, the read-out tuple information, the tuple storage unit as the destination corresponding to the destination tuple storage unit identification information included in the read tuple information, the network Send through
The tuple information received via the network is stored in a tuple storage unit included in the communication device.
A network distributed sharing method characterized by the above. A plurality of communication devices are connected via a network, and each of the plurality of communication devices stores tuple information including at least destination tuple storage unit identification information, and is identified by the tuple storage unit identification information. And the relay proxy unit used in the network distributed sharing system having the relay proxy unit that transmits the tuple information stored in the tuple storage unit or stores the received tuple information in the tuple storage unit. On the computer
The read tuple information from the tuple memory unit which the own communication device has, the read-out tuple information, the tuple storage unit as the destination corresponding to the destination tuple storage unit identification information included in the read tuple information, the network Sending side transfer procedure to send via
Receiving-side transfer procedure for storing tuple information received via the network in a tuple storage unit included in the communication device;
Network distributed shared program to execute.

Images