KR100505265B1 - Semantic information network(SION) - Google Patents

Abstract

On a network, a semantic information network for delivering an event comprising semantic information and data is provided. The semantic information network is a place for associating events from event senders to filters, which are information about event receivers, for delivery of events, and is the smallest unit that guarantees a common ontology scheme, and is an event place that spans the spread of events. It is provided with a device for providing.

Description

Semantic information network (SION)

According to the present invention, semantic information network, semantic information switch, which can directly specify desired information for end-users among the vast information distributed on the network, while the information provider can directly specify preferred users to distribute the information to, A semantic information router, a semantic information gateway, an event place, an event routing method, a federation method, a session, a filter management method, a statistical information collection method, an ontology conversion method, an ontology conversion information management method, and additional functions.

The conventional network is conceptually represented by the network model shown in FIG. In Fig. 16, each terminal registers a terminal address (e.g., network address and host address) as its identifier in the network. On the other hand, the transmitting terminal sends out an event (packet) composed of a recipient address (terminal address of the destination) and data shown in Fig. 17 to the network. That is, the basic concept of the conventional information network is to correctly deliver an event to a destination according to a recipient address.

Using this network, a case of realizing a proposal type service (a personalized information suggestion service for proposing personalized information for each user and a yellow page service such as a search service) is realized. Conventionally, in order to realize personalization information proposal service, it is necessary to always interpose a centralized server system (broker) as shown in FIG. Similarly, the yellow page service also needs to assume a broker called a search service. The centralized business model through these brokers is called a broker model. In this broker model, a broker (broker) is responsible for associating information providers with users. In other words, users and information providers can only meet through brokers.

19, the broker model will be described in detail. As shown in Fig. 19, a business model consisting of three business roles of a service provider (content information provider) 103, in addition to the end user (consumer 101 in the drawing) 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). By combining end user preference information, it has been realized as a proposal type service which proposes contents suitable for the end user (consumer 10l). These service providers are brokers.

Specific services include a search service such as Yahoo, a trading service, and a personalized information suggestion service that proposes content suitable for the end user's interest without direct intervening of the end user.

As shown in FIG. 20, such a service is realized as an integrated service system (service application) in each service provider 103 existing on the network 109 or the content distribution network 110. there was.

Due to this, the broker model has the following problems.

(1) The information provider (content provider 102) because the information provider (content provider 102) did not exist to announce the content information to the end user (consumer 101) without intervening a third party. He did not realize an order-taking type society in which an information provider (content provider) led the circulation of content information. In other words, the information provider (content provider 102), which is the provider of the content, cannot distribute the content information by its own policy without using a third party.

(2) In order to receive the proposed service of the service provider 103, the end user (consumer 101) had to explicitly recognize the existence, location, and access method of the service provider 103.

(3) Content, content information, and end user preference information could not be easily shared among other service providers 103. Until now, information was shared by exchanging information between individual service providers 103 according to a predetermined protocol.

(4) By the centralized management of the content information and the end user preference information in the service provider 103, a system with high scalability could not be easily constructed. Until now, the classical technique, such as preparing a several server system which manages content information and end user preference information, has been used.

By the way, distributed processing technologies such as the WWW (WorWd Wide Web) and CORBA provide an environment in which contents distributed and distributed on other types of distributed systems can be easily obtained in a home, and anyone can easily become a content provider. On the other hand, it is not easy to find the content desired by the end user among the vast amounts of content flooding the world, and early establishment of the realization technology is required.

In view of these circumstances and the problems of the broker model, the information provider (content provider) has proposed a non-broker model that can directly provide contents to end users who fit their contents without assuming the existence of a broker.

As a technique for realizing such a non-broker model, there are inventions by Gnutella and SUN (US Patent 5, 870,605: Document 1) and inventions by NEC (Japanese Patent Application Laid-Open No. 11-328654: Document 2).

Gnutella is a network that searches for and discovers a specific entity among a large number of unspecified entities (information) distributed on the Internet according to a peer-to-peer interaction model. In Gnutella, entities are also called servants. That is, each information provider superdisperses and manages meta data (meta files), and establishes arbitrary connections between meta files (between hosts in which the meta files are stored), so that only the information providers have a super-dispersion database related to meta data. Build it. By distributing cooperation among information providers, it is possible to construct a metadata retrieval network that does not require a broker. However, a search request packet from the consumer is broadcast to all information providers in accordance with the connection. That is, since P2P interaction is repeated for all hosts according to connection information, there is a problem in that unnecessary traffic increases and scalability decreases in proportion to an increase in the number of hosts or metadata types to be handled. In addition to scalability, there are problems in terms of interoperability, information sharing, scalability, security, privacy, and the like.

Document 1 enables the request and use of information in the absence of a broker in a situation where the information provider Pubisher and the subscriber do not have knowledge about each other by the network system for routing the content base. It showed how to. However, there is a problem in scalability because it does not have a routing structure that suppresses unnecessary event transmission. In addition, there is no problem in terms of interoperability, information sharing, scalability, etc. because they do not have ontologies (such as a structure for converting an event dictionary) between the territories. In other words, Document 1 defines a territories that share a common event dictionary, but it is not clear how to implement the territories or how to share information between different territories. As a result, there is a lack of a specific realization technique in the territory.

Document 2 proposes information routing that can route not only packets with specific recipient addresses but also packets containing only the specification of the region of interest. By routing information, a search that does not require a broker can be realized. However, there is no concept of an event place, a gateway, or a session that limits the uniqueness of the ontology system or the scope of the event. Therefore, there are problems in terms of scalability, security, privacy, interoperability, information sharing, and scalability.

As described above, the conventional non-broker model realization technique has four problems.

○ Lack of security and privacy protection

There is no mechanism to limit the scope of information distribution. In other words, it is not possible to limit the propagation of the event. For this reason, anyone who is connected to the network can see the information.

The endpoint of the information also becomes the end user's terminal and references it from the outside. For this reason, even when a terminal is loaded with information that is not desired to be released to the outside, it is possible to disclose the information when connected to a network.

Since there is no concept of a session, a network can be constructed only at an event transmitter terminal, but a network provider and an event transmitter and receiver cannot be separated.

○ lack of interoperability

• If the semantic information system (ontology system) creates other areas, it does not have a structure that connects these areas, and therefore, sharing of events between them is impossible.

It is impossible to send only necessary events.

Lack of extensibility

· Difficult to add or delete dynamic functions.

• Scale of network is not easy.

○ lack of scalability

・ We cannot cope with increase of the number of event senders and receivers.

• It is not possible to cope with an increase in the meaning information type (meta data type).

Unnecessary event transmission cannot be suppressed.

1 is a block diagram showing a configuration of an embodiment of the present invention.

2 is an explanatory diagram showing a configuration of an event.

3 is a diagram illustrating a model of a semantic information network.

4 is an explanatory diagram showing a definition of semantic information.

5 is an explanatory diagram showing a definition example of an event type.

6 is an explanatory diagram showing an example of an event definition.

It is explanatory drawing which shows the example of a filter definition.

8 is a diagram illustrating a configuration of a semantic information network.

9 is an explanatory diagram showing an operation structure and a control interface of a semantic information network.

10 is an explanatory diagram showing a physical link.

It is explanatory drawing which shows the management method of a filter.

12 is an explanatory diagram showing an event routing method.

It is explanatory drawing which shows the registration situation of a filter.

14 is an explanatory diagram showing a federation method.

15 is an explanatory diagram showing a community model.

It is explanatory drawing which shows the prior art.

It is explanatory drawing which shows the prior art.

18 is an explanatory diagram showing a conventional technique.

19 is a diagram illustrating a broker type business model.

20 is a diagram illustrating a broker system configuration.

21 is an explanatory diagram of positioning of a content information distribution network.

22 is a conceptual diagram of a content information distribution network according to an embodiment of the present invention.

Fig. 23 is a diagram illustrating a business model of an autonomous distributed combination environment (SION).

24 is a diagram illustrating an example of definition of content conditions.

25 is a diagram illustrating a definition example of a user preference attribute.

Fig. 26 is a production process chart showing the processing structure of the autonomous dispersion combined environment SION.

27 is a production process chart showing a processing structure of the autonomous dispersion combined environment SION.

28 is an explanatory diagram showing a physical link.

29A and 29B are explanatory diagrams showing an event routing method and a registration status of a filter.

30 is a diagram conceptually illustrating a processing sequence of event routing on a network tree.

Fig. 31 is a block diagram showing an internal configuration of a high reliability event delivery device for performing event routing.

32 is a diagram illustrating an expanded process of event routing on a network tree.

33 is a diagram for explaining a first ontology conversion method.

34 is a diagram for explaining a second ontology conversion method.

35 is a diagram for explaining a third ontology conversion method.

36 is a diagram illustrating a comparison of each ontology conversion method.

37 is a diagram illustrating a configuration example of an event type.

38 is a diagram illustrating correspondence between an event type and a slot.

39 is a diagram for explaining the classification thesaurus.

40 is a diagram illustrating an example of a tree having an attribute type name as an element.

41 is a diagram for explaining determination of slot correspondence.

The present invention has been made in view of the above circumstances, and among the vast information distributed on the network, the end user can directly specify the optimal information, or the information provider can directly specify the optimal user to whom the information should be distributed. And semantic information network, semantic information switch, semantic information router, semantic information gateway, event routing method, federation method, session, An object thereof is to provide a filter management method, a statistical information collection method, an ontology conversion method, an ontology conversion information management method, and additional functions.

In order to achieve the above object, the present invention is an event delivery device that performs delivery of an event consisting of data and semantic information that is metadata of the data according to semantic information on a network,

A place for combining events from an event sender against a filter that sets semantic information of an event desired by the event receiver as an event acquisition condition, and is a minimum unit that guarantees a common ontology system. An event delivery device having a device for providing an event place that is in scope.

Here, the apparatus for providing an event place means, for example, one or a plurality of computers. The term "computer" as used herein is a device having a central computing unit (CPU) and a memory that is controlably connected by the CPU, and stores a program for realizing an event place in the memory. An apparatus for providing an event place by executing in a CPU is therefore, in the present invention, the apparatus (computer) for providing an event place may be a personal computer, a PDA, a mobile phone, a workstation, a main frame, or the like.

Since the event delivery device of the present invention guarantees a common ontology system in the event place, the correctness of the event combination in the event place is ensured.

Furthermore, in the event delivery device of the present invention, the ontology system is defined by establishing an event place for each subnet (physical network unit), for each service type, for each service operator, or for a stake holder such as security or management unit. The increase in the event type (significant information type) can be suppressed.

In addition, the event delivery device of the present invention can easily localize the information (event) to be distributed since the event place becomes the propagation range of the event.

When the number of event transceivers belonging to the event place is increased, load balancing can be easily realized by dividing the event place.

In addition, in the event delivery device of the present invention, unnecessary connection of an event sender and another event place to an event place can be avoided, and as a result, high security and privacy protection of the event sender and receiver can be easily performed.

The present invention also provides the above-described event delivery device, wherein the event place combines the semantic information registered as the filter and the semantic information provided to the event, and filters the event ignited according to the combination result. The semantic information switch for notifying the event receiver of the semantic information switch and the semantic information switch are selected according to the event type, which is a template of semantic information, and the event is transmitted between the semantic information switches. Has an information router,

The event delivery device,

And a semantic information gateway for transmitting an event between the event places,

Provision of the event, reception of the event, and registration of the event type are provided by a community realized on an environment performed through a session which is a connection between an event receiver, an event sender, or an event type registrant terminal and the semantic information switch. As a device,

An authorization function for performing authorization such as participation in the community;

A management function for identifying and controlling information circulated in the community;

Provided is a community providing apparatus having a statistical processing function for performing statistical management of information distributed in the community.

In the community providing apparatus,

The community is realized using an event place provided by the event delivery device,

The management function is set for a semantic information gateway provided by the event delivery device for information to be distributed from an adjacent community.

Accordingly, in the community providing device of the present invention, for example, only information that is frequently distributed in the neighboring community (popular information) as information that can be distributed from the neighboring community can be distributed from the neighboring community to its own community. May be. In addition, in the community providing apparatus of the present invention, even in a large-scale system, popular information can be obtained without relying on a single concentrated server.

In addition, the present invention is a semantic information gateway used when delivering an event composed of data and semantic information which is meta data of the data according to semantic information on a network,

A place for combining events from an event sender against a filter that has set semantic information of an event which an event receiver wants to receive as an event acquisition condition, which is a minimum unit that guarantees a common ontology system and spreads the event. It provides a semantic information gateway having a transmitting unit that transmits an event between event places.

The semantic information gateway of the present invention enables the sharing of events between different event places. In addition, a global autonomous distributed combination network can be realized by a bottom up approach.

The present invention also provides a semantic information switch for notifying, according to semantic information, an event composed of data and semantic information which is metadata of the data, to an event receiver serving as a receiver of an event delivered in a network.

A function for registering a filter that sets semantic information of an event which an event receiver wants to receive as an event acquisition condition;

Classifying the filter for each event type serving as a template of semantic information, and subdividing and managing the filter for each session; and when a plurality of filters are registered in the same session, managing the relationship between the filters as a logical consensus relationship; ,

A function of combining semantic information registered as the filter with semantic information given to the event;

A semantic information switch having a function of notifying the event receiver of the filter according to the combination result is provided.

