Communication routing method with income optimization for telecommunication networks

• US 5,463,686 A
• Filed: 04/13/1993
• Issued: 10/31/1995
• Est. Priority Date: 04/17/1992
• Status: Expired due to Fees

• Current Assignee: Orange S.A.
• Original Assignee: Orange S.A.
• Inventors: Lebourges, Marc
• Primary Examiner(s): Hofsass, Jeffery A.
• Assistant Examiner(s): WEAVER, SCOTT LOUIS
• Application Number:
  US08/045,390
• Time in Patent Office: 931 Days
• Field of Search: 379/219, 379/220, 379/221, 379/229, 379/230, 379/112, 379/113, 379/115
• US Class Current: 379/221.07
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

A list of routing objects is associated with each switching node of a telecommunication network. This list includes a plurality of routing objects whose parameters are described in tree-structure form. Responsive to a call message received by said node, routing objects of the list whose parameters have tree-structure descriptions included in tree-structure descriptions of signalling elements of the call message are searched. Among all these routing objects, an object having a maximum gain is selected so as to route a communication associated to said call message according to a downstream path parameter of the object selected. Gains for each object are computed as a function of charge recorder information. New objects are created by incrementing by one level the tree-structure of each parameter of said maximum gain object. Each object whose difference in gain per communication with the maximum gain object is high is maintained. The other objects, which are less advantageous from an economic point of view, are deleted.

Claims

1. A method for routing a communication signal at a switching node of a telecommunication network having a plurality of switching nodes during a set-up procedure of said communication signal, comprising the following steps:

(a) associating a list of routing objects with said switching node, each of said routing objects including five parameters defining a network path from a predetermined origin in said communication network, said parameters including an origin parameter associated with a predetermined origin of said communication signal in said network, a destination parameter associated with a predetermined destination of said communication signal in said network, an upstream path parameter associated with at least one network component upstream of said switching mode, a service parameter associated with at least one network condition necessary for routing said communication signal, and a downstream path parameter associated with a network component downstream from said switching node to said predetermined destination, each of said five parameters being described in a tree-structural form arranged to be constituted by a plurality of levels, each said routing object having a predetermined economic gain-per-communication associated therewith;

(b) transmitting a call set-up message during said set-up procedure, said call set-up message including a first signalling element designating a first call origin and a first call destination of said communication signal, and a second signalling element designating a first upstream path from said first call origin up to said switching node, each of said first and second signalling elements being described in a tree-structural form arranged to be constituted by a plurality of levels;

(c) searching for and identifying routing objects compatible with said call set-up message among said routing objects of said list of routing objects associated with said switching node, said origin, destination and upstream path parameters of each of said compatible routing objects each being described in a tree-structural form having fewer levels than each of the tree-structural forms describing said first and second signalling elements, respectively;

(d) selecting from among said compatible routing objects a routing object having a selected maximum economic gain-per-communication where an economic gain-per-communication for each routing object is defined as an average difference between incomes and costs accounted in real-time depending on charging information for each of all said communications compatible with a particular routing object;

(e) associating logically said communication signal with said selected routing object having a maximum gain-per-communication, so as to route said communication signal along a selected downstream path defined by a downstream path parameter included in said selected routing object, and

(f) updating said economic gain of said selected routing object as a function of charging information associated with routing of said communication signal along said selected downstream path after receiving said call set-up message.

2. The method claimed in claim 1, where step (f) comprises the following sub-steps:

(i) creating new routing objects after receipt of "N" call set-up messages into said switching node where "N" is a predetermined integer at least equal to one, the number said new routing objects being created to equal no more than five, each of said new routing objects being virtually identical to the selected routing object with the exception of a single different parameter in each of said new routing objects where the tree-structural form level of each single different parameter is incremented by one;

(ii) computing an economic gain-per-communication for each of said new routing objects based upon communications being set up using call set-up messages for which first and second signalling elements are compatible with the origin, destination and upstream path parameters of said new routing objects; and

(iii) deleting from said list of routing objects any routing object for which a product of an absolute value of a difference between an economic gain-per-communication of a new routing object and an economic gain-per-communication of said selected routing object and a number of communications being set-up and associated with said new routing object is less than a predetermined threshold.

3. The method claimed in claim 1, wherein in step (d) said costs are calculated using real-time charging information as follows:

when a redirection from a first downstream path to a second downstream path occurs, where said first downstream path is defined by said downstream path parameter of said selected routing object and said second downstream path is defined by a second downstream path parameter of a second routing object compatible with said call set-up message, a cost resulting from said redirection is equal to a difference between a first expected economic gain and a second economic gain where said first economic gain is equal to said maximum economic gain-per-communication of said selected routing object if said communication had been routed along said first downstream path and said second expected economic gain is equal to a second gain-per-communication if said communication is routed along said second downstream path.