The present invention relates generally to cost efficient communication solutions. More particularly the invention relates to a system for establishing a telephone connection according to the preamble of claim 1 and a corresponding method according to the preamble of claim 7. The invention also relates to a computer program product according to claim 13 and a computer readable medium according to claim 14.
The advent of the Internet has created a new medium through which data can be exchanged very cost efficiently over vast distances. Recently, numerous designs have also been presented that enable telephone traffic to be effected via the Internet. Thus, the otherwise so expensive long distance rates can be reduced significantly. However, the known solutions in this area are disadvantageous for various reasons, primarily with reference to lack of compatibility. Namely, either a dedicated Internet service must be used, such as MSN® or Skype™, or tailormade terminals are required. In both cases it becomes relatively complicated and/or expensive to make and receive phone calls to/from users who are not subscribes to the same service as the other party. Alternatively, so-called double dialing or dial-through may be employed. This means that the caller first dials a local access number, and thereafter enters a pause sign (or equivalent character, e.g. represented by a “P”) plus an international number to the callee. One major drawback with this approach is that it is comparatively complicated to store the callee's number in a conventional software telephone book of the user terminal because different terminals may use different notation standards and different network operators may require different formats to invoke the service.
Of course, if a local telephone number were registered in each region/country where a user has friends, relatives, business partners etc. who the user wishes to offer an inexpensive calling alternative, and if all calls to any of these numbers were routed to the user's home subscription, the user could be reached on a local call rate “irrespective” of the caller's location. Nevertheless, such a solution would only be cost efficient for the callers, since maintaining and administrating the local telephone numbers is relatively expensive for the callee, particularly if he/she desires local numbers in many countries/regions.
The US patent publication No. 2006/0003770 discloses a solution for routing telephone calls to and from wireless phones using a low cost communications network other than a traditional telephone circuit switched network, e.g. the Internet. Here, a virtual phone client is implemented in the wireless phone for communication with a virtual phone server accessible via the wireless network. To effect calls, the client also communicates with an Internet gateway identified by the server. However, having to install the virtual phone client in the user terminal renders the solution inflexible. The network coverage is also comparatively limited. Moreover, the routing and billing schemes become relatively complex.
Providing caller identification may be complicated when routing telephone calls over the Internet. The US patent publication No. 2004/0048606 describes one example of a solution to this specific problem.
Still, the problem of interconnecting standard-type telephones (with POTS/wireless subscriptions) via the Internet in a manner being both cost efficient and technically feasible remains to be solved.
The object of the present invention is therefore to solve the above problems, as well as to provide a solution for telephone services, which is user-friendly, straightforward and reliable.
According to the invention, the object is achieved by the system as initially described, wherein the system includes a host resource adapted to route a call from the first terminal to the second terminal based on a unique combination of the first network identity and a first common telephone number in the first home telephone network dialed by the first terminal. The first common telephone number is here adapted to be shared among a first group of users in the first home telephone network. The system also includes a first interface node connecting the first home telephone network to at least one interconnecting network, and a second interface node connecting the second home telephone network to at least one of the at least one interconnecting network. Here, it is presumed that at least one of the at least one interconnecting network is represented by a packet switched network. Moreover, each of the a first and second interface nodes is adapted to handle telephone traffic over packet switched networks.
One important advantage of this system is that a user in the system can be conveniently called via a local number from each predefined caller. The overall fixed costs can also be held low, since a relatively small number of common telephone numbers (i.e. switchboard numbers) can be shared among a very large group of users. Furthermore, the Internet can be used to bridge any distances between the communicating parties at a constant and low rate.
According to one preferred embodiment of the invention, the host resource is adapted to route calls from each of a first number of first terminals in the first home telephone network to each of a second number of second terminals in the second home telephone network. To this aim, the host resource is associated with a database that stores one entry for each unique combination of: (i) the first network identity of each of the first terminals, (ii) the second network identity of each of the second terminals, and (iii) a respective first common telephone number to be dialed by each first terminal to reach each of the second terminals. Hence, looking up an intended callee/terminating terminal based on the first network identity (e.g. the caller's CLI (calling line identifier)) and the first common telephone number becomes very straightforward.
According to yet another preferred embodiment of the invention, after having routed said call, the host resource is adapted to set up a bi-directional primary connection between the first terminal and the second terminal after having routed said call provided that a call-accept message is generated by the second terminal. Thus, a conventional telephone conversation can be initiated.
According to a further preferred embodiment of the invention, the primary connection includes a first leg between the first terminal and the host resource, and a second leg between the host resource and the second terminal. Moreover, the host resource is adapted to: receive a termination request from the second terminal, and in response thereto disconnect the second leg, while maintaining the first leg during a threshold period. If a return call to a predefined telephone number associated with the first leg is received from the second terminal before expiry of the threshold period, the host resource is adapted to establish a bi-directional secondary connection between the first terminal and the second terminal. This modus operandi is highly desirable because thereby both subscribers can be connected at a very low cost (typically a local telephone rate).
According to still another preferred embodiment of the invention, at least one of the first and second home telephone networks is a wireless network, and consequently one or both of the originating and the second terminal is a wireless/cell/mobile phone. Hence, an improved flexibility is attained.
According to another aspect of the invention the object is achieved by the method described initially, wherein a dialing code is received from the first terminal. The dialing code identifies a first common telephone number in the first home telephone network. The first common telephone number, in turn, is adapted to be shared among a first group of users in the first home telephone network. The method involves receiving user data specifying the first network identity, and routing a call from the first terminal to the second terminal based on a unique combination of the first common telephone number and the first network identity. The method also involves setting up a bi-directional primary connection between the first terminal and the second terminal provided that a call-accept message is generated by the second terminal. The primary connection is established via at least one interconnecting network of packet switched type.
The advantages of this method, as well as the preferred embodiments thereof, are apparent from the discussion hereinabove with reference to the proposed system.
According to one preferred embodiment of this aspect of the invention, the unique combination of the first common telephone number and the first network identity is established in the host resource by means of the following procedure. First, an initial dialing instruction is received from the second terminal. The initial dialing instruction contains data, which uniquely identifies the first terminal. User data specifying the second network identity is received. Then, the first network identity is derived based on the initial dialing instruction. Thereafter, the first common telephone number is allocated based on the first and second network identities and any first common telephone numbers previously allocated to the first terminal and/or the second terminal in such a manner that a combination of the first network identity, the first common telephone number and the second network identity becomes unique. An entry is stored, which represents said unique combination, and finally, the method involves sending a service invitation message to the first terminal. The service invitation message includes data specifying an identity of the second terminal and the first common telephone number. Thereby, a (supposed) call-originating terminal is provided with a versatile access instrument to the second terminal.
According to another embodiment of this aspect of the invention, the allocation of the first common telephone number involves: investigating whether there exists an already stored entry in respect of the second terminal, and investigating whether there exists an already stored entry in respect of the first terminal. If no previously stored entry exists in respect of either of the first terminal and the second terminal, the first common telephone number is allocated by arbitrarily selecting one number from a predefined pool of telephone numbers in the first network. If there exists at least one stored entry in respect of the second terminal, however there exists no stored entry in respect of the first terminal, the first common telephone number is allocated to a number being identical to an already stored first common telephone number. If there exists at least one previously stored entry in respect of each of the originating and the second terminal, the first common telephone number is allocated to a number adjoining (incrementally or decrementally) an already stored first common telephone number in respect of the first terminal. Hence, a series of common telephone numbers is created, which appears intuitive to the users of the system.
According to yet another embodiment of this aspect of the invention, the first unique combination of the first common telephone number and the first network identity is instead established in the host resource by means of the following procedure. First, an initial service request is received from the second terminal. The initial service request contains data that uniquely identifies the first terminal. User data specifying the second network identity is also received. Then, the first network identity is derived based on the initial service request. Subsequently, an identity-number pair is allocated, which represents the first unique combination. However, additionally, the identity-number pair contains a second common telephone number in the second home telephone network. The second common telephone number, in turn, is adapted to be used for routing a call from the second terminal to the first terminal based on a second unique combination of the second common telephone number and the second network identity. Analogous to the first common telephone number, the second common telephone number is adapted to be shared among a second group of users in the second home telephone network. Hence, calls may be set up in both directions between the first and second terminals at local call rate, irrespective of the geographical distance separating these devices.
According to a further aspect of the invention the object is achieved by a computer program product, which is directly loadable into the memory of a computer, and includes software for controlling the method proposed above when said program is run on a computer.
According to another aspect of the invention the object is achieved by a computer readable medium, having a program recorded thereon, where the program is to control a computer to perform the method proposed above.
Further advantages, beneficial features and applications of the present invention will be apparent from the following description and the dependent claims.
The present invention is now to be explained more closely by means of preferred embodiments, which are disclosed as examples, and with reference to the attached drawings.
The system includes a host resource 110, which is adapted to route a call from the first terminal A to the second terminal B in a manner being essentially reverse to conventional routing strategies. Namely, the host resource 110 routes the call based on a unique combination of the first network identity CLIA (designating the caller) and a first common telephone number #αn in the first home telephone network α dialed by the first terminal A. The first common telephone number #αn, as such, is however adapted to be shared among a first group of users in the first home telephone network α. Preferably, the number #αn is a switchboard type of telephone number being associated with a plurality of lines, such that the number can be used by many contemporaneous callers. In any case, the number #αn is an ordinary telephone number in the sense that it can be stored in a conventional software telephone book of a user terminal.
In order to handle large groups of users, i.e. callers/callees, it is preferable if the host resource 110 is adapted to route calls from each of a first number of first terminals A in the first home telephone network α to each of a second number of second terminals B in the second home telephone network β. To this aim, the host resource 110 is associated with a database 120, which stores one entry <CLIA, #αn, CLIB> for each unique combination of: the first network identity CLIA of each of the first terminals A; the second network identity CLIB of each of the second terminals B; and a respective first common telephone number #αn to be dialed by each first terminal A to reach each of the second terminals B. Of course, the entries <CLIA, #αn, CLIB> need not be defined between all combinations of originating and second terminals A and B respectively. Instead, it is preferable that the entries <CLIA, #αn, CLIB> are created on an invitation basis, so that entries defining telephone numbers to a particular second terminal B are exclusively created in respect of subscriptions designated by a subscriber who has this terminal B at his/her disposal. Thus, identified friends, relatives, business partners and others can reach the subscriber with the terminal B via the proposed system. A combined procedure for inviting subscribers and creating the entries <CLIA, #αn, CLIB> according to one preferred embodiment of the invention will be described below with reference to
According to one preferred embodiment of the invention, the system includes a first interface node Nα, which connects the first home telephone network a to at least one interconnecting network N. The system also includes a second interface node Nβ, which connects the second home telephone network β to at least one of the at least one interconnecting network N. Preferably, the networks α and β are thereby interconnected via at least one interconnecting network N being packet switched network, e.g. the Internet. In such a case, each of the first and second interface nodes Nα and Nβ is adapted to handle telephone traffic over packet switched networks, e.g. according to Open SIP (session initiation protocol). Thereby, a telephone connection may be established between the terminals A and B, which is partially realized over the Internet. This, in turn, vouches for cost efficiency, especially if the physical distance between the terminals A and B is long.
Regardless of the protocol used in the interconnecting network(s) N the host resource 110 is also connected thereto, such that any telephone connections between the terminals A and B can be accomplished via this node 110. Specifically, according to one embodiment of the invention, the host resource 110 is adapted to set up a bi-directional primary connection between the first terminal A and the second terminal B after having routed the call. Preferably, a page signal P informs the second terminal B of the fact that the call has been routed to this terminal. The primary connection has a first leg L1 between the first terminal A and the host resource 110. The primary connection also has a second leg L2 between the host resource 110 and the second terminal B. In practice, the first and second legs L1 and L2 are preferably effected by means of connections Λ1 and Λ2 respectively, which reach the host resource 110 via the Internet.
Moreover, according to one preferred embodiment of the invention, the host resource 110 is adapted to receive a termination request from the second terminal B after having set up the connection between the terminals A and B. In response to such a request, the host resource 110 disconnects the second leg L2. Then, during a threshold period after having disconnected the second leg L2, the host resource 110 is adapted to maintain the first leg L1 (i.e. the first terminal A is placed on-hold). If a return call to a predefined telephone number is received from the second terminal B before expiry of the threshold period, the host resource 110 establishes a bi-directional secondary connection between the first terminal and the second terminal. This procedure will be further elucidated below with reference to
The predefined telephone number, which is associated with first leg L1, may either be a fixed number for all the second terminal's B service requests to the system, or the number may be assigned on a call-by-call basis.
As mentioned above, one or both the networks α and β may be a wireless network, e.g. a cellular telephone network. In such a case, one or both of the first and second terminals may be A and B may be a wireless/mobile/cellular phone.
It is further advantageous if the host resource 110 has a processor 130 and includes, or is associated with, a computer readable medium 140 (e.g. a memory module) storing a program which is adapted to make processor 130 control the host resource 110 to effect the above-described procedures.
The procedure involves receiving an initial dialing instruction (or service request) D[A] from the second terminal B. The instruction D[A] contains data, which uniquely identifies the first terminal A, i.e. the intended future calling party. Hence, the instruction D[A] may specify a telephone number (or CLI). However, provided that the host resource 110 is associated with an adequate database (such as an on-line telephone catalog), the initial dialing instruction D[A] may instead designate a physical or legal person and/or an address. In any case, the first network identity CLIA is derived based on the initial dialing instruction D[A]. Of course, if the instruction D[A] contains an explicit network identity, or telephone number, this process becomes trivial.
The procedure also involves receiving user data specifying the second network identity CLIB, which typically is a telephone number associated with second terminal B. Preferably, this data is forwarded automatically in the form of a CLI along with the initial dialing instruction D[A]. However, for instance if the call is made from a terminal being different from the intended second terminal B, the user data may be entered manually, for example by means of DTMF signaling, in response to prompting instructions from the host resource 110.
The first common telephone number #αn is then allocated based on the first and second network identities CLIA and CLIB. The number #αn is however also allocated on the basis of any common telephone numbers #α previously allocated to the first terminal A and/or the second terminal B, such that a combination of the first network identity CLIA, the first common telephone number #αn and the second network identity CLIB becomes unique. An entry <CLIA, #αn, CLIB> representing this unique combination is stored, preferably in the database 120.
Thereafter, the host resource 110 sends a service invitation message S[B, #αn] to the first terminal A. The message S[B, #αn] includes data specifying an identity of the second terminal B, e.g. a name and/or an organization, and the first common telephone number #αn to be used for future calls to the terminal B.
In order to render a series of first common telephone number #αn stored in the database 120 as user-friendly and intuitive as possible, according to one preferred embodiment of the invention, the first common telephone numbers #αn are allocated as follows.
When the host resource 110 receives an initial dialing instruction D[A] from a particular second terminal B, it is investigated whether there exists an already stored entry in respect of the second terminal B. It is also investigated whether there exists an already stored entry in respect the first terminal A being identified by the instruction D[A].
If there exists at least one previously stored entry in respect of each of the originating and the second terminal A and B, the first common telephone number #αn is allocated to a number adjoining, incrementally or decrementally, an already stored first common telephone number in respect of the first terminal A.
This strategy results in that the first terminals A build up a respective unbroken series of first common telephone numbers #αn. An exception must only be made in the statistically rare case when a first terminal A is invited by a second terminal Bi, which uses a specific first common telephone number #αn in the first network a, and the first terminal A has already been assigned this specific first common telephone number #αn as result of a previous invitation from another second terminal Bj.
As an alternative to the above-described procedure, the first unique combination <CLIA, #αn, CLIB> of the first common telephone number #αn and the first network identity CLIA may instead be established as follows.
First, an initial service request D[A] is received from the second terminal B, for example in the form of an SMS message (SMS=short message service), or an entry via a web page (uploaded or manually entered). In any case, the initial service request D[A] contains data uniquely identifying the first terminal A. User data specifying the second network identity CLIB is likewise received, e.g. as a CLI or a manual entry.
The first network identity CLIA (typically a telephone number) is then derived based on the initial service request D[A].
Thereafter, the host resource 110 allocates an identity-number pair <CLIA, #αn, #βm, CLIB> representing the first unique combination. However, in addition to the first unique combination, the identity-number pair also contains a second common telephone number (#βm) in the second home telephone network β. The second common telephone number #βm being adapted to be used for routing a call from the second terminal B to the first terminal A based on a second unique combination of the second common telephone number #βm and the second network identity CLIB. Analogous to the first common telephone number #αn, the second common telephone number #βm is adapted to be shared among a second group of users in the second home telephone network β. Preferably, the host resource 110 is adapted to notify the second terminal B the second common telephone number #βm via a return message S[A, #βm], for example in the form of an SMS, specifying the number #βm to be used for calling the first terminal A. In
The procedure is initiated by receiving a dialing code from the first terminal A in the host resource 110 (as the result of a telephone number entered in the terminal A and being sent over the first home telephone network α, and possibly one or more interconnecting networks N). The dialing code identifies a first common telephone number #αn in the first home telephone network α, which number #αn is adapted to be shared among a first group of users in the first home telephone network α. Thus, the first common telephone number #αn may be a switchboard number associated with the host resource 110.
The host resource 110 also receives user data specifying the first network identity CLIA. Typically, this data is forwarded automatically along with dialing code #αn in the form of a CLI. However, according to one preferred embodiment of the invention, it is also possible to use this service from first terminals A having network identities that are not registered with the host resource 110. Namely, if a call is originated from such a terminal A, the host resource 110 will not find a matching entry in the database 120. As a result, the user of the non-registered first terminal A is prompted to enter a valid first network identity CLIA, for example represented by his/her telephone number. Provided that a matching entry is found for this number, the host resource 110 routes the call to the second terminal B. Normally, this involves generating a page signal P. As mentioned earlier, the call is routed based on the unique combination of the first common telephone number #αn and the first network identity CLIA. Upon acceptance of the call (i.e. reception of a call-accept message, or off-hook, from the terminal B), a bi-directional primary connection is set up between the first terminal A and the second terminal B. This connection is here denoted L1 and L2, where L1 symbolizes a first leg between the first terminal A and the host resource 110; and L2 symbolizes a second leg between the host resource 110 and the second terminal B.
In
To this aim, the host resource 110 is specifically adapted to receive a termination request from the second terminal B after having set up the bi-directional primary connection L1, L2 between the terminals A and B. In response to such a request, the host resource 110 is further adapted to disconnect the second leg L2 while maintaining the first leg L1 during a threshold period T after having disconnected the second leg L2.
If a return call to a predefined telephone number #βr is received from the second terminal B before expiry of the threshold period T, the host resource 110 is adapted to set up a new second leg L2′ and associate this leg with the first leg L1, such that a bi-directional secondary connection L1, L2′ is established between the first terminal A and the second terminal B. Naturally, a precondition for this type of secondary connection L1, L2′ is that no termination request has yet been received from the terminal A.
To sum up, we will now describe the general method of establishing a telephone connection according to the invention with reference to the flow diagram in
An initial step 510 receives a dialing code from a first terminal. The dialing code identifies a common telephone number in a home telephone network of a first terminal. The common telephone number is adapted to be shared among a group of users in this home telephone network.
A following, or parallel step 520, receives user data specifying a first network identity of the first terminal. The combination of the first network identity and the common telephone number is unique, and designates a particular second terminal having a subscription in a home network different from the home network of the first terminal.
Subsequently, a step 530 routes a call from the first terminal to the designated second terminal. (i.e. based on the unique combination of the common telephone number and the first network identity).
All of the steps, as well as any sub-sequence of steps, described with reference to
For clarity reasons, the invention has here been described with reference to two home telephone networks α and β respectively. Naturally, the proposed solution is also applicable to any number of such networks larger than two. Hence, any combination of two subscribers having their respective subscriptions with two mutually different network operators may be interconnected via the host resource 110.
The term “comprises/comprising” when used in this specification is taken to specify the presence of stated features, integers, steps or components. However, the term does not preclude the presence or addition of one or more additional features, integers, steps or components or groups thereof.
The reference to any prior art in this specification is not, and should not be taken as, an acknowledgement or any suggestion that the referenced prior art forms part of the common general knowledge in Australia.
The invention is not restricted to the described embodiments in the figures, but may be varied freely within the scope of the claims.
Number | Date | Country | Kind |
---|---|---|---|
0601045 | May 2006 | SE | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/SE2007/050142 | 3/12/2007 | WO | 00 | 8/17/2009 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2007/129967 | 11/15/2007 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4191860 | Weber | Mar 1980 | A |
4277649 | Sheinbein | Jul 1981 | A |
4585906 | Matthews et al. | Apr 1986 | A |
4625081 | Lotito et al. | Nov 1986 | A |
4757267 | Riskin | Jul 1988 | A |
5029196 | Morganstein | Jul 1991 | A |
5029199 | Jones et al. | Jul 1991 | A |
5136636 | Wegrzynowicz | Aug 1992 | A |
5259024 | Morley, Jr. et al. | Nov 1993 | A |
5267307 | Izumi et al. | Nov 1993 | A |
5276731 | Arbel et al. | Jan 1994 | A |
5311572 | Friedes et al. | May 1994 | A |
5325424 | Grube | Jun 1994 | A |
5353331 | Emery et al. | Oct 1994 | A |
5353335 | D'Urso et al. | Oct 1994 | A |
5425084 | Brinskele | Jun 1995 | A |
5450479 | Alesio et al. | Sep 1995 | A |
5452350 | Reynolds et al. | Sep 1995 | A |
5457732 | Goldberg | Oct 1995 | A |
5465295 | Furman | Nov 1995 | A |
5473677 | D'Amato et al. | Dec 1995 | A |
5506897 | Moore et al. | Apr 1996 | A |
5533107 | Irwin et al. | Jul 1996 | A |
5546452 | Andrews et al. | Aug 1996 | A |
5559860 | Mizikovsky | Sep 1996 | A |
5574780 | Andruska et al. | Nov 1996 | A |
5579379 | D'Amico et al. | Nov 1996 | A |
5583926 | Venier et al. | Dec 1996 | A |
5588048 | Neville | Dec 1996 | A |
5644629 | Chow | Jul 1997 | A |
5646982 | Hogan et al. | Jul 1997 | A |
5661791 | Parker | Aug 1997 | A |
5673310 | Andruska et al. | Sep 1997 | A |
5748709 | Sheerin | May 1998 | A |
5758279 | Foti | May 1998 | A |
5802160 | Kugell et al. | Sep 1998 | A |
5802471 | Sawai et al. | Sep 1998 | A |
5802513 | Bowie, III | Sep 1998 | A |
5805684 | Hirose et al. | Sep 1998 | A |
5822416 | Goodacre et al. | Oct 1998 | A |
5825863 | Walker | Oct 1998 | A |
5844972 | Jagadish et al. | Dec 1998 | A |
5854975 | Fougnies et al. | Dec 1998 | A |
5859901 | Brendzel et al. | Jan 1999 | A |
RE36111 | Neville | Feb 1999 | E |
5867495 | Elliott et al. | Feb 1999 | A |
5875401 | Rochkind | Feb 1999 | A |
5878126 | Velamuri et al. | Mar 1999 | A |
5878130 | Andrews et al. | Mar 1999 | A |
5884972 | Deptolla | Mar 1999 | A |
5903636 | Malik | May 1999 | A |
5909650 | Jonsson | Jun 1999 | A |
5923745 | Hurd | Jul 1999 | A |
5953405 | Miloslavsky | Sep 1999 | A |
5995824 | Whitfield | Nov 1999 | A |
5999525 | Krishnaswamy et al. | Dec 1999 | A |
6011975 | Emery et al. | Jan 2000 | A |
6032039 | Kaplan | Feb 2000 | A |
6035025 | Hanson | Mar 2000 | A |
6075854 | Copley et al. | Jun 2000 | A |
6125174 | Watanabe | Sep 2000 | A |
6154532 | Lockhart et al. | Nov 2000 | A |
6157831 | Lamb | Dec 2000 | A |
6160877 | Tatchell et al. | Dec 2000 | A |
6163597 | Voit | Dec 2000 | A |
6173049 | Malik | Jan 2001 | B1 |
6175622 | Chiniwala et al. | Jan 2001 | B1 |
6195419 | Gilboy | Feb 2001 | B1 |
6195422 | Jones et al. | Feb 2001 | B1 |
6240170 | Shaffer et al. | May 2001 | B1 |
6246757 | Cai et al. | Jun 2001 | B1 |
6292553 | Fellingham et al. | Sep 2001 | B1 |
6308070 | Laster | Oct 2001 | B1 |
6324263 | Sherwood et al. | Nov 2001 | B1 |
6327359 | Kang et al. | Dec 2001 | B1 |
6356630 | Cai et al. | Mar 2002 | B1 |
6374302 | Galasso et al. | Apr 2002 | B1 |
6381315 | Nhaissi | Apr 2002 | B1 |
6442243 | Valco et al. | Aug 2002 | B1 |
6463145 | O'Neal et al. | Oct 2002 | B1 |
6507644 | Henderson et al. | Jan 2003 | B1 |
6522743 | Hurd | Feb 2003 | B1 |
6535596 | Frey et al. | Mar 2003 | B1 |
6539089 | Mahajan | Mar 2003 | B1 |
6614887 | Satapathy et al. | Sep 2003 | B1 |
6665390 | Ekstrom | Dec 2003 | B1 |
6665532 | Boland et al. | Dec 2003 | B1 |
6681119 | Verdonk | Jan 2004 | B1 |
6690779 | Walker et al. | Feb 2004 | B2 |
6697484 | Fleming, III | Feb 2004 | B1 |
6738636 | Lielbriedis | May 2004 | B2 |
6744874 | Wu | Jun 2004 | B2 |
6760324 | Scott et al. | Jul 2004 | B1 |
6771953 | Chow et al. | Aug 2004 | B1 |
6779020 | Henrick | Aug 2004 | B1 |
6788927 | Pohutsky et al. | Sep 2004 | B2 |
6795852 | Kleinrock et al. | Sep 2004 | B1 |
6798876 | Bala | Sep 2004 | B1 |
6813504 | Benchetrit et al. | Nov 2004 | B2 |
6873690 | Moon et al. | Mar 2005 | B2 |
6920487 | Sofer et al. | Jul 2005 | B2 |
6937713 | Kung et al. | Aug 2005 | B1 |
6963638 | Keller | Nov 2005 | B1 |
6970541 | Bates et al. | Nov 2005 | B2 |
6999575 | Sheinbein | Feb 2006 | B1 |
7016343 | Mermel et al. | Mar 2006 | B1 |
7042994 | Hanna et al. | May 2006 | B2 |
7103163 | Cook | Sep 2006 | B1 |
7103168 | Bedingfield, Sr. et al. | Sep 2006 | B2 |
7127051 | Bedingfield et al. | Oct 2006 | B2 |
7133508 | Parsa et al. | Nov 2006 | B1 |
7197560 | Caslin et al. | Mar 2007 | B2 |
7218721 | Vincent et al. | May 2007 | B1 |
7289522 | Gallant | Oct 2007 | B2 |
7295658 | Moon et al. | Nov 2007 | B2 |
7315738 | Delker et al. | Jan 2008 | B1 |
7346156 | Choupak et al. | Mar 2008 | B1 |
7386111 | Holder | Jun 2008 | B2 |
7567662 | Renner et al. | Jul 2009 | B1 |
7680262 | Holder | Mar 2010 | B2 |
20010000808 | Lesley | May 2001 | A1 |
20010028705 | Adams et al. | Oct 2001 | A1 |
20020025028 | Manto | Feb 2002 | A1 |
20020055351 | Elsey et al. | May 2002 | A1 |
20020057783 | Kredo et al. | May 2002 | A1 |
20020097854 | Bauer | Jul 2002 | A1 |
20020131574 | Alleman | Sep 2002 | A1 |
20020137503 | Roderique | Sep 2002 | A1 |
20020146103 | Holt et al. | Oct 2002 | A1 |
20020164978 | Moskowitz et al. | Nov 2002 | A1 |
20020165969 | Gallant | Nov 2002 | A1 |
20030043984 | Lauzon | Mar 2003 | A1 |
20030076940 | Manto | Apr 2003 | A1 |
20030081751 | Berstis | May 2003 | A1 |
20030119492 | Timmins et al. | Jun 2003 | A1 |
20030144013 | Benchetrit et al. | Jul 2003 | A1 |
20030174822 | Moon et al. | Sep 2003 | A1 |
20030198326 | Wei | Oct 2003 | A1 |
20040022384 | Flores et al. | Feb 2004 | A1 |
20040028208 | Carnazza et al. | Feb 2004 | A1 |
20040038706 | Wasser | Feb 2004 | A1 |
20040048606 | Heinmiller et al. | Mar 2004 | A1 |
20040151292 | Larsen | Aug 2004 | A1 |
20040203794 | Brown et al. | Oct 2004 | A1 |
20040213391 | Yau et al. | Oct 2004 | A1 |
20040235509 | Burritt et al. | Nov 2004 | A1 |
20050002508 | Elsey et al. | Jan 2005 | A1 |
20050020270 | Buckley | Jan 2005 | A1 |
20050060262 | Kunugi et al. | Mar 2005 | A1 |
20050101303 | Pelaez et al. | May 2005 | A1 |
20060078100 | Risafi et al. | Apr 2006 | A1 |
20060135137 | Chung | Jun 2006 | A1 |
20070032225 | Konicek et al. | Feb 2007 | A1 |
20070238472 | Wanless | Oct 2007 | A1 |
Number | Date | Country |
---|---|---|
0 740 480 | Oct 1996 | EP |
1 085 738 | Mar 2001 | EP |
1 267 556 | Dec 2002 | EP |
1267556 | Dec 2002 | EP |
11-136338 | May 1999 | JP |
11-243582 | Sep 1999 | JP |
2001-045540 | Feb 2001 | JP |
2001-268209 | Sep 2001 | JP |
WO 9506381 | Mar 1995 | WO |
WO 9506381 | Mar 1995 | WO |
WO 0001137 | Jan 2000 | WO |
WO 0060840 | Oct 2000 | WO |
WO 03028355 | Apr 2003 | WO |
WO 2009116991 | Sep 2009 | WO |
Entry |
---|
John Alexander et al., Cisco CallManager Fundamentals, (Cisco Press 2002) (entire book). |
Tom Keating, Variety-Pack CTI, CTI Magazine (Oct. 1997), 5 pages. |
Jonathan Lennox et al., Implementing Intelligent Network Services with the Session Initiation Protocol, Tech-Report No. CUCS-002-99, (1999), pp. 0-25. |
Betty Yuan, The New ABCs of ACDS, Call Center Magazine (1999), [online] [retrieved May 6, 2010]. Retrieved from the Internet: URL: file://C:\documents and Settings/jlucas/Local Settings\Temporary Internet Files\OLK1646\.... 9 pages. |
Alessandra Andreetto et al., Ubiquitous Communication Over IN and Internet (2000), 6 pages. |
Richard Stastny, Service Opportunities: From UPT and ENUM to UCI?, presented at Ecma TG17 (Jun. 2001), 25 pages. |
Geoff Huston, ENUM—Mapping the E.164 Number Space into the DNS (2002), pp. 1-10. |
Stephan Rupp et al., Flexible Universal Networks—A New Approach to Telecommunication Services?, [online] [retrieved May 7, 2010]. Retrieved from the Internet: <URL: http://portal.acm.org/citation.cfm?id=1015017>. 3 pages. |
CT-Connect Manual, Dialogic Corp. (1998), 28 pages. |
Call Centres and CTI—The GeoTel Communications Corporation, Competitor Brief (Datamonitor Aug. 1998), [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://www.callcentres.com.au/geotel.htm>. 8 pages. |
Microsoft to Acquire Sendit, Microsoft press release, Jul. 1, 1999, [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://www.microsoft.com/presspass/features/1999/07-01sendit.mspx>. 1 page. |
Microsoft Announces Shareholder Acceptance of Offer to Acquire Sendit, Microsoft press release, Jul. 1, 1999, [online] [retrieved Jul. 16, 2010]. Retrieved from the Internet: <URL: http://www.microsoft.com/presspass/press/1999/jul99/senditpr.mspx>. 2 pages. |
Collaboration in Creating the Mobile Internet Environment of the Future, Nokia press release, Jan. 13, 1997, [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://press.nokia.com/PR/199701/775490—5.html>. 2 pages. |
State of California—Rider B/800 Enhanced Call Routing (ECR), [online] [retrieved Jul. 16, 2010]. Retrieved from the Internet: <URL: https://ebiznet.sbc.com/calnetinfo/MCI—B/800ENHAN.htm>. 7 pages. |
SendIt Selects Natural MicroSystems for Enhanced ‘Wireless Internet’ Services Platform, Business Wire, Feb. 8, 1999, [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://findarticles.com/p/articles/mi—m0EIN/is—1999—Feb—8/ai—53720270/>. 3 pages. |
SENDIT: Swedish GSM Operator Europolitan Signs Upgrade Order for ICSA, M2 Presswire, Mar. 1999, [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://findarticles.com/p/articles/mi—hb5243/is—199903/ai—n20254452/>. 1 page. |
Greece's Cosmote Announces Mobile Internet Services Built on Microsoft Technology, Microsoft press release, Oct. 25, 2000, [online] [retrieved May 14, 2010]. Retrieved from the Internet: <URL: http://www.microsoft.com/Presspass/press/2000/oct00/cosmotepr.mspx. 2 pages. |
First Wireless E-mail Application (at p. 33), Smart Card News, vol. 7, No. 2, Feb. 1998, pp. 23-40. |
Robert J. Crawford et al., Case Study of Microsoft's Acquisition of Sendit (INSEAD 2003), 61 pages. |
Henning Schulzrinne, SIP for Mobility, presented at Conference International—SIP, Paris, France (Feb. 21, 2001), 23 pages. |
Robert Houron, Compaq, Mobility—Creating an Untethered World, presented at 1998 Worldwide Telecommunications Forum (2008). |
John Anderson, Intelligent Networks: Principles and Applications (Telecommunications series No. 46) (2002). |
Ollie Martikainen et al., Tutorial on Intelligent Networks, presented at International Federation for Information Processing's “IFIP in '95” conference (1995). |
Number | Date | Country | |
---|---|---|---|
20090310598 A1 | Dec 2009 | US |