The semantic information switch of the present invention classifies and manages the filter for each event type that is a template of an event, and when a plurality of filters are registered in the same session, the relationship between the filters is managed as a logical consensus relationship. The combination with the event can be performed efficiently. In addition, the present invention can distribute filtering processing to a plurality of semantic information switches by preparing a plurality of semantic information switches in one event place and connecting the semantic information switches to the semantic information routers.

The present invention also provides a semantic information router for determining a delivery route of an event composed of data and semantic information which is meta data of the data according to semantic information.

A path selection function for selecting an event delivery path between semantic information switches for notifying an event receiver of an event according to an event type that is a template of semantic information;

A semantic information router having an event sending function for transmitting the event with respect to the selected path is provided.

Since the semantic information router of the present invention selects an event delivery route between semantic information switches, unnecessary combinations and traffic in the semantic information switch can be reduced.

The present invention also provides a method for executing each of the methods provided by the functions of the event transmission device, the community providing device, the semantic information gateway, the semantic information switch, and the semantic information router, and any one of these methods by a computer; And a computer readable recording medium recording the program.

In addition, a function can be added by registering a filter in the semantic information switch of the present invention. The additional functions include, in addition to the standard semantic information gateway and semantic information router, statistical information collecting functions which are additional functions. In addition, the function can be deleted by erasing the filter from the semantic information switch, and this erasable function includes additional functions in addition to the standard semantic information gateway and the semantic information router.

According to the present invention described above, an event receiver connecting to the semantic information network of the present invention and receiving an event can receive an event required by the user by registering a filter with the semantic information switch.

The event sender also transmits the event by describing semantic information, which is meta data of the event, as indicating the event receiver to be received.

Accordingly,

1) The event sender directly sends an event to the content corresponding to the information to be provided without using a broker function that does not know the existence of the receiver and does not use the brokering function.

2) It is possible for an event receiver to directly receive an event without knowing the existence of the event sender and without using a broker function that mediates.

Also,

3) performing the transmitter in real time by making the broker to which the direct transmission / reception intervenes unnecessary;

4) The transceiver can be frequently accessed and deleted from the semantic information network.

Moreover, this invention is a semantic information network which delivers the event which consists of semantic information and data,

The semantic information network includes delivery destination determining means for determining a delivery destination of the event according to the content of the semantic information;

A semantic information network having an event delivery means for delivering the event to a delivery destination determined by the delivery destination determination means is provided.

The present invention also provides a semantic information switch for activating an entity to which an event is to be delivered according to semantic information included in a plurality of entities connected to receive an event delivered in a network.

The semantic information switch,

Semantic information combining means for combining semantic information registered in advance with semantic information included in an event;

According to the combined result in the semantic information combining means, a semantic information switch having switching means for activating the entity is provided.

The present invention also provides a semantic information router for selecting a route of an event delivered in a network according to semantic information.

The semantic information router is

Route selection means for dynamically selecting a route to which the event is to be delivered, according to content of semantic information included in the event;

A semantic information router having event sending means for sending out the event with respect to the path selected by the path selecting means is provided.

In addition, the present invention is a semantic information gateway that interconnects between semantic information networks having a minimum unit having different semantic information spaces, and transmits an event containing semantic information.

The semantic information gateway,

Ontology conversion means for performing ontology conversion of the event according to an ontology system adopted by the semantic information network of the transmission partner of the event;

A semantic information gateway is provided having an event transmitting means for transmitting the ontology converted event to another semantic information network.

The present invention also provides a semantic information network including the semantic information switch described above, the semantic information router described above, and the semantic information gateway described above.

In addition, the present invention is an event routing method for determining an event delivery route according to the semantic information included in the event, when the event consisting of the semantic information and data,

The event routing method,

A shared link object generation process of generating a shared link object for establishing a shared link for transmitting an event according to the physical link information of the event place object,

An event path setting process of setting an event path by registering a filter for transmitting the event with respect to a series of event place objects according to the shared link information established by the shared link object;

According to the event pass, it provides an event routing method having an event delivery process for delivering the event by determining the delivery path of the event.

The present invention also provides an event routing method for determining an event delivery route in a network according to semantic information included in the event when delivering an event comprising semantic information and data.

The event routing method,

A shared link object generation process of creating a shared link object for establishing a ring-shaped and one-way shared shared link between the event place objects in which semantic information is registered to perform event delivery;

An event path setting process of setting an event path for each event type by registering a filter for delivering the event to a series of event place objects in accordance with the shared link established by the shared link object;

It provides an event routing method having an event delivery process for delivering the event by determining the delivery path of the event according to the event pass.

In addition, the present invention is an event routing method for determining the event delivery path in the network in accordance with the semantic information included in the event, when delivering the event consisting of semantic information and data,

The event routing method,

A shared link object generation process of generating a shared link object for establishing a ring-shaped and one-way shared shared link between the event place objects in which semantic information is registered to perform event delivery;

A filter registration process of registering the wildcarded filter as an event type to deliver the event for all event place objects according to the shared link established by the shared link object;

It provides an event routing method having an event delivery process of combining the semantic information included in the delivered event and the attributes of the filter, and determines the delivery path of the event according to the combination result.

In addition, the present invention is an event routing device for determining an event delivery route according to the semantic information included in the event, when the event consisting of the semantic information and data,

The event routing device,

Shared link object generating means for generating a shared link object for establishing a shared link for transmitting an event according to the physical link information of the event place object;

Event path setting means for setting an event path by registering a filter for transmitting the event with respect to a series of event place objects according to the shared link information established by the shared link object;

According to the event pass, it provides an event routing device having an event delivery means for delivering the event by determining the delivery path of the event.

In addition, the present invention is an event routing device for determining the event delivery path in the network in accordance with the semantic information included in the event, when delivering the event consisting of semantic information and data,

The event routing device,

Shared link object generating means for generating a shared link object for establishing a ring-shaped and one-way shared shared link between the event place objects in which semantic information is registered for performing event delivery;

Event path setting means for setting an event path for each event type by registering a filter for delivering the event to a series of event place objects in accordance with the shared link established by the shared link object;

According to the event pass, it provides an event routing device having an event delivery means for delivering the event by determining the delivery path of the event.

In addition, the present invention is an event routing device for determining the event delivery path in the network in accordance with the semantic information included in the event, when delivering the event consisting of semantic information and data,

The event routing device,

A shared link object generating means for generating a shared link object for establishing a shared link which is ring-shaped and unidirectionally distributed between the event place objects in which semantic information is registered for event delivery;

Filter registration means for registering the wildcarded filter with an event type to deliver the event for all event place objects according to the shared link established by the shared link object;

Provided is an event routing device having event delivery means for delivering the event by combining the semantic information included in the delivered event and the attributes of the filter and determining the delivery route of the event according to the combination result.

In addition, the present invention, in a network environment, in the high reliability event delivery method, the event sender delivers the event to the unspecified number of event recipients through an event notification service, and a plurality of passes for the event delivery are prepared,

Give an individual identifier uniquely identifiable under the network environment to each event within the event notification service,

Provided is a high reliability event delivery method that detects that the same event is duplicated from another pass in combination with an identifier of an event that has been delivered and stored in the past.

In the high reliability event delivery method, among the unspecified number of event receivers, deliver an event from which the identifier is removed for at least one event notification service directly connected to the event sender,

Deliver an event to which the identifier is assigned for at least one event notification service located downstream of the directly connected event notification service.

In addition, the present invention, in a network environment, in the high reliability event delivery method, the event sender delivers the event to the unspecified number of event recipients through an event notification service, and a plurality of passes for the event delivery are prepared,

A first step in which the event sender transmits an event to the unspecified number of event receivers through an event notification service connected directly;

A second step of assigning an event identifier uniquely identifiable in a network environment to each event in the event notification service, and storing the event identifier as an event identifier list;

The event notification service directly connected to the event sender delivers an event without the identifier to an event receiver directly connected to the event notification service among the unspecified event receivers, and is located downstream of the directly connected event notification service. A third step of delivering the event to which the identifier is assigned to an event notification service;

In the event notification service receiving the delivery of the event, the presence or absence of the same event identifier is examined by referring to the event identifier list, and if the same event exists, the event is discarded. The fourth step of storing in the event identifier list and the event notification service receiving the event transmission from the event notification service remove the identifier from the unspecified event receivers to the event receiver directly connected to the event notification service. And a fifth step of delivering the event and delivering the event to which the identifier is assigned to the event notification service located downstream of the directly connected event notification service.

In addition, in the network environment, an event sender delivers an event to an unspecified number of event recipients through an event notification service, arranges the event notification service to a plurality of network nodes, and interconnects the event. In the high-reliability event delivery device having a plurality of delivery passes,

In the event notification service, event identifier assigning means for assigning an individual identifier uniquely identifiable in a network environment to each event;

Event identifier combining means for combining the same event duplicated from another pass with the identifier of an event that has been delivered and stored in the past;

The present invention provides a highly reliable event delivery device having an event identifier updating means for discarding the event when the same event identifier exists, and newly storing the event identifier when the same identifier does not exist.

In addition, the present invention provides a content information distribution network that directly proposes content provided to a consumer corresponding to content provision when a content provider providing content to a consumer who consumes the content is proposed.

A content information distribution means for distributing content information describing a condition of the consumer corresponding to the content provision;

A content information distribution network having content suggestion means for suggesting provided content in accordance with the content information is provided.

Further, in the content information distribution network, the content information is information sent by the content provider and includes a combination means for combining the content information with user preference information which is a condition for acquiring content information that the consumer desires to acquire. and,

The content suggesting means is configured to propose the provided content by autonomously notifying only the content information that matches the user preference information in the content information.

Furthermore, in the above-mentioned content information distribution network, an event place for registering the content information and the user preference information and providing a place for combining the registration information by the combining means;

Federation means for enabling information sharing between the event places.

Furthermore, in the above-mentioned content information distribution network, an event place for registering the content information and the user preference information and providing a place for combining the registration information by the combining means;

And load balancing means for distributing and distributing event place objects in the event place on a plurality of computer systems, and sharing information between distributed event place objects.

In the above-mentioned content information distribution network, there is provided a user agent means for registering the user preference information as a filter in the event place.

With respect to the filter in which the user agent means is registered, the event sent by the content provider side is combined by the combining means, and as a result of the combination, the filter matching the event is activated, and the user agent means corresponding to this filter. This configuration is to start autonomously.

In the above-described content information distribution network, there is provided a content agent means for registering the content information as a filter in the event place.

With respect to the filter in which the content agent means is registered, the user preference information sent by the consumer side as an event is combined by the combining means, and as a result of the combination, the consumer side autonomously combines the filter with the event. Take out the structure.

Further, in the above-described content information distribution network, event place generating means for generating the event place in accordance with a request for generating an event place;

Transmission session establishing means for establishing a session for transmitting an event with respect to the event place;

Receiving session establishing means for establishing a session for receiving an event with respect to said event place;

Filter generating means for generating the filter, and filter registration means for registering the filter with respect to the event place using the identifier of the filter generated by the filter generating means as a parameter.

In addition, the present invention provides a method for processing a content information distribution network that directly proposes content provided to a consumer corresponding to the provision of the content when the content provider providing the content is proposed to the consumer consuming the content. As

A content information distribution process for distributing content information describing a condition of a consumer corresponding to providing the content;

A processing method of a content information distribution network that executes a content suggestion process for suggesting provided content in accordance with the content information.

In the above-described method for processing a content information distribution network, the content information is information sent by the content provider,

The content suggestion processing is a combination of the content information and user preference information which is a condition for acquiring content information desired by the consumer, and autonomously notifies only the content information that matches the user preference information in the content information, thereby suggesting offered content. Is done.

Further, in the above-described method for processing a content information distribution network, the federation enables information sharing between the event places with respect to an event place where the content information and the user preference information are registered and provide a place for combining the registration information. The process is performed.

Further, in the above-described method for processing a content information distribution network, a plurality of computers are provided with an event place object in an event place that registers the content information and the user preference information and provides a place for combining the registration information by the combining means. Distributed distribution is performed on the system, and load balancing processing for sharing information between the distributed event place objects is executed.

Further, in the above-described method for processing a content information distribution network, an event sent by the content provider side is combined with respect to a filter in which user agent means for registering the user preference information as a filter in the event place is registered, and the combination result. Activate the filter to which the event matches, and the user agent means corresponding to this filter is autonomously activated.

In the above-described method for processing a content information distribution network, the combination processing is performed on the user preference information sent by the consumer as an event to a filter in which content agent means for registering the content information as a filter is registered in the event place. By the consumer, and as a result of the combination, the consumer side takes out the filter in which the event matches.

Further, in the above-described method for processing a content information distribution network, an event place generation process for generating the event place according to an event place generation request, and a transmission session establishment process for establishing a session for transmitting an event to the event place; A reception session establishment process for establishing a session for receiving an event with respect to the event place, a filter generation process for generating the filter, and an identifier of a filter generated by the filter generation process as a parameter to the event place. The filter registration process of registering the filter is performed.

The present invention also provides a computer readable recording medium having recorded thereon a program for causing a computer to execute any of the above-described processing methods of a content information distribution network.

EMBODIMENT OF THE INVENTION Hereinafter, one Embodiment of this invention is described with reference to drawings.

Meaning and Semantic Information Network SION

First, an outline of a Semantic Information-Oriented Network (hereinafter referred to as SI0N) will be described. SION is a network that can deliver events to destinations according to semantic information. 1 illustrates a conceptual model of SION. In Fig. 1, each terminal 2 registers semantic information (SI) with respect to SION1. On the other hand, the terminal 2 which transmits an event transmits the event which consists of semantic information and data Data shown in FIG. 2 to SION1. Here, the semantic information describes the characteristics of the data included in the event and is positioned as meta information of the data.

