JP4060325B2 - Semantic information switch, semantic information router, method, recording medium, program - Google Patents

Description

  The present invention relates to a component of a semantic information network, and relates to a semantic information switch, a semantic information router, a method, a recording medium, and a program for establishing and canceling event transfer, and transfer control.

  The conventional network is conceptually expressed by a network model shown in FIG. In FIG. 21, each terminal registers a terminal address (for example, a network address and a host address) in the network as its own identifier. On the other hand, the transmission terminal sends an event (packet) composed of the destination address (transmission destination terminal address) and data shown in FIG. 22 to the network. That is, the basic concept of a conventional information network is to correctly deliver an event to a destination based on a destination address.

Consider a case where a proposal-type service (a personalized information proposal service for proposing personalized information for each user and a yellow page service such as a search service) is realized using this network. Conventionally, a centralized server system (broker) as shown in FIG. 23 must always be interposed in order to realize a personalized information proposal service. Similarly, in the yellow page service, it is necessary to assume a broker called a search service. Such a centralized business model through a broker is called a broker model.
In this broker model, a broker (broker) plays a role of connecting an information provider and a user. That is, the user and the information provider can meet only through the broker.

  The broker model will be described in detail with reference to FIG. As shown in FIG. 24, in the business model composed of three business roles of the service provider (content information provider) 103 in addition to the end user (consumer 101 in the figure) and the information provider (content provider 102), The service provider 103 manages the content information registered from the information provider (content provider 102) and the end user preference information registered from the end user (consumer 101), and the registered content information and end user preference information. By collating these, it has been realized as a proposal-type service for proposing content suitable for the end user (consumer 101). Such a service provider corresponds to a broker.

Specific services include a search service such as Yahoo, a trading service, and a personalized information proposal service that proposes content that matches the end user's interest without direct intervention of the end user.
These services are realized as an integrated service system (service application) in each service provider 103 existing on the network 109 or the content distribution network 110 as shown in FIG.

Due to these reasons, the broker model has the following problems.
(1) The information provider (content provider 102) has no means for announcing content information to the end user (consumer 101) without a third party. An information provider (content provider) -led pursuit society that circulates content information itself could not be realized. That is, the information provider (content provider 102) who is the content provider cannot distribute the content information with his own policy without intervening third parties.
(2) In order to enjoy the service proposed by the service provider 103, the end user (consumer 101) must explicitly recognize the presence, location, and access method of the service provider 103.

(3) Sharing of content, content information, and end user preference information between different service providers 103 cannot be easily realized. Until now, information has been shared by exchanging information according to a protocol decided in advance between the individual service providers 103.
(4) Due to the centralized management of content information and end user preference information in the service provider 103, it is not easy to construct a highly scalable system. Until now, classical methods such as preparing a plurality of server systems for managing content information and end user preference information have been used.

By the way, distributed processing technologies such as WWW (World Wide Web) and CORBA provide an environment in which users can easily obtain content while being distributed and distributed on a heterogeneous distributed system, and anyone can easily provide content. It became possible to become a person. On the other hand, it is not easy to find the content desired by the end user from the enormous amount of content flooding all over the world, and it is desired to quickly establish a technology for that purpose.
In view of such circumstances and the problems of the broker model described above, it is possible for an information provider (content provider) to directly provide content to an end user who is appropriate for the content without assuming the presence of a broker. Proposed a non-broker model.

As non-broker model realization technologies, the invention by Gnutella, SUN (US Patent 5,870,605: corresponding to Patent Document 1 below), the invention by NEC (Japanese Patent Application No. 11-328654: Document 2: corresponding to Patent Document 2 below) There is.
Gnutella is a network that searches and discovers a specific entity from an unspecified number of entities (information) distributed on the Internet based on a P2P (Peer-to-Peer) interaction model. In Gnutella, an entity is also called a servant. In other words, each information provider supervises and manages metadata (metafile), and by setting an arbitrary connection between metafiles (between hosts storing metafiles), only the information provider can Build a super-distributed database of data. In addition, by distributing and coordinating information providers, it is possible to construct a metadata search network that does not require a broker. However, a search request packet from a consumer is broadcast to all information providers based on the connection. In other words, since P2P interaction is repeated for all hosts based on connection information, unnecessary traffic increases in proportion to the increase in the number of hosts and the type of metadata to be handled, and the scalability is extremely reduced. There's a problem. In addition to scalability, there are problems in terms of interoperability, information sharing, expandability, security, privacy, and the like.

Document 1 is a network system that performs content-based routing, making it possible to request and use information without a broker in the situation where the information provider (Publisher) and the user (Subscriber) do not have knowledge of each other. The method was shown. However, there is a problem in scalability because there is no routing mechanism that suppresses unnecessary event forwarding.
Furthermore, since there is no ontology between territories (such as a mechanism for converting an event dictionary), there are problems in terms of interoperability, information sharing, and extensibility. In other words, in Document 1, a territory that shares a common event dictionary is defined, but a territory implementation method and a method for sharing information between different territories are not clarified. Therefore, there is little description of specific feasibility regarding territory.

  Document 2 proposes information routing capable of routing not only a packet having a specific destination address but also a packet including only a specification of a region of interest. Information routing enables searches that do not require a broker. However, there is no concept of event place, gateway, or session that limits the uniqueness of the ontology system or the propagation range of events. Therefore, there are problems in terms of scalability, security, privacy, interoperability, information sharing, and extensibility.

As described above, the conventional technology for realizing the non-broker model has the following four problems.
○ Lack of security and privacy protection ・ There is no mechanism to limit the scope of information distribution. That is, it is not possible to limit the destination of the event. Therefore, anyone who is connected to the network can view the information.
-Also, the end point of information becomes the end user's terminal, which is referred to from the outside. Therefore, even if a terminal has information that is not desired to be disclosed to the outside, the information may be disclosed when connected to the network.
-Since there is no concept of a session, a network can be constructed with only event transmission / reception terminals, but the network provider and event transmission / reception party cannot be separated.

○ Lack of interoperability ・ When creating areas with different semantic information systems (ontology systems), there is no mechanism for connecting these areas, so events cannot be shared between them.
-Only necessary events cannot be transferred.
○ Lack of extensibility and addition / deletion of dynamic functions are difficult.
-It is not easy to expand the network scale.
○ Lack of scalability / Cannot cope with the increase in the number of senders and receivers of events.
・ The increase in semantic information type (metadata type) cannot be handled.
-Unnecessary event forwarding cannot be suppressed.

Accordingly, the present applicant has proposed a Semantic Information-Oriented Network (SION) as a technology for realizing a non-broker model other than the non-broker model described above. The literature describing the semantic information network by the present applicant is as follows.
-Takanari Hoshiai, Hiroshi Shibata: "Autonomous Distributed Collaborative Environment Architecture for Proposal of Proposal and its Performance Evaluation", IEICE Transactions (DI), Vol.J83-DI, No.9, pp.1001 -1012 (2000-09). ・ Toshinari Hoshiai, Hiroshi Shibata, Takamichi Sakai, Keiichi Koyanagi: “Semantic Information Network Architecture: SION Architecture”, NTT R & D, Vol.50, No.3, pp.157-164 (2001.3) (Corresponding to Non-Patent Document 1 below)

