Abstract:
The present invention provides an address analysis method for the next generation integrated network service. The address analysis method makes it possible to establish an outgoing or incoming call service in all kinds of address schemes while the integrated network interworks with a wired/wireless integrated network. The address analysis method for an integrated network service applied to an ATM, comprises the steps of: a)constructing an address analysis pointer determination database for determining an address analysis start pointer, and constructing an address analysis database for analyzing an address using the address analysis start pointer and a received address and an address information database for obtaining information of the address; b)determining an analysis start pointer in the address analysis pointer determination database by analyzing the received address information; and c)calculating an address information database link pointer by analyzing a corresponding address digit and the determined address analysis start link pointer of the address analysis database, and obtaining information of an address corresponding to the address information database link pointer.

Description:
BACKGROUND OF THE INVENTION  
         [0001]    1. Field of the Invention  
           [0002]    The present invention relates to a method for analyzing an address for the next generation integrated network service, and more particularly to an address analysis method for the next generation integrated network service applicable to an integrated network for making it possible to establish an originating or terminating call service in all kinds of address schemes while the integrated network interworks with a wired/wireless integrated network, and a computer-readable recording medium for implementing the address analysis method.  
           [0003]    2. Description of the Related Art  
           [0004]    Typically, the Internet for providing people with much abundant information through the medium of a computer has been composed of numerous virtual spaces, each called a Web site. The Internet has been rapidly developed along with a variety of communication networks being also rapidly developed. As one of these communication networks, there has been proposed a PSTN (Public Switched Telephone Network) having numerous lines throughout the world.  
           [0005]    As people&#39;s desires and technology required for more convenient living rapidly increase, many developers are intensively conducting research into a variety of new methods for more effectively use the Internet. One of the methods is a method for enabling a telephone, being a general main communication means, to be more conveniently used for surfing the Internet. Such a representative example is a commercial communication service such as an “Internet Phone” service or a “Dial Pad” service. Such typical techniques provide a user with a communication service over the Internet using a wide-range communication line and their own program on condition that the user clicks a phone number previously inputted or registered into the program.  
           [0006]    The above techniques recognize a unique identifier (ID) related to a subscriber&#39;s address over a variety of communication networks as well as the Internet, request a destination terminal&#39;s identifier from a server, and establish interconnection setup between the server and the destination terminal using an address of a real destination terminal. As a network becomes complicated and various terminals have been developed, a complicated interconnectivity between servers may be formed and much effort for establishing a mutual interworking operation between protocols is needed.  
           [0007]    In recent times, a recent trend of providing a subscriber with a convenience of use by integrating a variety of networks into one network requires an address analysis function conveniently applicable to an address scheme for supporting various kinds of protocols. In particular, at a current point of time having a development direction (i.e., a voice service, a data service, a wired/wireless integrated network service), there is a need for a new address analysis technique to be applicable to all kinds of address schemes, for example, an ITU-T (International Telecommunications Union Telecommunication) E.164 and E.191 or a NSAP (Network Service Access Point) defined by an ISO (International Organization for Standardization) 8348, etc.  
           [0008]    However, as for a typical address analysis method, a PSTN system and an ISDN (Integrated Services Digital Network) system can respectively accommodate only an E.164 address scheme, and an ATM (Asynchronous Transfer Mode) system can accommodate only an NSAP address scheme. Such a typical address analysis method is applied to only a local area, so that an address analysis method of an overall integrated network becomes ineffective in the case where the typical address analysis method interworks with the next generation integrated network, resulting in difficulties in managing the integrated network and in providing an integrated network interworking service.  
           [0009]    One representative example for solving the above difficulties is described in Korean Patent Application No. 1999-59968 (“INTEGRATED ATM NAMER SYSTEM CAPABLE OF SETTING UP SHORTCUT PATH IN NEXT GENERATION INTERNET AND METHOD THEREOF”), which is incorporated herein by reference. This method provides an originating call service on the Internet, provides traffics between a host destination and a router, and classifies the traffics into an IP (Internet Protocol) traffic, an IPoA traffic, and a pure ATM traffic according to characteristics of interfaces and the traffics in such a way that it provides a shortcut path in response to a destination address.  
           [0010]    However, since the aforesaid method in Korean Patent Application No. 1999-59968 only considers an Internet network for providing an ATM-based Internet service capable of setting up a shortcut path used for an integrated destination name address analysis function, it has a limitation in analyzing an address accommodating all address schemes for establishing an integrated network interworking service, and further, and it is unable to design/construct/manage the next generation integrated network.  
           [0011]    Another representative example is described in U.S. Pat. No. 6,243,384 (“Address Analysis for Asynchronous Transfer Mode Node with PNNI (Private Network-Network Interface) Protocol”), for storing PNNI protocol address information in an inactive mode, providing a call establishment state using an integrated table of an active mode upon receiving a network connection request, and thus effectively managing address information. However, this method has no address analysis method for accommodating all address schemes in case of being interoperable with the integrated network, resulting in a difficulty in managing the integrated network interworking operation.  
         SUMMARY OF THE INVENTION  
         [0012]    Therefore, the present invention has been made in view of the above problems, and it is an object of the present invention to provide an address analysis method for accommodating all address schemes to establish originating and terminating call services with a network accommodating a predetermined address scheme for the next generation integrated network service.  
           [0013]    It is another object of the present invention to provide a method for facilitating the design and construction of the next generation integrated network using an address analysis method accommodating all address schemes, and providing an effective integrated network management service.  
           [0014]    In accordance with one aspect of the present invention, the above and other objects can be accomplished by the provision of an address analysis method for an integrated network service applied to an ATM (Asynchronous Transfer Mode) switching system wherein an ALS (ATM Central Switching Subsystem) and an ACS (ATM Central Switching Subsystem) are connected to each other, comprising the steps of:  
           [0015]    a) constructing an address analysis pointer determination database for determining an address analysis start pointer, and constructing an address analysis database for analyzing an address using the address analysis start pointer and a received address and an address information database for obtaining information of the address; b) determining an analysis start pointer in the address analysis pointer determination database by analyzing the received address information; and c) calculating an address information database pointer by analyzing a corresponding address digit of the address analysis database, and obtaining information of an address corresponding to the address information database pointer.  
           [0016]    In accordance with another aspect of the present invention, there is provided a computer-readable recording medium in an ATM (Asynchronous Transfer Mode) switching system having a processor, wherein an ALS (ATM Central Switching Subsystem) and an ACS (ATM Central Switching Subsystem) are connected to each other, comprising: a first function for constructing an address analysis pointer determination database for determining an address analysis start pointer, and constructing an address analysis database for analyzing an address using the address analysis start pointer and a received address and an address information database for obtaining information of the address; a second function for determining an analysis start pointer in the address analysis pointer determination database by analyzing the received address information; and a third function for calculating an address information database pointer by analyzing a corresponding address digit of the address analysis database, and obtaining information of an address corresponding to the address information database pointer. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0017]    The above and other objects, features and other advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:  
         [0018]    [0018]FIG. 1 is a view illustrating a block diagram of a subsystem of an ATM switching system in accordance with the present invention;  
         [0019]    [0019]FIG. 2 depicts a database (DB) configuration in accordance with a preferred embodiment of the present invention, in more detail,  
         [0020]    [0020]FIG. 2 a  depicts an internal configuration of an address analysis pointer determination database (DB) in accordance with a preferred embodiment of the present invention, and  
         [0021]    [0021]FIG. 2 b  depicts internal configurations of an address analysis database (DB) and an address information database (DB) in accordance with a preferred embodiment of the present invention;  
         [0022]    [0022]FIG. 3 is a flow chart illustrating a procedure for determining an analysis start pointer of an address analysis database (DB) in accordance with the present invention; and  
         [0023]    [0023]FIG. 4 is a flow chart illustrating a procedure for processing an address analysis result after analyzing an address in accordance with the present invention. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0024]    Now, preferred embodiments of the present invention will be described in detail with reference to the annexed drawings. In the drawings, the same or similar elements are denoted by the same reference numerals even though they are depicted in different drawings. In the following description, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.  
         [0025]    [0025]FIG. 1 is a view illustrating a block diagram of a subsystem of an ATM switching system in accordance with the present invention. Referring to FIG. 1, a subsystem of an ATM switching system according to the present invention includes a plurality of ALSs (ATM Local Switching Subsystem)  1  and an ACS (ATM Central Switching Subsystem)  2 . The ATM switching systems are decentralized in units of the ALSs (ATM Local Switching Subsystems)  1 , and are interconnected via the ACS (ATM Central Switching Subsystem)  2 . A single ACS (ATM Local Switching Subsystem)  2  and two ALSs (ATM Local Switching subsystems)  1  are exemplarily depicted in FIG. 1, but a plurality of ALSs (ATM Local Switching subsystem)  1  may be used on behalf of the two ALSs.  
         [0026]    Firstly, a transfer network includes an ASNM (Access Switch Network Module)  3  in the ALS (ATM Local Switching Subsystem)  1 , an ISNM (Interconnection Switch Network Module)  4  in the ACS (ATM Local Switching Subsystem)  2 , a plurality of LIMs (Link Interface Modules)  5  between the ASNM (Access Switch Network Module)  3  in the ALS (ATM Local Switching subsystem)  1  and the ISNM (Interconnection Switch Network Module)  4  in the ACS  2 , and a plurality of IMs (Interface Modules)  6  for a subscriber/trunk.  
         [0027]    A control network includes a CCCP (Call Connection Control Processor)  7  for processing a call connection control function and an OMP (Operation &amp; Maintenance Processor)  8  for processing an operation/maintenance control function. The CCCP (Call Connection Control Processor)  7  contains a plurality of software modules for performing a variety of call connection control functions, a signal protocol process function, an access network link resource management function, a network node interface link resource management function, an internal switch link resource management function, a station number translation function, and a link and subscriber service profile data process function. The OMP (Operation &amp; Maintenance Processor)  8  contains a plurality of software modules for performing a system operation/maintenance function, a called number translation function, a route control function, and a route and number data process function. The CCCP (Call Connection Control Processor)  7  communicates with the OMP (Operation &amp; Maintenance Processor)  8  via a switch network module.  
         [0028]    The CCCP (Call Connection Control Processor)  7  determines an address analysis pointer using a variety of databases (DBs) for address information and an address analysis in the case where there is an address analysis request signal in an ATM network, and determines an address start point using the determined address analysis pointer. Subsequently, the CCCP (Call Connection Control Processor)  7  analyzes a status of an address digit corresponding to the address start point, and searches desired address information according to the address digit status.  
         [0029]    As described above, such a database (DB) used for the address analysis and the address information is shown in FIG. 2. FIG. 2 depicts a database (DB) configuration in accordance with a preferred embodiment of the present invention, in more detail, FIG. 2 a  depicts an internal configuration of an address analysis pointer determination database (DB) in accordance with a preferred embodiment of the present invention, and FIG. 2 b  depicts internal configurations of an address analysis database (DB) and an address information database (DB) in accordance with a preferred embodiment of the present invention.  
         [0030]    Referring to FIG. 2 a , the address analysis pointer determination DB  10  includes a NPI (Numbering Plan Identifier) field  11  for indicating a terminal number scheme, a TON (Type Of Number) field  12  for setting a type of a number, and an address start link pointer field  13 . The address start link pointer  13  is allocated to each tuple  14  according to key values of the NPI  11  and TON fields  12 . The address analysis DB  20  shown in FIG. 2 b  is a double linked list structure where address digits are linked to each other, and includes an address link pointer field  21 , an address digit field  22 , an address status field  23 , an address back link pointer field  24 , an next address link pointer field  25 , and an address information DB link pointer field  26 . The next address link pointer field  25 - 1  of the first tuple  27 - 1  in the address analysis DB  10  indicates a address link pointer field  21 - 2  of next(second) tuple  27 - 2 . Also, the next address link pointer field  25 - 2  of the second tuple  27 - 2  indicates a address link pointer field  21 -n of the n-th(last) tuple  27 -n.  
         [0031]    The address information DB  30  shown in FIG. 2 b  is constructed as a sequential structure by the number of addresses capable of being accommodated in a system, and is composed of N number of tuples  38 . The address information DB link pointer  26  of the address analysis DB  20  is used as a key to access a corresponding tuple  38 . The tuple  38  includes an address information DB link pointer  31 , a NPI  32 , a TON  33 , a call type  34 , a protocol type  35 , an address digit  36 , and an address length  37 , etc.  
         [0032]    As described above, the address analysis pointer determination database (DB)  10  is assigned an address start link pointer  13  corresponding to each tuple  13  according to values of the NPI and TON fields  11  and  12 . Two key values are determined on the basis of values of the NPI  11  and TON fields  12 , thereby determining the address start link pointer  13  according to the determined two key values. That is, in the case where there is an address analysis request signal in an ATM network, an NPI (Numbering Plan Identifier)  11  and a TON (Type Of Number)  12  of address information are checked in the address analysis pointer determination DB  10 . As shown in the address analysis pointer determination DB  10  of FIG. 2 a , the NPI field  11  determines three first key values, and a second key value of each first key value is determined on the basis of the TON field  12 . For example, if a NPI is an address scheme being not assigned, i.e., a type ‘unknown’, a first key value is ‘0’. If an NPI is an ISDN address scheme, a first key value is ‘1’. If an NPI is a NSAP address scheme, a first key value is ‘2’. Likewise, a first key value is determined as one of three values 0, 1 and 2 on the basis of a value of the NPI field  11 . In addition, if a TON is in a type ‘unknown’ for indicating not assigned type, a second key value is ‘0’. If a TON is a type ‘international’ for indicating an international number, a second key value is ‘1’. If a TON is a type ‘national’ for indicating a national number, a second key value is 2. If a TON is in a type ‘specific’ for indicating a specific setup number, a second key value is 3. If a TON is in a type ‘subscriber’ for indicating a terminal number, a second key value is 4. Likewise, a second key value is determined as one of five values 0, 1, 2, 3 and 4. In this case, as shown in FIG. 2 a , if a TON is in a type ‘unknown’ on condition that the NPI is in a type ‘unknown’, the address start link pointer  13  exists. If the TON is ‘international’, ‘national’, ‘specific’, or ‘subscriber’ on condition that the NPI is in a type ‘unknown’, there is no address start link pointer  13 . That is, this means that such key value does not exist.  
         [0033]    An address start link pointer  13  of each tuple  14  is determined on the basis of the determined two key values. Herein, the address start link pointer  13  is connected to the first address link pointer  21 - 1  of the first tuple  27 - 1  inside of the address analysis DB  20  of FIG. 2 b . That is, the address start link pointer  13  of the address analysis pointer determination DB  10  indicates the first address link pointer  21 - 1  of the first tuple  27 - 1 . As described above, the address link pointer  21 - 2  of the second tuple  27 - 2  is indicated on the basis of the first next address link pointer  25 - 1  of the first tuple  27 - 1 . The tuple  27  contains a plurality of information such as the address link pointer  21 , an address digit  22 , an address status  23 , a back address link pointer  24 , and the next address link pointer  25 , etc., and is assigned an address information DB link pointer field  26 . Herein, the address information DB link pointer  26  is connected to an address information DB link pointer  31  of each tuple  38  inside of the address information DB  30 .  
         [0034]    Referring to FIG. 2 b , an address digit status  23 - 1  is analyzed by accessing a first tuple  27 - 1  using a first address digit  22 - 1  among many input address digits. In the case where the address status  23 - 1  is connected to the next address digit  22 - 2 , a value of the next address link pointer  25 - 1  is connected to an address link pointer  21 - 2  of a tuple  27 - 2  corresponding to the next address digit  22 - 2  in such a way that a digit link toward the next tuple  27  is provided and a continuous link structure between digits is also provided. An address status  23 -n of a tuple  27 -n corresponding to the last digit is marked as the end of a link. A back address link pointer  24 - 2  of the tuple  27 - 2  is connected to an address link pointer  21 - 1  of the front tuple  27 - 1  in such a way that digits are backwardly linked to each other. An address information DB link pointer  26  of the last tuple  27  is connected to an address information DB link pointer  31  of a corresponding tuple  38  of the address information DB  30  in such a way that a relationship between the address analysis DB  20  and the address information DB  30  is maintained.  
         [0035]    A method for obtaining an address analysis start pointer using a database (DB) of FIGS. 2 a  will hereinafter be described with reference to FIG. 3. FIG. 3 is a flow chart illustrating a procedure for determining an analysis start pointer of an address analysis database (DB) in accordance with the present invention.  
         [0036]    Referring to FIG. 3, if an ATM network receives an address analysis request signal at step S 301 , an NPI, TON, and called party number among the received called/calling party number information elements and a calling protocol type are stored at step S 302 . Subsequently, the stored NPI is analyzed at step S 303 . One of steps S 304 , S 306 , and S 308  is performed on the basis of the analysis result of the step S 303 .  
         [0037]    If the NPI is an unknown address scheme ‘unknown’ at step S 303 , a program goes to step S 304  where a first key value is set to ‘0’. As previously typed, since a TON is in a type ‘unknown’ on condition that the NPI is in a type ‘unknown’, a second key value is set to ‘0’ by analyzing the TON at step S 305 . Therefore, address start link pointer  13  is calculated using the address analysis pointer determination DB  10  on condition that first and second key values are ‘0’, and then the first address link pointer  21 - 1  of the first tuple  27 - 1  inside the address analysis DB  20  is determined at step S 310  because the first address link pointer  21 - 1  is equal to the calculated address start link pointer  13 .  
         [0038]    But, if the NPI is an ISDN address scheme, a program goes to step S 306  where a first key value is set to ‘1’. The TON is analyzed in step S 307 . In this case, if the TON is a non-setting number ‘unknown’ at step  307 , a second key value is set to ‘ 0 ’. If the TON is an international number ‘international’ at step S 307 , a second key value is set to ‘1’. If the TON is a national number at step S 307 , a second key value is set to ‘2’. If the TON is a specific number ‘specific’ at step S 307 , a second key value is set to ‘3’. If the TON is a terminal number ‘subscriber’ at step S 307 , a second key value is set to ‘4’. Likewise, the address start link pointers  13  and the first address pointer  21 - 1  of the address analysis DB  20  are calculated using the address analysis pointer determination DB  10  on the basis of two key values of each pair of NPI and TON at step S 310 .  
         [0039]    In the meantime, if the NPI is a NSAP address scheme at step S 303 , a program goes to step S 308  where the first key value is set to ‘2’. Then, the TON is analyzed at step S 309 . In this case, if the TON is a non-setting number ‘unknown’ at step  309 , a second key value is set to ‘0’. If the TON is an international number ‘international’ at step S 309 , a second key value is set to ‘1’. Then, address start link pointers  13  and the first address link pointer  21 - 1  of the address analysis DB  20  are calculated using the address analysis pointer determination DB  10  on the basis of two key values of each pair at step S 310 . As described above, the second, third, . . . , last address link pointer  21 - 2 ,  21 - 3 , . . . ,  21 -n of the address analysis DB  20  are determined the next address link pointer  251 ,  25 - 2 , . . . ,  25 -(n−1) of the front tuple  27 - 1 ,  27 - 2 , . . . ,  27 -(n−1) respectively.  
         [0040]    An address analysis procedure and an address information calculation procedure using the address link start pointer  21  of the address analysis DB  20  and the received address will hereinafter be described with reference to FIG. 4.  
         [0041]    [0041]FIG. 4 is a flow chart illustrating a procedure for processing an address analysis result after analyzing an address in accordance with the present invention.  
         [0042]    Referring to FIG. 4, by using the address analysis DB  20 , a reach_flag is set to a false state ‘false’ at step S 401 . Herein, the reach_flag indicates an analysis result state of an address digit. In the case where a complete number at which the address digit is connectable is determined, the reach_flag indicates a state ‘true’. In the case where an incomplete number is determined, the reach_flags indicates a state ‘false’. Subsequently, the address start link pointer  13 , i.e., an address link pointer  21  of the address analysis DB  20 , is adapted as a first key, and an address digit is adapted as a second key in such a way that a corresponding tuple  27  of the address analysis DB  20  is searched at step S 402 . Then, a status of the address digit is analyzed, so that each address digit is analyzed at step S 403 .  
         [0043]    Upon receiving the analyzed result of the step S 403 , it is determined whether the address digit status is ‘none’ at step S 404 . If the address digit status is ‘none’ at step S 404 , it is determined whether the reach_flag is ‘true’ at step S 408 . If the reach_flag is ‘false’ at step S 408 , a program goes to step S 409  where an abnormal address process is performed. And, an abnormal process message is generated at step S 410 , and then a program is terminated. On the contrary, if the reach_flag is ‘true’ at step S 408 , a corresponding tuple  38  of the address information DB  30  is searched using a key value  26  stored in the address information DB  30  at step S 416 , and then corresponding address information required for a call control operation is obtained at step S 417 . Subsequently, a normal address process message is arranged at step S 418 , an execution success message is generated at step S 419 , and finally a program is terminated.  
         [0044]    In the meantime, if it is determined that the address digit status is not the state ‘none’ at step S 404 , a program goes to step S 405  where it is determined whether the address digit status is ‘next’ at step S 405 . If the address digit status is ‘next’ at step S 405 , an address link pointer  25  is obtained from the address analysis DB  20  at step S 411 , a program returns to step S 402  so that steps after the step S 402  are repeated.  
         [0045]    However, if the address digit status is not ‘next’ at step S 405 , a program goes to step S 406  where it is determined whether the address digit status is ‘reach’. If the address digit status is ‘reach’ at step S 406 , the reach_flag is set as a state ‘true’ at step S 412 , and the address information DB link pointer  26  of the address information DB  30  is obtained and stored at step S 413 . Then, an address link pointer  21  is obtained at step S 414 , a program returns to step S 402  so that steps after the step S 402  are repeated.  
         [0046]    On the other hand, if the address digit status is not ‘reach’ at step S 406 , then it is determined whether the address digit status is ‘last’ at step S 407 . If the address digit status is not ‘last’ at step S 407 , a program goes to step S 409  where a message is arranged as an abnormal address process at step S 409 , an abnormal process message is generated at step S 410  and then a program is terminated. Otherwise, if the address digit status is ‘last’ at step S 407 , an address information DB link pointer  26  of the address information DB  30  is obtained and stored at step S 415 . A corresponding tuple  38  of the address information DB  30  is searched using a key value of address information DB link pointer  26  of the address information DB  30  at step S 416 , and then corresponding address information required for a call control operation is obtained at step S 417 . Subsequently, a normal address process message is arranged at step S 418 , an execution success message is generated at step S 419 , and finally a program is terminated.  
         [0047]    As apparent from the above description, an address analysis method according to the present invention determines first and second key values of the address analysis pointer determination DB  10  by analyzing an NPI and a TON of a received address informaion, and thus determines an address start link pointer  13 . Then, the determined address start link pointer  13  is connected to an address link pointer  21  of the address analysis DB  20 , the address link pointer  21  of the address analysis DB  20  is adapted as a first key value, and an address digit  22  of the address analysis DB  20  is adapted as a second key value in such a way that a tuple  27  of the address analysis DB  20  is searched and an address digit status is analyzed in the tuple  27 . In this case, an address information DB link pointer  26  of the tuple  27  inside of the address analysis DB  20  is connected to an address information DB link pointer  31  of the address information DB  30  so that it is used as a key value for analyzing address information.  
         [0048]    In this way, an address digit status of the tuple  27  is analyzed, an address link pointer  21  is obtained on the basis of the address digit status, corresponding address information DB link pointers  26  and  31  are obtained and stored, a corresponding tuple  38  is searched using a key value of the address information DB link pointer  31  in such a way that information of a corresponding address is obtained. Likewise, one of a called network, a called node, and a called port is determined on the basis of an analysis result of an address being received from a network or a subscriber, so that the present invention can be applicable to all kinds of address schemes.  
         [0049]    An address analysis method and a procedure for processing an address analysis result in accordance with the present invention can be easily applicable to design/construct/manage the next generation integrated network.  
         [0050]    The address analysis method according to the present invention can accommodate all kinds of address schemes regardless of an address type, for example, an E.164 and E.191 of ITU-T or an NSAP defined by an ISO 8348, thereby providing the next generation voice and data service as well as a wired/wireless integrated network interworking service.  
         [0051]    Further, the address analysis method facilitates the design and construction of the next generation integrated network, and effectively manages the next generation integrated network.  
         [0052]    Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims.