WO1999046924A1 - Call returning service - Google Patents

Abstract

It is shown a method of convenient call returning on the account of the initiator of the communication (that can drastically increase number of returned calls). Also it is proposed ringing without maintaining a path between communicating parties - so the huge (and unpaid) load caused by ringing can be almost totally avoided. The parking service is made possible to any phone and in different versions - according the caller's needs. The voice mail is answered automatically. Incoming calls get individual treatment including discrete messages. User of shared line gets a personal line including personal forwarding and mail box. Caller gets electronic secretary) 'speaking' with called party in appropriate language. The proposed 'calling secretary' and existing 'called one' are transferred from home of their owners to homes of opposite party (or closest computer) preventing payment for long-distant calling. Call-back companies can propose new services saving customers time and money.

Description

CALL RETURNING SERVICE TECHNICAL FIELD This invention relates to telecommunication systems, wired, wireless and hybrid ones. New forms of call returning are proposed and their various applications are shown.

BACKGROUND ART Abbreviations: C - Calling party

T - Terminator, called party

CE - C's exchange (public exchange, which C belongs to)

TE - T's exchange

CP - C's phone

TP - T's phone

\ - and/or

1. There are call returning services (below RS) allowing T to return a call without manual dialing of C number (e.g. in Israel public exchanges allow last call returning by dialing *42). But T must pay for it (sometimes without knowing who is C and what is the toll) - therefore many calls are not returned.

For calling on C's account, T can use automatic collect call service (ACCS) - but then T must know CP number, manually dial and verify it; T's name must be pronounced and C should recognize T's voice (but sometimes C hears T the first time in life). la. The toll-free access (1-800...) can be limited to a certain area. There exists no limitation to certain phone(s) or person(s).

2. Many calls are not returned because T does not know about being called. For avoiding this calling number identification (CID) or voice mail/answering machine (below VM) are used. But these devices/services have such disadvantages: l. They must be bought. ii. Having them, T must remember to look on them (e.g. upon returning home), iii. Getting a message, T must write CP number and dial it for call return, iv. T pays for call returning.

3. In "call parking service" (CPS), very often, after receiving a signal that T is free, C switches on but receives a message that T is busy again. Besides, in many cases (e.g. international calls, calls to terminals of private exchange, etc.) it is not possible to use this service - therefore calls are repeated (sometimes loading very long lines).

4. Call repetitions happen also when T hears ringing but cannot receive call before allowed ringing time expires, or when C interrupts call after 3 rings (to avoid activation of answering machine) and then calls again, and for other reasons. Said repetitions represent inconvemence to caller and load on the system.

Even when call is completed at the first attempt, maintaining a communication (CP-TP) path during the ringing represents essential load.

5. After TP answers, C sometimes waits a lot of time for a wanted T to approach TP, to prepare to talk session (e.g. to find a needed paper). C pays toll for waiting time and often also to secretary for routine work of session preparing. Sometimes operators of phone company are paid: e.g. C does not know French but wants to reach a person in a French hotel.

5a. On the called (T) side is often used electronic secretary that leads C to needed department, then C waits (listening to music!) for department's answer and afterwards begins waiting, as described in previous chapter. All this waiting time the whole CP-TE line is loaded. 6. If a line is shared by several users, the problem of privacy arises. C can be interested that a call or a message be received by certain T only and others will not hear even C's voice. Besides, a call to one may disturb others; if one orders "follow me", others do not receive calls.

7. CBS (call back services, which have appeared recently) increase impaid load on basic network, give no new convenience (on the contrary, it is very inconvenient for mobile customers). The only proposed advantage: toll decreasing is limited by manner of call management.

DISCLOSURE OF THE INVENTION 1. It is proposed unification of RS and ACCS into CRS (collect return service) which allows simple call returning (like RS) but on C's account (like ACCS). E.g. for returning the last call, it is enough to dial (e.g.) *52. If CLϋ manages list of received calls (RL), T can indicate in RL any number, add *52 and call will be returned to the chosen number (to C) by CRS. C will be told the T's number (and optionally - when the call to T was issued) and proposed to collect the returned call: e.g. by pressing button 1. If 1 is pressed - call will be completed on C's account. Instead of T's number, C may be played his/her message to T (if C left such in public voice mail) - for reminding C about the subject of call message is better than the T's number. The third possibility: allow T to record a short message - is worse (if message is too short: like in ACCS - it may not remind the subject; if prolonged - it may be used for free of charge information delivery). CRS may be easily built on the basis of ACCS.

