EP2359258A2

EP2359258A2 - A method of self organized communication

Info

Publication number: EP2359258A2
Application number: EP09826330A
Authority: EP
Inventors: Sahar A. Al-Talib; Mazlan Abbas; Borhanuddin Mohd Ali
Original assignee: Mimos Bhd
Current assignee: Mimos Bhd
Priority date: 2008-11-11
Filing date: 2009-11-09
Publication date: 2011-08-24
Also published as: MY149719A; WO2010056104A2; EP2359258A4; WO2010056104A3

Abstract

There is provided a method that allows adding complex dependency logic to an existing database for self organized system without having to modify the underlying structure of the database. The present invention provides a way to flexibly handle record state transitions by using an event model. In other embodiment of the present invention an event meta-model is instantiated to represent a number of different event models and the corresponding dependencies that inter-relate them. Hash algorithm approach may be implemented for building the self-organized communication system database.

Description

A METHOD OF SELF ORGANIZED COMMUNICATION

FIELD OF INVENTION

The present invention relates to a method of self organized communication.

BACKGROUND OF INVENTION

A database is a collection of data organized in a way that facilitates updating, retrieving and managing data. Some databases have huge volumes of data that can weigh them down. Various search means are then used to store, retrieve, and/or delete information from the databases. The model in most common use today is the relational model. Other models such as the hierarchical model and the network model use a more explicit representation of relationships. A computer database relies upon software to organize the storage of data. This software is known as a database management system (DBMS). Database management systems are categorized according to the database model that they support. The model tends to determine the query languages that are available to access the database.

All of these databases take advantage of indexing to increase their speed. This technology has advanced tremendously since its early uses in the 1960s and 1970s. The most common kind of index is a sorted list of the contents of some particular table column, with pointers to the row associated with the value. An index allows a set of table rows matching some criterion to be located quickly though there are some disadvantages of indexing such as it increases the amount of storage on the hard drive necessary for the database file, and second, the index must be updated each time the data are altered, and this costs time. SUMMARY OF INVENTION

Accordingly, there is provided a method for a communication system, the method includes the steps of categorizing data to be included or to be excluded from a database wherein each category has a set of events and initializing a database of the self-organized communication system wherein, the method further includes at least a first mechanism to add a first node information when the node joins a topology, at least a second mechanism to delete a node information when a second node departs and at least a third mechanism to perform updates

The present invention consists of several novel features and a combination of parts hereinafter fully described and illustrated in the accompanying descnption and drawings, it being understood that vaπouj changes in the details may be made without departing from the scope of the invention or sacnficing any of the advantages of the present invention

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be fully understood from the detailed description given herein below and the accompanying drawings which are given by way of illustration only, and thus are not limitative of the present invention, wherein:

FIG. 1 is a diagram illustrating components of Self-Organized System;

FIG. 2 is a diagram showing how an event meta-model categorizes data of the self- organized system based on defined modeled events;

FIG. 3 is a diagram showing a database table that contains the nodes profile of the self- organized communication system;

FIG. 4 is a diagram illustrating an example of a Computer System used to implement the present invention;

FIG. 5 is a diagram showing basic operations of Hash Algorithm.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present invention relates to a method of self organized communication. Hereinafter, this specification will describe the present invention according to the preferred embodiments of the present invention. However, it is to be understood that limiting the description to the preferred embodiments of the invention is merely to facilitate discussion of the present invention and it is envisioned that those skilled in the art may devise various modifications and equivalents without departing from the scope of the appended claims.

The following detailed description of the preferred embodiments will now be described in accordance with the attached drawings, either individually or in combination.

There is provided a method that allows adding complex dependency logic to an existing database for self organized system without having to modify the underlying structure of the database. The present invention provides a way to flexibly handle record state transitions by using an event model. The event model is a set of one or more items called an event. Each event in the event model has an associated event type and contains dependency logic that inter-relates the events in the event model with one another. Each event represents a set of actions that are optionally contingent upon a condition. The actions and conditions that comprise an event are determined when the event is created. Each event may have a different set of actions and conditions. This enables an event to represent a number of different things. An event can represent anything it is defined to represent.