SION proposed in these documents is an autonomous decentralized network that distributes packets based on semantic information (metadata), and dynamically searches and discovers specific entities among the entities distributed on the network. can do.
The concept of SION is shown in FIG. As is clear from comparison between FIG. 26 and FIG. 21, SION is a metanetwork based on semantic information (what to send to whom) instead of the conventional destination address (sending to whom).

Here, an outline of the semantic information network will be briefly described with reference to FIG.
The entities 22a, 22b, and 22c (actually terminals and the like) for each event receiver and the entities 21a and 22b (actually terminals and the like) for each event sender are connected via SION1. Each entity 22 (a, b, c) previously registers semantic information indicating the characteristics of the event (information) desired to be received as a filter. The entity 21 (a, b) gives a “stimulus” to SION1 by sending an event. Here, it is assumed that the entity 21a gives a stimulus. This event includes at least semantic information. SION1 collates the semantic information of the transmitted event with each registered filter. If the semantic information of the transmitted event matches the registered filter, the filter “fires” and transmits the event to the corresponding entity 22. Here, it is assumed that the filter of the entity 22b has fired. When the filter fires, the corresponding entity 22b starts autonomously and receives the event. Thereby, only a specific entity can be searched and discovered.

In SION, a network is constructed by autonomously coordinating all entities including SION components. The SION network components include a semantic information switch (SI-SW), a semantic information router (SI-R), a semantic information gateway (SI-GW), an event place, and a session. SI-SW collates the semantic information registered as a filter with the semantic information attached to the event, and activates the event receiving entity that fired as a result. SI-R selects a route between SI-SWs, and transfers an event transmitted from a terminal as an entity to another SI-SW. The event place is a range of the event. SI-GW transfers events between event places. A session is a connection between SI-SW and an entity. By combining these as needed, a secure and scalable P2P network can be constructed with a bottom-up approach.
US Pat. No. 5,870,605 JP 2000-165449 A Takanari Hoshiai, Hiroshi Shibata: "Autonomous Distributed Collaborative Environment Architecture for Proposal Information Proposal and Its Performance Evaluation", IEICE Transactions (DI), Vol.J83-DI, No.9, pp.1001- 1012 (2000-09). ・ Toshinari Hoshiai, Hiroshi Shibata, Takamichi Sakai, Keiichi Koyanagi: “Semantic Information Network Architecture: SION Architecture”, NTT R & D, Vol.50, No.3, pp.157-164 (2001.3).

In this way, the concept of an entity including network components for autonomously coordinating SION networks has been proposed. However, the functions that can actually realize the concept are not sufficient for effectively searching and discovering a specific entity with what is currently proposed.
For example, according to the currently proposed concept, an event transmission / reception condition setting request and a cancellation request are sequentially and autonomously propagated (propagated). However, every time an event transmission / reception condition setting / cancellation request is received, if the request is propagated to each network component, the network is burdened. Also, for example, when canceling an event transmission / reception route, there is still no technical proposal to solve the problem of what to do when communication with a device that has been relayed without following the normal procedure due to failure of the device, etc. .
The present invention has been made in view of such circumstances, and is a constituent element of a semantic information network, which is a semantic information switch, semantic information router, and method for establishing and canceling effective event forwarding and forwarding control. An object of the present invention is to provide a recording medium and a program.

The present invention has been made in order to achieve the above object. The present invention includes at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network. A communication system that shares a first semantic information switch and a second semantic information switch connected to the first semantic information switch via a semantic information router. 1 semantic information switch transmits a filter registration request indicating an event acquisition condition, and the semantic information router is a counter for each event type and is included in the filter contents transmitted from the first semantic information switch. In addition to increasing and holding a counter of the same event type as the event type to be received, the event type included in the received filter content If the counter of the same event type as the flop was the initial value at the time of the received, it transmits a registration request of the filters the received,
The second semantic information switch registers the content of the registration request transmitted from the semantic information router as a filter.

  Further, the present invention relates to an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A filter management method for sharing an event with a second semantic information switch connected to the first semantic information switch via an information router, wherein the first semantic information switch A process of transmitting a filter registration request indicating an acquisition condition, and the semantic information router is a counter for each event type and is the same event type as the event type included in the filter content transmitted from the first semantic information switch And the same event type as the event type included in the received filter content. When the type counter is an initial value at the time of reception, the process of transmitting the received filter registration request, and the second semantic information switch includes the content of the registration request transmitted from the semantic information router. And a process of registering as a filter.

  The present invention also provides a control request reception request for receiving a filter registration request indicating an event acquisition condition comprising at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information. A filter registration information management unit that holds a counter for each event type and increments and holds a counter of the same event type as the event type included in the received filter content, and an event included in the received filter content When a counter of the same event type as the type is received, the control unit and the semantic information router transmit the received filter registration request and register the contents of the registration request as a filter.

  The present invention also includes a process of receiving a filter registration request indicating an event acquisition condition comprising at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information, A process for holding a counter for each event type and incrementing and holding a counter of the same event type as the event type included in the received filter content, and a counter of the same event type as the event type included in the received filter content Is the initial value at the time of reception, a process for transmitting the received filter registration request and registering the content of the registration request as a filter.

  The present invention is also a filter management program for managing a filter indicating an event acquisition condition, and includes at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information. A step of receiving a filter registration request indicating an event acquisition condition, a step of holding a counter for each event type, and a step of incrementing and holding a counter of the same event type as the event type included in the received filter content; Sending a registration request for the received filter and registering the content of the registration request as a filter if a counter of the same event type as the event type included in the received filter content is an initial value when received. Is a filter management program that allows a computer to execute That.

  This makes it possible to suppress the number of times that an event path setting request or cancellation request, which is an event passage route, sequentially propagates (propagates) autonomously, and minimizes the event path control overhead. Can be reduced.