Deliver data to "Tokyo residents"

Deliver the data to "people who are interested in classical music".

Deliver data to "persons with communication environment of lMbps or higher".

· Deliver the data to "people traveling through the streets in Meji".

Deliver the data to a "content provider whose content matches a keyword (eg travel)".

Expression is used.

SION is an autonomous distributed type that can dynamically determine a target (terminal, person, software, etc.) to which data should be delivered, and deliver and notify data to a specified subject according to the semantic information as described above. Meta network.

21 shows the position of SION (content information distribution network (autonomous distributed combination environment) 123 in the figure). By using SION, users (consumers in the drawing (end users) 111) corresponding to what the information provider (content provider 110 in the drawing) provides, rather than through a broker (which is often realized as a third-party service provider) ), You can suggest your own information. Moreover, the combination form of the multicast type can also be implement | achieved with respect to the combination of the conventional broadcast type only.

Such a business model capable of peer-to-peer information proposal in a broker non-intervention (non-broker model) is referred to as a customized model (or a customized information proposal model). Similarly, real-time information retrieval is possible in which the user can directly search for desired information without going through a search service (broker). This business model is referred to as a query model for a customized model. The difference between both is the difference in the directionality of the event.

In FIG. 21, SION is a virtual network network for the purpose of combining content information in order to build a customized society on the network network 121, and is located in an upper layer of the content distribution network 122. As shown in FIG. In addition, it is applicable to the following services etc. as a customized information suggestion service.

(1) Manufacturer: I would like to send a product guide to customers who seem to be interested in their products.

(2) Advertiser: I want to send personalized advertisements for each customer.

(3) Bartering: I would like to sell or exchange products according to the agreement between users.

Further, what kind of information is set in the data portion of the event depends on the service. For example, various types of usage such as information substance, reference to information (URL, distributed object identifier, etc.), proxy (such as Jini proxy), mobile agent, etc. Is possible.

Next, the details of SION will be described.

<SION Architecture>

First, SION's network architecture will be described. 3 shows a network model of SION. Here, for convenience of explanation, the terminal 2 is described separately from the transmitting terminal 21 of the event sender and the receiving terminal 22 of the event receiver.

The event receiver registers the semantic information (type of receiving event and acquisition condition) of the event that the event receiver wishes to receive as meta data using the reception terminal 22 as metadata. This is called a filter. On the other hand, the event sender gives the SION an incentive by sending an event to SION1 using the transmitting terminal 21. This event is composed of semantic information and data describing the characteristics of the event as shown in FIG. Definition of semantic information is shown in FIG. The semantic information is metadata of an event and an instance of a semantic information type (event type).

SION1 is an autonomous distributed type combination network for combining (filtering) an event sent by an event sender with respect to a filter registered by an event receiver. As a result of the combination, the filter passed by the event (responding to the event) is ignited, and the receiving terminal 22 of the corresponding event receiver is autonomously activated. This structure makes it possible to search for and discover in real time the terminal 2 that is the target among the unspecified terminals 2.

Next, the event type will be described. 5 shows an example of definition of an event type that is a template of an event. In addition, an event type can also be said to be a template of semantic information in relation to an event and semantic information. As shown in Fig. 5, the event type is an event type name (Event type name) and a condition name (in Fig. 5, "Service" or "CPU power" are applicable), and a data type for each condition name ( String or long) and conditional expressions (== or> =). The event type name is a name for uniquely identifying the event type.

If necessary, the parent type of the event type can also be inherited by setting a value specifying the event type name inherited by the item "Inherited event type".

As shown in Fig. 6, an event is created according to the data type of the event type. An event consists of an event type name, a combination of a condition name and a condition value, and a data portion. If the condition name, condition expression, or condition value defined in the event does not match the event type, an error occurs. However, the condition name used in the event may be a subset of the event type.

The definition example of a filter is shown in FIG. The filter consists of a pair of accepted event type names (Event type name), attribute names (" CPU power " and " Age " per line in FIG. 7) and attribute values (200 or 25 in FIG. 7). Only events belonging to the event type defined in the accepted event type name are subject to filtering. You can define several event type names here, and you can also target all events by specifying wildcards (*. *). In addition, if the attribute name defined in the filter does not exist in the condition name of the event type defined in the event type name to be accepted, an error occurs. However, in the case of a subset of the event type.

Next, the structure of SION is demonstrated. 8 is a diagram illustrating a configuration of SION1. As shown in FIG. 8, the SION includes a semantic information switch (SI-SW in the drawing), a semantic information router (SI-R in the drawing), and a semantic information gateway (Semantic Information-). Gateway, SI-GW in the drawing).

The semantic information switch (SI-SW) combines semantic information registered as a filter with semantic information provided to an event, and as a result, provides a switching mechanism for activating the terminal 2 of the fired event receiver. The semantic information switch (SI-SW) and each terminal 2 are combined in a star shape.

The semantic information router (SI-R) plays a role of selecting an event path between semantic information switches and transmitting an event transmitted from the terminal 2 to the semantic information switch to another semantic information switch. This is accomplished by dynamic event routing in accordance with semantic information.

The semantic information gateway (SI-GW) transmits events between event places (EP). The event place is the smallest unit (ontology domain) that provides an event combining location, guarantees a common semantic information space, and defines the spread of events. The event place being the ontology domain means that within the event place, the uniqueness of the ontology system such as the name, concept, vocabulary, meaning, and association of the event type is guaranteed, and the semantic information is described according to the common ontology. It has the effect of preventing species increase. By limiting the propagation range of the event, it is possible to prevent an increase in scale such as sending an event to all hosts and terminals subsequent to the network 121 or the content distribution network 122 of FIG. Event places can be created in units of operators, security, services, and physical subnets.

Basically, the event sent from the terminal of the event sender 2 is distributed only within the event place, and the distribution of events between event places having different ontology systems by means of a semantic information gateway (SI-GW). This becomes possible. At this time, the semantic information gateway SI-GW transfers the event to another event place after ontology conversion of the event.

<Entity using SION: UA and CA>

As an example of using SION, entities UA and CA operating on SION will be described with reference to FIG. 22.

(1) User Agent (UA)

A user agent (UA) is an agent that is an end user and is located with one entity using SION. The UA may be an event sender or an event receiver by an operation type (custom type, inquiry type). As described above, for example, in the case of becoming an event receiver, the end user preference information according to the preference of the end user is registered as a filter in the event place.

(2) Content Agent (CA)

Like the end user's relationship with the UA, the content agent (CA) is an agent of the information provider (content provider) and is one entity that uses SION. It can be a CA, an event sender, or an event receiver. For example, when an event sender is used, an event is transmitted using the content keyword (content information) as semantic information of the event and the content identifier as data of the event. Here, CA is mainly classified into two usage forms. One is a CA used from the standpoint of a service provider (content information provider), and the other is that as an information provider. The latter is used as a means for the information provider itself to easily become a content information provider.

(3) combination place, event receiver and event sender

In the CA, which is the event sender and the UA, which is the event receiver described in the present example, the EP provides a place for combining events sent by the CA to a filter registered by the UA. As a result, a CA-led customized combination can be realized. Each activated UA can independently access the desired content using the content identifier acquired as the event independently.

In addition, the CA registers the content keyword as a filter, while the UA sends end user preference information as an event, so that the UA-driven inquiry combination can be easily realized using SION. 23 shows the business model of SION. SION is basically operated by a service provider (content information provider) or a content provider.

<Examples of Event and Filter Values>

An example of using a filter and an event set in SION will be described.

(1) End User Symbol Properties and Content Conditions

Consider the case of delivering content information to SION. In other words, the handling information is the content information, the end user receives the content, and the information provider transmits the event. Content information is expressed as a content condition and user preference information is expressed as a user preference attribute. The content condition defines a condition of an end user UA suitable for providing the content. For example, the content condition may be described as shown in FIG. 24.

On the other hand, the end user preferences attribute defines the characteristics of the user UA and may be described as shown in FIG. 25 as an example. Conventionally, it is common to use content attributes as content information and end use preference conditions (search conditions) as end user preference information. However, in the case of the customization that the content provider only provides the content to the really suitable end user, the form of describing the end user's condition to be provided with the content information and describing the attributes of the UA in the end user preference information is conventional. Since the affinity with the custom combination is higher than that of the above, the above expression is newly defined.

(2) event and filter definition

The content agent CA sends out a content condition as an event. The procedure for creating this event is shown below.

First, as shown in Fig. 5, an event type that is a template of an event is defined. Here, the event type name is a name for uniquely identifying the event type. It also defines condition names and data types and condition expressions for condition names.

Register the event type with the event place. According to the data structure of the event type, an event is created (see Fig. 6). An event consists of a combination of an event type name, a condition name, and a condition value. In addition, the content identifier is set in the data portion.

Send the event to the event place. If the condition name or condition expression defined in the event does not match the event type, a transmission error occurs. However, the condition name used in the event may be a subset of the event type.

On the other hand, the user agent UA registers the user preference attribute as a filter in the event place. The procedure for creating this filter is shown below.

A filter is defined as shown in FIG. A filter consists of a pair of accepted event type names, attribute names, and attribute values. Only events belonging to the event type defined in the event type name to be received are subject to filtering. You can define several event type names here, and you can also target all events by specifying wildcards (*. *).

Register the filter in the event place. If the attribute name defined in the filter does not exist in the condition name of the event type defined in the event type name to be accepted, a registration error occurs. However, it may be a subset of the event type.

<Operation Structure and Interface Specification>

As an example of the implementation method of SION1, an implementation method using distributed object technology is shown. Here, SI-SW, SI-R, and SI-GW are implemented as distributed objects called event place object (EPO), shared link object (SLO), and federation agent (FA), respectively. 9 and 26 and 27, the operation structure and control interface of SION1 will be described in detail. In addition, SION1 network interface can be used by using SION-MT (Management Too1) or SION interface. In addition, MT can be used to withdraw or increase or decrease the EPO, dynamically change the physical link information, migrate the PO (dynamic change of the EPO to which the PO is bound), collect ignition rates, collect statistical information about popular or popular information, etc. It can be performed easily.

Activation & initialization of the event place factory (steps Sl in Fig. 9 (1) and 26)

First, the SION operator activates an event place factory (EPF) on any host, and then initializes the EPF. At this time, the EPF is provided with a host name capable of generating an event place EP and a place for storing the executable file of the EP. These are called event place generation information. SION operators are primarily information providers or service providers (content information providers such as Yahoo).

Generation request (Fig. 9 (2), step S2 of Fig. 26)

Subsequently, the person who generates the EP (hereinafter referred to as EP operator) requests generation of the EP from the EPF. At this time, the EP name and the EP attribute are given as parameters of the EP generation request. Here, the EP attribute represents the purpose of which the generated EP is used for a customized model or a query-type model, and expresses the direction of the flow of events.

Generation of event place (Fig. 9 (3), step S3 in Fig. 26)

Then, the EPF having received the EP generation request generates the EP. Specifically, at this time, an event place management object (EFMO) responsible for managing the EP is generated. In other words, the processing request to the EP is the same as the processing request to the EPMO. The EPF returns the identifier of the EP (that is, EPMO) generated to the generation request source. In addition, an EPMO is generated for a host dynamically determined from among hosts capable of generating EP designated in FIG. 9 (1) (step S1 in FIG. 26). As the determination method of the starting line host of the EPMO, the starting position is determined periodically. You can choose to explicitly specify the starting line host to determine according to the traffic.

Initialization request of the event place (Fig. 9 (4), step S4 of Fig. 26)

Subsequently, the EP operator requests EPMO to initialize the EP. At this time, a single event place object or various event place objects are designated. Further, a host capable of generating an event place object or the like and a storage location for an executable file such as an event place object are provided. This is called event place object creation information. In addition, when this is omitted, event place generation information is used.

The multiple event place object is used for the purpose of improving scalability by event combination processing load balancing in the event place. When multiple event place objects are specified, it is necessary to also provide physical link information (topology) of the event place object (EPO). Here, the physical link information of the EPO expresses which EPO knows the existence of some other EPO.

For example, as shown in FIG. 10, EPO2 * 32 knows the presence of EPO1 * 31, EPO3 * 33, and EPO4 * 34, but it expresses that EPO3 * 33 knows only presence of EPO2 * 32. Multiple EPO is intended to improve scalability by event combination processing load balancing in EP.

The EPMO dynamically determines the host generating the EPO from the host list capable of generating the EP designated in FIG. 9 (1) (step 1 in FIG. 26) and generates the EPO therein. At this time, in each EPO, one filter factory FF and statistical information collection object SO are always additionally generated, and these correspond to SI-SW. In addition, according to the number of physical links, a shared link object (SLO) is additionally generated in each EPO. For example, three SLOs are generated for EPO2 (corresponding to SLO2, 1, SLO2, 3, SLO2, 4 in FIG. 9), and these correspond to SI-R. The determination method of the host where the EPO is activated is the same as that of the EPMO, but the EPO used for each event type can be fixed. In addition, the EPMO generates an event type factory (ETF) in the EP. Within the EP, the namespace of unitary event types is guaranteed by the ETF.

Session establishment request for event transmission to the event place (FIG. 9 (5), step S5 in FIG. 26)

