Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q3/00—Selecting arrangements
  • H04Q3/0016—Arrangements providing connection between exchanges
  • H04Q3/0029—Provisions for intelligent networking
  • H04Q3/0054—Service creation techniques
  • H04Q3/0058—Service creation techniques using service-independent building blocks (SIBBs) or "primitives"
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
  • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10S707/00—Data processing: database and file management or data structures
  • Y10S707/99941—Database schema or data structure
  • Y10S707/99944—Object-oriented database structure
  • Y10S707/99945—Object-oriented database structure processing
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
  • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10S707/00—Data processing: database and file management or data structures
  • Y10S707/99941—Database schema or data structure
  • Y10S707/99948—Application of database or data structure, e.g. distributed, multimedia, or image

Definitions

• This invention concerns implementation of service independent building blocks (SIB). These building blocks are used for building intelligent network services.
• SIB service independent building blocks
• the intelligent network can be defined as an architecture that can be applied to most telecommunication networks irrespective of the network technology. It aims at bringing about telecommunication services providing an additional value and at control and management of these. It is a special feature of the intelligent network to provide modular functions which are independent of the service used and which may be connected to one another as components when developing new services, whereby it is easier to define and design new services. Another special feature is that the supply of services is independent of the telecommunication network. The services are separate from the lowermost physical network structure, which means that they can be distributed.
• CCITT defines the Intelligent Network Conceptual Model (INCM) in the CS-1 (Capability Set 1) recommendation.
• the model includes four planes, each of which represents an abstract view of the possibilities offered by the intelligent network.
• Figure 1 shows the conceptual model from the viewpoint of service logic.
• the top plane is called the Service Plane (SP) and it determines how the service will appear to its user.
• SP Service Plane
• the view contains no information on the implementation of services in the intelligent network.
• the service includes one or several lowermost components of this plane, the Service Feature (SF).
• SF Service Feature
• the SF is the smallest part of the service discernible to the user. They may be used in the same way as building blocks for building new complex services.
• the second topmost plane of the model is the Global Functional Plane containing a view of the intelligent network as service independent standards and as Service Independent Building Blocks (SIB), from which the service characteristics and services discernible on the topmost plane are collected with the aid of service logic.
• the Basic Call Process (BCP) covering the entire network and the Point of Initiation (POI) and Point of Return (POR) between the BCP and the SIB also belong to this plane.
• BCP Basic Call Process
• POI Point of Initiation
• POR Point of Return
• GSL Global Service Logic
• the service plane SF includes one SIB or several SIBs. In principle, the SIB is a sub-programme the operation of which is well defined.
• the second lowermost plane is called the Distributed Functional
• DFP Functional Entities
• FE Functional Entities
• FEA Functional Entity Actions
• Each entity may perform tasks of different types. Inside each functional entity most tasks may be performed as one or several sub-functions.
• DSL Distributed Service Logic
• One global service logic GSL of the global functional plane leads to one or several service logics X, Y, Z .. on the distributed functional plane.
• the lowest plane, the Physical Plane, is formed by Physical Entities (PE) supporting tasks of the distributed functional plane, by interfaces between these and by protocols.
• PE Physical Entities
• the service logic may be installed and performed by any physical item including a control function of the concerned service. The behaviour of the item is determined by the functional entity on the preceding DF plane.
• SIBs of the global functional plane are examined more closely in the following.
• FIG. 2 is a graphic view of the SIB process. The following matters can be distinguished in each SIB:
• SIB the logical end where SIB's function ends.
• ETSI does not define different SIBs by name nor their function, but defines the exchange of messages taking place in the telephone exchange. Through it the standard also affects the SIBs.
• the SIBs form a list wherein the names of SIBs and the parameters needed by the SIBs are listed.
• the service is carried out in such a way that the list is gone through and individual SIBs are performed. This is illustrated in Figure 3 where there are a number of n SIBs in the list.
• the instruction pointer IP points at the start of the list and after performance of an individual SIB the pointer is moved forward by one instruction to the next point or a jump is made to some other point in the list and the SIB located there is performed.
• Validation A is an example of this kind of service. It should also be noticed that different versions may be required of the same service. One teleoperator may need such a validation A which includes a replacing number A, whereas another teleoperator wants validation A without any replacing number A.
• SIB can be implemented as a sub-programme. Firstly, the sub-programme call must hereby relay the parameters used to the sub-programme implementing the SIB and, secondly, compiling is typically associated with the fact that the number or type of parameters to be relayed in the sub-programme call can not be changed without changing the source code. The final outcome is that SIB can not be implemented service independently, if its parameters are relayed in the sub-programme call.
• no SIB set is defined especially, but the SIBs are instead divided logically into two groups: assisting and performing SIBs respectively. This is done because one can be rather sure as regards some SIBs that they will remain unchanged and thus truly service independent, but there is no certainty as regards some, and this is the fundamental reason why the SIBs are divided into assisting and performing ones.
• the assisting SIBs perform simple and clearly limited tasks, whereby one can be sure that the number and type of parameters will remain unchanged also in the future.
• the tasks of performing SIBs are larger than the tasks of assisting SIBs and changes may occur in them.
• the parameters of performing SIBs are not relayed in the sub-programme call, but in one or several global data structures.
• Figure 1 shows a conceptual model of an intelligent network
• Figure 2 shows a service independent building block
• Figure 3 illustrates the performance of SIBs
• Figure 4 illustrates the use of a global variable
• Figure 5 shows an assisting SIB
• Figure 6 shows a performing SIB.
• the SIBs are thus divided logically into two groups: assisting and performing SIBs respectively.
• the assisting SIBs perform such tasks that the number and type of parameters will surely be standard irrespective of in which service programme the SIBs are used now and in the future.
• the performing SIBs are such that the number or type of their parameters may change, which again will lead to the problems mentioned in the presentation of the state of the art in this patent application.
• the problems are avoided in such a way that parameters of performing SIBs are not relayed in the sub-programme call, but in one or several global variables.
• the global variable is a data structure and the information stored in its fields is available to all sub-programmes.
• Such a data structure may be an already existing data structure of the software or it may be created separately.
• an unambiguous identifier refers to each field of the data structure used as the global variable.
• Such a data structure called CID is used as an example in the following which contains Call Instant Data.
• the CID data structure includes the following fields: CID_REC
• END REC CID In the service programme, reference is made to fields of the CID data structure based on an unambiguous identifier, in this case a sequence number, e.g. sequence number one (1) refers to subscriber A and sequence number two (2) refers to subscriber B etc. If the programme code of SIBs is included in the interpreter, the internal sequence numbers (1 and 2 above) of the interpreter are kept unchanged. Any new fields are added to the end of the CID data structure and they will have their own sequence numbers in a consecutive sequence of numbers. What was said earlier will now be illustrated with the aid of Figure
• SIB When it is the turn of service programme SIB to perform, the concerned SIB fetches the information it needs from the data structure which is a global variable. SIB performs its functions using the information it has fetched.
• SIBs Assisting SIBs will be described with the aid of two SIBs as examples. Their names are given by the applicant, but SIBs performing functions of a similar kind are found also in intelligent network software of other manufacturers.
• the first example SUD_TO_CID is an assisting SIB fetching individual subscriber information from the Service Support Data database and placing it in the CID data structure mentioned above.
• This SIB has two parameters, one of which indicates which subscriber information is fetched from the database while the other parameter indicates in which field of the CID data structure the subscriber information is placed.
• the other example IF shown in Figure 5 is an assisting SIB which has three input parameters.
• the first parameter is a truth value (true/false)
• the second parameter is a jump address a, to which the function will move if the truth value is true
• the third parameter is a jump address b, to which the function will move if the truth value is false.
• the jump address (a or b) resulting from SIB's performance moves the IP pointer shown in Figure 3 to the SIB referred to in the jump address, whereupon this SIB is performed. It is obvious that a SIB of this type will remain unchanged as time passes: two truth values can hardly produce anything else than two output values, which are given in the input parameters. It is rather useless to use a global variable in such a case.
• the tasks of performing SIBs are larger than those of assisting SIBs.
• FIG. 6 mentions CHARGINGJNFO which provides the call control with information relating to charging, such as the subscriber number and the charging origin.
• a performing SIB is typically preceded by one or several assisting SIBs.
• the CHARGINGJNFO SIB mentioned above is preceded by such a SUD_TO_CID wherein the charging origin information is fetched from the subscriber database and it is placed in a certain field of the CID record. When it is the turn of CHARGINGJNFO SIB to perform, it will obtain from the CID record the charging origin information it needs.
• SIBs By changing certain SIBs to be parameter-less it is possible to prevent any occurrence of several versions of the source code as a result of changes in the number of parameters. It is not necessary to change all SIBs to be parameter-less, because their number will (almost surely) remain the same.
• the SIB IF which was mentioned earlier can be implemented naturally so that it has three parameters, one of which indicates the reference operation while the two other parameters contain values which are compared with each other.
• the SIB which performs a connection procedure by the name of CONNECT and defined in the Core Inap standard and which sends an in_connect_s message to the Service Switching Point (SSP) is of that type of SIB that the number of parameters may vary. For this reason, it is worth while to implement CONNECT-SIB as a SIB without parameters which receives the information it needs from the global variable.
• the third characteristic feature concerns implementation of the programme code of SIBs.
• Implementation of SIBs may be based on known interpreter technology in such a way that the programme code of SIBs is included in the interpreter.
• the interpreter hereby reads a service programme formed by SIB names and SIB parameters and it then performs the programme code of the SIB.
• SIB relating to the third characteristic feature
• the SIB's task is to "connect" a call. It is assumed that the SIBs are implemented by interpreter technology and it is assumed that new information, analyse treejndex, should be used in CONNECT SIB.
• CONNECT SIB When a global variable , that is, a CID data structure is used and CONNECT SIB is implemented as a parameter-less SIB, then the following change is made in the CID data structure
• sequence number x of the addition is the first unused sequence number.
• the analysejreejndex information may be taken to the CID record e.g. with the aid of the R_TO_CID SIB.
• R_TO_CID is an assisting SIB having two parameters. One parameter refers to some R register while the other refers to a field in the CID data structure, in the present case to field X.
• the "old" service programme does not recognise field X in the CID data structure, which means that it does not set up any value for the analysejreejndex information, whereby the initialisation value is the analysejreejndex information.
• the interpreter functions as before from the viewpoint of the "old" service programme.
• the "new" sen/ice programme may use the analysejreejndex information, since the steps relating to the information are conditional, that is, they will be performed only if the analysejreejndex value differs from a certain initialisation value (0 is a common initialisation value).

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Exchange Systems With Centralized Control (AREA)
• Telephonic Communication Services (AREA)
• Mobile Radio Communication Systems (AREA)
• Working Measures On Existing Buildindgs (AREA)
• Buildings Adapted To Withstand Abnormal External Influences (AREA)
• Finishing Walls (AREA)
• Electronic Switches (AREA)
• Pharmaceuticals Containing Other Organic And Inorganic Compounds (AREA)
• Amplifiers (AREA)
• Crystals, And After-Treatments Of Crystals (AREA)

Priority Applications (5)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=8548868

Family Applications (1)

Country Status (8)

Cited By (6)

Families Citing this family (3)

Citations (4)

Family Cites Families (12)

• 1997
  • 1997-05-16 FI FI972108A patent/FI106988B/fi not_active IP Right Cessation
• 1998
  • 1998-05-15 AU AU74351/98A patent/AU7435198A/en not_active Abandoned
  • 1998-05-15 CN CN98805158A patent/CN1101020C/zh not_active Expired - Fee Related
  • 1998-05-15 DE DE69828804T patent/DE69828804T2/de not_active Expired - Lifetime
  • 1998-05-15 EP EP98921527A patent/EP1019810B1/en not_active Expired - Lifetime
  • 1998-05-15 AT AT98921527T patent/ATE288105T1/de not_active IP Right Cessation
  • 1998-05-15 WO PCT/FI1998/000417 patent/WO1998055919A1/fi active IP Right Grant
• 1999
  • 1999-11-15 US US09/440,411 patent/US6347311B1/en not_active Expired - Fee Related

Patent Citations (5)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events