Further, the present invention relates to an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A communication system for transferring data to and from a second semantic information switch connected to the first semantic information switch via an information router, wherein the first semantic information switch comprises:
Transmitting a shared link establishment request including at least an identifier of the first semantic information switch, wherein the second semantic information switch receives the shared link establishment request transmitted from the first semantic information switch; An identifier included in the shared link establishment request is transmitted, and the semantic information router transmits an event transmitted from the first semantic information switch based on the identifier transmitted from the second semantic information switch. It is characterized in that it is set for transfer to the semantic information switch.

  As a result, a one-way shared link for transmitting and receiving events is established between the semantic information switches, and the events can be transferred from the first semantic information switch to the second semantic information switch.

  In the communication system according to the present invention, the second semantic information switch further transmits an identifier of the semantic information switch via a communication network, and the semantic information router or the first semantic switch The other semantic information router that connects the semantic information switch and the second semantic information switch, the event transmitted from the second semantic information switch based on the identifier transmitted from the second semantic information switch. Further, a setting for transferring to the first semantic information switch is further performed.

  As a result, a bidirectional shared link for transmitting and receiving events is established between the semantic information switches, and events can be transferred to each other.

  Further, the present invention relates to an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A shared link establishment method for transferring data to and from a second semantic information switch connected to the first semantic information switch via an information router, wherein the first semantic information switch includes at least the first semantic information switch. A process of transmitting a shared link establishment request including an identifier of one semantic information switch, and the second semantic information switch receives the shared link establishment request transmitted from the first semantic information switch, and at least the shared link establishment request is received. A process of transmitting an identifier included in the link establishment request, and the semantic information router includes the second semantic information switch. Based on al transmitted identifier, and wherein the step of setting for transferring events sent from the first semantic information switch to the second semantic information switch.

  Further, the present invention relates to an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A shared link establishment program for transferring data to and from a second semantic information switch connected to the first semantic information switch via an information router, wherein the first semantic information switch includes at least the first semantic information switch. Transmitting a shared link establishment request including an identifier of one semantic information switch; and the second semantic information switch receives the shared link establishment request transmitted from the first semantic information switch, and at least the shared link establishment request is received. Transmitting the identifier included in the link establishment request; and the semantic information router A shared link for causing a computer to execute a setting for transferring an event transmitted from the first semantic information switch to the second semantic information switch based on an identifier transmitted from the information switch; It is an established program.

  Further, the present invention is a first semantic information switch and a second semantic information switch that establishes a shared link with the first semantic information switch via a first semantic information router on a network. A second semantic information switch that requests the first semantic information switch to establish a shared link, and a third meaning that a shared link is established with the second switch via a second semantic information router. An information switch, and a third semantic information switch that has requested the second semantic information switch to establish a shared link; at least data; semantic information that is metadata of the data; and A communication system for transferring an event consisting of an event type which is a vocabulary concept, wherein the second semantic information switch is an established system. When receiving the request to cancel the errand, the fact that the shared link is to be released is transmitted to the first semantic information switch and the third semantic information switch, and at least the first semantic information switch is sent to the third semantic information switch. The third semantic information switch, transmitting information indicating that the shared link is released to the first semantic information router and the second semantic information router, and releasing the shared link. Transmits a shared link establishment request to the first semantic information switch based on the received identifier of the first semantic information switch.

  Further, the present invention is a first semantic information switch and a second semantic information switch that establishes a shared link with the first semantic information switch via a first semantic information router on a network. A second semantic information switch that requests the first semantic information switch to establish a shared link, and a third meaning that a shared link is established with the second switch via a second semantic information router. An information switch, and a third semantic information switch that has requested the second semantic information switch to establish a shared link; at least data; semantic information that is metadata of the data; and A shared link release method for transferring an event consisting of an event type which is a vocabulary concept, wherein the second semantic information switch A shared link release request is received, a process of transmitting to the first semantic information switch and the third semantic information switch to release the shared link, and at least the third semantic information switch to the third semantic information switch. A process of transmitting information including an identifier of one semantic information switch, and a process of transmitting to the first semantic information router and the second semantic information router that the shared link is to be released and releasing the shared link. And the third semantic information switch transmits a request for establishing a shared link to the first semantic information switch based on the received identifier of the first semantic information switch.

  Further, the present invention is a first semantic information switch and a second semantic information switch that establishes a shared link with the first semantic information switch via a first semantic information router on a network. A second semantic information switch that requests the first semantic information switch to establish a shared link, and a third meaning that a shared link is established with the second switch via a second semantic information router. An information switch, and a third semantic information switch that has requested the second semantic information switch to establish a shared link; at least data; semantic information that is metadata of the data; and A shared link cancellation program for transferring an event consisting of an event type that is a vocabulary concept, wherein the second semantic information switch Receiving a request for releasing the established shared link, transmitting to the first semantic information switch and the third semantic information switch that the shared link is released, and at least sending to the third semantic information switch Transmitting the information including the identifier of the first semantic information switch, and transmitting to the first semantic information router and the second semantic information router that the shared link is to be released to share-drink And causing the third semantic information switch to cause the computer to execute a shared link establishment request to the first semantic information switch based on the received identifier of the first semantic information switch. This is a shared link cancellation program.

  As a result, even if the semantic information switch as a relay point is abolished, a shared link is established autonomously between the semantic information switch and another semantic information switch that has established a shared link, and events are transferred. be able to.

  Further, the present invention provides at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, a hop count of an event, and a hop that is a transfer attribute of an event on the network. A communication system comprising a plurality of semantic information switches that receive events consisting of attributes from an event sender and transfer them to other semantic information switches based on the semantic information, wherein the communication system includes at least first semantic information A switch, a second semantic information switch receiving a request from the first semantic information switch and establishing a shared link, and a second semantic information switch receiving a request from the second semantic information switch and establishing a shared link 3, the first semantic information switch designates the number of hops, and designates the designated host. An event including the number of hops and the hop attribute is designated as another semantic information switch to which a shared link establishment request has been made, and the second semantic information switch receives the event, The event is transmitted based on the included hop attribute and the number of hops, the third semantic information switch receives the event, transmits a return event to the first semantic information switch, and the first meaning An information switch is made to receive the return event.

  Further, the present invention provides at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, a hop count of an event, and a hop that is a transfer attribute of an event on the network. An event transfer method implemented in a communication system composed of a plurality of semantic information switches that receives an event consisting of attributes from an event sender and transfers them to another semantic information switch based on semantic information, the communication system comprising: At least a first semantic information switch, a second semantic information switch that has received a request from the first semantic information switch and has established a shared link, and a shared link that has received a request from the second semantic information switch And the first semantic information switch is a hop. The second semantic information switch includes a process of designating and transmitting an event including the designated hop number and hop attribute as another semantic information switch to which a shared link establishment request has been made, The process of receiving the event and transmitting the event based on a hop attribute and the number of hops included in the event, and the third semantic information switch receives the event and sends the event to the first semantic information switch. A process of transmitting a return event and causing the first semantic information switch to receive the return event.

  Further, the present invention provides an event on a network that includes at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event transfer attribute. A semantic information switch that is received from an event sender and forwarded to another semantic information switch based on the semantic information, and that makes a shared link establishment request based on a hop attribute included in the event An event transmission unit that uses any one of the semantic information switches or the other semantic information switches that have received the shared link establishment request or the semantic information switch of all the semantic information switches as a transfer destination of the event.

  Further, the present invention provides an event on a network that includes at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event transfer attribute. A shared link establishment method for receiving from an event sender and transferring to another semantic information switch based on the semantic information, and making a shared link establishment request based on a hop attribute included in the event The process is characterized in that the semantic information switch of any other semantic information switch or all the semantic information switches that have received the shared link establishment request is used as the event transfer destination.

  Further, the present invention provides an event on a network that includes at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event transfer attribute. A shared link establishment program for receiving from an event sender and transferring to another semantic information switch based on the semantic information, and making a shared link establishment request based on a hop attribute included in the event A shared link establishment program that causes a computer to execute another semantic information switch or another semantic information switch that has received a request to establish a shared link or a semantic information switch of any semantic information switch as an event transfer destination. is there.

  As a result, it is possible to control the transfer destination finely. As an effective example of the present invention, there is a case where a shared link has to be reestablished due to, for example, a failure of a semantic information switch, a power failure, or a session (communication path) failure. In such cases, it may not be possible to teach alternative semantic information switches that are needed when reestablishing a shared link. In SION, each semantic information switch grasps the alternative establishment request destination semantic information switch by sending an event of any number of hops in order to cope with such a situation, and substitutes it at the time of failure .

  Further, the present invention provides an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A communication system for transferring between a first semantic information switch and a second semantic information switch connected via a semantic information router, wherein the first semantic information switch sends a shared link establishment request. The second semantic information switch registers both the semantic information and the event type as a filter, and upon receiving the shared link establishment request transmitted from the first semantic information switch, transmits at least the filter. The semantic information router is transmitted from the second semantic information switch to the first semantic information switch. Characterized in that to register the filter.

  Further, the present invention provides an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on the network, the first semantic information switch, A filter management method for transferring data between a first semantic information switch and a second semantic information switch connected via a semantic information router, wherein the first semantic information switch includes a shared link establishment request. And the second semantic information switch registers both the semantic information and the event type as a filter, and receives at least the shared link establishment request transmitted from the first semantic information switch. A process of transmitting a filter, and the semantic information router sends the second semantic information to the first semantic information switch. And wherein the steps of registering a filter sent from the switch.

  Further, the present invention transfers an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on a network between a plurality of semantic information switches. The semantic information router includes a control unit that uses both semantic information and an event type as a filter, and registers a filter transmitted from a certain semantic information switch in another semantic information switch.

  Further, the present invention transfers an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on a network between a plurality of semantic information switches. This filter management method is characterized in that both semantic information and event type are filters, and a filter transmitted from a semantic information switch is registered in another semantic information switch.

  Further, the present invention transfers an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information on a network between a plurality of semantic information switches. This filter management program causes a computer to execute a step of registering a filter transmitted from a certain semantic information switch in another semantic information switch using both semantic information and event type as a filter.

  Thereby, it is possible to prevent any unnecessary event transfer from occurring in the semantic information network.

  Further, the present invention receives, on the network, an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information from an event sender, and Semantic information switch for transferring to other semantic information switches based on information, and a control unit that makes a shared link establishment request to each of the other semantic information switches at most once, and establishment from other semantic information switches A control request receiving unit that receives requests without limitation.

  Further, the present invention receives, on the network, an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information from an event sender, and An event transfer method for transferring to another semantic information switch based on information, a process of making a shared link establishment request to each of the other semantic information switches at most once, and an establishment request from another semantic information switch The process of accepting an unlimited number of times.

  Further, the present invention receives, on the network, an event including at least data, semantic information that is metadata of the data, and an event type that is a vocabulary concept of the semantic information from an event sender, and An event transfer program for transferring to another semantic information switch based on information, a step of making a shared link establishment request to each of the other semantic information switches at most once, and an establishment request from another semantic information switch Is an event transfer program that causes a computer to execute the step of accepting an unlimited number of times.

  This makes it possible to control the shared link more finely. As an effect, useless shared links can be prevented.

  Further, the present invention is a computer-readable recording medium on which the program described above is recorded.

  Thereby, it is possible to provide a computer-readable recording medium in which a program for realizing each function is recorded.

  As described above, according to the semantic information switch, semantic information router, method, recording medium, and program according to the present invention, it becomes possible to suppress unnecessary event transfer and event path setting / release requests, and scalability. An excellent semantic information network can be constructed.