Then, the EP is asked to establish a session. The EPMO generates a proxy object PO for each session request. The requester returns a session identifier that is an identifier for P0.

In addition, the EPMO indicates which EPO to use (bind with which EPO) for the PO when generating the PO. This instruction is necessary for various EPOs, but the method of determining the bound EPO is the same as that of EPMO. When requesting to establish a session with the EP, it is necessary to specify whether it is a session for event transmission or a session for event reception. In this example, a session for sending an event is specified.

Registration of event types (FIG. 9 (6), step S6 in FIG. 26)

Subsequently, registration of the event type is requested for P0. At this time, the PO requests generation of an event type object (ETO) from the ETF. It also stores the event type in the generated ETO. On the other hand, the EP can request the event type registration. At this time, the EPMO requests the ETF to generate the ETO, and stores the event type in the generated ETO. Generally, when an event sender registers an event type, it performs via PO. On the other hand, the EP operator registers an event type with the EP. Also, registering an event type with the same name is an error.

Session establishment request for event reception for event place (Fig. 9 (7), step S7 in Fig. 26)

Subsequently, the EP is required to establish a session for receiving an event. At this time, the session establishment requester (event reception object) gives as an parameter an identifier of an event reception object which is a notification place of an event and a notification method (speech type, look in type) of the event. The event reception may also be included as a parameter.

The EPMO then generates a PO per session request. The requestor returns a session identifier (an identifier of the PO). In addition, EPMO indicates the EPO to be used for the PO when generating the PO. This instruction is necessary for multiple EPOs, but the method of determining the bound EPO is the same as that of EPMO.

Create request of filter object (step S8 of FIG. 9 (8) and FIG. 26)

Subsequently, the PO is requested to be generated. At this time, the PO requests generation of an FO from the FF. At this time, the FF accompanying the EPO bound with PO is used. In addition, the identifier of the generated FO returns to the FO generation request source via PO.

Setting the filter value (Fig. 9 (9), step S9 of Fig. 26)

Subsequently, the setting of the filter value to the FO is requested to P0 using the FO identifier as a parameter. It is also possible to optionally ask the ETO to check whether the data structure (filter value) of the FO is correct with the key of the event type name (that is, the event type name to be filtered) stored in the filter object. Do. If it is not correct, an error occurs. However, if wildcard is specified, this check processing is not performed at all.

Filter registration (Fig. 9 (10), step S10 of Fig. 26)

Subsequently, after setting the filter value in the FO, the filter registration is requested to P0 using the identifier of the FO as a parameter. At this time, the filter identifier is returned to the registration request source. This enables the reception of an event. In addition, a plurality of filters can be registered through one P0 (here, a case where a plurality of different FOs are registered as filters through one PO or a same FO is registered as a filter multiple times) can be considered. All filters registered for one PO have an "OR relationship".

Event transmission (step S11 of FIG. 9 (A) and FIG. 27)

The event sender then sends an event to P0. At this time, P0 can optionally request the ETO to check whether the data structure of the event is correct with the key of the event type name stored in the event. If it is correct when this check process is selected, an error will be generated if it is not correct for the next process (Fig. 9 (B)).

Request combination of events (Fig. 9 (B), step S12 of Fig. 27)

The PO then sends an event to the EPO. At this time, the EPO creates a thread. In addition, a thread is created for each event, and each thread performs multiple processing of the event.

Combination with filter (FIG. 9C, step S13 in FIG. 27)

Subsequently, in the EPO, the thread performs the filtering process by combining the event and the filter. This includes exact matches, partial matches, weighted matches, and the like, which can be specified when setting filter values.

Activation of the proxy object (Fig. 9 (D), step S14 of Fig. 27)

Subsequently, when the event passes through the filter as a result of the combination with the filter, the corresponding PO is activated to receive this event. At this time, P0 can be selectively registered in SO such as the type, value, event ID, and the like of the received event. From this information, S0 can measure the ignition rate of the event (for each event type, for each event) or for events with high reputation in the EP.

Ignition type event notification (activation of an event receiving object) (FIG. 9E, step S15 of FIG. 27)

Next, P0 activates the event receiving object and delivers this event to the event receiving object. This corresponds to the event notification of the ignition type (interrupt type).

Look doll event notification (FIG. 9 (F))

On the other hand, P0 does not activate the event reception object, and the event reception object itself may take out an event in which spool (SPOOL: simultaneous peripheral operation) (SPOOL) corresponds to P0 corresponding to the event reception object. This corresponds to the event notification of the look doll. The activation trigger of the event reception object exists in various ways depending on the service type. However, as a typical example, a case where an end user makes a request for proposal of content to an event reception object may be considered.

<Management method of filter>

Next, the management method of the filter in each EPO is demonstrated.

First, a session for receiving an event is established. At this time, one PO is generated for each session request, and the PO is bound to any one EPO. One FF is attached to this EPO, respectively. As a result, the EPO used by the PO is uniquely determined, and all subsequent processing is performed through the PO (session for receiving events).

Next, an FO is generated, and a filter value (the type of event to be received and its acquisition condition) is set for the FO. Next, the filter is registered using the FO identifier as a parameter. At this time, the FO identifier is stored in each filter. Each EPO manages a filter registered through PO according to the following rules.

First, use the FO identifier stored in the filter and refer to the "Event Type to Receive" set in the FO. Then, the filter is classified for each event type to be received, and the filters classified for each event type are further divided and managed for each P0.

This management rule will be described with reference to FIG. 11 when a filter is registered through PO1. In this example, it is assumed that "Event Type X" is set as the event type to be received in the FO specified at the time of filter registration. At this time, the filter 1 of FIG. 11 corresponds to the filter to be registered in EPO, and the filter 2 corresponds to the filter registered through PO2. In addition, in each PO, although a plurality of filters can be registered, the registered filters are assumed to have an "OR relationship".

First, when an event of event type X arrives at the EPO, a combination with the filter 1 is performed. As a result, PO1 is activated when the filter 1 ignites. Subsequently, the combination with the filter 2 is performed, and as a result, PO2 is started when the filter 2 is ignited. At this time, since the filter 2 and the filter 3 have an "OR relationship", the combination with the filter 3 is not performed. By using such a filter management method, the number of combination processing in each EPO for one event can be basically equal to or less than the number of POs (receipt sessions).

<Event Routing Method: Routing Method in Arbitrary Topology>

Next, the event routing method will be described.

The EPO (SI-SW) accepts an event transmitter and receiver in a star form through a session. In addition, the EPO (SI-SW) combines a filter registered by the event receiver with an event sent by the event sender, and as a result, notifies the event only to the event receiver corresponding to the ignited filter (the event is matched only to the matching event receiver). Shipping) is a combination switch.

For this reason, when the number of senders (events) of events and the number of receivers (filters) of events increase, the processing capability of the EPO is saturated in proportion to it. Therefore, in SION, multiple EPO is provided as a means for realizing high scalability EP. Multiple EPO aims at scalable improvement of the total processing capacity of EP compared with the number of EPO, and specifically, EP achieves high scalability from the following two viewpoints.

First is load balancing and autonomous balancing. This is to distribute the sender / receiver of the event to a plurality of EPOs so as to load balance the filtering process of the event and not to create a bottleneck associated with the concentration of the process. In addition, each EPO is independent of the other EPO and achieves distributed coordination by an autonomous mechanism.

The second is to reduce network traffic and optimize the filtering process. This minimizes the amount of communication due to not transmitting unnecessary events between EPOs and reduces unnecessary filtering processes involved.

In FIG. 10, the case where the filter of the event type (X) is registered as the type of the event to receive about EPO3 * 33 can be considered. Here, when an event of event type (X) is sent to EPO4, it is necessary to send this event to EPO3 via EPO2. At this time, the event should not be transmitted to EPO1 in which the filter of event type X is not registered. Routing control of such an event between EPOs is a shared link object (SLO), which corresponds to the aforementioned SI-R.

Hereinafter, the details of the SI-R will be described.

First, upon initialization of the EP, an SLO is additionally generated in each EPO with reference to the physical link information (topology of the EPO). For example, three SLOs are generated for EPO2 in FIG. These correspond to SLO2, 1, SLO2, 3, and SLO2,4 in the figure. This SLOi, j establishes a shared link SLi, j that performs event transmission from EPOj to EPOi. In other words, as shown in Figs. 9 and 12, SL0i, j is a shared link which is a logical link for event transmission by establishing a session of event reception for EPOj and a session of event transmission for EPOi. The link SLi, j is established (the shared link means the establishment of a session by the SLO at the time of EP initialization and does not include the filter registration process).

After initialization of the EP, the event receiver can establish a session with the EP and register a filter through the session. At this time, an event path is set along the established shared link. For example, in FIG. 12, when the event receiver 3 registers a filter for receiving an event of "event type X" through PO3 in EPO3, PO3 selects an event type X filter in EPO3. Simultaneously with registration, it notifies SLO3, j (here SLO3,2). SLO3,2 uses SL3,2 and registers an event type X filter with EPO2. This is done via the PO of the receiving session distributed for SLO3,2, as described above. Similarly, this PO notifies the other SLO2, j except SLO2,3. SLO2, j (j ≠ 3) registers the filter in the EPO using SL2, j. Similarly, iteratively repeats until all EPOs have a pass for Event X.

The series of paths established for event type X in this manner is called an event path. This means that filter registration through PO3 is triggered so that event path setting requests for each event type are autonomously spread to all EPOs sequentially. In other words, each EPO need only recognize adjacent EPO. Therefore, the event path can be established with simple and unified autonomous logic, compared to the event path intensive management and broadcast event path setting / management method.

The registration status of the filter in EPO1 at this point in time is shown in FIG. As a result of the event receiver 3 registering the filter via PO3, the filter 1 is registered in EPO1. Setting an event path indicates registering a filter for event transmission in a series of EPOs in accordance with shared link information. In addition, in the filter to which the SLO is registered, only the event type name to be received is set, and the acquisition condition is not set, and only the event type name is filtered.

In this situation, when the event receiver 2 registers a filter of event type X with EPO2 via PO2, as described above, the setting of a new event path propagates to all EPOs, and as a result, the filter 2 ) Is registered in EPO1, and a filter is registered for each event path setting request.

At this time, when an event of event type X is sent to EPO1, filter 1 ignites and SLO2, 1 is activated. SLO2,1 sends this event to EPO2, and SLO3,2 is activated. In addition, the event is transmitted to EPO3 via SLO3,2. In order to prevent the infinite transmission of events between SL2,3 and SL3,2, the event maintains up to two identifiers of the EPO passed as one of the control information in the latest order.

As described above, since the filter 1 and the filter 2 have an OR relationship, the combination with the filter 2 is not performed when the filter 1 ignites. Therefore, even if the filter 1 exists, the redundant overhead of the filtering process by newly registering the filter 2 can be prevented from occurring. This means that when an event path is set, no reconstruction of all event paths including an already established event path is required, and a simple and unified autonomous setting of an event path is possible.

In addition, in EPO1, if there is a session established by the event receiver and filter registration through it (corresponding to the filter 3 of the POn), the session established by the event receiver for the EPO after all the SLO correspondence filtering processes are completed ( POn correspondence) is performed. In other words, event transmission processing to another EPO is first performed, and then the combination processing in this EPO is started.

Another effect of the event routing method described above is that the event path is not required to be rebuilt when the filter is deregistered. For example, when the event receiver 3 deregisters a filter registered through PO3, the release request is sequentially and autonomously propagated similarly to the case of registration. As a result, in EPO1, only the registration of the filter 1 is released, but the filter 2 still exists (the filter 2 then sends an event instead of the filter 1), so Consistency of all preset event paths is guaranteed without rebuilding.

By using such a method of autonomous distributed routing control, interconnection and distributed coordination of EPO can be easily realized. As a result, it is possible to smoothly perform the transition from the small network to the large network, the transition from the local network to the global network, and the like. In addition, global networking by the bottom-up approach can be easily achieved using common logic.

<Routing Method in Ring Topology: How to Use Event Path>

In FIG. 28, the case where a filter of event type X is registered as the type of event to be received for EPO3 can be considered. Here, when an event of event type X is sent to EPO1, it is necessary to send this event to EPO3 from EPO1 to EPO3 or via EPO2. Routing control of events between such ring-type EPOs is a shared link object (SLO), which corresponds to the aforementioned SI-R.

Hereinafter, the SI-R will be described in detail.

First, upon initialization of the EP, according to the physical link information (topology of the EPO), an SLO is additionally generated in each EPO. For example, in FIG. 9, SLO2,3 is generated for EPO2. This SLOi, j establishes a shared link SLi, j that performs event transmission from EPOj to EPOi. That is, as shown in Figs. 9 and 29A, SLOi, j establishes an event reception session for EPOj, and establishes an event transmission session for EPOi, thereby sharing a shared link (a logical link for event transmission). SLi, j) (the shared link means the establishment of a session by the SLO at the time of EP initialization and does not include the filter registration process). Thereby, the unidirectional ring-shaped shared link SLi, j is established.

After initialization of the EP, the event receiver can establish a session with the EP and register a filter through the session. At this time, an event path is set according to the established shared link. For example, in FIG. 29A, the case where the event receiver 3 registers the filter which performs the event reception of event type X via PO3 in EPO3. At this time, PO3 registers the filter of event type X in EPO3 and notifies SLO3,1 of the fact. At this time, SLO3,1 is provided as a parameter that the filter registration request generation source is EPO3. SLO3,1 uses SL3,1 and registers an event type X filter with EPO1. This is done via P0 of the receiving session allocated for SLO3,1, as described above. Similarly, this PO notifies SLO1, 2 of that fact. SLO1, 2 registers the filter in EPO2 using SLl, 2. Similarly, all EPOs are repeated until a pass for Event X is set. This process is repeated until immediately before the filter registration request generation source (here, EPO3). That is, SLO2, 3 does not register a filter in EPO3.