In one embodiment of the present invention an event meta-model is instantiated to represent a number of different event models and the corresponding dependencies that inter-relate them. The event meta-model is a model of one or more event models. Thus, it is a model of a model. The event meta-model is used, for example, to describe a set of modeled events. This is accomplished by maintaining values that represent type of events the event meta- model describes. The event meta-model enables the model creator to control what happens to each and every event in the event meta-model without having to modify an underlying structure of the database. Instead of changing the structure of the database, a new data type can be created in the event model. Once this new data type is created it can immediately be used. Thus, the event meta-model provides a way to add functionality to the database and immediately make that functionality available for use. All of this is done without having to create new tables / databases.

FIG. 2 illustrates how the event meta-model describes a set of modeled events / categories The event meta-model provides a framework in which multiple event models can be instantiated, and it contains a built-in clock mechanism that drives an instantiated event model, thus turning it into an event processor. More than one meta-model can be created. Each event meta-model contains a list of entities that represent various attributes of the event meta-model.

In an effort to make the data stored in databases easily retrievable, databases are organized according to a predetermined structure. The present invention utilizes hash algorithm approach to be implemented for building the self-organized communication system database.

FIG. 5 depicts the basic operations of hash algorithm. Hashing is a method used for referencing records in a table by performing arithmetic transformations on keys into table addresses. The elements of hashing are (1) Hash Table: this is a random access table in which an item can be reached by means of a hash function to form an address from the key; (2) Hash Function: this is a function which, when applied to the key, produces an integer in the range of 0 to (table size-1) that can be used as an address in a table; (3) Collision: this is a situation when a hash function maps two different keys to the same table address. A hash function should have characteristics such as easy to compute, repeatable, should depend on the entire key, all range values should be hit with equal probability and patterns in the key should not be reflected in patterns in the hash values. A division-reminder method satisfies all the characteristics mentioned.

The division-remainder method has been selected in the present invention in which the size of the number of items in the table is estimated. That number is then used as a divisor into each original value or key to extract a quotient and a remainder. The remainder is the hashed value.

This algorithm maps keys to numbers in the range of 0 to (Table size - 1) such that:

H(K) = K mod N where: H(K) : hash key in the range [1 ,N]

K: host identity (e.g., IPv6 address-layer 3, Media Access Control (MAC) address-layer 2, the port of a peer client or any other present or future identified host identity) N: size of the hash table (self-organized system database)

For the quality of hash function, it is recommended to select a prime number for the table size in order to decrease collisions so that a better distribution of keys can be obtained. For this reason, values of 101 , 211 , 307, 1007, 10007, and 49999 for the hash table size could be chosen.

Since this method is liable to produce a number of collisions, any search mechanism would have to be able to recognize a collision and offer an alternate search mechanism. So, on collision, the following steps are contributed in the present invention, step 1: try alternative entries until an empty one is found, step 2: link the new entry with the previous one using a link address 'Clue' to form a chain or cluster with all the members in a chain structure within the table space.

The present invention provides a way to flexibly handle record state transitions by using an event model. The event model comprises of different categories for example: category- A, category- B, category- C, or any other categories to be defined based on the requirements of the self-organized system.

FIG. 1 shows the components of the event modeling mechanism for the self-organized communication system. In the present invention, the categories or the system components could change frequently but the structure of the database does not change. No more databases need to be added. Referring to FIG. 1 :

Category A

Initialize Self Organized System

Characteristics of the self-organized communication system:

• Scale depends on the size of the self-organized system and can reach thousands or more nodes.

• Node information can include for example: node identity, node location (address), security information / key(s), QoS parameters, or any other present or future node information needed to be added to the node profile. Some of this node information or other node information can be obtained / interrelated with profiles / databases exists / built to contain node information.

Category B Subscription (Self-configuration) Pseudo Algorithm

BEGIN Calculate the hash key of the node using its identity IF the location in the hash table is empty

THEN

Add the node to the assigned cluster. Add 'clue' to link nodes of each cluster. Update the cluster elements. ELSE