An embodiment of the present invention will be described with reference to the drawings.
Hereinafter, all computers such as personal computers, workstations, portable information terminals, mobile phones, and wearable computers are collectively referred to as hosts. Furthermore, a host that implements SION software is called a SION entity (simply an entity).
An entity is a unit of autonomous decentralization in SION, and is a virtualized host that implements SION software as an autonomous operating entity in SION (see FIG. 1). SION software also provides various mechanisms for individual entities to perform autonomous distributed cooperation.

Here, the entity will be described in detail. Entities are classified into three main types as shown in FIG.
(1) Entity acting as a service (Service entity: hereinafter referred to as SE)
(2) Entity that acts as a network component (network entity: hereinafter referred to as NE)
(3) Entities that act from the viewpoints of both services and network components (service network entity: hereinafter referred to as SNE)

  The service entity is a virtualized application program as an entity. With a plug-in mechanism provided by SION-MT (SION-Management Tool), a general application program can be entityized as a service entity. SION-MT itself is a service entity. The service entity can send events to SION and receive events from SION via the session. In addition, a single service entity can establish multiple sessions for SION. Service entities are basically not involved in network construction / operation.

The network entity is an entity for constructing SION. As mentioned above, SI-SW (semantic information switch), SI-R (semantic information router), SI-GW (semantic information gateway), EP (event place) , Session, statistics entity, fault handling entity, alive entity, etc. In the SION of the present embodiment, as many network components as necessary can be dynamically generated in the entity as necessary. For example, a plurality of SI-SWs can be dynamically generated in one entity. In addition, SI-SWs in the same entity can belong to different EPs.
These are used when building a backbone P2P network or a hybrid P2P network.
SNE is an entity that behaves from the perspective of both services and network components, and is used when building a pure P2P network. This is a form in which each SNE helps each other to build a volunteer network, and the SNE distributes and cooperates to self-organize the network.

  Note that a hybrid P2P network is a network that is configured by, for example, an operator such as a network provider generating an event place in advance on a host or the like, and a service entity such as a personal terminal connecting to the event place through a session. . The pure P2P network is a network configured by connecting entities that are individual transmission / reception terminals via shared links, and among these networks, the smallest unit for sharing an event is an event place. The backbone P2P network is a connection form between networks, for example, a network in a state where pure P2P networks in a plurality of regions are connected via a hybrid P2P network.

FIG. 3 shows the configuration of an entity when a plurality of network entities are included in one entity. In this figure, a request processing unit 31 is a manager interface for accepting a request for generating a network component. The factory 32 generates network elements such as SI-SW, SI-R, SI-GW, EP, session, statistical information entity, failure processing entity, and Alive entity as distributed objects in the entity. Based on the generation request received by the request processing unit 31, the factory 32 generates the above-described network component.
In this figure, SI-SW, SI-R, SI-GW, and the like generated in this manner exist in one entity.

FIG. 4 shows a network configuration example of SION. In SION, various forms of P2P networks can be constructed by arranging and combining entities according to the purpose. Also, different forms of P2P networks can be seamlessly linked. This includes: "All entities are autonomously distributed and coordinated in a unified and simple mechanism called" chain reaction based on stimulation and firing "", "Reducing P2P network configuration differences to entity placement problems", etc. Is achieved.
Note that an entity advertises its existence based on a public protocol. This is called advertisement. The advertisement includes a method using an “advertisement base (origin entity, origin event place, etc.)” that acts as an advertisement transmission base, and a method based on broadcast cascade.
In the following, individual network entities are described in detail.

<SI-SW (SI-Switch)>
SI-SW (semantic information switch) provides a switching mechanism for switching events based on semantic information. In SION, this SI-SW is implemented as distributed software.
Fig. 5 shows the configuration of SI-SW. In this figure, an event receiver 51 receives an event from an event sender. The collation unit 52 collates the semantic information given to the event received by the event reception unit with the filter. The event transmission unit 53 transmits the event ignited by the verification unit to the event receiver. The filter management unit 54 stores a filter and an event transmission destination when fired as a result of collation.
The control request receiving unit 55 receives control requests from other switches, routers, and the like. The control unit 56 performs filter control (registration, release), session control (registration, release), shared link control (establishment, release, re-establishment, information response) and the like based on the request received by the control request reception unit. . The shared link setting information management unit 57 stores a shared link setting condition (setting partner SW ID, setting request / requested type).

  As shown in FIG. 6, SI-SW accommodates service entities in a star shape via a session. Here, the session is a connection between the SI-SW and the service entity, and the service entity can send and receive events via the session. The service entity is an entity that transmits and receives events to and from the SI-SW. For convenience of explanation, the service entity may be referred to as an event transmission entity and an event reception entity. The former is an entity that transmits an event to SI-SW, and the latter is an entity that receives an event from SI-SW. A service entity can have both aspects.