The series of paths established for event type X in this manner is called an event path. This is a method in which filter registration through PO3 is triggered, and event path setting requests for each event type are sequentially and autonomously spread to all EPOs. In other words, each EPO need only recognize adjacent EPO. As a result, the event path can be established by using simple and unified autonomous logic as compared with the method for centrally managing the event path and setting and managing the event path by broadcasting.

The registration status of the filter in EPO1 at this point is shown in FIG. 29B. As a result of the event receiver 3 registering the filter through PO3, the filter 1 is registered in EPO1. Setting an event path means registering a filter for event transmission in a series of EPOs according to shared link information. In addition, in the filter in which the SLO is registered, only the event type name to be received is set, and the acquisition condition is not set, and only the event type name is filtered.

In this situation, when the event receiver 2 registers the filter of event type X to EPO2 via PO2, as described above, the setting of the new event path propagates to all the EPO, and as a result, the filter 2 It is registered in EPO1, and a filter is registered for each event path setting request.

At this time, when an event of event type X is sent to EPO1, filter 1 ignites, and SLO3 and 1 are activated. SLO2,3 is activated by SLO3,1 sending this event to EPO3. In addition, the corresponding event is transmitted to EPO2 through SLO2,3. In addition, in order to prevent infinite traversal of the event, the event maintains the identifier of the EPO in which the event occurred as one of the control information, and when the event is traversed and returned to the source of the event (EPO (SLO)), the event Destroy.

In addition, as mentioned above, since the filter 1 and the filter 2 have OR relationship, when the filter 1 ignites, the combination of the filter 2 is not performed. Therefore, even if the filter 1 exists, the redundant overhead of the filtering process by newly registering the filter 2 can be prevented from occurring at all. This means that when an event path is set, no reconstruction of all event paths including a predetermined event path is required, and a simple and unified autonomous setting of an event path is possible.

In addition, when there is a session established by the event receiver and filter registration through the event receiver (corresponding to the filter 3 of POn) in EPO1, the POn corresponding filtering process is performed after all of the SLO-compliant filtering processes are completed. That is, the event transfer process to another EPO is given priority and then the combination process in this EPO is started.

Another effect of the event routing method described above is that rebuilding of the event path is unnecessary at the time of deregistration of the filter. For example, when the event receiver 3 deregisters a filter registered through PO3, the release request is sequentially and autonomously propagated similarly to the case of registration. As a result, in EPO1, only the registration of the filter 1 is released, but the filter 2 continues to exist (the filter 2 then sends an event instead of the filter 1). Without rebuilding, consistency of all preset event paths is guaranteed.

By using this autonomous distributed routing control method, the interconnection and distributed coordination of EPO can be easily realized. As a result, it is possible to smoothly perform the transition from the small network to the large network, the transition from the local network to the global network, and the like. In addition, global networking by the bottom-up approach can be easily achieved using common logic.

Routing Method in Ring Topology: Using Wildcards

Next, an event routing method different from the event routing method of the ring topology using the above-described event path will be described. This routing method is the same as the above-mentioned method until a shared link (logical link) is established. The event routing method differs from the method described above in that it does not establish an event path, and allows SLOi, j to register a unique filter at the same time when establishing the shared link SLi, j. At this time, the registered filter specifies a wild card as the type of the event to be received. Accordingly, the event path for each event type is not established for all events.

By specifying wildcards in the semantic information in this manner, the events are traversed along the ring-shaped shared link SLi, j, so that events can be delivered to all EPOs.

<Route method using sequential number>

Another method of routing (a method of using sequential numbers) is further shown in the above-described method using the event path or the two methods using the ring topology.

30 is a diagram conceptually showing a processing procedure by an event routing method.

In the figure, 211 is an event sender, and 212 and 213 are event receivers. 214 and 215 are EPO to which the event routing method is implemented. In addition, in the following description of event routing, although SLO exists between EPO for simplicity, it does not describe in particular. 30 and 32, the "supplier" in the figure corresponds to the "event sender" and the "consumer" corresponds to the "event receiver". In addition, "NS" (event, notification, service) corresponds to "EPO".

FIG. 30 shows a procedure for event notification for notifying event information between the event sender 211 and the event receivers 212 and 213 through the EPO 214 and 215 in a network wide environment.

In FIG. 30, first, the event sender 211 transmits an event to the EPO 214 directly connected (1) event delivery. Upon receiving the event, the EPO 214 gives the event an event identifier (ID) that can uniquely identify the event in the network wide environment as additional information (2) gives an event ID, and assigns the event ID to the event ID. Store in the list 221 (save event ID ③), deliver the event with the event ID removed as an additional information to the directly connected event recipient group (here, only the event recipient 212), and directly connect the downstream EPO group (here EPO). (215) only) to transmit an event with additional information (4) event delivery.

Each EPO (EPO 215 in the drawing) that has received the event is checked whether the same event ID is recorded in the event ID list (here, event ID list 221) that manages the event ID, respectively ( ⑤ Check Event ID). In this check, the EPO that finds the same event ID discards the event, and if the EPO is not found, the event ID is stored in the event ID list 221 (6). (213) only) delivers the event from which the event ID is removed (7) event delivery, and transmits the event having additional information to the directly connected downstream EPO group (which does not exist here).

As a result, the EPOs 214 and 215 are arranged in a plurality of network nodes and interconnected to establish a plurality of event transmission routes, thereby enabling load balancing of event delivery processing and loss of events due to failures in event transmission between network nodes. Can reduce the frequency. In addition, the event receivers 212 and 213 do not need to check the same event from a plurality of event transmission routes, and there is no need to define an event confirmation protocol between the event sender 211 and the event receivers 212 and 213. EPO groups 214 and 215 that deliver events that do not occur to event receivers 212 and 213 can be realized. This group of EPOs 214 and 215 appears to be one EPO from the event sender 211 or the event receivers 212 and 213.

Fig. 31 is a block diagram showing an internal configuration of a high reliability event delivery device that executes an event routing method using sequential numbers. The high-reliability event delivery device of the present invention is a high-reliability event network in which an event sender delivers an event to an unspecified number of event recipients through an EPO, arranges EPOs per row in a plurality of network nodes, and is interconnected. As described above, a plurality of delivery passes for an event are set to perform event delivery.

For this reason, the high reliability event delivery device of the present invention includes an event ID storage unit 421, an event ID grant unit 422, an event ID combination unit 423, an event ID update unit 424, and event delivery. The control unit 425 is configured.

The event ID storage unit 421 stores the ID list of the event as described above. The event ID assigning unit 422, in each of the EPOs 214 and 215, gives an individual identifier uniquely identifiable here under a network environment. The event ID combining unit 423 combines with the event IDs that have been delivered and stored in the past and supplies the result to the event ID updating unit 424 in order to detect that the same event is duplicated and delivered from another pass. . Here, if the same event ID exists, the corresponding event is discarded. If the same ID does not exist, the corresponding event ID is newly stored in the event ID storage unit 421.

The event delivery control unit 425 delivers the event of removing the previous event ID to the EPO group directly connected to the event sender (supplier) 211 among the unspecified event receivers (consumers) 212 and 213, and directly Deliver an event with an ID to an EPO group located downstream of the linked EPO.

Fig. 32 is an embodiment showing a processing procedure for realizing this event routing method on a network tree.

