Telephonic communications – Plural exchange network or interconnection – Connection call model
Patent
1997-10-10
2000-10-31
Zele, Krista
Telephonic communications
Plural exchange network or interconnection
Connection call model
379219, 379220, 379 14, H04M 700
Patent
active
061414107
DESCRIPTION:
BRIEF SUMMARY
This application is the national phase of international application PCT/FI96/00186, filed Apr. 9, 1996 which designated the U.S.
BACKGROUND OF THE INVENTION
The invention relates to a method according to the preamble of appended claim 1 and a system according to the preamble of appended claim 9 for routing traffic in a node of a telecommunication network. The solution according to the invention is intended to be used especially in an exchange for routing calls made by users of a telephone network towards a desired subscriber (the called subscriber).
When a subscriber of a telephone network makes a call, the destination assigned for the call is determined in the exchange in accordance with the numbers selected by the subscriber. Each node of the telephone network finds out the destination of the incoming call by analyzing the selected numbers. In order that each node could forward calls, given information is transmitted relating to each call attempt, which information will in the following be referred to as call attempt data. The call attempt data includes e.g. the calling address, the called address and information on what kind of transfer media is required by the call in question.
The same destination can generally be reached along several alternative paths. A set of alternative paths typically correspond to a given destination in a transit exchange. Until an exchange can start operating, its routing functions must be established: routes are to be created, routes are to be grouped into destinations and digit analyses are to be created for providing the desired destinations as results.
Although the destination can be reached by using several alternative paths, some of the paths are shorter than the others. As it is preferable to route calls along the shortest (direct) route, routing is often carried out in such a manner that direct alternatives are tested first.
Routing functions typically carried out in an exchange are illustrated in FIG. 1 in a somewhat clarified way. The routing principle is hierarchical in such a manner that origin and digit analyses are carried out at the beginning on the basis of information on the calling subscriber and the selected numbers. The origin analysis is carried out to find out the information relating to the origin of the call. The information concerning the subscriber may be e.g. the origin of the incoming route (or circuit) and the subscriber class of the calling subscriber. Thus the same selected digit series received from different incoming circuit groups or from subscribers belonging to different classes may lead to a different result. The destination is obtained as a result of the analyses conducted. For example, there may be 65,000 destinations in the Applicant's DX 200 exchange each of which can contain 5 subdestinations. Subdestinations are typically divided into three main classes: connections directed to another exchange, subscriber lines in the same exchange and service triggers that initiate some service. A service of this kind can be of a very simple type, e.g a voice message delivered to the subscriber or a more complicated service that requires a conversation with a more remotely situated database (such as the service control point SCP in an intelligent network or the HLR register in the GSM network).
The destination also includes a so-called charging index which is supplied to the charging analysis (not shown in the figure).
One destination typically contains information on several, e.g. five different subdestinations. The subdestinations can be arranged within the destination into a given priority order in such a manner that one of them is the main alternative for routing. If e.g. a congestion is detected on the first subdestination, the call can be transferred to some other subdestination.
Each subdestination is further connected to one outgoing or internal route. The circuit groups associated with the desired route are tested after this in a given order to find an idle circuit. At this context a circuit refers to a combination of two transmission ch
REFERENCES:
patent: 4669113 (1987-05-01), Ash et al.
patent: 4885780 (1989-12-01), Gopal et al.
patent: 4979118 (1990-12-01), Kheradpir
patent: 5086460 (1992-02-01), Ash et al.
patent: 5130982 (1992-07-01), Ash et al.
patent: 5291550 (1994-03-01), Levy et al.
patent: 5377262 (1994-12-01), Bales et al.
patent: 5402478 (1995-03-01), Hluchyi et al.
patent: 5848055 (1998-12-01), Fedyk et al.
Nokia Telecommunications Oy
Tieu Benny Q.
Zele Krista
LandOfFree
Routing traffic in a node of a telecommunication network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Routing traffic in a node of a telecommunication network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing traffic in a node of a telecommunication network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2062396