Search linearly for an empty location. Add the node to the cluster. Update the cluster elements. END

Where:

Node: could be a Customer Premises Equipment (CPE) / hand-phone (HP) / notebook / wireless node.

Node identity: could be Internet Protocol (IP) address / Media Access Control (MAC) address / port of a peer client or any present or future identity that recognizes the node.

Cluster: is a group of nodes those their identity hashes to the same location in the hash table

Clue: is a number that was added / contributed for self-organization purposes.

Category C Unsubscribe (Self-healing) Pseudo Algorithm

BEGIN

Calculate the hash key of the leaving node using its identity Search the cluster starting from the hash key of the leaving node using the clues.

IF the node is found THEN

Delete its membership Update the hash table

ELSE

Play an error message, such as communication error and exit END

Where:

Node identity: could be IP address / MAC address / port of a peer client or any present or future identity that recognizes the node.

Clue: is a number that was added / contributed for self-organization purposes.

Leaving node: a node that leaves the system normally or due to communication error, power off, administrator action and other reasons.

FIG. 2 shows how the event modeling mechanism categorizes the data of the self-organized system based on the defined events. FIG. 3 depicts sample information for each communication node to be saved in the database. The present invention may be implemented as computer software in the form of computer readable program code executed on a general purpose computer such as the one illustrated in FIG. 4. In which a Keyboard and mouse are for introducing user input to the computer system and communicating that user input to a central processing unit (CPU). Other suitable input devices may be used in addition to, or in place of, the mouse and keyboard. Input / output (I/O) unit coupled to bidirectional system bus represents such I/O elements as a printer, audio / video (A/V) I/O, etc.

The computer includes a video memory, main memory and mass storage, all coupled to bidirectional system bus along with keyboard, mouse and processor. A mass storage where the database of the self-organized communication system resides could be any available mass storage technology. The CPU could be any suitable microprocessor or microcomputer. Main memory is of type dynamic random access memory (DRAM). A monitor is a type of monitor suitable for displaying graphic images.

The computer system may also include a communication interface to provide a data communication via network link to a compatible Local Area Network (LAN). Wireless links are also possible. The network link may provide a connection through local area network to host computer or to data equipment operated by an Internet Service Provider (ISP).

The computer can send messages and receive data, including program code, through the network(s), network link, and communication interface. In the Internet example, server might transmit a requested code for an application program through the Internet, ISP, local network and communication interface. In accord with the invention, one such downloaded application is the method and apparatus for event modeling described herein. The computer system described before is for purposes of example only. An embodiment of the invention may be implemented in any type of computer system or programming or processing environment.

Claims

1. A method for a self-organized communication system, the method includes the steps of:

a. initializing a database of the self-organized communication system; b. categorizing data to be included or to be excluded from a database wherein each category has a set of events; and c. instantiating an event meta-model;

wherein,

the method further includes at least a first mechanism to add a first node information when the node joins a topology, at least a second mechanism to delete a node information when a second node departs and at least a third mechanism to perform updates.

2. The method as claimed in claim 1 wherein, the set of events, each: a. represents a set of actions optionally contingent upon a condition; b. has actions and conditions that accommodate the set of events and the actions and conditions are determined when the set of events is created; c. has different set of actions and conditions from other set of events; and d. represents a definable event.

3. The method as claimed in claim 1 wherein, the event meta-model represents a number of different event models and corresponding dependencies that interrelate the event meta-model to at least one event models

4. The method as claimed in claim 1 wherein, the self-organized communication system is of a size of more than one node based on the size of the communication system topology.

5. The method as claimed in claim 1 wherein, the node could be a Customer Premises Equipment (CPE), a hand-phone (HP), a notebook or any present or future wired / wireless node.

6. The method claimed in claim 1 wherein, the method is be used in a subscription service environment, the environment includes a database to store any details relating to the nodes such as recording corresponding nodes of those subscribe to a particular service and, status of the node.

7. The method claimed in claim 6 wherein, the status of the node includes a new subscribed node, a node that's subscription is about to expire, a node that is targeted for a specific renewal offer and a newly renewed node that has not yet paid a subscription fee.