In FIG. 32, when the event is received from the event sender 221, the EPO 231 gives the received event as additional information and an event ID capable of uniquely identifying the event under a network wide environment. Store the event IDs in the list of event IDs managed by the EPO 231, deliver the events without the additional event IDs to the directly connected event receiver (here event receiver 222), and send the directly linked downstream EPO group (here EPO 232 and EPO 233 send an event with additional information.

Subsequently, the EPO 232 and the EPO 233 which have received the event transmission from the EPO 231 check whether the same event ID is recorded in the event ID list which manages the event ID of the corresponding event, respectively. In this case, since the same event ID is not found in this check, the EPO 232 and EPO 233 store the event ID in the event ID list managing each, and the event ID which is additional information to the directly connected event receiver. It delivers the event that eliminates and sends an event with additional information to the downstream directly connected EPO (here, EPO 234 is directly connected downstream EPO from EPO 232 and from EPO 233).

Subsequently, the EPO 234 receives the same event transmission from both the EPO 232 and the EPO 233. If the event reception from the EPO 232 occurs first, the EPO 234 records the event ID of the corresponding event in the event ID list managed by the EPO 234 itself. Check

Here, since the same event ID is not found in this check, it stores the event ID in the event ID list, delivers the event without the additional event ID to the directly connected event receiver, and directs the downstream EPO 215. Send an event with additional information to.

On the other hand, the same event is transmitted from the EPO 233. At this time, the EPO 234 records the event ID of the corresponding event in the event ID list managed by the EPO 234 itself. Check

At this check, the same event ID is found from the event ID list, and the EPO 234 discards the event. In this case, since no event transmission is performed for directly connected event receivers and directly connected downstream EPOs, the same event is not duplicated.

The EPO 235 receives the event transmission only once from the EPO 234, and the EPO 235 records the same event ID in the event ID list managed by the EPO 235 itself. Check if there is.

In this case, since the same event ID is not found in this check, the corresponding event ID is stored in the event ID list, and the event which removes the event ID as additional information is delivered to the directly connected event receiver.

Since there is no direct downstream EPO of EPO 235 here, event delivery is complete here.

If, during this operation, the event transmission from the EPO 232 to the EPO 234 fails and cannot be transmitted, the event transmitted from the EPO 233 to the EPO 234 is the event ID list of the EPO 234. Is not present, the event delivery is performed to the event receiver or downstream EP0 which is not discarded and directly connected.

In the embodiment shown in Fig. 32, since there is only one route such as the transfer route from the EPO 23l to the EPO 232, the transfer route from the EPO 234 to the EPO 235, and so on, the transfer reliability In order to improve this, a method such as establishing a transmission route from the EPO 233 to the EPO 232 or establishing a transmission route from the EPO 233 to the EPO 235 can be used.

<Federation Method>

Next, a federation method will be described with reference to FIG. 14. The federation agent FA is an agent for establishing federation between event places and corresponds to the SI-GW described above. For example, consider the case where Event Place A establishes federation with respect to Event Place B. First, the FA belonging to the event place A registers a filter with respect to the event place B. At this time, an event sender belonging to the event place B sends an event, and as a result, when this filter fires, the FA starts autonomously. This may regard the FA as one event recipient belonging to event place B. Subsequently, the FA retransmits the acquired event to the event place A to which it belongs. This may regard the FA as one event sender belonging to event place A.

In this way, the federation between the event places can be easily realized by using the FA serving as both functions. In other words, it is possible to realize federation between event places with control logic such as a single event place. By using this mechanism to interconnect the event places, which are the basic building blocks of SION1, a global combination network can be constructed with a bottom up approach, and event sharing can be realized among the event places. In addition, when event place A and event place B have different ontology, FA belonging to event place A converts the event acquired from event place B into ontology of event place A, and sends it to event place A.

When event transmission is carried out over different ontology systems, ontology conversion is required. As a conventional technique for performing this conversion, if a standard ontology is defined and an event is transmitted to another event place, a method of transmitting an event after converting it to a format conforming to the standard ontology and the number of combinations of event places There are ways to prepare the ontology conversion table in advance.

However, the conventional method lacks flexibility in order to cope with dynamic federation of the event place (dynamic initiation and initiation of federation). Therefore, in the present invention, as shown in Fig. 14, only the difference (transformation information) with the ontology information of adjacent event places in the FA is kept in the ontology conversion table. In other words, each FA distributes and maintains the conversion information, and guarantees the consistency of the ontology system as a whole. This makes it possible to easily cope with dynamic federation between event places. On the other hand, since ontology conversion processing occurs every time an event passes the event place, the conversion processing overhead is increased compared to the conventional method. Has characteristics.

<Ontology Conversion Method>

The three ontologies conversion methods described above are described in more detail, and a comparison between the methods is shown.

1. Ontology conversion method 1 (use standard ontology)

This method defines a standard ontology (global common framework) and uses it for federation between event places. 33 shows the structure of this method. First, in this figure, the event place 501, the event place 502, the event place 502, and the event place 503 are connected by FA1 and FA2, respectively, and the event transmitted in the event place 501 is shown. (1) shows the state transmitted to the event place 502 by FA1 and to the event place 503 by FA2. In addition, the number in parentheses () of an event in the figure indicates which event place is described according to the ontology of the event place.

The processing of this method will be described with reference to FIG.

(1) First, event 1 is transmitted in event place 501. At this time, the transmitted event 1 is described according to the ontology of the event place 501.

(2) FA1 autonomously starts by the said event (1), and receives the said event (1). FA1 then performs ontology conversion of event (1) into event (2) according to the standard ontology.

(3) FA1 sends the event (2) to FA2. At this time, by tunneling the event place 502, the event 2 is directly delivered to FA2. In addition, FA1 sends the event 3 to the event place 502 after ontology conversion of the event 2 into the event 3 according to the ontology of the event place 502.

(4) FA2 which has received the event (2) in the above (3) performs ontology conversion of the event (2) into an event (4) according to the ontology of the event place (503). FA2 then sends the event 4 to the event place 503.

That is, in this method, when event transmission between event places is performed, the event is first converted into one conforming to the standard ontology, and then the event is converted into one conforming to the ontology of the event side of the receiving side of the event.

2. Ontology Conversion Method 2 (Ontology Conversion between a Source Event Place and a Receive Event Place)

This method is a method for converting an event in accordance with the ontology of the source event place of an event in each FA from an event in accordance with the ontology of the event side of the receiving side. This method will be described with reference to FIG. 34. 34, the event place 501 and the event place 502, and the event place 502 and the event place 503 are connected by FA1 and FA2, respectively, as shown in FIG. The event 1 thus transmitted is shown by the FA1 to the event place 502 and by the FA2 to the event place 503. In addition, the number in parentheses () of an event in the figure indicates which event place is described according to the ontology of the event place.

The processing of this method will be described with reference to FIG.

(1) First, event 1 is transmitted in event place 501. At this time, the transmitted event 1 is described according to the ontology of the event place 501.

(2) FA1 autonomously starts by the said event (1), and receives the said event (1). FA1 transmits the event 1 to FA2. At this time, the event 1 is directly delivered to FA2 by tunneling the event place 502. In addition, FA1 sends the event 2 to the event place 502 after ontology conversion of the event 1 into the event 2 according to the ontology of the event place 502.

(3) The FA2 that has received the event (1) in (2) performs ontology conversion of the event (1) into an event (3) according to the ontology of the event place (503). FA2 then sends the event 3 to the event place 503.

3. Ontology Conversion Method 3 (Ontology Conversion Between Adjacent Event Places)

This method always transforms an event into an ontology of adjacent event places. This method will be described with reference to FIG. 35. In FIG. 35, as in FIGS. 33 and 34, the event place 501 and the event place 502, and the event place 502 and the event place 503 are connected by FA1 and FA2, respectively. The event 1 transmitted in 501 indicates the state of being transmitted to the event place 502 by FA1 and to the event place 503 by FA2. In addition, numbers in parentheses () of an event in the figure indicate which event place is described according to an ontology of an event place.

35, the processing of the method will be described.

(1) First, event 1 is transmitted in event place 501. At this time, the transmitted event 1 is described according to the ontology of the event place 501.

(2) FA1 autonomously activates according to the said event (1), and receives the said event (1). FA1 then sends the event 2 to the event place 502 after ontology conversion of the event 1 into an event 2 according to the ontology of the event place 502.

(3) FA2 autonomously starts by the said event (2), and receives the said event (2). FA2 then performs ontology conversion of event 2 into event 3 according to the ontology of event place 503. FA2 then sends the event 3 to the event place 503.

36 shows the comparison of the three ontology conversion methods described above with three comparison items. The three ontology conversion methods are listed on the vertical axis, and three comparison items are described on the horizontal axis.

First, the comparison item "the number (A) of ontology conversion information held by each FA" indicates the number of ontology conversion information that each FA must maintain for ontology conversion. Here, the ontology conversion information (ontology conversion table) means information used to convert an event described according to one ontology into an event described according to another ontology. The ontology conversion methods 1 and 3 only need two and one ontology conversion information, but the ontology conversion method 2 requires the ontology conversion information of the maximum (number of event places-1).

Next, the comparison item "the number (B) of performing ontology conversion for an event specific to each FA" "is the number of times an ontology conversion process is performed for one event received in each FA. For ontology conversion methods 1, 2, and 3, at most, they are 2, 1, and 1 time. In other words, the difference of the superiority between the ontology conversion methods is insignificant in this comparison item.

Finally, the comparison item "the number of times ontology conversion is performed for an event when an event is transmitted through multiple event places" means that when an event is focused on a particular event, the event is assigned to multiple event places. When transmitted past, this refers to the number of times the ontology conversion process is performed on the event. Ontology conversion methods 1 and 2 are sufficient for only 2 or 1 time, whereas in ontology conversion method 3, the ontology conversion process of maximum (number of FAs passed-1) is performed.

The characteristics of the ontology conversion methods 1, 2, and 3 will be described in turn using the comparison items (A), (B) and (C).

Ontology conversion method 1 has no problem with any of the comparison items in (A) (B) and (C), and has the highest processing efficiency. However, this method 1 has a problem of establishing a standard ontology. In IP, a hierarchical naming rule can establish an address system that is the only standard in the world. However, the address system in the semantic information network refers to a semantic information system (ontology), and it is thought that it is impossible to establish the only standard system in the world with respect to such semantic information. For example, a facilitator or the like has adopted a method of using a standard ontology as a communication language between agents, but it is considered that it is difficult to create such a standard ontology in a global environment. Therefore, ontology conversion method 1 cannot be used when a global environment is targeted as an application area.

Regarding the ontology conversion method 2, the items of (B) and (C) do not matter, but there is a problem with the items of (A). In other words, in the ontology conversion method 2, when the number of event places for federation increases, the number of ontology conversion information that each FA must keep accompanying is increased proportionally. Therefore, when the number of event places to federate is large (when the global environment is targeted as an application area), it is also difficult to use the present method 2.

Ontology conversion method 3 is a design method of the present invention. In this method 3, the item of (A) and (B) is not a problem, but there is a problem in the item of (C). That is, since the number of ontology conversions increases in proportion to the increase in the number of event places FAs that an event passes, not only is the ontology conversion processing efficiency worse, but also an error that occurs during ontology conversion accumulates. Have. However, since only attention is given to adjacent event places, it has the advantage that dynamic federation (dynamic start and release of federation) can be easily realized.

Summarizing the above, when the global application area in which a large number of event places exist exists, use of ontology conversion methods 1 and 2 is difficult. And although there are some subjects, only the ontology conversion method 3 which is the design method of this invention can respond to application in a global environment.

<Automatic Generation of Ontology Conversion Information>

Hereinafter, a method of automatically generating ontology conversion information will be described. Conventionally, the ontology conversion information has been created manually, but the feature of the present invention lies in that the ontology conversion information is generated automatically. By automatically generating, it is possible to reduce the labor of the manual manual work. The automatic generation method can be applied to any of the ontology conversion methods 1 to 3 described above.

Hereinafter, a method of automatically generating ontology conversion information by the FA will be described step by step.

(1) acquisition of semantic information system

The FA obtains a semantic information system (ontology) from both the conversion source event place and the conversion destination event place of the ontology transform. Here, the semantic information system specifically means a set of event types registered in each event place. The FA can acquire the set of event types registered in the event place by requesting the EPMO.

Here, FIG. 37 shows the format of the event type targeted by the automatic generation method. Event types are described in a flame structure as shown in this figure. That is, each event type is an event type name that uniquely specifies the event type, a parent type name that specifies the inherited parent type, a comment (comment) describing the role of the event type, and an attribute name and attribute value type name pair. It consists of a plurality of slots. It is also not necessary to describe the description, but it is recommended to describe it in order to improve the ontology conversion accuracy.

(2) Automatic generation of ontology conversion information

Ontology conversion information (ontology conversion table) is generated based on the semantic information system obtained in (1) above.

This automatic generation method is intended for the case where the event type is described in accordance with the flame format shown in FIG. 37 in both the ontology conversion source event place and the conversion destination event place. In this case, for event ontology conversion, which event type of the source event place corresponds to which event type of the destination event place, and which slot corresponds to which slot among the corresponding event types. It is necessary to request a correspondence relationship between an event type and a slot (see FIG. 38). That is, in this automatic generation method, ontology conversion information is defined as a correspondence table (table) relating to the event type and slots in the conversion source event place and the conversion destination event place.

Hereinafter, a method for generating such a correspondence table (ontology conversion information) will be described by dividing into four sub-steps 2.1 to 2.4. These substeps are composed of a similarity calculation method and a mapping method. The former is a method of calculating similarity between event types and slots, and the latter is a method of determining correspondence relationship between event types and slots based on the calculated similarity. In addition, the degree of similarity assumes a real value of 0 (not similar) to 1 (similar).

(2.1) Calculation of similarity between slots

The similarity between slots is calculated from the similarity between the corresponding attribute name and the attribute value type name as shown in Equation 1 below. In this case, it is calculated based on the minimum values of "similarity of attribute name" and "similarity of attribute value type name".

Similarity of slot = min ("Affinity of Attribute Name", "Affinity of Attribute Value Type Name")

First, the "similarity of attribute names" can be calculated using thesaurus. Currently, a number of thesauruses are available (for example, Japanese vocabulary system (NTT Communication Science Basic Research Institute, Iwanami Bookstore), Kadokawa Thesaurus, Kadokawa Bookstore), Classification Vocabulary Table (National Institute of Korean Language), EDR Electronic Dictionary (Japanese electronic dictionary research institute), etc., and the method of automatic construction of thesaurus using corpus are also being studied.

Here, the "similarity of attribute names" is calculated using the method shown in Natural Language Processing (by Makoto Nagao). In other words, when the classification thesaurus is used (see FIG. 39), the depth of the common upper node of the two vocabularies is d _c , and the "similarity of the attribute name" by the following expression is calculated as in Equation 2 below.

Here, max (depth) is the maximum value of the hierarchical depth of the thesaurus tree. On the other hand, when using the upper and lower thesaurus, the similarity is obtained by the following equation (3).

here,

d _i , d _j ...

d _{c ..} Depth of common upper node.

In addition, when calculating the similarity of a word such as an attribute name, it is assumed that the coding (character code, uppercase and lowercase letters, full size, half size, etc.) is processed after unification. Also, to cope with some notational changes (for example, foreign words (interfaces, interfaces), Okurigana, abbreviations (special express, express), etc.), the best combination search (best Similarity calculated according to -match retrieval) or Levenshtein distance is added to calculate the word similarity.

Subsequently, also in the "similarity of attribute value type names", the same calculation method as that of the attribute name is basically used. That is, a tree having an attribute value type name (string, integer, float, etc.) as an element as shown in Fig. 40 is created, and the expression of the similarity of the attribute names described above (i.e., &quot; (2) &quot; Attribute value type name similarity ".

(2.2) Slot mapping

Slot mapping refers to a method for requesting the most appropriate slot correspondence between specific event types. In the present invention, mapping is realized by the following algorithm which is simple and clear.

[1] Create a similarity matrix of slot pairs. In this case, the element A _ij of the similarity matrix is calculated by using Equation 1 described above for the similarity between the i-th slot of the transform source event type and the j-th slot of the transform destination event type.

[2] The following is repeated until the slot corresponding pair cannot be made (refer to FIG. 41).

〔2. 1] i and j are obtained when the element A _ij of the similarity matrix takes the maximum value max (A _ij ).

if (max (A _ij )> α (an integer to be a threshold)) {

     Store slot pairs (i, j).

} else {

     End the loop.

}

[2. 2] Delete row i and column j.

By the above-described algorithm, a plurality of slot pairs ij representing the corresponding relationship between slots are calculated. In addition, the constant α is for preventing the creation of an invalid slot pair.

(2.3) Calculation of Similarity Between Event Types

The similarity of the event type is calculated by Equation 4 based on the similarity between the event type name, the description, and the slot belonging to the event type. In other words,

Similarity of event type = min ("Event type name similarity", "Description similarity", "Slot pair set similarity")

First, the "similarity of event type name" is calculated by the same method as that of the attribute name mentioned above. That is, it calculates by Formula (Equation 2 and Formula 3) using the thesaurus.

Regarding the following "similarity of description," the vector-space model is used. That is, if the index word vectors of the description statements of the conversion source event type and the conversion destination event type are s and d, respectively, the "similarity of the description statements" can be calculated by the vector dot product by the following expression (5).

Similarity of description

The final "similarity of the set of slot pairs" is calculated by the following equation (6) using the set of slot pairs calculated using the slot mapping method described in (2.2).

Similarity of set of slot pairs = (similarity of Σ slot pair) / number of slots

This term is based on the idea that the corresponding event type has the same slot.

(2.4) Determine Event Type Response (Mapping)

The mapping of event types is the same as the slot method. That is, a similarity matrix of event type pairs is created using Equation 4, and a corresponding relationship (set of event type pairs) is calculated by the mapping algorithm described in substep 2.2.

Community and Evolutionary Network

Next, the community service which is one of the killer services of SION will be described. An entity in a community service is an autonomous decentralized actor that can dynamically determine its activity pattern by repeating learning, evolution, degradation, and destruction according to its own policy. Communities provide an efficient place of communication for such entities. In other words, an entity in a community can dynamically search for, discover, and identify an entity that needs to communicate with itself or an entity that affects its own behavior and can interact with the specified entity.

This community can especially handle entities with the following characteristics:

(1) Very small, huge number of entities in the community (unspecified number of entities).

(2) The property of an entity changes in real time. Typical attributes of an entity include location information, time of day, and so on.

(3) The behavior of entities in the community is not regular and behavior prediction is difficult.

(4) Participation in the community, eviction, extinction and duplication from the community occur frequently and irregularly.

(5) Entities in a community need to meet each other in real time according to policies, attributes, scenarios, and the like.

It is not easy to manage entities having such characteristics in a server or mediator (broker), and to search and discover each other in real time. The EP of SIONl is located as an execution environment of a community having such a feature. In other words, the community is the meta execution environment of the EP, and provides a place of communication with a high degree of abstraction compared to using the EP directly. By using an EP in the community's execution environment, every entity in the community can directly discover the entity with which to communicate, not through a broker. This is because communication of entities in the community is implemented as transmitters of events in the EP.

15 illustrates a conceptual model of a community. An UA, an information service provision agent (ISA), corresponds to an entity in a community. An UA is an agent acting autonomously as a user's agent, dynamically determining its behavior based on the user's preferences, operating environment, location information, situation, and trends, and searching for ISAs or other UAs to interact with, Interact with. An ISA is an agent that acts autonomously as an information provider or service agent's agent, searching for UAs or other ISAs to interact with according to the provider's intent. In other words, it searches for and specifies a partner suitable for providing his information.

On the other hand, community agent (ComA) is an agent in charge of the operation of the community. The EP operator controls and operates SION through SION-MT in accordance with an operation policy. Thus, ComA can be regarded as an agent of the EP operator. By default, the operational policy of the community is defined by ComA. For example, participation in the community, eviction, destruction, duplication, etc. of entities such as UA and ISA, identification and control of information distributed in the community (such as deletion of inappropriate events), statistical information in the community (trend information, reputation, etc.) It is responsible for the management of such high information, etc. according to their own operation policy.

In addition, in order to achieve high scalability and reliability assurance, the community executes SION control such as increase and decrease, withdrawal, and migration of EP and EPO according to load situation or failure situation. In other words, by combining SION1 and ComA, SION1 evolves from an autonomous distributed network to an evolved network that can learn, grow, and evolve. As such, ComA is responsible for self-organizing SION1 while controlling the behavior of entities within the community. In addition, it is possible to share information between communities through cooperation between communities. For example, of the information distributed in the community A, only the top 10 of the most popular can be distributed to the community B. Hereinafter, the flow of a process is shown.

First, ComA of community B instructs FA of event place B to "distribute only the top 10 of the most popular information distributed in community A to community B."

Subsequently, the FA queries the event place A for the top 10 event types. Upon receiving this, the event place A inquires the statistical information collecting object SO under the umbrella and returns the result to the FA.

Next, the FA creates an ontology conversion table based on the acquired event type, and sets a filter for the event place A. FIG. Thereafter, the FA can receive the corresponding event from the event place (A).

Subsequently, the FA ontology converts the event acquired from the event place A in accordance with the ontology conversion table, and sends it to the event place B.

As described above, according to the present embodiment, the following effects can be obtained.

First, SION's network environment can be easily built on distributed object environment.

Second, by joining the service application as an entity to the community, it is possible to simply send events or pick up necessary events, and to promote mutual communication.

In this embodiment, a global content information distribution network can be easily constructed by using the event place provided by SION. In addition, the present invention can be commonly applied to exchange of other information such as service information and communication information.

In addition, in this invention, addition, deletion, and change of an entity do not affect another entity. In other words, adding a new service does not affect existing services. Also, adding new features does not affect other features. For example, adding a failure handling mechanism to SION does not affect existing components. Therefore, in this invention, service / function plug-in plug-out can be performed easily.

In addition, the present invention records a program of software for realizing the functions (event place, semantic information switch, semantic information router, semantic information gateway, and / or additional function) of the above embodiment on a computer-readable recording medium. The program recorded on the recording medium may be read by one or a plurality of computer systems for execution. In addition, the "computer system" used here shall contain hardware, such as 0S and a peripheral device.

In addition, a "computer system" may be a device having a central computing unit (CPU) and a memory connected controllable by this CPU, and may be an information terminal such as a personal computer, a PDA, a mobile phone, a workstation, a mainframe, or the like. It may be.

The term "computer-readable recording medium" means a storage device such as a floppy disk, a magneto-optical disk, a portable medium such as a ROM, a CD-ROM, a CD-R, or a hard disk built into a computer system. In addition, a "computer-readable recording medium" means a program for a predetermined time, such as volatile memory (RAM) inside a computer system that becomes a server or client when a program is transmitted through a network such as the Internet or a communication line such as a telephone line. We shall include thing holding.

The program may be transferred from a computer system storing the program to a storage device or the like to another computer system through a transmission medium or by a transmission wave in the transmission medium. Here, the "transmission medium" for transmitting a program refers to a medium having a function of transmitting information, such as a network (communication network) such as the Internet or a communication line (communication line) such as a telephone line.

The program may be for realizing some of the functions described above. The above-described functions may be realized in combination with a program already recorded in the computer system, or a so-called difference file (differential program).

As mentioned above, although embodiment of this invention was described above with reference to drawings, the specific structure is not limited to this embodiment, The design of the range which does not deviate from the summary of this invention, etc. are included.

As described above, according to the present invention, the federation mechanism between the event places through the FA can bring an event distributed only in another event place into its own event place. That is, an information provider belonging to another event place can be used.

On the contrary, by sending an event to another event place, it is possible to advertise an event circulating in its own event place. In other words, it is possible to obtain end users belonging to different event places. In this way, the event can be shared among different event places, and the global autonomous distributed combination network can be constructed by the bottom up approach by interoperation between event places considering the ontology.

The mechanism of multiple EPO enables load balancing of the filtering process to a plurality of EP0s, and at the same time, it is possible to minimize network traffic by the event routing mechanisms between autonomously operating EP0s. As a result, the total throughput of the EP can be improved in a scalable manner.

Instead of going through a broker, you can directly search for and discover entities that are right for you.

For example, the information provider may specify an end user that matches the information provided by the information provider without knowing the existence of the end user. Consider the case of any content provider wishing to provide content. In other words, this content provider is the information provider described so far. With respect to the end-users who fit the content provider's own content, it is possible to easily realize a customized society for providing the content. Conventionally, the end user specifies a content suitable for the user by a combination of inquiries to the service provider driven by the end user. In addition, a content provider may be a sender of content information without resorting to a specific content information provider.

As a result, not only the content but also the content information can be transmitted by the content provider according to its own policy.

Similarly, an end user may search for and discover an information provider (content provider) that matches his or her own preferences without knowing the existence of an information provider (in this case, a content provider) and without asking a specific service provider. Can be.

Both actions mean that the end user and the information provider (content provider) can realize that they are transparent to each other. Accordingly, it is possible to send information in real time according to its own policy without resorting to a specific broker.

In addition, when a large number of entities to be searched or when an entity frequently enters or exits a search target domain, a search technique according to the non-broker model becomes particularly effective.

In SION, the endpoint of semantic information is a network. On the other hand, in the method of performing peer-to-peer connection between terminals, since the endpoint of semantic information becomes a terminal, the contents of the terminal are disclosed to the outside. Therefore, SION can realize higher security and privacy protection than the latter method.

Whether or not to allow the federation of the event place is basically an operational problem that can be left to the operator of the event place, and technically, a global network can be built using the federation mechanism. This is similar to how the Internet was established by interconnecting LANs (at the time of denying access to a particular LAN, the Internet would not exist today. Similarly, the interconnection of event places through federated agent means FA is operational). It should be allowed by default). In addition, it is thought that a plan that guarantees the rights of the content provider, the event provider, and the event place operator is required, and this can be achieved by using the setting contents of a filter, a combination of a click guarantee technique, and the like. On the other hand, protecting the privacy of end users is also an important task. In the case of a custom combination, it is the content information that is distributed among the event places as an event, and the user preference information is concealed in the event place, so that the end user's privacy can be protected relatively safely.