The service entity is positioned as a distributed application on SION (an application program that transmits and receives events using SION), and the File Exchanger (file exchange application) and personal TV service shown in FIG. Has been implemented.
FIG. 7 shows the structure of an event (SION packet). The event includes a control information part (CI: Control Information) part, a semantic information (SI: Semantic Information) part, and a data part. Transmission data is stored in the data portion. Various data and programs such as text (document, telephone number, XML), binary data, reference (URL, Object Reference), proxy, agent, and the like can be stored as transmission data.

  On the other hand, the semantic information section stores semantic information (vocabulary and its value) of transmission data and a vocabulary concept of semantic information (called event type). Here, the semantic information is metadata describing characteristics of transmission data, and belongs to any event type as shown in the semantic information system (ontology system) in FIG. That is, the semantic information is an event type instance, and the event type is a semantic information template. You can define inheritance relationships between event types. Some event type names are reserved for SION control (for SION network entities). For reference, an example of a semantic information system is shown in FIG. In this figure, the meaning information “title; yesterday”, “price; $ 30”, “artist name; beatles” belongs to the event type “popular” and also belongs to the event type “music”. Yes. In addition, the meaning information “title; night of Kiyoshi no Ko”, “price; $ 20”, “situation; Christmas” belongs to the event type “BGM” and also belongs to the event type “music”. .

The control information part is a data field used for execution control of SION, and only this is not open to the service entity that is the user of SION. Control information section includes matched filter identifier, matched filter matching score, synchronous statistics collection flag, TTL value (within event place, between event places), number of hops (within event place, between event places), etc. Various control information is set.
As shown in FIG. 10, the event receiving entity registers an event acquisition condition in the SI-SW via the session. This is called a filter.
In the filter, an event type of an event to be acquired and a matching condition with semantic information (for example, an object whose vocabulary “Price” is in the range of “$ 20 to $ 40” is acquired) are set. Note that the matching condition can also be selected in units of filters for complete matches with all vocabularies defined in the event type, partial matches with some vocabularies, weighted matches, and the like.

A plurality of filters can be registered from one session, but filters registered through the same session have an “or” relationship. That is, one session fires at most once for an event.
If a wild card is specified for the event type of the event to be acquired, all event types are subject to matching. Further, when 1 (logical value is true) is set as the matching condition with the semantic information, it means that the matching condition with the semantic information is satisfied unconditionally.

On the other hand, the event transmission entity transmits an event to the SI-SW via the session. At this time, the event receiving unit 51 of the SI-SW receives the event and passes it to the matching unit 52. The collation unit 52 collates the event semantic information part with the filter. Specifically, first, it is checked whether or not the event type is desired to be received. If the event type is satisfied, the semantic information and the matching condition are checked. As a result of the collation, when the condition is satisfied, the event receiving entity in which the matched filter is registered is activated and the event is notified. In SION, event transmission is called “stimulus”, the filter matches the event “reaction”, and the entity that registered the matched filter is activated and event notification is called “fire”.
In addition to event notification by firing, it also supports look-in type event notification. This is a reception mode in which an event spooled for each reception session is acquired by pulling. This look-in type event notification is effective for event reception across firewalls as shown in FIG. 28 and event reception when SE is not active.

The basic concept of SION is to make all entities autonomously and cooperatively coordinated by a chain reaction of stimulus and firing.
It is also possible to register semantic information in the filter and set distribution conditions (collation conditions) in the semantic information section of the event. In SION, this type of model is called a custom model. For example, “$ 20 <Price <$ 30” can be set in the semantic information portion of the event. On the other hand, the form described in the text (a form in which a filter is registered in SI-SW and semantic information is registered in an event) is called an inquiry type model.

<EP (Event Place)>
The event place is a domain concept devised for the following purposes (see FIG. 11). The shared link and SI-R will be described later.
(1) Event transfer range: It is possible to limit the spread range of chain reactions based on stimulation and firing.
(2) Event routing target range: A set of SI-SWs connected by a shared link. Link topology and event routing method can be selected for each event place.
(3) Space in which the uniqueness of the semantic information system is guaranteed: An explosive increase in the event types handled is suppressed.

The following are examples of the main usage of event places with such features.
(1) Subnet unit (physical unit)
For example, it is used when building a local network of SION on a personal computer at work.
(2) Service unit (logical unit)
In general, the required semantic information system (vocabulary concept and vocabulary) differs for each service. For example, it is used when an event place is constructed for each service type such as a securities information providing service and a medical information service.
(3) Service operator unit Even when the same service type is used, a different event place is constructed for each service operator.

(4) Security Assurance Unit Only approved entities are allowed to participate in the event place. That is, it is allowed to establish a session with the SI-SW in the event place, or to establish a shared link with the SI-SW in the event place. Basically, information sharing between event places is not allowed.
(5) Unit of network operation / administrator For ease of operation and management, the event place may be further divided into a plurality of event places.
(6) Load distribution unit From the viewpoint of load distribution, an event place may be divided into a plurality of event places.

(7) Physical unit associated with session establishment restrictions
In SION, a connection between a service entity and SI-SW, and a connection between SI-SW (shared link) are realized by a session. The session itself is a logical concept, but when it is physically implemented using a wireless LAN or the like, the grouping target is limited by the wireless reachable distance.
(8) Grouping of groups By using SI-GW, which will be described later, event places are linked in a hierarchical manner, a clustering configuration having a parent group / child group relationship can be constructed.

<SI-GW (SI-Gateway)>
The event place is for limiting the event transfer range, and basically cannot share an event with another event place. However, by setting SI-GW (semantic information gateway), event sharing between event places becomes possible (see FIG. 11). Thereby, cooperation (federation) between event places constructed according to each use and purpose becomes possible.
In FIG. 11, for example, when event place A makes a cooperation request to event place B and this is approved by event place B, event place A generates SI-GW _{A, B.} Note that one-way or two-way cooperation can be specified as the cooperation request.

SI-GW _{A and B} establish an event reception session for event place B, while establishing an event transmission session for its own event place.
This makes it possible to transfer an event that occurred in event place B to event place A.
SI-GW _{A and B} are fine-grained firewalls, such as setting all filter types to be transferred or only specific event types to be transferred by setting the filter value registered via the event reception session. Control becomes possible.

Further, when event transfer is performed between event places having different semantic information systems, it is necessary to convert event semantic information. Therefore, SI-GW _{A and B} create a semantic information conversion table between event place A and event place B, perform semantic information conversion based on the information, and then transfer events to event place A. Do. The number of transfers (number of hops) between event places is limited by the TTL value.
Based on the above concept, interconnection with other P2P networks is also possible. In SION, this mechanism is called “S / x-GW”. For example, from SION, the Gnutella network is virtualized as one entity via S / G-GW.

<Reference model>
SION uses the concept of a reference model. The lowest layer is the SION and event transmission layer. Provides a network interface for higher layers. The middleware layer is a community network and corresponds to the intelligence layer of SION. The highest layer is the application layer (service entity).
SION-Management TOOL (SION-MT) is also positioned as one of the service entities. This is a GUI tool that issues the SION network interface and does not have any service-specific logic. However, a plug-in mechanism that can incorporate other application programs (applications having service logic) into SION-MT is provided. This makes it easy to build a service entity customized for each user.

<Online increase / decrease method>
Here, the network entity increase / decrease method is described from the viewpoint of SI-SW increase / decrease.
<Purpose of SI-SW increase / decrease>
First, the purpose of SI-SW increase / decrease in SION is described.
(1) From the viewpoint of improving the total processing capacity of the event place, add SI-SWs in the event place to distribute the event filtering process. From the opposite perspective, SI-SW will be reduced.
(2) Build a flexible and global network from the bottom up by flexibly establishing a shared link for dynamically generated SI-SW.