A useful rule can be introduced : if a call is returned within a short (prescribed) time after issuing the initial - unanswered - call, it will be collected on C's account without asking C's permission (e.g. without asking C to press 1). It is unconditional CRS-UCRS. C can avoid it only by evident ban of call returning (e.g. in Israel C's number can be classified by dialing *43). On the other hand, C can allow T toll-free returning time much longer than said prescribed by mle; the time may be broken: C allows returning at certain periods. Call returning at toll-free time is even simpler than in RS: for T it is enough to rise handset and calling to C begins; T can be told which number call is retuming to; for interruption of the call, it is enough to press any button - e.g. to begin dialing to another number. Once interrupted call does not "reappear", but anytime T can get (e.g. by dialing *53) on display or by vocal means list of unconditional relxαming calls (URL) and choose any number for UCRS. Whereas RL may be stored at any place (at TP, T's office private exchange, etc.) - URL (at least copy of it) must be stored at public exchange(s). Most effective for various types of UCRS is maintaining URL on both TE and CE. When returned call arrives at CE, the last checks whether the calling number arrives in URL and if so, allows collecting the call on C's account.

For ensuring call return many C will pay even the high tolls demanded now by ACCS, but more justified (and may be more profitable) will be if for returned call collecting C pays the same toll as for issuing direct call to T. This principle can be easily implemented if C and T are customers of the same company: calls returned by T may be rewritten on C's account. But if it is not so, and even if tolls in opposite directions (between the same two points) are different - there can be proposed a solution satisfying all sides. One solution is such: dialing *52 (or *53) causes no real call return but only a signal to C that T is ready for communication. It is service analogous to CPS and may be performed by CPS means. When C switches on, a "direct call" to TP begins and C is charged. T after dialing *52 either switches off and waits for ringing, or TE simulates "real call returning": T holds handset and hears "ringing - to C" until call completion (or message that C refuses to collect the call). If CPS through signaling line is impossible, TP and CP numbers are delivered between TE and CE through "usual speech paths", said path being destroyed immediately after said delivery. Delivering TP number \ T's password through "speech path" may be used also when T is calling from "alien" phone. la. TP number is usually excluded from URL after one call return. But C can allow multiple returns for unlimited time for certain phone number or password. So constant toll-free access can be given to certain T (until C changes the order).

