AU3508199A – Method, server and communication node for the establishment of fee-optimised communication connections
– Google Patents
AU3508199A – Method, server and communication node for the establishment of fee-optimised communication connections
– Google Patents
Method, server and communication node for the establishment of fee-optimised communication connections
Download PDF
Info
Publication number
AU3508199A
AU3508199A
AU35081/99A
AU3508199A
AU3508199A
AU 3508199 A
AU3508199 A
AU 3508199A
AU 35081/99 A
AU35081/99 A
AU 35081/99A
AU 3508199 A
AU3508199 A
AU 3508199A
AU 3508199 A
AU3508199 A
AU 3508199A
Authority
AU
Australia
Prior art keywords
communication
connection
fees
subscriber
communication path
Prior art date
1998-06-19
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
AU35081/99A
Inventor
Rolf Kotthaus
Hans Jurgen Dr. Matt
Peter Dr. Sauer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alcatel Lucent SAS
Original Assignee
Alcatel CIT SA
Alcatel SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
1998-06-19
Filing date
1999-06-16
Publication date
2000-01-06
1999-06-16
Application filed by Alcatel CIT SA, Alcatel SA
filed
Critical
Alcatel CIT SA
2000-01-06
Publication of AU3508199A
publication
Critical
patent/AU3508199A/en
Status
Abandoned
legal-status
Critical
Current
Links
Espacenet
Global Dossier
Discuss
Classifications
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
H04M15/80—Rating or billing plans; Tariff determination aspects
H04M15/8044—Least cost routing
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
H04M15/28—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP with meter at substation or with calculation of charges at terminal
H04M15/30—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP with meter at substation or with calculation of charges at terminal the meter or calculation of charges not being controlled from an exchange
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04W—WIRELESS COMMUNICATION NETWORKS
H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
H04W4/24—Accounting or billing
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
H04M2215/20—Technology dependant metering
H04M2215/2026—Wireless network, e.g. GSM, PCS, TACS
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
H04M2215/32—Involving wireless systems
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
H04M2215/42—Least cost routing, i.e. provision for selecting the lowest cost tariff
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04M—TELEPHONIC COMMUNICATION
H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
H04M2215/74—Rating aspects, e.g. rating parameters or tariff determination apects
H04M2215/745—Least cost routing, e.g. Automatic or manual, call by call or by preselection
Description
P/00/011 Regulation 3.2
AUSTRALIA
Patents Act 1990
ORIGINAL
COMPLETE SPECIFICATION STANDARD PATENT Invention Title: Method, server and communication node for the establishment of fee-optimised communication connections.
The following statement is a full description of this invention, including the best method of performing it known to us: FHPSYC\FNATPOT20\991670 1 .9 CE\99159(X)9.5 1 Method, server and communication node for the establishment of fee-optimised communication connections Field of the invention The present invention relates to a method for constructing fee-optimised communication connections by a communication facility, a server adapted to perform said method and a communication node adapted to perform said method.
Background of the invention Because of the deregulation of the telecommunication market, a subscriber can, during the establishment of a communication connection, mostly choose among communication 10 paths of different telecommunication networks over which the communication connection to a communication partner can be established. By dialling a code in addition to the number of the desired subscriber, a communication path can be specified on one of telecommunication networks. The selection of a communication path can, for example, be made according to which communication path can be expected to have the lowest fee, 15 or according to which communication path can provide a desired transmission quality.
Because a selection of a communication path according to the lowest fee requires a knowledge of the respective applicable rates, equipment for the private market has recently been offered which is inserted between the subscriber connection of a telecommunication network and the subscriber terminal, and automatically establishes a cost-effective communication connection to a communication partner. This feature is referred to as “Least Cost Routing” and is available in many private telecommunication installations, and in add-on boxes which are inserted between the subscriber connection and a terminal. In such a Least-Cost-Routing unit a tariff table is stored from which the equipment for establishing cost-effective connections can read the respective applicable fees and identification codes for the different communication paths. When the subscriber dials the number of a desired communication partner, the terminal first sends this subscriber number to the Least-Cost-Routing unit which then determines as cost-effective a communication path as possible, with the aid of its tariff table. Subsequently the Least-Cost-Routing unit establishes the desired connection by sending over the subscriber connection a connection request with the identification code of the previously-determined CE\991599.5(X 2 cost-effective communication path, and the subscriber number of the desired communication partner.
In general, however, by no means every subscriber has a Least-Cost-Routing unit, so that such a subscriber can only enjoy cost-effective communication connections if he knows the tariffs of possible communication paths and their respective identification codes, determines the most cost-effective path himself and then enters its identification code into his terminal. Even the owner of a Least-Cost-Routing unit must suffer some inconvenience, since the tariffs for possible communication paths are frequently changed by their providers and therefore the tariff tables stored in the Least-Cost-Routing unit must be updated after every tariff change. The owner must then inform himself about the current tariffs and enter these into the Least-Cost-Routing unit.
Summary of the invention S”According to a first aspect of the present invention there is provided a method for 15 constructing fee-optimised communication connections by a communication facility, with the steps: -Provision of a database by the communication facility in which the fees are stored :which accrue for the use of the communication paths which can be used by the communication facility for setting up a communication connection, -Request by a first subscriber to the communication facility for a connection to a second subscriber, -Determination of a communication path between the first and second subscribers using the most favourable total fees as a criterion, -Establishment of a communication connection between the first and second subscribers along the above-mentioned communication path, also comprising the additional steps of: -Determination of the unit fees applicable to the said communication connection, -Charging by the communication facility of the fees accrued to at least one of the CE\99159(X)9.5 3 subscribers.
According to a second aspect of the present invention there is provided a server for establishing fee-optimised communication connections where the server has a database in which the fees are stored which accrue for the use of those communication paths which can be used by at least one communication facility for establishing a communication connection, where the server is provided with means which are so designed that a first subscriber can indicate a request for a connection to a second subscriber, where the server is provided with means for determining a communication path between the first and second subscribers using the most favourable total fees as a criterion, and where the server is provided with means for requesting the establishment of a communication path between the first and second subscribers along the said communication path, characterised in that the server is provided with means for determining the unit fees applicable to the said communication path, and that the server is provided with means for charging the accrued fees to at least one of the two subscribers.
According to a third aspect of the present invention there is provided a communication node for establishing fee-optimised communication connections, where the communication node is provided with a database in which the fees are stored which accrue for the use of communication paths which can be used by the communication node for establishing a communication connection, where the communication node is provided with means with which a first subscriber can indicate a request for a connection to a second subscriber, where the communication node is provided with means for determining a communication path between the first and second subscribers using the most favourable total fees as a criterion, and where the communication node is provided with means for establishing a communication connection between the first and second subscribers along the said communication path, characterised in that the communication node is provided with means for determining the unit fees applicable to the above-mentioned communication path, and that the communication node is provided with means for charging the accrued fees to at least one of the two subscribers.
Brief description of the drawings In the following the invention and its advantages are described by means of a design CE\991591)0.5 4 example with the aid of the diagrams.
Fig. ishows an arrangement for implementing the method of the invention, consisting of a terminal SUB1, a terminal SUB2, a communication node EX1 according to the invention and a communication node EX2.
Fig. 2shows a communication node EX1 according to the invention containing a control unit CPU, a memory MEM and a switching unit SW.
Fig. 3shows an arrangement for implementing the method of the invention, consisting of a terminal SUB1, a terminal SUB2, a terminal SUB2B, a communication node EX1 according to the invention and a communication node EX2.
Fig. 4shows an arrangement for implementing the method of the invention, consisting of a terminal SUB 1, a terminal SUB2, a communication node EXX, a server SER according to the invention and a communication node EX2.
Detailed description of the embodiments In Fig. 1 an arrangement is shown with which the method of the invention can be 15 implemented. Starting from the terminal SUB 1 of a first subscriber, a connection is to be Woo established to a terminal SUB2 of a second subscriber, with the lowest possible fees.
:1 Both the terminal SUB1 and the terminal SUB2 are connected to a telecommunication network NW via subscriber lines which are not shown in Fig. 1. However, a connection path segment CON1 is shown which leads to the terminal SUB1 via the subscriber line and will be explained in more detail later, as well as a connection path segment CON3 which leads to the terminal SUB2 via the subscriber line and will also be explained in more detail later. A subscriber number is respectively allocated to each of the subscriber lines. In order to simplify the representation in the following, the subscriber number allocated to the subscriber connection of terminal SUB 1 will be referred to as the “subscriber number of terminal SUB and the subscriber number allocated to the subscriber connection of terminal SUB2 will be referred to as the “subscriber number of terminal SUB2”. The terminals SUB 1 and SUB2 can, for example, be telephone sets, fax machines or Personal Computers with means for connecting to a telecommunication network. The telecommunication network NW is shown with a communication node EX1 and a communication node EX2 as examples of other elements, not shown in Fig. 1. The CE\99159(X)9.5 communication nodes EX1 and EX2 can be connected via two communication paths CON2A and CON2B which can be used alternatively, and will be described in more detail later. The communication paths CON2A and CON2B can extend over various facilities, link lines and partial networks of the telecommunication network NW, not shown in Fig. 1, since the telecommunication network NW can, for example, be formed from a telecommunication network of a public operator, from leased lines and from the telecommunication networks of private operators, which can be in the form of land-line telecommunication networks or mobile radio telecommunication networks. Between the terminals SUB1 and SUB2, a communication connection can be established which 10 extends via the connection path segment CON1, the communication node EX1, the communication path CON2A or the communication path CON2B to the communication node EX2, and from there via the connection path segment CON3. This communication 9 connection is not shown in Fig. 1. Since the communication connection, however, extends via the above-mentioned connection path segments, which all have the 9999 w 15 abbreviation “CON” in their reference number, for simplicity this communication connection will be referred to in the following as “communication connection CON”.
When a communication connection is to be established between the terminal SUB 1 and the terminal SUB2, a connection is first established from the terminal SUB 1 to a 9.9 communication node EXI over the connection path segment CON1. For this, at the terminal SUB 1 the subscriber number of terminal SUB2 is entered, as well as a prefixed identification code of the communication node EX1. With the aid of the prefix, the telecommunication network NW can first establish the connection path segment CON1 to the communication node EX 1, namely starting from the subscriber connection of terminal SUB 1 via facilities and connection lines of the telecommunication network NW which are not shown in Fig. 1, for example via a remote unit, a local exchange and possibly via other exchanges, up to the communication node EX1. In order to notify the desired communication connection CON from the terminal SUB1 to the terminal SUB2 at the communication node EX1, the subscriber number of the terminal SUB2 is sent to the communication node EX1 as the connection target, and additionally the subscriber number of the terminal SUB 1 is sent as the connection source, for example with the aid of a signalling message from the Central Signalling Set No. 7 of the ITU-T, or if the CE\99159(X)9.5 6 connection path segment CON1 is maintained over a line of an ISDN telecommunication network, with the aid of a message on the D channel of this line.
As can be seen in Fig. 1, from the communication node EX1 the desired communication connection CON can be established to the communication node EX2 via the alternatively usable communication paths CON2A and CON2B, and from there to the terminal SUB2.
The communication path CON2A can, for example, extend over a land-line telecommunication network, the communication path CON2B over a mobile radio telecommunication network or over a Digital European Cordless Telecommunication (DECT) network. For simplicity, the facilities of these telecommunication networks, for 10 example exchanges and junction lines, are not shown in Fig. 1. However it is also .o possible that a direct connection exists between the communication node EX1 and the communication node EX2, for example a collective line for several communication connections, over which the communication path CON2A can also extend. Apart from the two communication paths CON2A and CON2B, other alternatively usable communication paths, which are not shown in Fig. 1, can also exist between the communication nodes EX 1 and EX2.
In order to be able to describe in more detail the operation of the communication node EX1, the significant components of the communication node EX1 will be explained in the following with the aid of Fig. 2, namely a switching unit SW, a control unit CPU and a memory MEM. The connection path segment CON1, known from Fig. 1, leads to the communication node EX1 and, within this communication node EX1, connects to the switching unit SW. In the switching unit SW a connection can be established from the connection path segment CON1 to the communication path CON2A or to the communication path CON2B, both of which exit from the communication node EX 1 and are likewise known from Fig. 1. The switching unit SW can, for example, be a switching matrix in an exchange which is controlled by the control unit CPU. The control unit CPU can, for example, be a processor which executes programs which are stored in the memory MEM. Communication path tables are also stored in a database in the memory MEM and in these tables communication paths usable from the communication node EX1, and the applicable fees for their use, are recorded. The control unit CPU, the memory MEM and the switching unit SW are respectively connected with each other via CE\99159(X)9.5 7 connections which are not shown in Fig. 2.
The communication path tables stored in the database DB are updated at regular intervals by the communication node EX1, for example by the communication node EX1 requesting the currently valid fee tariffs from the operators of communication paths CON2A and CON2B, or by the communication node EX1 evaluating its currently established communication connections and their respective applicable fees in order to determine the fee tariffs of the communication connection.
By reference to the components of the communication node EX1 shown in Fig. 2 the switching unit SW, the control unit CPU and the memory MEM the further processing of the connection request from the terminal SUB 1 to the terminal SUB2 will be described in the following with the aid of Fig. 1. After the communication node EX1 has received S the request for a connection from terminal SUB 1 to terminal SUB2, the communication nodeEX1 determines over which communication paths the terminal SUB2 can be reached. For this the control unit CPU evaluates the communication path tables in the database DB and first of all determines that the terminal SUB2 can be reached via the two alternatively usable communication paths CON2A and Con2B, the communication node EX2 and the connection path segment CON3. Then the control unit CPU investigates, with the aid of the communication path tables, over which of the two communication paths CON2A and Con2B the terminal SUB2 can be reached with the most favourable total fees. The control unit CPU can, for example, determine that the communication path CON2A is the most favourable communication path because, when the connection request was entered, the fee tariff is lower on the communication path CON2A than on the communication path CON2B. In addition to considering the fee tariffs on the communication paths CON2A and CON2B, the communication node EX1 also takes into account the applicable fees on the connection path segments CON1 and CON3 when determining the most favourable communication path. For example if the terminal SUB 1 is a terminal for a land-line telecommunication network, the terminal SUB2 is a terminal for a mobile radio telecommunication network and the communication path CON2B as well as the connection path segment CON3 are part of this mobile radio network, then for example the communication path CON2B can be selected as part of the communication connection CON for the further extension of the connection from the communication CE\99159(X9.5 8 node EX1, with the most favourable total fees, since especially at the transition from a land-line telecommunication network to a mobile radio telecommunication network particularly high fees are demanded for the network change. Such a network change is made possible by the communication node EX1 with its interface to the land-line telecommunication network towards the connection path segment CON1, and with its interface to the mobile radio telecommunication network towards the communication path CON2B. The communication node EX1 can thus establish the communication connection CON with especially favourable fees. Similarly to the network change to the mobile radio network, the communication node EX1 can provide a convenient access for
S..
the terminal SUB1 to the above-mentioned collective line, if the communication °t connection CON over this collective line is possible with the most favourable total fees, because such a collective line cannot normally be dialled directly in a convenient way from a terminal or included in a communication connection.
U. U° For determining the most favourable total fees for the communication connection CON, a table can also be placed into the memory MEM of the communication node EX1 in .which an average duration for calls is noted which are initiated by the terminal SUB1.
Then the control unit CPU, with the aid of the communication path table, can calculate what fees would apply to such an average connection, and thus select the most favourable communication path CON2A or CON2B. The consideration of the average duration of a
U
connection is, for example, advantageous if special discounts are allowed on a communication path for connections of different durations, or if the applicable fees change during the use of a communication path after a particular time interval. It is also possible for the communication node EX1 not to rely on average connection durations for the calculation of likely fees, but to request a probable duration of the connection from the terminal SUB1. For this the communication node EX1, after receiving the request for the communication connection CON, for example sends a voice message with such a request to the terminal SUB 1 via the connection path segment CON1. From the terminal SUB1, the probable duration of the connection can then be indicated to the communication node EX1, for example by means of Dual Tone Multi Frequency (DTMF) signals as in-band signalling.
CE\991590)9.5 9 In the design example the communication node EXI includes the communication path CON2A in the desired communication connection CON to the terminal SUB2 because the control unit CPU has selected the communication path CON2A as the communication path for a communication connection CON with the most favourable total fee. For this reason in Fig. 1 the communication path CON2A is shown as a solid line, the communication path CON2B as a dashed line.
When the communication path CON2A is a part of a direct collective line between the communication node EX1 and the communication node EX2, the communication node •EX1 can occupy a channel of this collective line to enable the further extension of the
S.
o• 10 desired communication connection CON. Then the communication node EXI transmits 0005 on this channel a request to the communication node EX2 to complete the establishment 0S OS ••0of the connection up to the terminal SUB2. The communication node EX2 then builds up the connection path segment CON3 to the terminal SUB2, so that the terminal SUB 1 and the terminal SUB2 are connected to each other. if the communication path CON2A extends over a part-network of the telecommunication network NW, then the communication node EX1 for example adds an identification code to the subscriber SS e *0•45 number of the terminal SUB2 and sends this identification code together with the subscriber number to the telecommunication network NW for the further establishment of the desired communication connection CON, for example using the already-mentioned
S~
Central Signalling Set No. 7. The telecommunication network NW then completes the setting up of the communication connection CON between the terminal SUB 1 and terminal SUB2 via the communication path CON2A, the communication node EX2 and the connection path segment CON3. if the communication path CON2A extends over several part-networks in the telecommunication network NW, then the communication node EX1 provides identification codes for each of the partial networks, as well as the subscriber number of the terminal SUB2, to the telecommunication network NW with the help of which the telecommunication network NW can set up the communication path CON2A via these partial networks.
After the communication connection CON between the terminal SUB1 and terminal SUB2 has been established, and is used subsequently by the terminal SUB1 and the terminal SUB2, the communication node EX1 determines the fees accruing due to the use CE\99159009.5 of the communication connection CON, that is the fees on the connection path segments CON1 and CON3, as well as on the communication path CON2A. For this, for example, the above- mentioned part-network of the telecommunication network NW through which the communication path CON2A extends in the above example, sends metering pulses to the communication node EX1 which the control unit CPU of the communication node EX1 can sum and charge to one of the subscribers using the communication connection CON, by an entry into the memory MEM usually for the subscriber calling from the terminal SUB1. However, the control unit CPU can also charge all the metering pulses to the called subscriber at the terminal SUB2, or partly to the calling subscriber at terminal SUB1 and the called subscriber at terminal SUB2. The memory MEM can be read later for the billing of the accrued fees.
However it is also possible, immediately after the communication connection CON is released, for the communication node EX1 to send the fees accrued by the communication connection CON and calculated by the communication node EX1 to a 15 billing unit of the telecommunication network NW which is not shown in Fig. 1. Apart from the fees determined by the communication node EX1, such a billing unit can for example store, in addition to the fees calculated by the communication node EX1, the V000.
fees registered by other facilities of the telecommunication network NW, so that later an 0 account can be provided for all fees accrued within the telecommunication network NW.
20 The services of the communication node EXI can be provided to the subscriber of communication node EX1 free of charge, as a special service. It is, however, also o o possible for a fee to be charged for the use of the communication node EX1. The communication node EX1 can charge the subscriber at the terminal SUB1 a service fee for determining the communication path according to the most favourable total fees, in 25 addition to the fees accrued due to the use of the communication connection CON. Such a service fee can be a fixed fee, or a variable fee which is determined, for example, by the savings that the communication node EX1 has achieved by its selection of the respective most favourable communication path.
If the duration of the communication connection CON exceeds either a planned duration or the duration deduced from average values, the fees actually accrued for the communication connection CON can exceed the predicted fees because, for example, a CF\99 I59(X)9.5 higher tariff rate applies on the communication path CON2A after a given period. Or after a given period the tariff rate on the communication path CON2B3 may be lower than that applying to the communication path CON2A. By means of its communication path tables, the communication node EX 1 can determine such fee variations and, for statistical purposes, can for example record them in its memory MEM. It is however advantageous if such fee variations are indicated to the subscribers on the communication connection CON. At least that subscriber who will be billed with the fees accrued on the communication connection CON will be interested in fee variations. If for example the fees are being charged to the subscriber at the terminal SUB 1, the communication node EXI can send a message via the connection path segment CONI to the terminal SUB 1 with the currently applicable tariff, or an advice regarding a more cost-effective connection possibility, for example by means of a voice announcement or a signal tone. If the connection path segment CONJ is part of an ISDN network, such a message can also be transmitted within the frame of user-to-user signalling on an ISDN D channel, such as *:15 is offered by the DSS 1 Protocol for ISDN telecommunication networks as the feature customer-specific signalling information during a connection” (with the abbreviation “UUS3”). The terminal SUB 1 can for example show the content of such a UUS3 message on a display.
As a reaction to the content of such a message, the subscriber at the terminal SUB 1 can, 20 for example, terminate the communication connection CON if the tariff has increased and the subscriber does not want to be charged these higher fees. After ending the communication connection CON, the subscriber can also have a new connection established to the terminal SUB2, by again requesting the communication node EXl to set up a new connection with the most favourable total fee. The communication node EXlI can for example include the alternatively usable communication path CON2B in the new communication connection.
However, it is also possible that the communication connection CON does not have to be terminated first in order to use either the communication path CON2A or the communication path CON2B for the communication connection CON which provides the communication connection CON with the most favourable total fee. After the communication node EXi has determined an alternatively usable communication path, CE\99159(X)9.5 12 for example the communication path CON2B, the communication node EX 1 can switch between the communication paths CON2A and CON2B while the communication connection CON remains, for example by placing both the communication paths CON2A and CON2B in parallel during a transition phase and then switching seamlessly from one communication path to the other. The communication node EXI can also carry out such a switchover automatically if this has been pre-arranged, for example by an appropriate entry for the terminal SUB 1 in the memory MEM.
Nevertheless, in some cases automatic switching may not be desired by a subscriber, for example because during the switchover the communication connection CON may be broken or disturbed for a short time, or because the communication connection CON is to be terminated in any case shortly after the possibility of a switchover was recognised. The communication node EXI then for example has a warning in its memory MEM that switching between communication paths is only permitted after receipt of an instruction.
Such an instruction can be sent by one of the terminals SUB1 or SUB2 to the 15 communication node EX1 as an instruction message in the form of signalling, with which S’the communication node EX1 is given an instruction for switching over. The instruction message can, for example, be sent to the communication node EX1 with the aid of the S above-mentioned in-band signalling with DTMF signals.
Another possibility results when the communication node EX1 determines, for a request 20 from terminal SUB 1 for a connection to terminal SUB2, that the desired communication connection CON to the terminal SUB2 can be established especially favourably if the communication connection CON between terminal SUB1 and terminal SUB2 is not established from the communication node EX1, but starting from the communication node EX2, in the form of a so-called “callback” function. The communication node EX 1 then first sends a message to the communication node EX2 with a request to set up the communication connection CON, and also advises over which of the communication paths CON2A or CON2B this is most advantageous. Then the communication node EX1 terminates the connection with the terminal SUB1 on the communication connection CON1. Thereupon the communication node EX2 establishes the desired communication connection CON between terminal SUB2 and terminal SUB1, according to the instructions, on one of the communication paths CON2A or CON2B. When the CE\99159009.5 13 applicable unit charges for the communication connection CON are sent to the communication node EX1, the communication node EX1 can in this case also determine the unit charges and charge the fees to one of the two subscribers.
In a particularly simple but efficient design version of the invention it is not even necessary for carrying out the above-mentioned “callback” function that two alternative communication paths CON2A and CON2B are available between the communication node EX1 and the communication node EX2, but possibly only one communication path, for example the communication path CON2A. In such a case, the communication node EX1 can first determine that the desired communication connection CON can in principle be established, and then determine that the communication path CON2A is usable with the most favourable total fee if it is started from the communication node EX2. The communication node EX1 then sends to the communication node EX2 an instruction to establish the communication connection CON. As already described, the communication node EX2 then sets up the desired communication connection CON between terminal 15 SUB2 and terminal SUB 1 over the communication path CON2A. The then applicable unit fees are transmitted to the communication node EX1 which then charges them to one of the two subscribers.
In addition to the fees to be expected on a communication path, the communication node EX1 can also take into account the transmission quality to be expected on the respective 20 communication path when selecting the most favourable communication path. For this, in addition to the tariff rates for each of the communication paths, a parameter for the transmission quality can be entered into the communication path table. Then if a minimum transmission quality is prescribed for a subscriber connection, for example the subscriber connection of terminal SUB1, by means of, for example, an entry in the memory MEM, then the communication nodeEX1 may possibly not select the communication path CON2A as the most suitable communication path for the communication connection CON, as in the above example, but the communication path CON2B because only the communication path CON2B offers the desired minimum transmission quality. A desired minimum transmission quality can also already be specified to the communication node EX1 together with a connection request. After the terminal SUB 1 is connected, as in the above example of the connection setup, with the CE\99159(X)9.5 14 communication node EX1 via the connection path segment CON1, the communication node EX1 can query the terminal SUB 1, for example by means of a voice announcement, for the entry of a desired transmission quality. The terminal SUB 1 can then prescribe a transmission quality to the communication node EX1, for example in the frame of an in-band signalling with DTMF signals. If then for example a number key is pressed on a keypad of terminal SUB 1, and a DTMF signal corresponding to this is sent from the terminal SUB1 to the communication node EX 1, then the communication node EX1 can for example deduce from this that a very good transmission quality is desired. Similarly, the communication node EXI can deduce from a DTMF signal corresponding to a numerical key that an average transmission quality is sufficient. The communication node EX1 then establishes the communication connection CON according to the prescribed transmission quality.
Fig. 3 shows components which are known from Fig. 1 which fulfill functions which are known from Fig. 1, and which are therefore given the same reference numbers. In 9..
addition, however, there is in Fig. 3 a terminal SUB2B which can be reached from the communication node EX1 via the communication path CON2C. Furthermore, Fig. 3 shows a terminal SUB1B and a connection path segment CON1B which will be discussed later. The terminal SUB2B is connected to the telecommunication network NW by its own subscriber line which is indicated by the communication path CON2C. The 20 terminal SUB2B is owned by the same subscriber, called the B-subscriber in the following, who also owns the terminal SUB2. Thus, for example, the terminal SUB2 can be a terminal for a land-line telecommunication network, and the terminal SUB2B a O terminal for a mobile radio telecommunication network. This B-subscriber therefore can be reached from the terminal SUB 1 either via the terminal SUB2 or the terminal SUB2B.
25 This alternative accessibility of the B-subscriber is recorded in the communication path table in the database DB of the communication node EX1. Like the communication paths CON2A and CON2B, the communication path CON2C can extend over various part-networks of the telecommunication network NW, for example via a mobile radio telecommunication network if the terminal SUB2B is a terminal for a mobile radio telecommunication network. When a connection request from the terminal SUB 1 to the terminal SUB2 is sent to the communication node EX1, the communication node EX1 CE\99159009.5 can consider the applicable fees on the communication path CON2C in addition to those on the communication paths CON2A and Con2B, when determining the most favourable communication path. If the fees on the communication path CON2C are lower than those on the communication paths CON2A or Con2B, the communication node EX1 establishes the desired connection to the terminal SUB2B, instead of to the terminal SUB2.
Like the B-subscriber, the calling subscriber at the terminal SUB1, referred to as the A-subscriber in the following, can be provided with an alternative terminal SUBIB, additional to the terminal SUB2. The terminal SUBlB is connected to the telecommunication network NW via a subscriber line. The location of this subscriber line is indicated by the connection path segment CONIB between the terminal SUBI1B and the communication node EX1. As was the case for the alternative access to the B-subscriber via the terminals SUB2 and SUB2B, the alternative usability of the terminals SUB1 and SUB1 by the A-subscriber is also recorded in the communication ooo path table in the database DB of the communication node EX1. When the A-subscriber sends a request for a connection with the terminal SUB2 from his terminal SUB1 to the communication node EX1, with the aid of its communication path table the communication node EX1 can determine, by considering all the possible connection path segments and communication paths which may be relevant to the connection request, that 20 an alternative connection between the terminals SUB1B and SUB2B is possible with more favourable fees than the requested connection between terminals SUB 1 and SUB2.
The communication node EX1 then notifies this to the A-subscriber, for example by a means of a voice announcement, terminates the connection via the connection path segment CON1 to the terminal SUB1, and instead of a connection between the terminals SUB1 and SUB2, establishes a connection between the terminals SUB1B and SUB2B.
The fees incurred by the latter connection, as well as any fees possibly incurred earlier on the connection path segment CON1, are calculated in the already-described way and charged to one or both subscribers.
When the B-subscriber does not have the alternative terminals SUB2 and SUB2B as in the previous example, but only a single terminal SUB2, the communication node EXI can also determine, for a request from terminal SUB 1 for a connection to terminal SUB2, CE\99159X)9.5 16 that the A-subscriber can be connected to the terminal SUB2 with the most favourable total fee by use of the alternative terminal SUB1B, and can then, in the way already described, establish a connection between the terminal SUB 1B and the terminal SUB2, as well as calculate the accrued fees and bill them.
Instead of the communication node EX1 according to the invention, a conventional exchange as used in telecommunication networks, working together with a server in accordance with the invention, can also be used. Fig. 4 shows such an exchange, referred to as exchange EXX, which is connected to a server SER according to the invention, via the connection CONS. The remaining components in Fig. 4 are identical in function with those of the same name from Fig. 1, and thus do not need to be explained further. The exchange EXX can for example be a so-called Service Switching Point (SSP), and the server SER a Service Control Point (SSP), of an Intelligent Network which communicate via the connection CONS with the aid of the already-mentioned Central Signalling Set No. 7 of the 1TU-T. The server SER can also be a computer module which is integrated into the exchange EXX and is connected with the exchange EXX via an internal proprietary interface. Like the communication node EX1, the server SER is also :provided with a control unit CPU, a memory MEM and a database DB into which the communication path tables are entered. In these communication path tables the communication paths are recorded which are usable from the exchange EXX, for 20 example in Fig. 4 the communication paths CON2A and Con2B. When the terminal SUB1 sends a request for a connection with the terminal SUB2 to the exchange EXX, •then the exchange EXX first passes this connection request to the server SER. This server then determines possible communication connections between the terminals SUB1 and SUB2 with the most favourable total fee, and then, depending on the result of its 25 determination, sends a message to the exchange EXX requesting it to extend the desired connection either via the communication path CON2A or the communication path CON2B. The fees accrued due to the connection between the terminals SUB 1 and SUB2, which for example reach the exchange EXX as metering pulses or charge messages, are then passed on by the exchange EXX to the server SER, calculated by the server and billed to one or both of the subscribers taking part in the connection, in the way described earlier.
Claims (13)
1. A method for constructing fee-optimised communication connections by a communication facility, with the steps: -Provision of a database by the communication facilityin which the fees are stored which accrue for the use of the communication paths which can be used by the communication facility for setting up a communication connection, -Request by a first subscriber to the communication facility for a connection to a second subscriber, -Determination of a communication path between the first and second subscribers using the most favourable total fees as a criterion, -Establishment of a communication connection between the first and second subscribers along the above-mentioned communication path, S•-Determination of the unit fees applicable to the said communication connection, and -Charging by the communication facility of the fees accrued to at least one of the 15 subscribers.
2. A method in accordance with Claim 1 wherein a second cost-effective communication path between the first and second subscribers is determined by the o* communication facility, according to the most favourable total fees if, during the connection, the fees applicable to the usable communication path change. o 20
3. A method in accordance with Claim 2 wherein the possibility of using the second communication path is indicated to at least one of the subscribers.
4. A method in accordance with Claim 2 wherein a changeover is made to the second communication path.
A method in accordance with Claim 3 wherein a changeover is made to the second communication path if the first or second subscriber indicates a request for a changeover to the second communication path.
6. A method in accordance with Claim 1 wherein, in the database of the communication facility, in addition to the fees, the respective transmission quality of those CE\9915900)9.5 18 communication paths is stored which can be used by the communication facility to establish a communication connection, that a desired transmission quality is specified in the request for a connection, and that the first communication connection between the first and second subscribers is determined according to the criterion of the desired transmission quality, as well as according to the criterion of most favourable total fees.
7. A method in accordance with Claim 1 wherein, if the first or second subscriber can be reached via communication paths which connect to different terminals, the communication facility determines that communication path between those terminals with which the first and second subscribers can be connected with the most favourable total fees.
8. A server (SER) for establishing fee-optimised communication connections where the server has a database in which the fees are stored which accrue for the use of those communication paths which can be used by at least one communication facilityfor establishing a communication connection, where the server is provided with means which 15 are so designed that a first subscriber can indicate a request for a connection to a second subscriber, where the server is provided with means for determining a communication path between the first and second subscribers using the most favourable total fees as a 99 9° criterion, and where the server is provided with means for requesting the establishment of a communication path between the first and second subscribers along the said 9* 9 20 communication path, wherein the server is provided with means for determining the unit fees applicable to the said communication path, and that the server is provided with means for charging the accrued fees to at least one of the two subscribers. soot•
9. A communication nodefor establishing fee-optimised communication connections, where the communication node is provided with a database in which the fees are stored which accrue for the use of communication paths which can be used by the communication node for establishing a communication connection, where the communication node is provided with means with which a first subscriber can indicate a request for a connection to a second subscriber, where the communication node is provided with means for determining a communication path between the first and second subscribers using the most favourable total fees as a criterion, and where the communication node is provided with means for establishing a communication CE\99159(X)9.5 19 connection between the first and second subscribers along the said communication path, wherein the communication node is provided with means for determining the unit fees applicable to the above-mentioned communication path, and that the communication node is provided with means for charging the accrued fees to at least one of the two subscribers.
A communication node in accordance with Claim 9 wherein the communication node contains means for transmitting and means for receiving messages on at least one signalling channel over which messages can be exchanged using the signalling codes which are customary between the exchanges of a transmission network.
11. A method substantially as hereinbefore described with reference to any one of the embodiments shown in the accompanying drawings.
12. A server substantially as hereinbefore described with reference to figure 4 of the accompanying drawings. S•
13. A communications node substantially as hereinbefore described with reference any 15 one of the embodiments shown in the accompanying drawings. Dated this 16th day of June 1999 Alcatel S. by its attorneys Freehills Patent Attorneys S 0 e•
AU35081/99A
1998-06-19
1999-06-16
Method, server and communication node for the establishment of fee-optimised communication connections
Abandoned
AU3508199A
(en)
Applications Claiming Priority (2)
Application Number
Priority Date
Filing Date
Title
DE19827285
1998-06-19
DE19827285A
DE19827285A1
(en)
1998-06-19
1998-06-19
Method, server and communication node for establishing fee-optimized communication connections
Publications (1)
Publication Number
Publication Date
AU3508199A
true
AU3508199A
(en)
2000-01-06
Family
ID=7871356
Family Applications (1)
Application Number
Title
Priority Date
Filing Date
AU35081/99A
Abandoned
AU3508199A
(en)
1998-06-19
1999-06-16
Method, server and communication node for the establishment of fee-optimised communication connections
Country Status (6)
Country
Link
US
(1)
US6269156B1
(en)
EP
(1)
EP0966148A3
(en)
JP
(1)
JP2000156747A
(en)
AU
(1)
AU3508199A
(en)
CA
(1)
CA2275006A1
(en)
DE
(1)
DE19827285A1
(en)
Families Citing this family (6)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
FI974651A0
(en)
*
1997-12-31
1997-12-31
Finland Telecom Oy
Vaegval baserat pao prissaettning
US6345072B1
(en)
*
1999-02-22
2002-02-05
Integrated Telecom Express, Inc.
Universal DSL link interface between a DSL digital controller and a DSL codec
DE10023868A1
(en)
*
2000-05-16
2001-11-22
Siemens Ag
Establishing connection between a local and a central communications device central control unit initiating new link establishment by accessing call-back module in central device
JP2002077257A
(en)
*
2000-08-31
2002-03-15
Nippon Telegr & Teleph Corp
Stream distribution network service method and its system
JP4330297B2
(en)
*
2001-09-21
2009-09-16
シャープ株式会社
Call terminal
US20070233603A1
(en)
*
2006-03-30
2007-10-04
Schmidgall Matthew M
Flexible routing of electronic-based transactions
Family Cites Families (27)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
JPH0310261A
(en)
1989-06-07
1991-01-17
Konica Corp
Color image forming device
JPH0370261A
(en)
*
1989-08-09
1991-03-26
Canon Inc
Picture communication equipment
GB9013605D0
(en)
*
1990-06-18
1990-08-08
Stc Plc
Mobile communications
JP2816385B2
(en)
*
1990-06-29
1998-10-27
富士通株式会社
Route selection method for PBX tenant service
US5473630A
(en)
*
1993-01-19
1995-12-05
At&T Corp.
Telecommunications rate data base accessing
TW284946B
(en)
*
1993-01-19
1996-09-01
At & T Corp
US5515425A
(en)
*
1993-01-19
1996-05-07
At&T Corp.
Telecommunications system with active database
US5802502A
(en)
*
1993-05-24
1998-09-01
British Telecommunications Public Limited Company
System for selective communication connection based on transaction pricing signals
US5425085C1
(en)
*
1994-03-18
2001-10-09
Rates Technology Inc
Least control routing device for separate connection into phone line
US6188756B1
(en)
*
1994-10-11
2001-02-13
Alexander Mashinsky
Efficient communication through networks
CA2159384C
(en)
*
1994-10-18
1998-09-22
Barry H. Freedman
Method for processing collect telephone calls
US5570417A
(en)
*
1995-03-28
1996-10-29
Lucent Technologies Inc.
System for automatically providing customer access to alternative telephony service providers
GB2300089A
(en)
*
1995-04-21
1996-10-23
Eurotel Telecom Limited
Least cost router in a telecommunications system
US5790642A
(en)
*
1995-04-28
1998-08-04
Dialogic Corporation
Competitively bidding service centers
US5870460A
(en)
*
1995-05-31
1999-02-09
Mci Communications Corporation
System for least cost routing of data transactions in a telecommunications network
DE19522998C2
(en)
1995-06-24
1997-05-22
Reis Standardwerk
Device for handling bank notes or similar sheet-shaped flexible objects
DE19522988A1
(en)
*
1995-06-28
1997-01-02
Sel Alcatel Ag
Procedure for charge information as well as service control device, subscriber exchange, terminal and communication network
US6078652A
(en)
*
1995-07-21
2000-06-20
Call Manage, Ltd.
Least cost routing system
US5862203A
(en)
*
1995-07-21
1999-01-19
Call Manage
Telecommunications call management system
US5764741A
(en)
*
1995-07-21
1998-06-09
Callmanage Ltd.
Least cost rooting system
US5712907A
(en)
*
1995-09-18
1998-01-27
Open Port Technology, Inc.
Pro-active message delivery system and method
US5606602A
(en)
*
1995-11-06
1997-02-25
Summit Telecom Systems, Inc.
Bidding for telecommunications traffic
DE19614926A1
(en)
*
1996-04-16
1997-10-23
Philips Patentverwaltung
Private telecommunications network
US6122352A
(en)
*
1996-12-19
2000-09-19
Nokia Telecommunications Oy
Method for controlling a credit customer call
DE19735950C1
(en)
*
1997-08-19
1999-04-22
Siemens Ag
Mobile communication system for charging for calls and mobile station
DE29714935U1
(en)
*
1997-08-20
1998-01-08
Elsdale Ltd
System for selecting at least one specific communication link
JP3204306B2
(en)
*
1998-03-03
2001-09-04
日本電気株式会社
Optimal call path re-search device
1998
1998-06-19
DE
DE19827285A
patent/DE19827285A1/en
not_active
Withdrawn
1999
1999-05-28
EP
EP99440123A
patent/EP0966148A3/en
not_active
Withdrawn
1999-06-04
JP
JP11158003A
patent/JP2000156747A/en
active
Pending
1999-06-15
CA
CA002275006A
patent/CA2275006A1/en
not_active
Abandoned
1999-06-16
AU
AU35081/99A
patent/AU3508199A/en
not_active
Abandoned
1999-06-17
US
US09/335,179
patent/US6269156B1/en
not_active
Expired – Fee Related
Also Published As
Publication number
Publication date
CA2275006A1
(en)
1999-12-19
DE19827285A1
(en)
1999-12-23
JP2000156747A
(en)
2000-06-06
US6269156B1
(en)
2001-07-31
EP0966148A2
(en)
1999-12-22
EP0966148A3
(en)
2000-05-03
Similar Documents
Publication
Publication Date
Title
EP0627150B1
(en)
1999-09-01
Third party charge
US6741691B1
(en)
2004-05-25
Call-back method for telecommunications and devices adapted accordingly
EP0452591B1
(en)
1996-06-12
Method and apparatus for the billing of value-added communication calls
AU720085B2
(en)
2000-05-25
Method and apparatus for providing an improved caller interface in a fixed cellular communications system
US6442260B1
(en)
2002-08-27
Method and system for transmitting information to a telecommunication terminal
JPH08500956A
(en)
1996-01-30
The method used to complete the telephone call
JPH08500954A
(en)
1996-01-30
Remote communication follow-me service
WO1999021350A1
(en)
1999-04-29
Method for arranging transaction based billing for telephone services
EP1106010A1
(en)
2001-06-13
Charging in a telecommunications system
JP2000101754A
(en)
2000-04-07
Charge informing method
EP1173970B1
(en)
2006-08-02
Call charges in a telecommunication network
CA2519807C
(en)
2011-02-08
Method for determining charges in real time for value-added services in a telecommunication network
AU3508199A
(en)
2000-01-06
Method, server and communication node for the establishment of fee-optimised communication connections
WO1998021900A1
(en)
1998-05-22
Method and arrangement for call forwarding in intelligent network
JP2004096249A
(en)
2004-03-25
Callback telephone call method using internet, computer-readable storage medium, and callback telephone call system
AU743988B2
(en)
2002-02-14
Procedure for obtaining instructions regarding a destination subscriber
US6370243B2
(en)
2002-04-09
Method for transmitting data traffic in a telecommunications system
JP3294445B2
(en)
2002-06-24
Billing system with stochastic discount function
RU2127494C1
(en)
1999-03-10
Method and system for processing data-traffic signals bearing information
JPH0730667A
(en)
1995-01-31
Alternative connecting system for communication line
JP2944150B2
(en)
1999-08-30
Private branch exchange billing control method
KR20030043533A
(en)
2003-06-02
System and method for providing the phone service by payment of receiving end according to user setting condition
KR100674344B1
(en)
2007-01-24
Method for managing small office home officeSOHO subscribers in FreePhone service
KR20020035378A
(en)
2002-05-11
accounting method for pre-paid card service
JPH07107209A
(en)
1995-04-21
Continuing device for public telephone line
Legal Events
Date
Code
Title
Description
2004-04-08
MK5
Application lapsed section 142(2)(e) – patent request and compl. specification not accepted