<Type of increase / decrease>
In SION, several types of increase / decrease are provided. Here, FIG. 13 shows a typical configuration.
(1) Combining and separating event places As shown in FIG. 13A, a plurality of event places can be combined.
This is because a shared link is established between event places by combining requests (established shared links) to any SI-SW or event place belonging to the event place, and the combination of both is realized. The Note that the request source and the request destination of synthesis (shared link establishment) may be either SI-SW or event place. On the other hand, in the case of division, the established shared link is released and separated into event places.

(2) Participating and leaving the event place As shown in Fig. 13 (b), existing requests can be made by making a participation request (shared link establishment request) to the event place. A shared link is established with SI-SW and you can participate in the event place.
When the SI-SW leaves the event place, the shared link with another SI-SW is canceled, the shared link is reconstructed, and the event place is withdrawn. At this time, the state of the SI-SW that has moved out transitions to the suspended state.
Note that by requesting the SI-SW to establish a shared link from the event place side, the SI-SW can be taken into the event place. This is called absorption. The opposite is called splitting.

(3) Increasing or decreasing SI-SW As shown in Fig. 13 (c), if an SI-SW expansion request is made to SI-SW in the event place or event place, the specified host ( The number of SI-SWs specified for the entity) is newly generated, and a shared link is established with the existing SI-SW. On the other hand, when an SI-SW reduction request is made to the event place, the shared link of the designated SI-SW is released, and then the shared link is re-established and the SI-SW is deleted. At this time, the state of SI-SW transits to Non-Existent.

(4) Federation between event places As shown in FIG. 13 (d), SI-GW is generated by making a federation (cooperation) request to SI-SW in the event place or to the event place. Both event places are linked through the session. The federation request source and request destination may be either SI-SW or event place.
FIG. 14 shows the state transition of the SI-SW in the above form. Since the state of the SI-SW when the SI-SW is generated is a suspended state, the SI-SW does not become active unless it belongs to any event place. In addition, the SI-SW for which a shared link is established cannot be deleted.

<Entity arrangement and business model>
As described above, a hybrid business model and a pure business model can be constructed according to the arrangement of network entities.
The former is a form in which an event place is constructed by arranging network entities in advance on a host provided by a network provider or service provider, and a user (event sender / receiver) participates in the event place via a session.

On the other hand, the latter is a form in which a pure P2P network is constructed by arranging network entities on individual hosts of event senders and receivers and establishing a shared link for each.
By using SION, both forms can be realized with the same network architecture and control method. That is, it can be reduced to the problem of the arrangement method of the network entity. It is also possible to link the two via SI-GW. The advantage of SI-GW is that when attention is paid to a certain event place A, event place B (SI-GW) linked to the event place can be seen as one service entity of event place A. That is, general service entities and event places can be handled in the same manner.
By developing this idea and deploying SION / Gnutella-GW, it can be easily linked with other P2P networks such as Gnutella. From the SION (event place) side, the entire Gnutella network appears as one service entity participating in SION. In addition, such an SX-GW (X = I, G) can be arranged by an event place operator, but SX-GW is incorporated into SION-MT using the SION-MT plug-in mechanism. Therefore, it is possible for the end user to arrange the service.
This makes it possible to build a seamless network in a build-up and to be an adhesive for business models with different SIONs (broker models and other brokerless models).

<Event routing method>
The shared link (shared link) is a concept for performing bidirectional event sharing between a plurality of different SI-SWs. For example, the SI-SW can establish a shared link between SI-SWs by making a shared link (SL) establishment request to another SI-SW. Various event routing methods can be dynamically selected between SI-SWs by setting filter values to be described later.
FIG. 15 shows a state in which SI-SW2 and SI-SW3 are respectively requesting establishment of a shared link to SI-SW1.

<Establishment of shared link>
Here, in FIG. 15, a mechanism from the establishment request to establishment of a shared link from SI-SW2 to SI-SW1 will be described.
As shown in FIG. 16, SI-R is installed between SI-SW and SI-SW, and SI-R performs event routing (event transfer) between SI-SW based on semantic information. . The configuration of SI-R will be described with reference to FIG.
The event transfer unit 71 receives an event from a switch and transmits the event to another switch. The control request receiving unit 72 receives control requests such as shared link control (establishment / cancellation) and filter registration control from other switches and routers. The control unit 73 performs the control received by the control request receiving unit. The filter registration information management unit 74 records filter registration information (registration counter for each event type).

Hereinafter, an operation for establishing a shared link will be described.
(1) SI-SW2 issues an SI-SW2 identifier and filter setting contents to SI-SW1 together with a shared link establishment request. The filter setting contents are issued as necessary, and may or may not be present.
(2) At this time, as shown in FIG. 16, SI-SW1 dynamically generates SI-R _1,2 by factory 32 and establishes shared link setting information management in order to establish SL _1,2. The unit 57 stores that SI-SW2 is a shared link establishment request source. SI-SW1 passes the SI-W2 identifier, filter settings, etc. to SI-R _1,2 .

(3) The control unit 73 of SI-R ₁ , ₂ establishes a session for event reception with respect to SI-SW2. Furthermore, a session for event transmission is established for the SI-SW 1 to which it belongs.
(4) As a result, SL _1,2 is established. For example, an event sent by SE4 to SI-SW2 is also sent to SI-SW1 via SI-R _1,2. .
(5) At this time, SI-R _1,2 requests SI-SW2 to register the filter, and SI-R _1,2 registers the filter. Depending on the settings of the filter, the event transfer method can be selected. An example of the event transfer method will be described below with reference to (a) and (b).

(A) The event sent to SI-SW2 is unconditionally transferred to SI-SW1.
That is, SI-R _1,2 fires for all events. This can be done by setting a wildcard as the event type that you want to receive for the filter that SI-R _1,2 registers through the event reception session and setting 1 (logical value true) as the matching condition. Become. In this method, useless event transfer and event verification processing overhead at the transfer destination occur, but since the event path setting overhead described later does not occur, this method is effective when the number of filter registrations is sufficiently larger than the number of event transmissions It is.

(B) Transfer only necessary events to SI-SW1 from SI-SW2 to SI-SW1 (no unnecessary event transfer is performed). That is, SI-R _1,2 fires only for a specific event. For example, SE2 is a filter registered against SI-SW1, by SI-R _{1, 2} is filter registered in the SI-SW2, this method can be realized. In addition, by registering only the event type as a “1” filter (the matching condition is always true), only the event type is matched in SI-SW2, and as a result, when SI-R _1,2 is fired , SI-R _1,2 sends the event to SI-SW1, and collates with semantic information in SI-SW1 (event routing based on vocabulary concept), and both “2” event type and matching condition Is registered in SI-SW2 as a filter, and it is roughly divided into forms that perform complete filtering in SI-SW2 (event routing by vocabulary). Such routing information is called an event path.
It should be noted that the event transfer method (filter value at the time of SI-R filter registration to SI-SW) can be selected at the time of EP generation or filter registration from a service entity.

  The lexical event routing method does not cause any unnecessary event forwarding, but the filter registration processing overhead for routing is enormous, so this method is effective when the number of event transmissions is sufficiently larger than the number of filter registrations. .