2. Instead of repeated calling to T, C can order a schedule of ringing from TE to T. When T rises handset, call is returned to C by UCRS. So C is free from burden of dialing, and CE-TE path - from load. Below is shown how said schedule can be corrected (ringing to T avoided when CP is busy or C leaves the room). If said correction is not performed and call returns when C cannot receive it - an individual message (TP number is recognized by C's CID) is played to T and T's answer is recorded by C's VM. Having no constant VM, C can hire temporal box. So the whole complex of problems of prior art is solved.

The described means can be used separately and without connection to the central idea of invention (CRS): i. Temporal voice boxes may be introduced. ii. CLDWM can be equipped with (or joined to) ringing means, actively asking for attention to existence of message or unanswered call, iii. hi period between beginning of hearing of certain message until beginning of hearing of following message (in some arrangements until the arrival of a new call), dialing of a constant (e.g. *45) causes call return to caller who has left said certain message. For this purpose CID can write the CP number in DTM form on the tape of answering machine (*45 causes dialing CP number directly from the tape). When public VM is used, hearing of message causes placing of CP number on the place where there are numbers of mcoming calls - so the call can be returned by RS (*42). When CID is impossible (or returning desirable to phone other than calling one), C can dial manually the number of phone which call should be returned to. iv. Not only messages from callers may be indicated by numbers, but also messages to callers. Expecting a specific call, T leaves in VM an individual message and attaches to it phone number or password. When expected call arrives, said numbers are recognized and specific callers receive appropriate messages. Some callers do not receive messages at all: as if VM do not exist for them; others receive a common message (like in "usual" VM). So each caller gets an "individual treatment". Below will be shown how to arrange differential "relation of VM" not only to callers but also to different owners of VM (sharing the same phone line).

3. When TP is "busy", C also orders ringing from TE to T (tins time, very frequent callings). In such way, freeing of any phone (including terminal of private exchange) can be revealed. When T reacts on said ringing, TE returns call to C, and it is completed quickly: if call is important to C, he/she waits near the phone and has ordered to reject calls from "3-d parties". So all disadvantages of CPs are avoided.

It may be opposite sequence: revealing (by frequent calling) that T is free, TE firstly issues a call to C and after its reception - a call to T is issued (we have here a full analogy to CPS from customer's point of view, but technical implementation is different).

The 3rd option: after TP "freeing" TE calls simultaneously to TP and CP.

Each of these three options has specific advantages and C should be given a possibility to choose.

The 3rd option can be easily implemented also in CPS - even without any change on exchanges. Receiving a signal that T is free, CP (itself, without C's order) issues a call to TP, simultaneously signaling to C that a call is in progress. Only small changes of phone device are needed, giving its owner essential advantages.

4. Introduction of UCRS opens the door for entirely new manner of call completion. After C's dialing, the pair of (CP, TP) numbers (and may be additional information) are delivered to TE, which rings to T and when TP is activated the call is returned to CP.

The said information delivering may be either on signaling line or the "usual" CP-TE the path is installed only for said delivery and afterwards is destroyed. So during ringing time there is no load on line between exchanges. Ringing may be of any form (e.g. activation of answering machine can be avoided) and of any duration - according to C's wish.

Calls from "3-d party" to C may be either rejected, or allowed but interrupted immediately when returned call arrives or treated otherwise - also according C's order (returned calls are distinguished from other by CID or by agreed special indicators). During ringing, CP may be switched on and for C can be created a full illusion of "usual call"; when C hangs off - the ringing is ceased (with slight delay which has not essential sequences). On the other hand, C can hang off immediately after dialing and wait ("unswitched" and "free-handed") for call returning; in this case the ringing to T may be of predetermined "standard" duration (which can be changed if C issues a special order).

5. C can order call returning not immediately after TP is achieved, but after needed T is found and prepared. TE can prepare the T side by such request: "Call to TIM. For talk with TOM about TABLE - press 1". C's action for delivering this request may be such: dial 11, say TIM, dial *, say TOM, dial *, say TABLE (11 - is code of the request, * - delimiter). If actions will be: 11 TIM** TABLE - then request will look so: "Call i TLM. For talk about TABLE - ...". 11 TIM*TOM* means: "Call tøTIM. For talk with TOM - ...". 11 TIM**: "Call TIM - ...". 11**TABLE: "For talk about TABLE - ...". l l*TOM*: "For talk with TOM -...".

Voice insets may be also encoded (dialing used instead of pronouncement),, but it is possible only for limited number of words. Here helps the fact that C's name (TOM) and the subject of talk (TABLE) must not be real ones: C and T may agree (e.g.) that TOM means KlausYT ABLE- WAR (there can be agreement also about T's name, but it must be known to all TP owners). So list of 40-50 encoded words may be useful - especially if it is desirable that C's voice is heard on T's side only by certain T.

C can order language of the request or of any part of it. E.G., 1st sentence (Call to TIM) may in three languages, the 2nd in one only. Without C's order the language will be of the country where TE is located, but T can demand translation. Encoding-decoding program can be installed not only on TE but also on private exchange of T's office or even on TP. In the last case, T chooses the basic language for requests.

Aspects of this chapter are the following: i. An electronic secretary is proposed, requesting T side: C's secretary - below CES (prior art knows only T's electronic secretary, requesting C). C gives the order, CES "talks" with T side during preparation period, ii. CES may be at any point of CP-TP path. The most effective implementation is following C gives order to computer of CP or CE, the last transmits said order to computer of TE or TP and the very last plays role CES "talking" with T side; when T is prepared - call is returned to C. The long human- computer dialogs (C's ordering and especially CES "talking") load short (if any) lines; trucks between public exchanges (CE-TE) are loaded only short time by delivering data between computers. iii. It is proposed usage of standard (common) requests into which C inserts individual voice insets. Said requests and their languages are encoded. It can be encoded whole set of requests and a number of words for replacing voice insets - so between computers can be transmitted only a short chain of short numbers, reducing to rninimum load of trucks.

5a. The aspects of previous chapter may be used separately, e.g.: i. Aspect of CES creation may be used without idea of truck unloading. CES can be on CP. Then the load on trucks will not be decreased (moreover it may be even increased relatively to existing communication) - but C gets an electronic secretary: preparing T saves costly human time. In this case, there is no call returning. ii. On the other hand, aspect of trucks unloading may be used for existing C requesting. Programs of C requesting are based on very simple schemes and can be easily encoded and quickly transmitted between computers. When C contacts the remote T's computer with requesting program, the last is transmitted to computer closest to C (e.g. to CE), C hears the requests from the closest computer and presses series of buttons; when completed, said series (may be together with requests for T preparation) is transmitted to T computer and begins r nging to T's department; when the last answers (or may be after T is prepared) call is returned to C. In this case, we have not a sole call returning, but multiple reinstallations of CE-TE line.

6. Privacy (despite line sharing) may be achieved in the following way (which may be implemented on exchanges or on smart phones). It receives individual number (IN - usually one digit) known to public (or delivered by C requesting service: e.g. "For call to TIM - dial 2"). C dials T's IN (in addition to TP number) whoever rises TP handset hears: "A call to TIM" (it can be said even before handset rising: instead of ringing). Only specific T can receive (return) the call: by dialing password (known only to T). If password is not dialed within predetermined line, an individual message can be left (for hearing it, password is needed as well). When T orders "follow me", only calls to T are forwarded to places according to T's order: it can be a schedule (at certain time - to certain place), or priority list, or simultaneous ringing, to several places, etc. Ringing of forwarded calls (for guests!) should be different than "usual ringing" (for hosts): e.g. "guest ringing" may be of 1-2 rings only; at places without guest nobody will react to guest ringing, only guest goes to the phone and returns the call dialing (e.g. *52) and password.

C can allow call returning (from TP and "host places") without password - then other (than T) can do it. On the basis of one "physical line" are created mutual individual lines. It is obvious that some of the above improvements may be used without call returning: password can be used for receiving individual calls if C remains on line enough time. 7. Comparison with CBS is given in the following chapter.

PREFERRED EMBODIMENT Here is shown how proposed services are supplied by special exchange (SE) without interference with structure of basic network. Whereas CBS exchange returns call "knowing" only who is C, SE does it "knowing" also what C wishes and after fulfillment of the wish (e.g. after T is ready to communicate). C's order to SE includes: TP number and requests for preparing T, C's password, number for call returning and allowed time for said returning. It is proposed to use data accumulator (DA) that gives the following advantages:

1. It saves manual introduction of data which has not changed after previous order; in most cases, only TP number has to be renewed.

2. The data can be delivered to SE with high speed, e.g. by low toll. If even such toll is to be avoided, the method of CBS can be used: deliberately unanswered calling (DA can be equipped with program of delivering information to SE by series of calls to different numbers with different intervals between calls). DA can be either stationary (installed between CP and the line) or mobile (transmits data when coupled with microphone) or hybrid one. Stationary DA can be used for rejection calls other than returned: DA can open time slots by "agreement" with CE (3-d partly has little chance to enter into the slot and usually receives "busy"); another "agreement" may be about special signaling for returned calls: e.g. it can be fax-ringing hybrid. DA can be equipped with sensor of a tag carried by C - so if C is not in the room, when £E is scheduled to call to T - DA issues a ring (of certain duration) to SE avoiding the scheduled call; analogous signal is issued if CP is busy.

If not only C is a customer of SE but also T - it is easy to implement measures of chapter 6 of disclosure. If T is "alien", there may be used such a request: "Call to TIM. If absent - press 2. For talk about TABLE - dial code". C and T have preliminary agreed code related to TABLE; C includes it in order to SE; for call returning, T must answer by the same code. It 2 is pressed - a new request arrives: "For forwarding a call to TIM - press 3 and dial number. For helping to find TIM - press 4 and leave a message" etc.

A wide range of services can be supplied by SE as described here and in disclosure. There is no problem of service implementation and of charging C by SE. As for "basic network", the new services will be much more effective if local public exchanges are involved; designers of exchanges of various type using technical (not inventive) skill, can achieve said effectiveness. It should also be mentioned that many of the measures proposed for completion of the central idea (call returning on C's account) may have independent use - therefore dependent claims should be paid attention to almost equal to main claim.

Claims

1. Method of call returning, wherein toll of call returned by T is placed on C's account (C collects returned call).

2. Method according to 1, wherein in case of "no answer" calling is not repeated from CP but from TE to T according to a schedule ordered by C and when T activates the phone (rises handset) the call is returned, as in 1.

3. Method according to 1, wherein in "busy" case calling is repeated from TE to T with high frequency until revealing that TP is free.

4. Method according to 1, wherein not only repeated but already the first call is made from TE to T according to C's order delivered to TE either on signaling line or on speech path which is destroyed immediately after order delivery.

5. Method according to 1, wherein a call is returned not immediately after TP activation but after T's preparation to communication.

6. Method according to 1, wherein call can be returned not by any person (who incidentally is near TP) but only by one chosen by C.

7. Method according to 1, wherein C permits call collection after it is returned by T.

8. Method according to 1 and 7, wherein C is reminded about call's subject by pronouncement/display of TP numbe time of issuing the initial call (from C to T)\ by playing the message to T (if C left such)\by recording of short T's message to C.

9. Method according to 1, wherein during predetermined time after initial call the returning call is collected without C's permission.

10. Method according to 1, wherein C permits call collection preliminary (under some conditions: like returning within certain time periods).

11. Method according to 1, wherein returned calls are recognized by CID or through dialing (by T) the phone numbeήpassword.

12. Method according to 1, wherein C permits to certain phone numbers\passwords unlimited number of returns for unlimited time.

13. Method according to 1, wherein calls are really returned from TP to CP and afterwards rewritten from T's account to C's one.

14. Method according to 1, wherein when TP is activated, it is signaled to CP, and after CP activation, a call from CP to TP is issued.

15. Method according to 2, wherein a call of said schedule is abolished when CP is busy or C is absent.

16. Method according to 9, 10, 11 and 12, wherein when C is absent, T receives an individual message (TP number is recognized by CID, or T is identified otherwise).

17. Method according to 16, wherein C hires a temporal box for said individual message.

18. Method according to 1, wherein individual messages are recorded for different users of shared line and can be received by dialing password.

19. Method according to 1, wherein the number for call returning is written on tape together with voice message.

20. Method according to 1, wherein when playing a message by public VM of T, the C's number is placed where number of last mcoming call is - so call can be returned automatically.

21. Method according to 3, wherein after said revealing, TE issues calls either firstly to T and after T's answer to C, or in sequence opposite to previous or to C and T simultaneously (any of these 3 options - according to preliminary C's order).

22. Method according to 4, wherein said order points out different forms of ringing.

23. Method according to 4, wherein during C's waiting for call returning other (than returned) calls are treated according to C's order (returned call is distinguished from other calls by CID or special indicators; special time slots for call returning may be introduced).

24. Method according to 4 and 23, wherein during said waiting, CP is switched on and C has an illusion of "usual call; ringing from TE to T is ceased when CP is switched off.

25. Method according to 4 and 23, wherein during said waiting, CP is switched off, ringing to T is ceased after predetermined (standard) time or according to special C's order.

26. Method according to 5, wherein an electronic secretary for C is introduced: a program preparing T to communication.

27. Method according to 26, wherein said program includes common (standard) requests into which can be inserted specific insets; said requests, their languages and common insets are encoded - specific requests are constructed according to agreed rules (uncommon insets are inserted by voice); languages are chosen by communication system according to common circumstances and can be changed by preliminary C's order or on T's demand while hearing the requests.

28. Method according to 1 (and partly 5, 26, 27), wherein the proposed programs for T requesting and existing programs for requesting C are transferred from remote computers to ones close to requested human.

29. Method according to 6, wherein user of shared line receives an individual number (IN - which by any means made known to public) and on the other hand, there is a password known to said user only; calling to said user (T), C dials (besides TP number) T's IN - call can be received/returned only using T's password.

30. Method according to 29, wherein C, using password, orders forwarding of individual calls; a schedule may be used (at certain time - to certain place, priority list, simultaneous calling to several places, etc.) for reception/returning of forwarded calls must be used the password, unless C allows "free reception".

31. Method according to 30, wherein ringing of forwarded calls is different than "usual" one (short ringing of 1-2 rings recommended).

32. Method according to 29 and 30, wherein T's name appears at display during the ringing or is pronounced instead of ringing.

33. Method according to 27, wherein C and T agree that certain encoded common inset means a certain theme or name and certain password is attached to said inset.

34. Accumulator to which data is inserted before communication session and is rapidly transmitted during session.

35. Accumulator according to 34, which is carried by customer and transmits data when coupled with microphone.

36. Accumulator according to 34, which is installed at entry to phone set (or is built in) and besides data transferring deals with other call treatments (like distinguishing between returned calls from other ones).

37. Accumulator according to 34, which represents hybrid of accumulators of claims 35 and 36.