The transmission of the event, the reception of the event, and the registration of the event type are performed through a session that is a connection between the terminal of an event receiver, an event sender, or an event type registrant, and the semantic information switch. By this session, the semantic information switch can be arranged in any host (terminal).

Claims (73)

An event delivery device that performs delivery of an event consisting of data and semantic information that is meta data of the data according to semantic information on a network, The smallest unit in which semantic information is described according to a common ontology system while being a place for combining events from an event sender with respect to a filter that sets semantic information of an event desired by the event receiver as an event acquisition condition. The event obtained by combining the semantic information registered as the filter and the semantic information coded in the event in every event place that is within a range in which the delivery of the event is spread, and ignited according to the combination result is the event of the filter. Event delivery device having a semantic information switch for notifying the recipient. delete 2. The event delivery device according to claim 1, further comprising a semantic information gateway for transmitting events between the semantic information switches belonging to different event places. delete The method of claim 1, wherein the event place, And a semantic information router for selecting an event path between the semantic information switches according to an event type that is a template of semantic information and transmitting an event between the semantic information switches. The method of claim 1, wherein the event place, A semantic information router for selecting an event path between the semantic information switches according to an event type that is a template of semantic information, and transmitting an event between the semantic information switches; The event delivery device, And a semantic information gateway for transmitting the events between the event places. The event transmission according to claim 6, wherein the transmission of the event, the reception of the event, and the registration of the event type are performed through a session that is a connection between a terminal of an event receiver, an event sender, or an event type registrant, and the semantic information switch. Shipping device. 8. The semantic information gateway according to any one of claims 3, 6, and 7, wherein the semantic information gateway is configured at an event place where an event from an event place serving as a transmission source becomes a receiving side when transmitting an event between the event places. An event delivery device comprising a filtering function for transmitting only the event that meets a condition of an event required. 8. The ontology system according to any one of claims 3, 6 and 7, wherein the semantic information gateway is provided with a different ontology system between the event places when transmitting an event between the event places. And an event delivery device that transmits the event after ontology conversion of the event to be transmitted using the ontology conversion information describing the correspondence relationship therebetween. 10. The event delivery device according to claim 9, wherein the semantic information gateway includes ontology conversion information for a difference of ontology information between adjacent event places, and performs ontology conversion of an event transmitted using the ontology conversion information. The semantic information gateway according to claim 9, wherein the semantic information gateway acquires a set of event types registered in the event place as the ontology information from both of the event places to be converted, and the correspondence between the two event types and the event types. The event delivery device which obtains the correspondence relationship of the slot which is an item, makes ontology conversion information into ontology conversion information, and performs ontology conversion of the event transmitted using the ontology conversion information. The event place according to any one of claims 1, 3, 5, 6, and 7, wherein the event place accepts a registration of an event type that is a template of semantic information, and there is no overlap in the received event type. An event delivery device for registering the event type in the event place. The semantic information switch according to any one of claims 1, 5, 6, and 7, wherein the semantic information switch classifies the filter for each event type serving as a template of semantic information, and further subdivids and manages the filter for each session. The event delivery device which manages the relationship between the filters as a logical sum relationship when several filters are registered in a session. The apparatus of claim 7, wherein the event delivery device, With a central computing unit, And a memory connected to the control unit by the central computing unit. The memory, Generate an event place object for realizing the semantic information switch; Generate a shared link object that realizes the semantic information router according to the topology information of the event place object, Associating the event place object with the shared link object according to the topology information Storing a program executable in the central computing unit, And the event delivery device provides the event place by executing the program. The method of claim 14, wherein the program is further configured to generate the event place object. Dynamically determining a host that generates the event place object from a host capable of generating an event place object, and generating an event place object in the determined host so that event combination processing load balancing within the event place can be performed. An event delivery device to be executed in the central computing device. The event delivery device according to any one of claims 5 to 7, With a central computing unit, And a memory connected to the control unit by the central computing unit. The memory, Generate a shared link for performing event transmission according to the physical link information of the event place object for realizing the semantic information switch; Storing the software executable in the central computing unit that performs event transmission between the semantic information switches and performs event selection between the semantic information switches in accordance with the shared link established by the shared link object, The apparatus for providing the event place realizes the semantic information router by executing the software. The method of claim 16, wherein the program, In event transmission between the semantic information switches, For a series of event place objects, the event path for each event type is set by registering a filter for delivering the event, Maintain two identifiers of event place objects passed as control information for the transmitted events in the latest order, And the central computing unit executes preventing the infinite transmission of the event with reference to the control information. The method of claim 16, wherein the program, In the generation of the shared link, Create a shared link object that is ring-shaped and can be unidirectionally delivered between the event place objects, In event transmission between the semantic switches, For a series of event place objects, the event path for each event type is set by registering a filter for delivering the event, And discarding the event when the event has been traversed to the source of the event, by referring to the identifier of the event place object that is the source of the event held by the transmitted event, by the central computing unit. The method of claim 18, wherein the program, In event transmission between the semantic switches, In registering the filter to deliver the event, the central computing unit registers the filter with the wildcard designated as the event type to deliver the event to all event place objects in the event place instead of setting an event path. Letting event delivery device. The method of claim 7, wherein the semantic information router, in the delivery of the event, An event identifier providing function for assigning a uniquely identifiable identifier to each event, And a detection function for detecting that the same event has been duplicated from another path by referring to an identifier of an event stored in the past and stored. The method according to any one of claims 3, 6 and 7, wherein the semantic information gateway is: With a central computing unit, And a memory connected to the control unit by the central computing unit. The memory, Between the event places, a filter relating to the event place serving as the event transmission destination is registered in the event place serving as the event transmission source, and executed by the central computing unit that transmits only the events passing through the registered filters to the event place serving as the event transmitting destination. Event delivery device to remember available software. 8. The event delivery device according to any one of claims 1, 3, 5, 6, and 7, wherein the event place further comprises a function of collecting statistical information about an event circulating in the event place. The method of claim 14, wherein the software, And generating, by the central computing unit, an information collecting object for collecting statistical information about an event circulating in the event place. The apparatus according to any one of claims 1, 3, 5, 6, 7, 14, 15 and 20, wherein the apparatus for providing the event place comprises: An event delivery device that guarantees a common ontology system by managing an ontology system in an event place composed of an event type that is a template of semantic information, an inheritance relationship between the event types, and metadata that is an instance of the event type. A community providing device realized on an event delivery device according to claim 7, An authorization function for performing authorization such as participation in the community; And a management function for identifying and controlling the information distributed in the community, and a statistical processing function for performing statistical management of the information distributed in the community. 27. The system of claim 25, wherein the community is realized using an event place provided by the event delivery device, And the management function sets a semantic information gateway provided by the event delivery device for information that can be distributed from an adjacent community. In order to deliver an event composed of data and semantic information which is metadata of the data in a network, The event receiver combines the events from the event sender with respect to the filter that sets the semantic information of the event that the event receiver wants to receive as the condition for acquiring the event, and matches the event according to the combination combination to the event receiver corresponding to the filter. A semantic information gateway that has a semantic information switch for notifying and which transmits an event between event places that is the minimum unit in which semantic information is described according to a common ontology system, and that the event delivery is spread. And a transmitting unit for receiving the event from the semantic information switch belonging to an event place of a transmission source and transmitting the event to the semantic information switch belonging to an event place of a transmission destination. The method of claim 27, wherein the transmission unit, A function of transmitting an event according to semantic information between the event places; A function of performing ontology conversion of an event to be transmitted by using ontology conversion information describing a correspondence relationship between the ontology systems when the event places are transmitted between the event places. Meaning information gateway with. The method of claim 28, wherein the transmission unit, Between the event places, the event place serving as an event transmission destination further includes a function of registering a filter with the event place serving as an event transmission source, The function of transmitting the event is, A semantic information gateway that sends only events that pass a registered filter to the event place that is the destination of the event. A semantic information switch for notifying, according to semantic information, an event composed of data and semantic information that is meta data of the data to an event receiver serving as a receiver of an event delivered in a network. A function for registering a filter that has set the semantic information of an event which an event receiver wants to receive as an event acquisition condition; Classifying the filter for each event type serving as a template of semantic information, and subdividing and managing the filter for each session, and when a plurality of filters are registered in the same session, managing the relationship between the filters as a logical sum relationship; , A function of receiving the event and combining the semantic information registered as the filter with the semantic information given to the event; And a semantic information switch having a function of notifying the event receiver of the filter according to a result of the combination. A semantic information router for determining a delivery route of an event composed of data and semantic information that is meta data of the data according to semantic information, A route selection function for selecting an event delivery path between semantic information switches for notifying an event to an event receiver according to an event type that is a template of semantic information; A semantic information router having an event sending function for sending the event with respect to the selected path. The method of claim 31, wherein the path selection function, Generating a shared link that transmits an event according to the physical link information of the semantic information switch that delivers the event to the event receiver according to the semantic information included in the event; A function of making an event path selection between the semantic information switches according to the shared link established by the shared link object, The event sending function, A semantic information router for performing event transmission between the semantic information switches according to the selected event path. 33. The method of claim 32, wherein the function of performing event path selection is: A function for setting an event path for each event type by registering a filter for delivering the event to a series of event place objects, The event sending function, A function of maintaining two identifiers of event place objects passed as control information with respect to the transmitted event in the latest order; A semantic information router having a function of preventing infinite transmission of an event with reference to the control information. 33. The method of claim 32, wherein the function of creating the shared link comprises: Create a shared link object that is ring-shaped and can be unidirectionally delivered between the event place objects, The function of performing the event path selection, A function for setting an event path for each event type by registering a filter for delivering the event to a series of event place objects, The event sending function, A semantic information router for discarding an event when the event is traversed to an originator of an event by referring to an identifier of an event place object that is a source of an event where a transmitted event is maintained. The method of claim 34, wherein the function of performing the event path selection, When registering a filter for delivering the event, instead of setting an event path, semantic information having a function of registering the wildcard-designated filter as an event type to deliver the event to all event place objects in the event place. Luther. The method of claim 31, wherein the event sending function, An event identifier providing function for assigning a uniquely identifiable identifier to each event, A semantic information router having a detection function for detecting that an identical event is duplicated from another path by referring to an identifier of an event that has been delivered and stored in the past. As an event delivery method in which a delivery of an event composed of data and semantic information that is meta data of the data is performed according to semantic information on a network, Providing an event place by a device connected to the network, It is a minimum unit where semantic information is described according to a common ontology system, as well as a place for combining events from an event sender with respect to a filter that sets semantic information of an event which an event receiver wants to receive as an event acquisition condition. A semantic information switch is installed at each event place that delivers the event. And the semantic information switch combines semantic information registered as the filter and semantic information given to the event, and notifies the event receiver of the filter of the event ignited according to the combination result. Way. delete 38. The apparatus according to claim 37, further comprising: a semantic information gateway for transmitting an event between the semantic information switches belonging to different event places, respectively; Sending an event between the event places by the semantic information gateway. delete 38. The system of claim 37, further comprising a semantic information router in the event place, And by the semantic information router, selecting a path of an event between the semantic information switches according to an event type that is a template of semantic information, and simultaneously transmitting an event between the semantic information switches. Way. 38. The system of claim 37, further comprising a semantic information router in the event place, Further set up a semantic information gateway for transmitting events between the event places, The semantic information router performs path selection of events between the semantic information switches according to an event type that is a template of semantic information, and transmits events between the semantic information switches. Sending, by the semantic information gateway, an event between the event places. 43. The method of claim 42, further comprising: sending the event, receiving the event, and registering the event type through a session that is a connection between a terminal of an event receiver, an event sender, or an event type registrant, and the semantic information switch. Including the event shipping method. The event from the event place serving as a transmission source according to any one of claims 39, 42, and 43, when transmitting an event between the event places in the semantic information gateway. And performing filtering to transmit only the event meeting the conditions of the event required at the event place. The method according to any one of claims 39, 42, and 43, wherein in the semantic information gateway, when an event is transmitted between the event places, a different ontology system is provided between the event places. And performing the ontology conversion of the event to be transmitted using the ontology conversion information describing the correspondence between the ontology systems, and then transmitting the event. 46. The method of claim 45, further comprising: in the semantic information gateway, comprising a difference in ontology information between adjacent event places as ontology conversion information, and performing ontology conversion of an event transmitted using the ontology conversion information. Including the event shipping method. 46. The apparatus according to claim 45, wherein in the semantic information gateway, a set of event types registered in the event place as the ontology information is obtained from both of the event places that are to be converted, and correspondence between the event types of the two and the event types. Obtaining a corresponding relationship between slots as an item, using the correspondence as ontology conversion information, and performing ontology conversion of an event transmitted using the ontology conversion information. The method of any one of claims 37, 39, 41, 42 and 43, wherein in the event place: Accepts the registration of an event type that is a template of semantic information. Registering the event type in the event place when there is no overlap in the received event type. The said semantic information switch of any one of Claims 41-43, The filter is classified for each event type that is a template of semantic information, and the filter is divided and managed for each session. If a plurality of filters are registered in the same session, managing the relationships between the filters as a logical sum relationship. 44. The system of claim 43, wherein the event place is Generate an event place object for realizing the semantic information switch; Generating a shared link object for realizing the semantic information router according to the topology information of the event place object, Associating the event place object with the shared link object according to the topology information. 51. The method of claim 50, wherein in generating the event place object: Dynamically determining a host that generates the event place object from a host capable of generating an event place object so as to perform an event combination processing load balancing in the event place, Generating an event place object for the determined host. The method of any one of claims 41 to 43, wherein the semantic information router, According to the physical link information of the event place object which realizes the said semantic information switch, the shared link which performs event transmission is produced | generated, The event delivery method is realized by performing event transmission between the semantic information switches and performing event path selection between the semantic information switches in accordance with the shared link established by the shared link object. The method of claim 52, wherein in event transmission between the semantic information switches, For a series of event place objects, the event path for each event type is set by registering a filter for delivering the event, Regarding the transmitted event, two identifiers of the passed event place objects are maintained in the latest order as control information, Preventing infinite transmission of the event with reference to the control information. 53. The method of claim 52, wherein in the creation of the shared link: Create a shared link object that is ring-shaped and can be unidirectionally delivered between the event place objects, In event transmission between the semantic switches, The event path for each event type is set by registering a filter for delivering the event to a series of event place objects, And discarding the event when the event is traversed to a source of an event by referring to an identifier of an event place object that is a source of an event in which the transmitted event is maintained. 55. The method of claim 54, wherein in event transmission between semantic switches: Registering a filter to deliver the event, instead of setting an event path, registering a filter with a wildcard designated as the event type to deliver the event to all event place objects in the event place. Way. The delivery of an event by the semantic information router according to claim 43, wherein: Give an event identifier that gives a uniquely identifiable identifier for each event, And detecting that the same event is duplicated from another pass by referring to an identifier of an event that has been delivered and stored in the past. The method of any one of claims 39, 42, and 43, wherein the semantic information gateway is: Between event places, a filter relating to the event place that is the event destination is registered in the event place that is the event source. Transmitting only the event that has passed the registered filter to an event place serving as an event transmission destination. 44. Event delivery according to any one of claims 37, 39, 41, 42, and 43, further comprising the step of: collecting, at said event place, statistical information about an event circulating in said event place. Way. 51. The method of claim 50, wherein in realizing the event place: Generating an information collection object for collecting statistical information about an event circulating in the event place. The apparatus of any one of claims 37, 39, 41, 42, 43, 50, 51, 56 and 59, wherein the event place is An event delivery method that guarantees a common ontology system by managing an ontology system in an event place composed of an event type that is a template of semantic information, an inheritance relationship between event types, and metadata that is an instance of the event type. As a community providing method realized on the event delivery device according to claim 7, Authorizing whether or not to participate in the community; And a management step for identifying and controlling the information distributed in the community, and a statistical processing step for performing statistical management of the information distributed in the community. 63. The method according to claim 61, wherein the community is created using an event place provided by the event delivery device, And setting the semantic information gateway provided by the event delivery method for information that can be distributed from an adjacent community. In the event delivery method which delivers the event which consists of data and semantic information which is meta data of the said data according to semantic information, Combining events from an event sender with respect to a filter that sets semantic information of an event desired by the event receiver as an event acquisition condition, and notifies the event receiver corresponding to the filter of the matched event according to the combination result. And transmitting the event according to the semantic information, the semantic information switch being provided, and transmitting the event between event places that are the minimum units in which the semantic information is described according to a common ontology system, and the distribution of the event is spread. Event transmission method between the event place comprising a. The method of claim 63, wherein in the transmission of the event, Performing an ontology conversion of the event to be transmitted using the ontology conversion information describing a correspondence relationship between the ontology systems when the event is transmitted between the event places and having different ontology systems between the event places. Event transmission method between event places to perform. The method of claim 64, wherein in the transmission of the event, Between event places, the event place that is the destination of the event registers a filter with the event place that is the source of the event, And transmitting only the event passing the registered filter to the event place serving as the event transmission destination. An event delivery method of notifying, according to semantic information, an event composed of data and semantic information that is meta data of the data to an event receiver serving as a receiver of an event delivered in a network. Register the filter that has set the semantic information of the event which the event receiver wants to receive as the event acquisition condition, The filter is classified for each event type that is a template of semantic information, and the filter is divided and managed for each session. If a plurality of filters are registered in the same session after receiving the event, the relationship between the filters is managed as a logical sum relationship, The semantic information registered as the filter and the semantic information given to the event are combined, Notifying the event receiver of the filter according to a result of the combination. An event delivery route determination method for determining a delivery route of an event composed of data and semantic information that is meta data of the data in accordance with semantic information in a network, A path selection step of selecting an event delivery path between semantic information switches that notify an event receiver of an event according to an event type that is a template of semantic information; And an event delivery step of transmitting the event with respect to the selected route. The method of claim 67, wherein the path selection step, Generating a shared link that transmits an event according to the physical link information of the semantic information switch that delivers the event to the event receiver according to the semantic information included in the event; Performing an event path selection between the semantic information switches in accordance with the shared link established by the shared link object, The event sending step, And an event delivery route determining method according to the selected event route. 69. The method of claim 68, wherein performing event path selection comprises: Setting an event path for each event type by registering a filter for delivering the event to a series of event place objects, The event sending step, Maintaining two identifiers of the event place objects passed as control information for the transmitted event in the latest order; Meaning information router comprising the step of preventing the infinite transmission of the event with reference to the control information. 69. The method of claim 68, wherein creating the shared link comprises: Create a shared link object that is ring-shaped and can be unidirectionally delivered between the event place objects, The step of performing the event path selection, Setting an event path for each event type by registering a filter for delivering the event to a series of event place objects, The event sending step, And discarding the event when the event has been traversed to a source of an event by referring to an identifier of an event place object that is a source of an event maintained by a transmitted event. 71. The method of claim 70, wherein performing event path selection comprises: Upon registering a filter for delivering the event, instead of setting an event path, registering the wildcarded filter as an event type to deliver the event to all event place objects in the event place. How to determine your delivery route. The method of claim 67, wherein the event sending step, Assigning a uniquely identifiable identifier for each event, Detecting the event delivery route comprising the step of detecting that the same event is delivered from another pass by referring to the identifier of the event that has been delivered and stored in the past The computer program according to any one of claims 37, 39, 41, 42, 43, 50, 51, 56, 59, and 61 to 72, wherein the computer program is executable on the computer. A system consisting of a program and a computer executes the method of any one of claims 37, 39, 41, 42, 43, 50, 51, 56, 59 and 61-72. Recording media storing programs that can be read by a computer.