On the other hand, the routing method based on the vocabulary concept is positioned as a compromise between the two methods described above. In other words, it is effective when the number of filter registrations and the number of event transmissions are about the same, or when the ratio between the number of filter registrations and the number of event transmissions cannot be predicted.
With these mechanisms, event multi-hop and multicast based on semantic information are realized.

(6) The above-described procedures (2) to (5) are similarly performed in the SI-SW2 that is the shared link establishment request source. That is, SI-SW2 memorizes SI-SW1 as an establishment request destination and dynamically generates SI-R (SI-R _2,1 ) to establish SL _2,1 , Do the same. As a result, a bidirectional shared link is established between SI-SW1 and SI-SW2, and events can be shared with each other. By not registering the filter, a one-way shared link can be logically established.

(7) The number of event transfers, that is, the number of hops between SI-SWs can be limited by the TTL value. With these, multi-hop between SI and SW can be realized.
As is clear from the above description, SI-R is an entity having aspects of both event transmission and event reception, and is not fundamentally different from a service entity that is a general service application. In SION, an entity used for SION control such as SI-R is called a network entity, particularly distinguished from a service entity. In SION, all service entities and network entities are treated as a common entity, and autonomously operated according to a simple and consistent common logic of event transmission and event reception, i.e., chain reaction of stimulus and firing. , Provide a super-distributed and super-loosely coupled architecture in which all entities can cooperate autonomously and distributedly.

<Release and re-establish shared link>
When a specific SI-SW is removed or removed, the shared link established between the SI-SWs must be released and the shared link reestablished. The outline is introduced below.
In FIG. 18, the first numeral of the shared link establishment request indicates the order of those requests. First, a shared link establishment request is made from SI-SW2 to SI-SW1.
Next, a request to establish a shared link is made from SI-SW3 to SI-SW2. Finally, a shared link establishment request is sent from SI-SW4 to SI-SW2. Note that here, each SI-SW can make a shared link establishment request only once to each other SI-SW, but it is also possible to adopt a link topology that can accept the establishment request without limitation. . Thereby, a useless shared link can be prevented.

When this establishment request is successful, a shared link is established between each SI-SW by the procedure described above. At this time, for example, SI-SW2 shares a list of SI-SW (SI-SW1) that has requested establishment and SI-SW (SI-SW3, SI-SW4) that has accepted establishment. It is held in the link setting information management unit 57.
In this situation, for example, when SI-SW2 is required to be removed or removed, a shared link release request is issued to SI-SW2, and a new shared link needs to be established after the shared link is released. . The procedure is shown below. For convenience of explanation, each part of SI-SW1 is a (for example, control unit 56a) at the end, each part of SI-SW2 is at the end (for example, control unit 56b), and each part of SI-SW3 is the end. C (for example, the control unit 56c), and each unit of the SI-SW1 is described with d (for example, the control unit 56d) at the end.

(1) A shared link release request is notified to SI-SW2. The control request receiving unit 55b of the SI-SW2 receives the request and controls the control unit 56b.
(2) The control unit 56b of the SI-SW2 notifies the 1-hop SI-SW (SI-SW1, SI-SW3, SI-SW4) of releasing its own shared link. This can be done by sending an event with the TTL value of the event set to 1. At this time, for SI-SW (SI-SW3, SI-SW4) that accepted the establishment of the shared link to itself, the establishment request destination of the shared link on behalf of itself, that is, the SI that made the establishment request -Teach SW1. Thereafter, the control unit 56b of the SI-SW2 notifies the SI-R _2,1 , SI in order to release the shared link (SL _2,1 , SL _2,3 , SL _2,4 ) established by the SI-SW ₂ itself. -R _2,3 , SI-R _2,4 (however, these SI-Rs are not shown) Each control unit 73 of these SI-Rs releases a session with another SI-SW in response to this.

(3) On the other hand, the control units 56 (c, d) of SI-SW3 and SI-SW4 all _share links (SL _3,2 , SL _4,2 ) that they have established for SI-SW2. Cancel the request, make a shared link establishment request to the new SI-SW (SI-SW1), and re-establish the shared link. Note that the control unit 56a of the SI-SW1 cancels SL ₁ and ₂ , and waits for establishment requests from the SI-SW3 and SI-SW4.

(4) Not only is the request for releasing the shared link following proper procedures such as SI-SW removal or removal, but also due to SI-SW failure, power failure, session (communication path) failure, etc. In some cases, the shared link must be re-established.
However, in such cases, it may not be possible to teach alternative SI-SWs that are needed when reestablishing a shared link. In SION, in order to cope with such a situation, each SI-SW transmits an event of n hops (n is arbitrary) to grasp an alternative establishment request destination SI-SW. In SION, finer hop control is possible by using the TTL value and the hop attribute included in the event semantic information. Typical hop attributes include:
“1” Only SI-SWs requesting establishment of a shared link are targeted for hopping.
“2” Only SI-SWs that accept shared link establishment requests are targeted for hopping.
“3” All SI-SWs are targeted for hopping.

  For example, the event flow when the hop attribute of “1” is designated is indicated by a broken line in FIG. In FIG. 19, (i / j) is shared link establishment information stored in each SI-SW. i indicates the SI-SW for which the SI-SW has made a shared link establishment request, while j indicates the SI-SW for which the SI-SW has accepted the shared link establishment request. For example, (2/5, 6) of SI-SW3 indicates that SI-SW3 issues an establishment request to SI-SW2, and accepts establishment requests from SI-SW5 and SI-SW6. In this situation, SI-SW6 can know the existence of SI-SW2 by sending an event with 2 hops and “1” hop attribute and receiving a return event from SI-SW2. Substitute for SI-SW3 failure.

<Event path management method>
FIG. 20 shows how an event path (event routing information) set by SI-R is updated and managed when a service entity registers a filter in a one-way shared link. .
FIG. 20B shows an example of SI-R counter value transition when the SE registers / cancels a filter for the event type “BGM” in the network configuration of FIG. 20A. is there.

In FIG. 20B, SE _i + means that the service entity i has registered BGM as an event type of the event to be acquired. On the other hand, SE _i -means that the service entity has removed the filter.
The numbers in the table are the counter values for event path management held by the SI-R filter registration information management unit 74, and SI-R sets the event path for SI-SW. Indicates the number of times the filter is registered. Such management is performed for each event type. However, the actual filter registration from SI-R to SI-SW is controlled by the control unit 73 so as to be performed only when the counter value is incremented from 0 to 1. For example, when the SI-R transitions from 1 to 2, the filter registration is not performed, and only the fact that the filter registration is requested is stored in the counter of the filter registration information management unit 74. Similarly, when the service entity performs the filter removal, the counter is decremented to update the event path, but the actual filter removal from SI-R to SI-SW results in a counter value of 0. Sometimes it happens for the first time. This makes it possible to suppress the number of times an event path setting request or cancellation request is sequentially propagated (propagated) autonomously to the minimum necessary, thereby reducing event path control overhead. .

In order to simplify the description, only a one-way shared link is used for the description, but actually, the same event path management is performed in the bidirectional shared link.
Hereinafter, FIG. 20B will be briefly described.
The initial value “1” indicates that an event path for the event type “BGM” has not been established.
“2” When SE3 registers a filter, event path setting requests sequentially and autonomously propagate, and as a result, SI-R _3,2 registers the filter in SI-SW2, and similarly, SI-R Event paths are set by R _2,1 and SI-R _2,4 registering with SI-SW as filters. At this time, each SI-R increments the counter.
"3" Further, the SE5 registers a filter, through the SI-R _5,3, although setting request event path is spread against _{SI-R 3,2, SI-R} 3,2 is already Since a filter for transferring an event related to the event type BGM has already been registered (counter value is 1), the counter is simply incremented to 2, and no further filter registration is performed. For this reason, since the event path setting request does not spread to SI-R _2,1 and SI-R _2,4 , the counters of both do not change.
In the same way as “4”, the counter values in the table are updated as shown in FIG.

  The shared link setting information management unit 57 and the filter registration information management unit 74 in FIGS. 5 and 17 only read out a nonvolatile memory such as a hard disk device, a magneto-optical disk device, a flash memory, or a CR-ROM. It is assumed to be configured by a possible storage medium, a volatile memory such as a RAM (Random Access Memory), or a combination thereof.

  3, 5, and 17 may be realized by dedicated hardware, and each unit in FIGS. 3, 5, and 17 may be a memory and a CPU (central processing unit). ), And a program for realizing the function of each unit in FIGS. 3, 5, and 17 may be loaded into a memory and executed to implement the function.

In addition, a program for realizing part or all of the functions of the respective units in FIGS. 3, 5, and 17 is recorded on a computer-readable recording medium, and the program recorded on the recording medium is read into a computer system. The function may be realized by executing. 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 storage device such as a flexible medium, a magneto-optical disk, a portable medium such as a ROM and a CD-ROM, and a hard disk incorporated in a 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 changes and the like within a scope not departing from the gist of the present invention.

In one Embodiment of this invention, it is a figure explaining the outline | summary of an entity. In the same embodiment, it is a figure explaining the type (kind) of an entity. In the same embodiment, it is a figure explaining the structure of an entity. In the same embodiment, it is a figure explaining the structure of a semantic information switch, an entity, and a session. In the same embodiment, it is a figure explaining the structure of a semantic information switch. In the same embodiment, it is a figure which shows the structural example of a semantic information network. In the same embodiment, it is a figure explaining the structure of an event. In the embodiment, it is a figure explaining the outline | summary of a semantic information system (ontology system). In the embodiment, it is an example of a semantic information system (ontology system). In the same embodiment, it is a figure explaining registration of event acquisition conditions. In the same embodiment, it is a figure explaining the outline | summary of an event place. In the same embodiment, it is a figure explaining the view of a reference model. In the same embodiment, it is a figure explaining the increase / decrease form of a network entity. In the embodiment, it is a figure explaining the state transition of a semantic information switch. In the same embodiment, it is a figure explaining the state in which a semantic information switch performs the establishment request | requirement of a shared link. In the embodiment, it is a figure explaining the operation | movement in which a semantic information switch establishes a shared link. In the same embodiment, it is a figure explaining the structure of a semantic information router. In the same embodiment, it is a figure explaining the operation | movement which a semantic information switch cancels | releases and re-establishes a shared link. In the same embodiment, it is a figure explaining the flow of the event which has a hop attribute. FIG. 6 is a diagram for explaining how an event path is managed and updated in a semantic information router when an arbitrary service entity registers a filter in the embodiment. In the embodiment, it is a figure explaining the conventional network. In the same embodiment, it is a figure explaining the structure of a packet. In the same embodiment, it is a figure explaining the network structure for implement | achieving the conventional personalized information proposal service. In the same embodiment, it is a figure for demonstrating a broker model. It is a figure explaining the realization method of a broker model in the embodiment. In the same embodiment, it is a figure explaining the concept of a semantic information network. It is a figure explaining the concept which shares an event in the semantic information network of the embodiment. In the same embodiment, it is a figure explaining the federation over the firewall using SI-GW.

Explanation of symbols

1: semantic information network (SION), 2: entity, 21 (a, b): entity, 22 (a, b, c): entity, 31: request processing unit, 32: factory, 51: event receiving unit, 52 : Collation unit, 53: event transmission unit, 54: filter management unit, 55: control request reception unit, 56: control unit, 57: shared link setting information management unit, 71: event transfer unit, 72: control request reception unit, 73: Control unit, 74: Filter registration information management unit, 101: Consumer, 102: Content provider, 103: Service provider, 109: Network network, 110: Content distribution network

Claims (6)

On the network, an event including at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, an event hop count, and a hop attribute that is an event transfer attribute A communication system comprising a plurality of semantic information switches that are received from an event sender and transferred to other semantic information switches based on semantic information,
The communication system is:
At least a first semantic information switch, a second semantic information switch that has received a request from the first semantic information switch and has established a shared link, and a shared link that has received a request from the second semantic information switch And a third semantic information switch that has established
The first semantic information switch is
Specify the number of hops, and send an event including the specified number of hops and hop attribute as another semantic information switch to which the shared link establishment request has been made,
The second semantic information switch is
Receiving the event, transmitting the event based on a hop attribute and the number of hops included in the event,
The third semantic information switch is
A communication system that receives the event, transmits a return event to the first semantic information switch, and causes the first semantic information switch to receive the return event. On the network, an event including at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, an event hop count, and a hop attribute that is an event transfer attribute An event transfer method implemented in a communication system comprising a plurality of semantic information switches that are received from an event sender and transferred to other semantic information switches based on semantic information,
The communication system is:
At least a first semantic information switch, a second semantic information switch that has received a request from the first semantic information switch and has established a shared link, and a shared link that has received a request from the second semantic information switch And a third semantic information switch that has established
The first semantic information switch is
Specifying the number of hops, transmitting the event including the specified hop number and hop attribute as another semantic information switch to which a shared link establishment request has been made,
The second semantic information switch is
Receiving the event and transmitting the event based on a hop attribute and a hop number included in the event;
The third semantic information switch is
Receiving the event, sending a return event to the first semantic information switch, and causing the first semantic information switch to receive the return event;
Event transfer method characterized by this. On the network, an event including at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event forwarding attribute is received from an event sender. A semantic information switch for transferring to another semantic information switch based on the semantic information,
Based on the hop attribute included in the event, the semantic information switch is another semantic information switch that has requested establishment of a shared link, another semantic information switch that has received a request for establishment of a shared link, or all semantic information switches. A semantic information switch comprising: an event transmission unit having the event transfer destination as a destination. On the network, an event including at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event forwarding attribute is received from an event sender. A shared link establishment method for transferring to another semantic information switch based on the semantic information,
Based on the hop attribute included in the event, the semantic information switch is another semantic information switch that has requested establishment of a shared link, another semantic information switch that has received a request for establishment of a shared link, or all semantic information switches. the method comprising the steps of: the event of the transfer destination,
A process of establishing a shared link with the semantic information switch as the transfer destination;
A method for establishing a shared link, comprising: On the network, an event including at least data, semantic information that is metadata of the data, an event type that is a vocabulary concept of the semantic information, and a hop attribute that is an event forwarding attribute is received from an event sender. A shared link establishment program for transferring to another semantic information switch based on the semantic information,
Based on the hop attribute included in the event, the semantic information switch is another semantic information switch that has requested establishment of a shared link, another semantic information switch that has received a request for establishment of a shared link, or all semantic information switches. A step that forwards the event to
Establishing a shared link with the semantic information switch as the transfer destination;
A shared link establishment program that causes a computer to execute. A computer-readable recording medium on which the program according to claim 5 is recorded.

Images