Patent Grant
8189565
The present invention relates to a method of accessing service resource items that are intended to be used in setting up bearer channels through a switched telecommunications system.
As used herein, the term “switched telecommunication system” means a system comprising a bearer network with switches for setting up a bearer channel through the network. The term “switched telecommunication system” is to be taken to include not only the existing public and private telephone systems (whether using analogue phones or ISDN-based), but also broadband (ATM) and other switch-based bearer networks that are currently being implemented or may emerge in the future. For convenience, the term “switched telecommunication system” is sometimes shortened herein to telecommunication system.
Reference to a “call” in the context of a switched telecommunication system is to be understood as meaning a communication through a bearer channel set up across the bearer network, whilst references to call setup, maintenance and takedown are to be taken to mean the processes of setting up, maintaining and taking down a bearer channel through the bearer network. Terms such as “call processing” and “call handling” are to be similarly interpreted.
The term “communication system” when used herein should be understood as having a broader meaning than switched telecommunication system, and is intended to include datagram-based communication systems where each data packet is independently routed through a bearer network without following a predetermined bearer channel.
Telecommunication companies running PSTNs (Public Switched Telephone Networks) and PLMNs (Public Land Mobile Networks) are in the business of providing communication services and in doing so are providing increasing built-in intelligence in the form of “IN services” such as 800 number services and call forwarding. In contrast, the World Wide Web (WWW), which has seen explosive growth in recent times, is an example of an Internet-based global network providing complex information services. These two worlds, that of the large communications utilities and that of the highly dynamic, pioneer-spirit WWW information culture, are uneasy companions and each plans to encroach on the domain previously occupied by the others; thus telephony services will be offered over the WWW and information services over the public communication infrastructure.
The present invention proposes technologies for a more synergetic relationship between these two worlds than is currently envisaged and in order to place the present invention in context, a review will first be given of each of these two worlds.
Telephone Networks with IN Services
The Basic PSTN. The basic service provided by a PSTN (Public Switched Telephone Network) is the interconnection of two telephones (that is, setting up a bearer channel between the telephones) according to a called-party telephone number input at the calling-party telephone.
Thus, where the CPE is a traditional dumb telephone, control signalling between the CPE and its local SP is in-band signalling, that is, the signalling is carried on the same channel as used for voice; this signalling is interpreted and converted at the SPs 12 into signalling between SPs that uses a dedicated common-channel signalling network 16 (implemented nowadays using the SS7 protocol suite). Where the CPE is an ISDN terminal, signalling is carried in a separate channel directly from the CPE on an end-to-end. Modern SPs use the ISUP (ISDN User Part) SS7 protocol for inter-exchange call control signalling whether the CPE is a standard telephone or an ISDN terminal.
Telephone Numbering Plans—As certain aspects of the present invention are influenced by the structuring of telephone numbers, a brief description will now be given of the structuring of such numbers. Telephone numbers form an international, hierarchical addressing scheme based on groups of decimal digits. The top level of the hierarchy is administered by the ITU-T, which has allocated single-digit numeric codes to the major geographic zones (for example “1” for North America, “2” for Africa, “3” for Europe, “4” for Europe, “5” for South America and Cuba, etc.). Within each zone countries are assigned 2 or 3 digit codes, so that within zone 3 France is “33”, and within zone 4 the UK is “44”. Administration of the numbering plan within a country is delegated to a national body, such as the Office of Telecommunications (“Oftel”) in the UK. The following further description is based on the UK numbering plan, but the scheme described will be recognised as having widespread applicability.
In the UK all national numbers are prefixed by a code from 01 to 09 (the ‘0’ prefix is dropped in international dialing). The currently assigned codes are “01” for Geographic Area Codes, “02” for Additional Geographic Area Codes, “04” for Mobile Services, “07” for Personal Numbers, and “08” for Special Service (freephone, information). Normal wireline PSTN subscriber telephone numbers are allocated from the Geographic Area Code codes, and currently only codes prefixed by 01 are allocated. Geographic area codes are presently 3 or 4 digits (excluding the leading ‘0’) and there are currently 638 geographic areas each with its own code. A full national UK dialed number takes two forms:
The first case has the ‘0’ prefix, a 3 digit area code and a 7 digit local number, and the second case has the ‘0’ prefix, a 4 digit area code, and a 6 digit local number. Further interpretation of the local number will take place within the area exchange, as even a 6 digit address space is too large for a single switch, and for a typical local area several switches may be needed to host the required number of subscriber lines. This interpretation is opaque and is a matter for the area service provider.
In the current PSTN the inherently hierarchical and geographic interpretation of telephone numbers is mirrored by the physical architecture of the network. A telephone number is structured in a way that makes it easy to route a call through the network. At each step, the prefix of the number provides information about the current routing step, and the suffix (perhaps opaquely) provides information about subsequent routing steps; as long as a switch knows how to parse a prefix and carry out a routing step, it does not need to understand the content of the suffix, which is left for subsequent routing steps. For this reason the international and national switching fabric is also organised hierarchically.
Intelligent Networks. Returning now to a consideration of the current telephone network infrastructure, in addition to basic call handling, an SP may also serve to provide what are called IN (Intelligent Network) services; in this case the SP is termed a service switching point, SSP. An SSP 25 is arranged to suspend call processing at defined points-in-call upon particular criteria being met, and to delegate the continuation of call processing to a service control subsystem providing a service control function (SCF) either in the form of a service control point, SCP 17 (see
Service logic running in an SCP or Adjunct will generally make use of subscriber information stored in a service data function (SDF) 22 that may be integral with the SCP/Adjunct or partially or wholly separate therefrom. The service data function (SDF), like the service control function (SCF) forms part of the service control subsystem of the PSTN. It may be noted that some or all of the service control function may be built into the PSTN switches themselves.
In addition to the SCP 17 and Adjunct 18, the
In operation, when the SSP 25 receives a call, it examines internal trigger conditions and, possibly, user information (eg dialed digits) to as certain if the call requires a service to be provided by the service control subsystem 17, 18; the checking of trigger conditions may be carried out at several different points in call processing. Where the SSP 25 determines that a service is required it messages the service control subsystem (either SCP 17 or Adjunct 18) requesting the desired service and sending it a logic representation of the call in terms of its connectivity and call processing status. The service control subsystem then provides the requested service and this may involve either a single interaction between the SSP and service control subsystem or a session of interactions. A typical service is call forwarding which is a called-party service giving expression to an end-user requirement as simple as “if you call me on number X and it rings ten times, try calling number Y”. In this case, it is the SSP local to the called end-user that triggers its associated SCP (or Adjunct) to provide this service; it will, of course, be appreciated that the SSP must be primed to know that the service is to be provided for a called number X.
The above-described model for the provision of IN services in a PSTN can also be mapped onto PLMNs (Public Land Mobile Networks) such as GSM and other mobile networks. Control signalling in the case of a mobile subscriber is more complex because in addition to all the usual signalling requirements, there is also a need to establish where a call to a mobile subscriber should be routed; however, this is not a very different problem from a number of called-party IN services in the PSTN. Thus in GSM, the service-data function (SDF) is largely located in a system named a Home Location Register (HLR) and the service control function in a system named a Visitor Location Register (VLR) that is generally associated on a one-to-one basis with each SSP (which in GSM terminology is called a Mobile Switching Centre, MSC).
Because subscribers are mobile, the subscriber profile is transported from the HLR to whichever VIR happens to be functionally closest to be mobile subscriber, and from there the VLR operates the (fixed) service using the subscriber profile and interacts with the SSP. The HLR and VLR thus constitute a service control subsystem similar to an SCP or Adjunct with their associated databases.
It is, of course, also possible to provide IN services in private telephone systems and, in this case, the service control function and service data function are generally either integrated into a PABX (Private Automatic Branch Exchange) or provided by a local computer. The service control subsystem, whilst present, may thus not be a physically distinct from the PABX.
The above-described general architectural framework for providing IN services has both strengths and flaws. Its main strength is that it works and many services have been successfully deployed, such as 800 number services, credit card calling, voicemail, and various call waiting and redirection services. However, despite years of standardisation, services are still implemented one-at-a-time on proprietary platforms and do not scale well. The approach has been based on large, fault-tolerant systems which provide services for hundreds of thousands or even millions of subscribers and take years to deploy. Furthermore, since the networks used to support these services also constitute the basic telephone infrastructure, anything attached to these networks must be rigorously vetted. Additionally, each country and operator tends to have local variations of the so-called standards making it difficult to supply standard products and thereby braking the dynamics of competition.
The World Wide Web
In contrast to the slow deliberate progress of the telephone infrastructure, the WWW has grown explosively from its inception in 1989 to become the primary electronic information distribution service in terms of spread, availability and richness of information content. Anyone can, for a modest outlay, become an information provider with a world-wide audience in a highly interconnected information architecture.
The WWW is a client-server application running over the Internet and using a client-server protocol which mandates only the simplest of exchanges between client and server. This protocol is HTTP (Hyper Text Transfer Protocol) which is optimised for use over TCP/IP networks such as the Internet; the HTTP protocol can, however, also be used over networks using different communication protocol stacks.
Since the availability of literature concerning the WWW has seen the same sort of growth as the WWW itself, a detailed description of the WWW, HTTP and the Internet will not be given herein. An outline description will, however, be given with attention being paid to certain features of relevance to the present invention.
The WWW uses the Internet for interconnectivity. Internet is a system that connects together networks on a worldwide basis. Internet is based on the TCP/IP protocol suite and provides connectivity to networks that also use TCP/IP. For an entity to have a presence on the Internet, it needs both access to a network connected to the Internet and an IP address. IP addresses are hierarchically structured. Generally an entity will be identified at the user level by a name that can be resolved into the corresponding IP address by the Domain Name System (DNS) of the Internet. Because the DNS or adaptions of it are fundamental to at least certain embodiments of the invention described hereinafter, a description will next be given of the general form and operation of the DNS.
The Domain Name System—The DNS is a global, distributed, database, and without its performance, resilience and scalability much of the Internet would not exist in its current form. The DNS, in response to a client request, serves to associate an Internet host domain name with one or more Registration Records (RR) of differing types, the most common being an address (A) record (such as 15.144.8.69) and mail exchanger (MX) records (used to identify a domain host configured to accept electronic mail for a domain). The RRs are distributed across DNS name servers world-wide, these servers cooperating to provide the domain name translation service; no single DNS server contains more than a small part of the global database, but each server knows how to locate DNS servers which are “closer” to the data than it is. For present purposes, the main characteristics of the DNS of interest are:
The host name space is organised as a tree-structured hierarchy of nodes with each host having a corresponding leaf node; each node has a label (except the root node) and each label begins with an alphabetic character and is followed by a sequence of alphabetic characters or digits. The full, or “fully qualified” name of a host is the string of node labels, each separated by a “.”, from the corresponding leaf node to the root node of the hierarchy, this latter being represented by a terminating “.” in the name. Thus a host machine “fred” of Hewlett-Packard Laboratories in Bristol, England will have a fully qualified domain name of “fred.hpl.hp.com.” (note that if a host name does not have a terminal “.” it is interpreted relative to the current node of the naming hierarchy).
Each host has one or more associated Registration Records (RRs).
There are a plurality of DNS servers each with responsibility for a subtree of the name space. A DNS server will hold RRs for all or part of its subtree—in the latter case it delegates responsibility for the remainder of the subtree to one or more further DNS servers. A DNS server knows the address of any server to which it has delegated responsibility and also the address of the server which has given it the responsibility for the subtree it manages. The DNS servers thus point to each other in a structuring reflecting that of the naming hierarchy.
An application wishing to make use of the DNS does so through an associated “resolver” that knows the address of at least one DNS server. When a DNS server is asked by this resolver for an RR of a specified host, it will return either the requested RR or the address of a DNS server closer to the server holding the RR in terms of traversal of the naming hierarchy. In effect, the hierarchy of the servers is ascended until a server is reached that also has responsibility for the domain nate to be resolved; thereafter, the DNS server hierarchy is descended down to the server holding the RR for the domain name to be resolved.
The DNS uses a predetermined message format (in fact, it is the same for query and response) and uses the IP protocols.
These characteristics of the DNS may be considered as defining a “DNS-type” system always allowing for minor variations such as in label syntax, how the labels are combined (ordering, separators), the message format details, evolutions of the IP protocols etc.
Due to the hierarchical naming structure, it is possible to delegate responsibility for administering domains (subtrees) of the name space recursively. Thus, the top-level domains are administered by InterNic (these top-level domains include the familiar ‘com’, ‘edu’, ‘org’, ‘int’, ‘net’, ‘mil’ domains as well as top-level country domains specified by standard two-letter codes such as ‘us’, ‘uk’, ‘fr’ etc.). At the next level, by way of example Hewlett-Packard Company is responsible for all names ending in ‘hp.com’ and British Universities are collectively responsible for all names ending in ‘ac.uk’. Descending further, and again by way of example, administration of the domain ‘hpl.hp.com’ is the responsibility of Hewlett-Packard Laboratories and administration of the subtree (domain) ‘newcastle.ac.uk’ is the responsibility of the University of Newcastle-upon-Tyne.
This looks extremely inefficient, but DNS servers are designed to build a dynamic cache, and are initialised with the addresses of several root servers, so in practice most of the iterative queries never take place. In this case the ‘hpl.hp.com’ DNS server will know the addresses of several root servers, and will likely have the addresses of ‘uk’ and ‘ac.uk’ servers in its cache. The first query to the ‘hpl.hp.com’ server will return the address of the ‘ac.uk’ server. The second query to the ‘ac.uk’ server will return the address of the ‘newcastle.ac.uk’ server, and the third query will return the RR in question. Any future queries with a ‘newcastle.ac.uk’ prefix will go direct to the newcastle DNS server as that address will be retained in the “hpl.hp.com” DNS server cache. In practice names within a local subtree are resolved in a single query, and names outside the local subtree are resolved in two or three queries.
Rather than a resolver being responsible for carrying out the series of query iterations required to resolve a domain name, the resolver may specify its first query to be recursive in which case the receiving DNS server is responsible for resolving the query (if it cannot directly return the requested RR, it will itself issue a recursive query to a ‘closer’ DNS server, and so on).
It should also be noted that in practice each DNS server will be replicated, that is, organised as a primary and one or more secondaries. A primary DNS nameserver initialises itself from a database maintained on a local file system, while a secondary initialises itself by transferring information from a primary. A subtree will normally have one primary nameserver and anything up to ten secondaries—the limitation tends to be the time required by the secondaries to update their databases from the primary. The primary database is the master source of subtree information and is maintained by the domain DNS administrator. The secondaries are not simply standby secondaries but each actively participates in the DNS with dependent servers that point to it rather than to the corresponding primary.
DNS implementations, such as BIND, are widely available as a standard part of most UNIX systems, and can claim to be among the most robust and widely used distributed applications in existence.
Operation of the WWW Referring now to
Many users of the WWW do not have network access to the Internet but instead access the Internet via an Internet service provider, ISP, 33 that does have network access. In this case, the user terminal 34 will generally communicate with the ISP 33 over the public telephone system using a modem and employing either SLIP (Serial Line Interface Protocol) or PPP (Point-to-Point Protocol). These protocols allow Internet packets to traverse ordinary telephone lines. Access to the Internet of this form is known as “dialup IP” access. With this access method, the user terminal 34 is temporarily allocated an IP address during each user session; however, since this IP address may differ between sessions, it is not practical for the entity 34 to act as a server.
A cornerstone of the WWW is its ability to address particular information resources by means of an Uniform Resource Identifier (URI) that will generally be either a Uniform Resource Locator (URL) that identifies a resource by location, or a Uniform Resource Name (URN) that can be resolved into an URL. By way of example, a full or “absolute” URL will comprise the following elements:
In fact, the ‘port’ may be omitted in which case port 80 is assumed.
The HTTP protocol is based on a request/response paradigm. Referring again to
The two main request methods are:
GET—This method results in the retrieval of whatever information (in the form of an entity) is identified by the Request-URI. It is important to note that if the Request-URI refers to a data-producing process, it is the produced data which is returned as the entity in the response and not the source text of the process.
POST—This method is used to request that the destination server accept the entity enclosed in the request as a new subordinate of the resource identified by the Request-URI. The POST method can be used for annotation of existing resources, providing a message to a bulletin board, providing data to a data-handling process (for example, data produced as the result of submitting a form), and extending a database through an append operation.
In summary, the GET method can be used to directly retrieve data, or to trigger any process that will return an entity (which may either be data or a simply an indication of the result of running the process). The POST method is used for registering data and specifying this method is also effective to trigger a process in the server to handle the posted data appropriately.
The passing of information to a process triggered to run on a server using either the GET or POST method is currently done according to an interface called the Common Gateway Interface (CGI). The receiving process is often written in a scripting language though this is not essential. Typically, the triggered server script is used for interfacing to a database to service a query included in a GET request. Another use, already referred to, is to append data associated with a POST request to a database.
Other important factors in the success of the WWW is the use of the HyperText Markup Language (HTML) for representing the makeup of documents transferred over the Www, and the availability of powerful graphical Web browsers, such as Netscape and Mosaic, for interpreting such documents in a client terminal to present them to a user. Basically, HTML is used to identify each part of a document, such as a title, or a graphic, and it is then up to the browser running in the client terminal to decide how to display each document part. However, HTML is more than this—it also enables a URI and a request method to be associated with any element of a document (such as a particular word or an image) so that when a user points to and clicks on that element, the resource identified by the URI is accessed according to the scheme (protocol) and request method specified. This arrangement provides a hyperlink from one document to another. Using such hyperlinks, a user at a client terminal can skip effortlessly from one document downloaded from a server on one side of the world, to another document located on a server on the other side of the world. Since a document created by one author may include a hyperlink to a document created by another, an extremely powerful document cross-referring system results with no central bureaucratic control.
Hyperlinks are not the only intelligence that can be built into an HTML document. Another powerful feature is the ability to fill in a downloaded “Form” document on screen and then activate a ‘commit’ graphical button in order to have the entered information passed to a resource (such as a database) designed to collect such information. This is achieved by associating the POST request method with the ‘commit’ button together with the URI of the database resource; activating the ‘commit’ button results in the entered information being posted to the identified resource where it is appropriately handled.
Another powerful possibility is the association of program code (generally scripts to be interpreted) with particular documents elements, such as graphical buttons, this code being executed upon the button being activated. This opens up the possibility of users downloading program code from a resource and then running the code.
It will be appreciated by persons skilled in the art that HTML is only one of several currently available scripting languages delivering the functionality outlined above and it may be expected that any serious Web browser will have built-in support for multiple scripting languages. For example, Netscape 2.0 supports HTML 3.0, Java and LiveScript (the latter being Netscape proprietary scripting Language).
The importance of the role of the graphical Web browser itself should not be overlooked. As well as the ability to support multiple scripting languages, a Web browser should provide built-in support for standard media types, and the ability to load and execute programs in the client, amongst other features. These browsers may be viewed as operating systems for WWW interaction.
WWW and the Telephone Network
It is possible to provide a telephony service over the Internet between connected terminals by digitising voice input and sending it over the Internet in discrete packets for reassembly at the receiving terminal. This is an example of a communication service on the Internet. Conversely, it is possible to point to a variety of information services provided over the telephone system, such as the Minitel system widely available in France. However, these encroachments into each anothers traditional territories pose no real threat to either the Internet or the public telephone system.
Of more interest are areas of cooperative use of the Internet and the telephone system. In fact, one such area has existed for some considerable time and has been outlined above with reference to
Another known example of the cooperative use of the Internet and PSTN is a recently launched service by which an Internet user with a sound card in his/her terminal computer can make a voice call to a standard telephone anywhere in the world. This is achieved by transferring digitised voice over the Internet to a service provider near the destination telephone; this service provider then connects into the local PSTN to access the desired phone and transfers across into the local PSTN the voice traffic received over the Internet. Voice input from the called telephone is handled in the reverse manner. Key to this service is the ability to identify the service provider local (in telephony charging terms) to the destination phone. This arrangement, whilst offering the prospect of competition for the telecom operators for long distance calls, is again a simple chaining together of the Internet and PSTN. It may, however, be noted that in this case it is necessary to provide at least a minimum of feedback to the Internet calling party on the progress of call set to the destination telephone over the PSTN local to that telephone; this feedback need only be in terms of whether or not the call has succeeded.
From the foregoing it can be seen that the current cooperative use of the Internet and telephone system is at a very simple level.
It is an object of the present invention to provide a method of accessing a service resource item over a communications network that facilitates the integration of the PSTN and the WWW.
According to the present invention, there is provided a method of accessing service resource items for use in respect of setting up bearer channels through a switched telecommunications system, the method including the steps of:
(a)—provisioning at least one server connected to a computer network with a plurality of service resource items that are thereafter locatable on said computer network by corresponding known URIs, said computer network being logically distinct from the telecommunications system, and said service resource items relating to setup control for bearer channels through said telecommunications system with each said service resource item being associated with a respective predetermined code, said predetermined codes being distinct from said URIs and identifying end-point entities for said bearer channels;
(b)—providing a mapping between each said predetermined code and the said known URI of the service resource item associated with that predetermined code; and
(c)—utilising a said predetermined code to access a corresponding said service resource item by using said mapping to determine the URI corresponding to that resource item and then using this URI to access the service resource item over said computer network.
In one embodiment, at least some of the URIs are derivable from their corresponding said predetermined codes by manipulation according to a function specified by said mapping. In another embodiment, at least some of the URIs are derivable from their corresponding said predetermined codes by look up in an association table associating said predetermined codes and URIs according to said mapping. This association table can advantageously be held on at least one database server connected to the computer network, step (c) involving accessing the database server over the computer network to determine the URI corresponding to the said predetermined code. Preferably, the said at least one database server is provided by a DNS-type distributed database system in which the URIs are held in records associated with respective names, herein referred to as domain names, by which the records can be retrieved. In this case, step (c) involves translating said predetermined code into a corresponding domain name and using this domain name to retrieve the URI of the required service resource item from the DNS-type distributed database system.
More than one service resource item can be located at the same URI; in this case, the predetermined codes of these service resource items will include respective relative-resource-identifier values that can be used at the server holding the service resource items to identify the required resource item amongst the service resource items at the same URI.
The telecommunications system may be a telephone system with each said predetermined code being either the telephone number of the calling party or the telephone number of the called party (these numbers may either be the numbers of specific telephones, or personal numbers). In one preferred embodiment where at least some of said predetermined codes are called-party telephone numbers, the corresponding service resource items are the current telephone numbers of the called parties.
Generally as regards the nature of the service resources, these may be of the following type:
service logic intended to be executed by the corresponding server upon being accessed with the result of this execution being returned to the accessing entity;
downloadable service data which upon being accessed is intended to be downloaded to the accessing entity;
downloadable service logic which upon being accessed is intended to be downloaded to the accessing entity for execution thereby.
Preferably, where URIs are referred to in the foregoing, these URIs are URLs and/or URNs. Furthermore, the servers referred to are preferably HTTP servers.
It is to be understood that reference in the foregoing to the computer network being logically distinct from the telecommunications system is not to be taken to imply that there is physical separation of the two—indeed, there will frequently be joint use of the same physical infrastructure. Furthermore, not only may bearer channels set up in the telecommunications system share the same transmission medium as the computer network, but such a bearer channel may act as a pipe for traffic across the computer network. The intention of requiring the computer network to be logically distinct from the telecommunications system is to exclude computer networks that are dedicated to the management or monitoring of the bearer network and effectively form part of the telecommunications system itself.
Preferably, the computer network is generally accessible to users of the telecommunications system as this provides a number of benefits to users that will become apparent hereinafter. The phrase “generally accessible” should not be construed as meaning that all users of the telecommunications system have such access to the computer network or can get such access but, rather, it should be understood as meaning that a significant proportion of these users have or can obtain access to the computer network.
By way of example, in one preferred embodiment of the invention, the computer network generally accessible to users of the telecommunications system but logically distinct from it, is the Internet and the telecommunications system is a public telephone system. In another embodiment, the telecommunication system is a private system including a PABX, and the computer network is a LAN.
Embodiments of the present invention will now be described, by way of non-limiting example, with reference to the accompanying diagrammatic drawings, in which:
The SCP 43 may operate in a conventional manner responding to service requests from SSPs 41 to run specific service logic on particular data according to information contained in the service request, and to send back to the requesting SSP appropriate instructions for effecting call set up. A service request is generated by the SSP in response to predetermined trigger conditions being met at a trigger check point, there being one or more such check points in the course of handling a call (it may be noted that where the trigger conditions have been downloaded to the SSP from the SCP then it could be said that the SSP is responding to an information request by the SCP when contacting the SCP upon the trigger conditions being met—however, in the present specification, this initial communication from the SSP to the SCP will be referred to as a “service request”).
The SCP 43 is also provided with a network access interface 44 to the Internet 50 in order to make use of certain service resource items 49 (also referred to below simply as “service resources”) during the course of processing at least certain service requests from the SSPs 41. These service resources 49 are held as WWW pages on HTTP servers 51 (more particularly, on service resource databases 52 of these servers 51). The WWW pages containing these service resources are referred to below as “phone” pages. The servers 51 are connected to the Internet and the phone pages are read accessible using respective URLs or URNs (for convenience, the more general term URI will be used hereinafter to mean the Internet-resolvable indicator of the location of a phone page).
The service resources may be service logic or service data and may be used by an otherwise standard service logic program running on the SCP, by accessing the phone page of the required resource using the appropriate URI. In certain cases, the service resources 49 may provide substantially all of the service control and data associated with a particular service. In this case, the service logic program running in the SCP 43 is of skeleton form, being instantiated on receipt of a service request and then serving to initiate service resources access and to return the results of this access to the entity that made the service request. In fact, according to this approach, the SCP could be implemented simply as a platform for fetching and executing phone-page service logic and would not need to have the complex provisioning and management systems for such logic as is required by standard SCP platforms; SCPs could then become more ubiquitous, possibly being associated with every SSP.
If a response is received from the accessed resource before the expiration of a time-out period (tested in step 108), then the response, which is usually in the form of a destination number, is supplied to the appropriate SLP as identified using the correlation ID passed with the response (step 109). An INAP/TCAP response message is then prepared and sent to the entity that made the original service request (steps 110 and 111) after which the SLP instance is terminated (113).
If in step 108, a time-out occurs before a response is received, then a default response value (generally a default destination number) may be looked up in the customer record and put in an INAP/TCAP message and sent back to the requesting entity (steps 114 to 116). The SLP instance is then terminated (113).
Locating & Accessing Service Resources
The functionality associated with accessing a phone-page resource is schematically represented in
Resource Codes—It is possible that more than one service resource is associated with a particular telephone number; in this case the resource access block 46 will need to know additional information (such as current point-in-call, pic) to enable the appropriate service resource to be identified. If the service resources associated with a number are located on different phone pages, then the additional information is also passed to the URI determination block 47 to enable it to return the URI of the appropriate phone page. It is also possible for all the service resources associated with a number to be located on the same phone page. In this case, the resource access block 46 uses the additional information to pass a resource-identifying parameter with its access request to the phone page concerned; it is then up to the functionality associated with the phone page to access the correct service resource.
Thus, each service resource can be considered as being identified by a respective resource code 54 (see
Resource Access—Where only one service resource 49 is located on a phone page 58 identified by a unique URI, then the resource code 54 simply comprises the UI, generally either a telephone number alone or a telephone number plus a pic parameter (see
In contrast, where multiple service resources 49 are located on the same phone page 58 (
An alternative to the
URI Determination from Resource Code—The implementation of the URI determination block 47 that performs process 55 will next be considered. Block 47 may be implemented in a variety of ways, four of which are described below:
Direct Input
It would be possible, though not necessarily convenient, to arrange for the calling party to input directly the required URI. The calling party may thus input the host id component of the URI required (either in the form of a host domain name or host IP address) plus the path component of the URI. For example, in the case where the phone page of a called party is to be accessed, the calling party may input the URI of the called party and, indeed, this input may substitute for the normal input of a telephone number. A leading input string (for example “999”) may be used to identify the input as an URI. As regards the input means, where a user only has a standard 12 key telephone, input of host domain names and other URI elements requiring alpha characters, will need to be done using one of the standard techniques for alpha input from a phonepad (such techniques are already used, for example, to enable a calling party to “spell” out the name of the called party). It would also be possible to provide users with a full alphanumeric keypad to facilitate URI input.
Computation
Service resource access over the Internet could be restricted to a set of dialed numbers from which it was possible to compute a corresponding URI; in this case, this computation would be the responsibility of block 47.
Association Table Lookup
Probably the simplest implementation for the block 47 is as an association table (either in memory or held on database disc store 48) associating a URI with the UI part of each resource code. A potential problem with this approach is that a service resource may be required for a called party number on the other side of the world which implies a rigorous update regime between PSTN operators worldwide in order to keep the association table up-to-date. (Note that the same implication is not necessarily applicable in respect of marking the called-party number as one required to trigger a service request, since the number may be arranged to be one of a group of numbers all triggering an appropriate service request, in a manner similar to 800 numbers).
DNS-Type Lookup
An alternative lookup solution is to use a hierarchically-structure-d distributed database system, similar to (or even part of) the Domain Name System (DNS) of the Internet, in order to resolve the UI part of a resource code to a corresponding URI. This approach, which will be described in more detail below, would typically involve databases maintained by each PSTN operator for its numbers with which URIs are associated. These databases would be accessible by all PSTNs through a network such as the Internet with resolution requests being pointed to the appropriate database in a manner similar to the Domain Name System. In this case, the block 47 is constituted by an appropriate resolution program arranged to request UI resolution over the Internet through interface 44.
Before describing a DNS-type lookup implementation for the URI determination block 47, some further general comments are appropriate. Whatever method is used to determine the URI, certain simplifications are possible if limited constraints are placed on the URIs permitted. In particular, it is not necessary to determine all components of an URI in the following cases:
(i) A part of the URI path component can be made standard for all service resources, this standard part being simply added by the block 47 once the rest of the URI has been determined. For example, where a roaming number is to be looked up, it may by convention always be held in a file “roam” in a subdirectory “tel” of a subscriber's directory on a particular server. In this case the URI host component and the subscriber-unique part of the path component are first determined and then the remaining path part “/tel/roam” is added.
(ii) The URI path component can be arranged to be the same as a predetermined part of the resource code, the block 47 needing only to determine the host component and then add the path. For example, it may be agreed that the path must always end with the telephone number concerned, or sufficient of the terminating digits to have a high probability of uniqueness on the host machine. The path may also include standard components to be added by block 47.
(iii) Blocks of telephone numbers may have their corresponding service resources located on the same host server so that it is only necessary to use a part of the telephone number to determine the host component of the URI; in this case, the path component can conveniently include all or part of each telephone number. This situation implies a tight degree of control by the telephone operators and does not offer the telephone user the freedom to choose the host server on which user places their phone page.
Another general point worthy of note is that however the URI is determined, the host component of the URI may be provided either in the form of a host domain name or a host IP address. Where the host is identified by a domain name, then a further resolution of URI host name to IP address will subsequently be carried out in standard manner by interface 44 using the Domain Name System of the Internet. This further resolution can be avoided if the host identity is directly provided as an IP address.
Where a database lookup is used to provide the number to URI translation, this database may be independent of, or combined with, a customer database containing other customer-related information. Factors affecting this choice include, on the one hand, the possible desirability of having the number-to-UI translation information widely available, and on the other hand, the possible desirability of restricting access to other customer-related information.
DNS-Type URI Lookup
A DNS-type lookup implementation for the URI determination block 47 will now be described in some detail for the case where the UI part of the resource code is a telephone number and there are no constraints on the URI, thereby requiring both the full host and path components of the URI to be returned by the lookup. A key part of the overall process is the formation of the equivalent of a host domain name from the telephone number of interest; this domain-name equivalent is then resolved into a corresponding URI by a lookup mechanism which in the present example is identical to that employed by the DNS (indeed, the lookup mechanism may be incorporated into the DNS though it can also be independently implemented).
The nature of the DNS has already been described above with reference to
The basic principles surrounding operation of a Duris system are:
every telephone number can be turned into a host domain name (the name space containing such host domain names for the telephone numbers of interest is referred to below as the “telname space”); and
for every host domain name in the host domain space there is a Registration Record held by the Duris system containing the corresponding URI.
Thus, an input telephone number forming, in the present case, the UI part of a resource code 54 (see
There are a number of possibilities at the top level as to how a Duris system could be implemented:
(a) Independent of the DNS. In this option, the telname space constitutes the entire name space to be managed with the root of the telname space being the “.” name space root (see
(b) Unfragmented Telname Space within the DNS. In this option, the telname space is a domain of the DNS name space and the Duris system is provided by the DNS itself. Thus, where the telname space comprises all domain names derived from public telephone numbers worldwide, the telname space could be placed within the domain of the ITU, in a special subdomain “tel”, the root of the telname space then being “tel.itu.int.” (see
(c) Fragmented Telname Space within the DNS. In this option, the telname space is split between multiple domains of the DNS name space and the Duris system is provided by the DNS itself. Thus where the telname space comprises all domain names derived from public telephone numbers worldwide, the telname space could be split between respective “tel” subdomains of each country domain; thus, as illustrated in
Consideration will next be given to the parsing of a telephone number into a domain name—in other words, where to insert the “.” characters into the number to provide the structuring of a domain name. Of course, as already explained, telephone numbers are hierarchically structured according to each country's numbering plan. Thus one approach would be to follow this numbering plan structuring in dividing up a telephone number to form a domain name. By way of example, the telephone number “441447456987” which is a UK number (country code “44”) with a four digit area code (“1447”) and six digit local number (“456987”) could be divided to form a domain name of 456987.1447.44 (note that the reversal of label order occasioned by the fact that the DNS labels are arranged least significant first). If the telname space is a subdomain of the DNS with a placement as illustrated in
456987.1447.44.tel.itu.int.
There are however, difficulties inherent with trying to match the numbering plan hierarchy when parsing a telephone number into a host name. Firstly, in order to parse an international number correctly, it would be necessary for each entity tasked with this operation to know the structuring of each country's numbering plan and where, as in the UK, area codes may be of differing length the required knowledge may need to take the form of a lookup table. Whilst this is not a complicated computational task, it is a major administrative nuisance as it means that each country will need to inform all others about its numbering plan and any updates. The second problem is that a six or seven digit local number is a very large domain; it would be preferable to create subdomains for performance and scaling reasons but there is no obvious way of doing this.
These problems can be overcome by giving up the restriction that the parsing of telephone number into a domain name should match the structuring of national numbering plans. In fact, there is no strong reason to follow such a scheme as DNS servers know nothing about the meaning of the name space. It is therefore possible to parse telephone numbers using a deterministic algorithm taking, for example, 4 digits at a time to limit the size of each subdomain and making it possible to ‘insert the dots’ without knowing the numbering plan concerned. So long as the DNS domains and zones served by the DNS servers are created correctly it will all work.
For international numbers it would still seem appropriate to separate off the country codes and so a hybrid parsing scheme would be to parse the initial part of a dialed number according to known country codes and thereafter use a deterministic scheme (for example 3, 7 or 4, 6 or 3,3,4) to separate the digits. Of course, if a fragmented telname space is being used as illustrated in Figure UC then the country code is used to look up the host name tail and it is only the national part of the number which would be parsed.
Finally, as regards the details of how a DNS server can be set up to hold RR records with URIs, reference can be made, for example, to “DNS and BIND”, Paul Albitz and Criket Liu, O'Reilly & Associates, 1992 which describes how to set up a DNS server using the Unix BIND implementation. The type of the RR records is, for example, text.
It should be noted that DNS labels should not in theory start with a digit. If this convention is retained, then it is of course a trivial exercise when parsing a telephone number to insert a standard character as the first character of each label. Thus, a 4 digit label of 2826 would become “t2826” where “t” is used as the standard starting character.
It will be appreciated that as with domain names, where an input telephone number is not the full number (for example, a local call does not require any international or area code prefix), it would be parsed into a domain name in the local domain.
The foregoing discussion of Duris system implementation, has been in terms of translating a telephone number into an URI where the telephone number forms the full UI of a resource code and the Duris system returns a full URI. It will be appreciated that the described Duris implementation can be readily adapted to accommodate the various modification discussed above regarding the form of the UI and what parts of the URI need to be looked up. For example, where there are a number of differents service resources associated with a subscriber each in its own file and the required source is identified by a pic part of the resource code, then the input telephone number will be used to look up, not the full URI, but the host component and that part of the path component up to the relevant subdirectory, the pic part of the UI then being appended to identify the required resource file.
For small local Duris implementations, it may be possible to have a single server; the implementation should still, however, be considered as of a DNS type provided the other relevant features are present.
Nature of Service Resources
Turning now to a consideration of the service resources 49, how these service resources can be provisioned onto the servers 51 will be described more fully below but, by way of present example, the service resource or resources associated with a particular PSTN user (individual or organisation, whether a calling or called party) can be placed on a server 51 over the Internet from a user terminal 53 in one or more WWW pages.
Consider the simple case where the service resource is a service data item such as a telephone number (for example, an alternative number to be tried if the user's telephone corresponding to the number dialed by a calling party is busy). This diversion number could be made the sole service resource of a phone page of the user. The phone page URI could be a URL with scheme set to HTTP in which case the GET method could be used to retrieve the diversion number. Such an arrangement is suitable if the phone page is only to be used for functional retrieval of the diversion number. However, if the diversion number is to be visually presented at a user terminal 53, then it may be desirable to accompany the number with explanatory material (this will often not be necessary as the diversion number can be arranged to be returned into an existing displayed page that already provides context information). However, where the phone page does include explanatory material as well as the diversion number, an entity only wishing to make functional use of the phone page, could be arranged to retrieve the phone page and then extract the diversion number (this would, of course, require a standard way of identifying the information to be extracted from the phone page).
An alternative and preferred arrangement for providing for both viewing and functional access to a resource requiring explanatory material for viewing, is to use an object-oriented approach to resource design. In this case, the resource object would have two different access methods associated with it, one for purely functional use of the resource and the other enabling viewing of associated explanatory material. It would then be up to the accessing entity to access the resource object using the appropriate object method.
Yet another arrangement for providing for both viewing and functional use of the diversion number, would be to provide separate resources appropriately configured for each use, each resource having its own resource code (generally, both such resources would be placed on the same phone page and in this case the UI part of each resource code would be the same).
Retrieval of a phone page for use by a human user will generally not be as time critical as retrieval for operational use by a PSTN. Thus, while for human use the scheme specified in the URL of a service resource could be HTTP, it may be advantageous for operational use to define a special “phone” scheme (access protocol) which would result in the server 51 using an optimised access routine to access the required resource (diversion number, in the current example) and respond to the accessing entity in the minimum possible time.
Besides data items, other possible types of service resource include service logic for execution in place (at the server) with the result of this execution being returned to the entity accessing the resource; service logic downloadable from the server to the accessing entity for execution at that entity; and a logging resource for logging information passed to it by the accessing entity (or simply for logging the fact that is has been accessed). It will be appreciated that the logging resource is really just a particular case of service logic executable in place.
By way of example, a service resource constituted by execute-in-place service logic can be arranged to implement time-of-day routing, the result of executing the service logic being the telephone number to which a call should be routed taking account of the time of day at the called party's location. An example of a service resource constituted by downloadable service logic is service logic for controlling calling-party option interrogation using the facilities provided by an IP. As regards the logging resource, this can be used for recording the number of calls placed to a particular number.
Where each resource has its own phone page and the resource is present only in its unembellished functional form, then the HTTP scheme can be employed for access using the GET method for both the downloadable service logic and the execution-in-place service logic, and the POST method for the logging resource. If it is desired to provide an explanatory material with each service resource, then any of the solutions discussed above in relation to data items, can be used.
Where more than one service resource is to be associated with a number, then each such resource can be placed on a respective phone page with its own URI. However, the preferred approach is to place all such service resources on the same page and use the RRI part of the corresponding resource codes to enable access to the appropriate resource. The accessed resource is then treated according to its form (executed if execute-in-place service logic, returned if downloadable service data or logic).
Thus if both a diversion-number service-data resource and a time-of-day execution-in-place service-logic resource are placed on the same phone page, the diversion-number resource code might have an RRI of “1” whilst the time-of day resource code might have an RRI value of “2”.
Where calling/called party options are to be included in a service resource for presentation to such party, then as already indicated, this can conveniently be done by constituting the service resource as downloadable service logic with the chosen option possibly initiating request for a follow-up service resource.
It will be appreciated that a service resource will often be of a complex type, combining service data and/or downloadable service logic and/or execute in place service logic. A particularly powerful combination is the combination of the two types of service logic where the downloadable service logic is designed to interact with execute-in-place service logic; using this arrangement, the user can be presented with complex client-server type applications.
Example Usage of Service Resource
In the present example, the association between B's Webtel number and the URL of B's phone page is stored in an association table accessible to SCP 43.
Upon a user A seeking to contact user B by dialing the Webtel number of B, the telephone 40 being used by A passes a call set up request to SSP 41 (note that in
The
It will be appreciated that although in the
With respect to the logging service resource mentioned above, one possible application for such a resource is in telephone voting. In this case, dialing the voting number causes the SSP picking up the call to pass a service request to SCP 43 which then contacts the appropriate logging resource over the Internet to register a vote after which the call is terminated. To minimise bottlenecks, a logging resource could be provided at a different URL for each SCP, it being a simple matter to collect and collate voting from all these logging resources over the Internet. If an SCP with Internet access is provided at every SSP, then the risk of congestion is greatly reduced.
As already noted, a user's phone page may hold multiple service resources in which case the access request from the accessing SCP needs to contain an appropriate RRI identifying the required resource.
In the event that an SCP is to provide both a traditional IN service to some users and an equivalent service using an Internet-accessed service resource to other users, then a lookup table may need to be provided in the SCP to ensure that a service request is appropriately handled; such a lookup table can conveniently be combined with the customer record database.
Once a user, such as user B, has set up one or more phone pages specifying his desired service resources (particularly service logic defining personalised services), it is clearly logical for user B to want any PSTN operator he cares to use, to access and utilise such service resources. This is possible if the Webtel-to-URI databases are available to all operators. Thus multiple operators could be set to access B's phone page or pages. If an operator declines to use B's phone pages, B can obviously chose not to use that operator (at least where that operator provides a long haul carrier service subject to user selection). The possibility therefore arises that service provision will cease to command a premium from operators, but that the provision of phone-page utilisation by an operator will become a necessary basic feature of PSTN operation.
Provisioning and Updating Service Resources
Consideration will next be given as to how the service resources 49 are provisioned to the servers 51 and subsequently updated.
So far as provisioning is concerned, two basic actions are required: firstly, the service resource must be placed on a server 51 and, secondly, the URI of the service resource must be notified to the PSTN operator along with the trigger conditions (number plus any other condition such as point in call) calling for access to the resource; if multiple resources are provided at the same URI, then the RRI values needed to retrieve the appropriate resource for a particular trigger condition, must also be notified. This notification process will be referred to hereinafter as registering the service resource with the PSTN operator; registration is, of course, necessary to enable the association tables used by SCP 43 to be set up and for trigger conditions to be set in SSPs 43. For certain services, such as that described above with reference to
As to the process of placing a service resource on a server 51, how this is carried out will depend on the attitude of the PSTN operator to the possible effects of such service resources on operation of the PSTN. Where the service resource simply returns a data item to an accessing entity, then an operator may not be too concerned about possible errors (accidental or deliberate) in implementing the service resource. However, the operator will probably be much more concerned about the proper operation of any service logic that may be returned by a resource; indeed, an operator may not permit such a service resource.
Assuming for the moment that an operator has no concerns about the nature or implementation of service resources, then how a resource is placed on a server 51 will largely depend on the nature of the server concerned. For example, if a user has a computer with network access to the Internet and this computer is used as server 51, then the user can simply load a desired resource onto the server as a WWW phone page for external access. A similar situation arises if the server is an organisation server to which the server has access over an internal LAN. In both these latter cases, loading the resource as a WWW phone page does not itself require Internet access. However, if the server 51 is one run by an external Internet service provider, then a user can arrange to download the required service resource into the user's allocated Web site space on the server; this may or may not involve Internet access. One special case of this latter scenario is where the PSTN operator provides a special server for user phone pages containing service resources.
Except where a user's own computer acts as server 51, placing a service resource on a server will generally involve clearing one or more levels of password protection.
As regards the origin of the service resource loaded by a user onto server 51, this may be generated by the user or, particularly where the resource includes service logic, may be provided by a third party (including the PSTN operator).
If the PSTN operator wishes to have control over the service resources 49 to avoid any adverse effects on operation of the PSTN, two approaches are possible. Firstly, the operator could require that every resource (or, possibly, a particular subset) had to be subject to a verification process before use, appropriate measures then being taken to avoid subsequent alteration of the resource by the user (except, possibly, for particular data items); in this respect, the operator could require that the resource be placed on a server under the operator's control and to which the user had no write access (except possibly for altering particular data items, as indicated above). A second, more attractive, approach to minimising adverse effects by the service resources 49, is for the operator to provide standard service resources to which a user could-add the user's own data (and possibly make limited functional selections in case where the resource included service logic); the customised resource would then be loaded onto a server 51 controlled by the operator. This process can be conveniently implemented for a particular resource using an HTML “form” which a user could download over the WWW from the operator-controlled server. After completing the form and activating a commit graphical button of the form, the entered information would be posted back to the server where the information would be used to produce a customised service resource thereafter placed on the server for access over the Internet. An advantage of this approach is that registration of the service resource with the operator is simultaneously effected. (It may be noted that if registration needs to be done as a separate act from having a service resource loaded on a server, then using an HTML form is a very convenient way to implement the registration process).
From the foregoing it can be seen that whilst the provisioning process does not necessarily require information to be passed over the Internet, in many cases this will be the best solution, particularly if an HTML form exchanged over the WWW can be used to produce a customised service resource. It should be noted that producing a customised service resource using an HTML form is not limited to cases where the PSTN operator controls the server.
As regards updating service resources, there is likely to be a need to update certain data items on a fairly frequent basis (for example, roaming number). Where the PSTN operator does not place any controls on the service resources 49, then update is a relatively simple matter, only requiring write access to the server concerned (as already indicated, this will generally involve one or more levels of password protection). However, where the PSTN operator exercises control over the service resources, for example by only permitting customisations of standard service resources, such customised resources being loaded on servers controlled by the operator), then write access to the service resource may be tightly controlled. Again, an HTML form may conveniently be used as the medium for modifying a data item in such cases; to the operator, this has the benefit of limiting the modifications possible whilst to the user, a form interface should provide a simple route to resource modification.
For more complex updates, it may be necessary to go through a process similar to that required for initial provisioning.
Particularly where the service resources are held on a server 51 controlled by the PSTN operator, resource update will generally involve communication over the Internet.
Web User Interaction
Consideration will next be given to other possible uses of the service resources held in phone pages on the servers 51. For example, if user B's phone page contains a diversion number, then provided this phone page is read-accessible over the Internet from user A's terminal 53, user A can use a graphical Web browser running on terminal 53 to view B's phone page and discover B's diversion number. As earlier discussed, the diversion number may be passed to user A for display in an existing visual context giving meaning to the number, or may be passed to user A with accompanying explanatory text.
A more useful example is a current roaming number service for user B. Suppose B's phone page 49 on server 51 (see
B's current number to be called is then determined and passed to user A's terminal 53 (see arrow 68) where it is displayed. An explanatory text concerning the number will generally also be displayed; for example the text “Please call me at the following number:” could be displayed, this text being provided either by the HTML script associated with the phone button, or from the phone page when returning the current number. In fact, it would probably be more helpful to provide user A, not only with the current number for reaching user B, but also with all numbers where B could be reached together with the times when B was most likely to be at each number. Since this extra information is likely to be subject to frequent change, the only sensible way to provide the information is from the phone page. Thus, B's phone page not only provides the current number for reaching B, but also a text that includes numbers and times subject to change; scripting B's phone page is, of course, done in a way that ensures that variable data need only be altered in one place.
In a further example, B's phone page might include downloadable service logic for execution at user A's terminal. This is useful where choices are to be presented to a user, each choice producing a follow-up action such as fetching a further phone page. For example, the first-accessed phone page may be a family phone page giving the general telephone number for a family but also giving the user the possibility of selecting further phone information on each family member, such as a time-of-day dependent number; in this case, each family member has their own follow-up phone page.
In the above scenarios, user A has been presented with a number to call over the PSTN. User A can now pick up his standard telephone and dial the number given. In fact, a complication arises if A only has Internet access via a SLIP/PPP connection over an ordinary, non-ISDN, PSTN line since, in this case, A's telephone line is already tied up with making Internet access when gateway 90 seeks to set up a call to A's telephone; with an ISDN connection, as two channels are available, this problem does not arise. One way of overcoming this problem would be to have user A's terminal 53, after obtaining the number to call from B's phone page, automatically suspend its Internet session by storing any required state information (for example, current WWW URL being accessed) and then terminate its SLIP/PPP connection to thereby free up the telephone line. A can then telephone B. At the end of this call, A can resume the suspended Internet session, using the stored state information to return to the point where A left off to call B. An alternative approach is to operate a suitable multiplexing modulation scheme on the telephone line to A allowing voice and data to be simultaneously carried. A number of such schemes already exist. The PSTN would then need to separate the combined data and voice rams coming from A at some point and pass each to its appropriate destination (the Internet data being forwarded to the ISP providing the SLIP/PPP connection for user A and the voice stream being passed to B); of course, data and voice traffic in the reverse direction would also need combining at some point for sending over the last leg to A's terminal.
Rather than A manually dialing B using a standard telephone, another possibility is that user A's terminal is provided with functionality enabling A to make a call over the PSTN from his terminal; this functionality generally comprises a hardware interface 70 (
However the call is placed, if B's telephone corresponding to the number tried by A is busy, a number of possibilities exist. Thus if B has a phone page that specifies a diversion number, and B has registered this service resource with the PSTN, then the diversion number should be automatically tried by the PSTN. However, if the diversion number resource has not been registered with the PSTN a busy signal will returned to A. Where A has placed the call through a standard telephone, A must now decide how to proceed and A may elect either to give up or to refer again to B's phone page to look up the diversion number and redial using this number. If A placed the original call using his terminal 53 then the latter can be programmed to detect the return of a busy signal and then automatically look up B's diversion number and redial using this number. This functionality can be included in service logic downloaded from B's phone page and run on A's terminal.
If A had to terminate his Internet session in order to free up the telephone line for voice use, then referring back to B's phone page requires a new Internet session to be started (in fact, this inconvenience could be avoided if B's diversion number were passed to A's terminal at the time the original number to be dialed for B was supplied).
The service resource accessed on B's phone page upon B's telephone being busy may, of course, be more complex than just a diversion number. In particular, user A may be presented with a range of options including, for example, B's fax or voice mailbox number, the selection of an option potentially initiating the running of appropriate accessing software. Another possible option would be for A to leave B a call back message using a form downloaded from B's phone page upon this option being chosen; the completed form would be posted back to server 51 and logged for B to check in due course.
Of course, it may arise that user A wishes to access B's phone page to find out, for example, B's current roaming number, but user A does not know the URI of B's Web site and only has B's Webtel number. A could just call B through the PSTN in which case the translation of B's Webtel number to roaming number would be automatically effected (assuming B is still registered for this service); however, A may not wish to call B straight away, but just note his current roaming number. In order to solve A's problem, the Webtel-to-URI association tables previously described are preferably made accessible on the Internet at a known address (for example, at a known Web site). All that A need now do is to access this Web site passing B's Webtel number; B's phone page URI will then be returned to A who can then use it to access B's phone page. This process can, of course be made automatic from the point when A sends B's Webtel number to the association-table Web site.
Internet/PSTN Call Interface
In the
Thus, upon A initiating a call to B, Internet phone software 81 in A's terminal sends call initiation signalling over the Internet to interface 80, the address of which is already known to A's terminal. At interface 80, the signalling is converted into ISDN-type signalling and passed to SSP 41. Call set up then proceeds in the normal way and return signalling is transferred back through interface 80, over the Internet, to the software 81 in A's terminal. This software passes call setup progress information to the WWW browser 73 for display to A. Upon the call becoming established, A can talk to B through his telephone and A's voice input is first digitised in phone hardware interface 83 and then inserted into IP packets by software 81 to traverse the Internet to interface 80 (see arrow 84); voice traffic from B follows the reverse path.
IN services can be provided to this call by SCP in response to a service request from an SSP 41. Thus, if B's phone is busy, and B is registered for call diversion, SCP 43 on receiving a service request will access B's appropriate phone page for call diversion and retrieve the diversion number. If SSP 41 is not set to initiate a service request on B's telephone being busy, the busy indication is returned to A's terminal where it can be handled in the manner already described with reference to
In fact, interface 80 can be provided with functionality similar to an SSP to set trigger conditions and generate a service request to SCP 43 on these conditions being satisfied.
Third-Party Call Setup Gateway
Thus, upon A wishing to call B, a third-party call setup request is sent from A's terminal over the Internet to the gateway 90 (see arrow 91). This setup request includes A's telephone number and B's current roaming number. Gateway 90 first attempts to setup the call to A's telephone (which should generally succeed) and thereafter to set up the call to B's identified telephone. Once the call is setup, A and B communicate in standard manner across the PSTN.
If B's phone had been busy, then any of the previously described scenarios may ensue.
Gateway 90 can also be arranged to make service requests to SCP 43 upon predetermined trigger conditions being satisfied. Thus, gateway 90 might be set to pick up the busy condition on B's telephone and initiate a service request to SCP 43 for a diversion number. However passing the busy indication back to A's terminal via gateway 90 is preferred because of the flexibility it gives A regarding further action.
As already generally discussed in relation to
It may be noted that the third party call setup request made by A's terminal to gateway 90 could equally have been made by service logic held in B's phone page and executed by server 51 (such an arrangement would, of course, require A's telephone number to be passed to B's phone-page service logic and this could be arranged to occur either automatically or through a form presented to user A at terminal A and then posted back to server 51).
It may also be noted that the interface 80 of
Www-Based “FreePhone” (800 Number) Services
It is possible to implement a “FreePhone” or “800 number” type of service using a combination of the WWW and the PSTN. As will be seen from the following description of such a service with reference to
In the
Suppose user A at terminal 53 is browsing D's Website, looking at the catalogue pages (arrow 121). If A sees an item of interest and wishes to make an enquiry to D about this item, then A can activate at terminal 53 the graphical freephone button 122 associated with the catalogue page concerned. This activation causes code embedded in the catalogue page currently loaded in A's terminal to prompt the user to enter their telephone number and, optionally, their name, after which an HTTP request is sent to D's freephone page using the POST method and enclosing the entered data (arrow 123). D's freephone page on receiving this request executes service logic to enter a new enquiry (including A's name and telephone number) in an enquiry queue 127 maintained in an enquiry control system 126. In the present example, the enquiry control system is connected to the server 51 via line 125, externally of the Internet; however, it would also be possible to have server 51 communicate with the enquiry control system through the Internet and, indeed, this may be the most practical arrangement where D's Website is on an ISP server rather than on a server controlled by D. In fact, the code run in A's terminal upon activation of the freephone graphical button 122 could be arranged to directly forward the enquiry request to the enquiry control system over the Internet rather than passing it back through the server 51.
The enquiry control system 126 manages enquiries passed to it to ensure that they are dealt with in an ordered manner. The system 126 on receiving a new enquiry preferably estimates approximately how long it will be before the enquiry is dealt with, this estimation being based on the number of currently queued enquiries and the average time taken to handle an enquiry. This estimation of waiting time is passed back via server 51 to user A in the response to the POST request message.
The enquiry control system 126 looks after the distribution of enquiries to a number of agents each of which is equipped with a telephone 40 and a display 129. A's enquiry will be dealt with as soon as it reaches the head of the queue 127 and there is an agent detected as available to handle the enquiry (thus, for example, the system may be arranged to detect when an agent's telephone goes on hook). When these conditions are met, a distribution and setup control unit 128 takes A's enquiry and displays A's name and telephone number on the display 129 of the available agent (for clarity, herein referenced as agent D′); if user D keeps a database on D's past customers or credit rating data, then unit 128 will also look for and display any such further information known about A. At the same time, unit 128 makes a third-party call setup request (arrow 130) over the Internet to gateway 90 asking for a call to be set up between the telephone of the available agent D′ and the telephone of user A, both telephones being identified by their respective numbers. If both D′ and A pick up the call, the enquiry then proceeds, the cost of the call being paid for by D as it is D that originated the call over the PSTN. If, for whatever reason, the call remains incomplete (for example, unanswered by A) for a predetermined timeout period, then unit 128 can be arranged to automatically pass on to the next enquiry at the head of the queue 127.
It would, of course, be possible to dispense with having the unit 128 request call setup through gateway 90 and either have the agent D′ dial A's number manually or have unit 126 initiate auto-dialing for D′ telephone (agent D′ having, for example, a computer-integrated telephone similar to that of A's in
As discussed in relation to
Where user A only has a telephone 40 and no terminal 53, it is still possible to utilise the basic structure of
A significant advantage of the above freephone schemes using WWW, is that user D is not running up charges for use of the PSTN during periods when an enquiry is enqueued, waiting to be handled.
Variants
Many variants are, of course, possible to the above-described arrangements and a number of these variants are described below.
Distributed Processing Environment. As is illustrated in
Service Resources on DNS-Type Servers. In the foregoing examples, the service resource items have been placed on servers 51 connected to the Internet and a desired service resource has then been accessed over the Internet by the service control subsystem of the PSTN, and/or by Internet users, through the use of an URI derived from a resource code that identifies the desired service resource item. In a preferred arrangement for deriving the URI from a resource code in the form of a telephone number, all or part of the telephone number concerned was parsed into domain name form and then resolved into an URI using a DNS-type distributed database system that, indeed, could be integrated into the DNS itself (see
Feedback Mechanisms. In discussing the WWW-based freephone arrangement of
In the described arrangements, the servers 51 have held service resource items concerned primarily with call setup control. It may be noted that in a somewhat different application, Internet servers could be arranged to hold data that could be accessed from the telephone system in response to a user-initiated telephone request and returned to that telephone user. Such a service would he provided, for example, in response to an SSP triggering a service request upon a particular telephone number being input, the service request prompting an SCP to cause an intelligent peripheral to access a particular Internet server (not necessarily an HTTP server) and retrieve the required data for return to the calling party. The intelligent peripheral may include a text-to-voice converter for replaying the data vocally to the user.
One further feedback process is also worthy of note, in this case in relation to service resource items themselves. By way of example, a telephone user G may subscribe to a service by which calls passed through to G's telephone are to be separated by a minimum of X minutes, X being user settable. To implement this service, G has a phone page on a server 51 that includes a “busy” status indication. Upon termination of a successful call to G, G's local SSP triggers the sending of a message by the associated SCP over the Internet to G's phone page. This message causes G's busy indication to be set to indicate that G is busy; the message also starts a timer which times out after a period X and causes the busy status indication to be reset. A call attempt to G will either be rejected at G's SSP because G's line is genuinely busy or will trigger the SSP to enquire via the SCP whether G's phone-page busy status indication is set. If the busy status indication is set (which it will be during the period X following termination of a successful call) the call attempt is rejected whereas if the busy status indication is in its reset condition, the call attempt is allowed to proceed.
By placing the busy status indication mechanism on G's phone page, it is possible to arrange for G to be able to easily change the value of X.
More General Variants. Whilst the service control subsystem of the PSTN has been embodied as an SCP in the foregoing examples, it will be appreciated that the functionality of the service control subsystem could be provided as part of an SSP or in an associated adjunct. Furthermore, the triggering of service requests can be effected by equipment other than SSPs, for example by intercept boxes inserted in the SS7 signalling links.
It will be appreciated that the term “Internet” is to be understood to include not only the current specification of the TCP/IP protocols used for the Internet and the current addressing scheme, but also evolutions of these features such as may be needed to deal with isochronous media. Furthermore, references to the WWW and the HTTP protocol should equally be understood to encompass their evolved descendants.
The present invention can also be applied to telephone systems other than just PSTNs, for example to PLMNs and other mobile networks, and to private systems using PABXs. In this latter case, a LAN or campus-wide computer network serving generally the same internal users as the PABX, will take the role of the Internet in the described embodiments.
Furthermore, the present invention has application where any switched telecommunication system (for example, a broadband ATM system) requires service control and a computer network can be used for the delivery of service resources to the service control subsystem of the telecommunication system.
| Number | Date | Country | Kind |
|---|---|---|---|
| 9525190.6 | Dec 1995 | GB | national |
| 95410148 | Dec 1995 | EP | regional |
| 9603582.9 | Feb 1996 | GB | national |
The present application is a continuation of U.S. patent application Ser. No. 11/066,880, filed Feb. 25, 2005, which is a divisional of U.S. patent application Ser. No. 10/052,285, filed Jan. 18, 2002 (now U.S. Pat. No. 7,012,916), which is a divisional of U.S. patent application Ser. No. 09/077,795, filed Jun. 5, 1998 (now U.S. Pat. No. 6,466,570), which claims priority under 35 USC 371 to PCT application No. PCT/GB96/03055, filed Dec. 11, 1996, which further claims priority to Great Britain Patent Application No. GB 9603582.9, filed Feb. 20, 1996, to European Patent Application No. EP 95410148.1, filed Dec. 22, 1995, and to Great Britain Patent Application No. GB 9525190.6, filed Dec. 11, 1995. All of the above-listed patent applications, publications thereof, and patents, are hereby incorporated by reference herein as to their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4054756 | Comella et al. | Oct 1977 | A |
| 4100377 | Flanagan | Jul 1978 | A |
| 4201891 | Lawrence et al. | May 1980 | A |
| 4313035 | Jordan et al. | Jan 1982 | A |
| 4611094 | Asmuth et al. | Sep 1986 | A |
| 4611096 | Asmuth et al. | Sep 1986 | A |
| 4653045 | Stanley et al. | Mar 1987 | A |
| 4659877 | Dorsey et al. | Apr 1987 | A |
| 4679190 | Dias et al. | Jul 1987 | A |
| 4685125 | Zave | Aug 1987 | A |
| 4713806 | Oberlander et al. | Dec 1987 | A |
| 4718005 | Feigenbaum et al. | Jan 1988 | A |
| 4734931 | Bourg et al. | Mar 1988 | A |
| 4747130 | Ho | May 1988 | A |
| 4771425 | Baran et al. | Sep 1988 | A |
| 4788718 | McNabb et al. | Nov 1988 | A |
| 4821034 | Anderson et al. | Apr 1989 | A |
| 4872157 | Hemmady et al. | Oct 1989 | A |
| 4893302 | Hemmady et al. | Jan 1990 | A |
| 4897874 | Lidinsky et al. | Jan 1990 | A |
| 4899373 | Lee et al. | Feb 1990 | A |
| 4933931 | Kokubo | Jun 1990 | A |
| 4969184 | Gordon et al. | Nov 1990 | A |
| 4979206 | Padden et al. | Dec 1990 | A |
| 4996707 | O'Malley et al. | Feb 1991 | A |
| 5025254 | Hess | Jun 1991 | A |
| 5029196 | Morganstein | Jul 1991 | A |
| 5065393 | Sibbitt et al. | Nov 1991 | A |
| 5068888 | Scherk et al. | Nov 1991 | A |
| 5107492 | Roux et al. | Apr 1992 | A |
| 5113499 | Ankney et al. | May 1992 | A |
| 5115495 | Tsuchiya et al. | May 1992 | A |
| 5146488 | Okada et al. | Sep 1992 | A |
| 5146491 | Silver et al. | Sep 1992 | A |
| 5157390 | Yoshie et al. | Oct 1992 | A |
| 5157662 | Tadamura et al. | Oct 1992 | A |
| 5159592 | Perkins | Oct 1992 | A |
| 5159624 | Makita | Oct 1992 | A |
| 5164938 | Jurkevich et al. | Nov 1992 | A |
| 5185860 | Wu | Feb 1993 | A |
| 5193110 | Jones et al. | Mar 1993 | A |
| 5195085 | Bertsch et al. | Mar 1993 | A |
| 5195086 | Baumgartner et al. | Mar 1993 | A |
| 5204894 | Darden | Apr 1993 | A |
| 5206901 | Harlow et al. | Apr 1993 | A |
| 5223699 | Flynn et al. | Jun 1993 | A |
| 5226075 | Funk et al. | Jul 1993 | A |
| 5241588 | Babson, III et al. | Aug 1993 | A |
| 5247571 | Kay et al. | Sep 1993 | A |
| 5260986 | Pershan | Nov 1993 | A |
| 5272749 | Masek | Dec 1993 | A |
| 5287199 | Zoccolillo | Feb 1994 | A |
| 5311583 | Friedes et al. | May 1994 | A |
| 5317566 | Joshi | May 1994 | A |
| 5325421 | Hou et al. | Jun 1994 | A |
| 5327486 | Wolff et al. | Jul 1994 | A |
| 5329520 | Richardson | Jul 1994 | A |
| 5329578 | Brennan et al. | Jul 1994 | A |
| 5333266 | Boaz et al. | Jul 1994 | A |
| 5347633 | Ashfield et al. | Sep 1994 | A |
| 5351276 | Doll, Jr. et al. | Sep 1994 | A |
| 5351286 | Nici | Sep 1994 | A |
| 5353331 | Emery et al. | Oct 1994 | A |
| 5361256 | Doeringer et al. | Nov 1994 | A |
| 5390335 | Stephan et al. | Feb 1995 | A |
| 5392344 | Ash et al. | Feb 1995 | A |
| 5396542 | Alger et al. | Mar 1995 | A |
| 5402478 | Hluchyj et al. | Mar 1995 | A |
| 5406557 | Baudoin | Apr 1995 | A |
| 5418844 | Morrisey et al. | May 1995 | A |
| 5422940 | Endo et al. | Jun 1995 | A |
| 5423003 | Berteau | Jun 1995 | A |
| 5425028 | Britton et al. | Jun 1995 | A |
| 5425085 | Weinberger et al. | Jun 1995 | A |
| 5425091 | Josephs | Jun 1995 | A |
| 5428608 | Freeman et al. | Jun 1995 | A |
| 5436963 | Fitzpatrick et al. | Jul 1995 | A |
| 5438568 | Weisser, Jr. | Aug 1995 | A |
| 5440563 | Isidoro et al. | Aug 1995 | A |
| 5440620 | Slusky | Aug 1995 | A |
| 5448633 | Jamaleddin et al. | Sep 1995 | A |
| 5450411 | Heil | Sep 1995 | A |
| 5452289 | Sharma et al. | Sep 1995 | A |
| 5452350 | Reynolds et al. | Sep 1995 | A |
| 5455821 | Schaeffer et al. | Oct 1995 | A |
| 5459775 | Isono et al. | Oct 1995 | A |
| 5461611 | Drake, Jr. et al. | Oct 1995 | A |
| 5463677 | Bash et al. | Oct 1995 | A |
| 5469496 | Emery et al. | Nov 1995 | A |
| 5469497 | Pierce et al. | Nov 1995 | A |
| 5473608 | Gagne et al. | Dec 1995 | A |
| 5475748 | Jones | Dec 1995 | A |
| 5475817 | Waldo et al. | Dec 1995 | A |
| 5477531 | McKee et al. | Dec 1995 | A |
| 5479494 | Clitherow | Dec 1995 | A |
| 5481603 | Gutierrez et al. | Jan 1996 | A |
| 5483586 | Sussman | Jan 1996 | A |
| 5483587 | Hogan et al. | Jan 1996 | A |
| 5487111 | Slusky | Jan 1996 | A |
| 5495521 | Rangachar | Feb 1996 | A |
| 5500889 | Baker et al. | Mar 1996 | A |
| 5500929 | Dickinson | Mar 1996 | A |
| 5506887 | Emery et al. | Apr 1996 | A |
| 5506893 | Buscher et al. | Apr 1996 | A |
| 5511111 | Serbetcioglu et al. | Apr 1996 | A |
| 5513127 | Gard et al. | Apr 1996 | A |
| 5521719 | Yamada | May 1996 | A |
| 5521924 | Kakuma et al. | May 1996 | A |
| 5524137 | Rhee | Jun 1996 | A |
| 5526353 | Henley et al. | Jun 1996 | A |
| 5526416 | Dezonno et al. | Jun 1996 | A |
| 5526489 | Nilakantan et al. | Jun 1996 | A |
| 5530744 | Charalambous et al. | Jun 1996 | A |
| 5530852 | Meske, Jr. et al. | Jun 1996 | A |
| 5533115 | Hollenbach et al. | Jul 1996 | A |
| 5539884 | Robrock, II | Jul 1996 | A |
| 5539886 | Aldred et al. | Jul 1996 | A |
| 5541917 | Farris | Jul 1996 | A |
| 5541927 | Kristol et al. | Jul 1996 | A |
| 5541930 | Klingman | Jul 1996 | A |
| 5546452 | Andrews et al. | Aug 1996 | A |
| 5551025 | O'Reilly et al. | Aug 1996 | A |
| 5551035 | Arnold et al. | Aug 1996 | A |
| 5559721 | Ishii | Sep 1996 | A |
| 5559871 | Smith | Sep 1996 | A |
| 5561670 | Hoffert et al. | Oct 1996 | A |
| 5563882 | Bruno et al. | Oct 1996 | A |
| 5570410 | Hooshiari | Oct 1996 | A |
| 5575961 | Kuwabara et al. | Nov 1996 | A |
| 5579472 | Keyworth, II et al. | Nov 1996 | A |
| 5583920 | Wheeler, Jr. | Dec 1996 | A |
| 5586177 | Farris et al. | Dec 1996 | A |
| 5590127 | Bales et al. | Dec 1996 | A |
| 5590181 | Hogan et al. | Dec 1996 | A |
| 5594769 | Pellegrino et al. | Jan 1997 | A |
| 5594789 | Seazholtz et al. | Jan 1997 | A |
| 5603084 | Henry, Jr. et al. | Feb 1997 | A |
| 5603085 | Shedlo | Feb 1997 | A |
| 5604682 | McLaughlin et al. | Feb 1997 | A |
| 5604737 | Iwami et al. | Feb 1997 | A |
| 5608446 | Carr et al. | Mar 1997 | A |
| 5608786 | Gordon | Mar 1997 | A |
| 5610910 | Focsaneanu et al. | Mar 1997 | A |
| 5610972 | Emery et al. | Mar 1997 | A |
| 5610976 | Uota et al. | Mar 1997 | A |
| 5617422 | Litzenberger et al. | Apr 1997 | A |
| 5617540 | Civanlar et al. | Apr 1997 | A |
| 5619555 | Fenton et al. | Apr 1997 | A |
| 5619557 | Van Berkum | Apr 1997 | A |
| 5619562 | Maurer et al. | Apr 1997 | A |
| 5623601 | Vu | Apr 1997 | A |
| 5625404 | Grady et al. | Apr 1997 | A |
| 5625407 | Biggs et al. | Apr 1997 | A |
| 5625675 | Katsumaru et al. | Apr 1997 | A |
| 5625677 | Feiertag et al. | Apr 1997 | A |
| 5625682 | Gray et al. | Apr 1997 | A |
| 5627886 | Bowman | May 1997 | A |
| 5629978 | Blumhardt et al. | May 1997 | A |
| 5633916 | Goldhagen et al. | May 1997 | A |
| 5634012 | Stefik et al. | May 1997 | A |
| 5636216 | Fox et al. | Jun 1997 | A |
| 5646982 | Hogan et al. | Jul 1997 | A |
| 5651006 | Fujino et al. | Jul 1997 | A |
| 5652787 | O'Kelly | Jul 1997 | A |
| 5654957 | Koyama | Aug 1997 | A |
| 5657250 | Park et al. | Aug 1997 | A |
| 5661197 | Villiger et al. | Aug 1997 | A |
| 5661782 | Bartholomew et al. | Aug 1997 | A |
| 5661790 | Hsu | Aug 1997 | A |
| 5664005 | Emery et al. | Sep 1997 | A |
| 5664102 | Faynberg | Sep 1997 | A |
| 5668857 | McHale | Sep 1997 | A |
| 5673263 | Basso et al. | Sep 1997 | A |
| 5675507 | Bobo, II | Oct 1997 | A |
| 5675741 | Aggarwal et al. | Oct 1997 | A |
| 5680116 | Hashimoto et al. | Oct 1997 | A |
| 5680392 | Semaan | Oct 1997 | A |
| 5687167 | Bertin et al. | Nov 1997 | A |
| 5689550 | Garson et al. | Nov 1997 | A |
| 5689553 | Ahuja et al. | Nov 1997 | A |
| 5692039 | Brankley et al. | Nov 1997 | A |
| 5694463 | Christie et al. | Dec 1997 | A |
| 5699089 | Murray | Dec 1997 | A |
| 5699352 | Kriete et al. | Dec 1997 | A |
| 5701295 | Bales et al. | Dec 1997 | A |
| 5701465 | Baugher et al. | Dec 1997 | A |
| 5703935 | Raissyan et al. | Dec 1997 | A |
| 5703940 | Sattar et al. | Dec 1997 | A |
| 5703942 | Pinard et al. | Dec 1997 | A |
| 5708780 | Levergood et al. | Jan 1998 | A |
| 5710884 | Dedrick | Jan 1998 | A |
| 5712903 | Bartholomew et al. | Jan 1998 | A |
| 5712906 | Grady et al. | Jan 1998 | A |
| 5712907 | Wegner et al. | Jan 1998 | A |
| 5712908 | Brinkman et al. | Jan 1998 | A |
| 5719854 | Choudhury et al. | Feb 1998 | A |
| 5724355 | Bruno et al. | Mar 1998 | A |
| 5724406 | Juster | Mar 1998 | A |
| 5724412 | Srinivasan | Mar 1998 | A |
| 5726984 | Kubler et al. | Mar 1998 | A |
| 5727129 | Barrett et al. | Mar 1998 | A |
| 5729544 | Lev et al. | Mar 1998 | A |
| 5729599 | Plomondon et al. | Mar 1998 | A |
| 5732078 | Arango | Mar 1998 | A |
| 5732219 | Blumer et al. | Mar 1998 | A |
| 5737333 | Civanlar et al. | Apr 1998 | A |
| 5737395 | Irribarren | Apr 1998 | A |
| 5737414 | Walker et al. | Apr 1998 | A |
| 5742668 | Pepe et al. | Apr 1998 | A |
| 5742905 | Pepe et al. | Apr 1998 | A |
| 5744533 | Iwamoto et al. | Apr 1998 | A |
| 5745694 | Egawa et al. | Apr 1998 | A |
| 5748468 | Notenboom et al. | May 1998 | A |
| 5751961 | Smyk | May 1998 | A |
| 5754639 | Flockhart et al. | May 1998 | A |
| 5757784 | Liebowitz et al. | May 1998 | A |
| 5758281 | Emery et al. | May 1998 | A |
| 5761290 | Farris et al. | Jun 1998 | A |
| 5774530 | Montgomery et al. | Jun 1998 | A |
| 5774533 | Patel | Jun 1998 | A |
| 5774670 | Montulli | Jun 1998 | A |
| 5781550 | Templin et al. | Jul 1998 | A |
| 5781624 | Mitra et al. | Jul 1998 | A |
| 5784617 | Greenstein et al. | Jul 1998 | A |
| 5787160 | Chaney et al. | Jul 1998 | A |
| 5790172 | Imanaka | Aug 1998 | A |
| 5790806 | Koperda | Aug 1998 | A |
| 5793672 | Wong et al. | Aug 1998 | A |
| 5796790 | Brunner | Aug 1998 | A |
| 5799063 | Krane | Aug 1998 | A |
| 5799317 | He et al. | Aug 1998 | A |
| 5802146 | Dulman | Sep 1998 | A |
| 5802502 | Gell et al. | Sep 1998 | A |
| 5802510 | Jones | Sep 1998 | A |
| 5809129 | Andersson et al. | Sep 1998 | A |
| 5812656 | Garland et al. | Sep 1998 | A |
| 5812776 | Gifford | Sep 1998 | A |
| 5812795 | Horovitz et al. | Sep 1998 | A |
| 5812865 | Theimer et al. | Sep 1998 | A |
| 5818921 | Vander Meiden et al. | Oct 1998 | A |
| 5825772 | Dobbins et al. | Oct 1998 | A |
| 5825869 | Brooks et al. | Oct 1998 | A |
| 5826268 | Schaefer et al. | Oct 1998 | A |
| 5828737 | Sawyer | Oct 1998 | A |
| 5828844 | Civanlar et al. | Oct 1998 | A |
| 5832197 | Houji | Nov 1998 | A |
| 5835723 | Andrews et al. | Nov 1998 | A |
| 5838682 | Dekelbaum et al. | Nov 1998 | A |
| 5838686 | Ozkan | Nov 1998 | A |
| 5838768 | Sumar et al. | Nov 1998 | A |
| 5838970 | Thomas | Nov 1998 | A |
| 5845267 | Ronen | Dec 1998 | A |
| 5848143 | Andrews et al. | Dec 1998 | A |
| 5850433 | Rondeau | Dec 1998 | A |
| 5864604 | Moen et al. | Jan 1999 | A |
| 5864610 | Ronen | Jan 1999 | A |
| 5864670 | Hayashi et al. | Jan 1999 | A |
| 5867495 | Elliott et al. | Feb 1999 | A |
| 5867566 | Hogan et al. | Feb 1999 | A |
| 5867571 | Borchering | Feb 1999 | A |
| 5870454 | Dahlen | Feb 1999 | A |
| 5870561 | Jarvis et al. | Feb 1999 | A |
| 5873077 | Kanoh et al. | Feb 1999 | A |
| 5878126 | Velamuri et al. | Mar 1999 | A |
| 5878128 | Kantola | Mar 1999 | A |
| 5878212 | Civanlar et al. | Mar 1999 | A |
| 5881134 | Foster et al. | Mar 1999 | A |
| 5883891 | Williams et al. | Mar 1999 | A |
| 5883894 | Patel et al. | Mar 1999 | A |
| 5884032 | Bateman et al. | Mar 1999 | A |
| 5889774 | Mirashrafi et al. | Mar 1999 | A |
| 5889777 | Miyao et al. | Mar 1999 | A |
| 5892754 | Kompella et al. | Apr 1999 | A |
| 5903558 | Jones et al. | May 1999 | A |
| 5903559 | Acharya et al. | May 1999 | A |
| 5903735 | Kidder et al. | May 1999 | A |
| 5907547 | Foladare et al. | May 1999 | A |
| 5909430 | Reaves | Jun 1999 | A |
| 5915008 | Dulman | Jun 1999 | A |
| 5915012 | Miloslavsky | Jun 1999 | A |
| 5917817 | Dunn et al. | Jun 1999 | A |
| 5923659 | Curry et al. | Jul 1999 | A |
| 5930348 | Regnier et al. | Jul 1999 | A |
| 5933412 | Choudhury et al. | Aug 1999 | A |
| 5933425 | Iwata | Aug 1999 | A |
| 5933486 | Norby et al. | Aug 1999 | A |
| 5936958 | Soumiya et al. | Aug 1999 | A |
| 5940479 | Guy et al. | Aug 1999 | A |
| 5940616 | Wang | Aug 1999 | A |
| 5944795 | Civanlar | Aug 1999 | A |
| 5949869 | Sink et al. | Sep 1999 | A |
| 5949977 | Hernandez | Sep 1999 | A |
| 5953322 | Kimball | Sep 1999 | A |
| 5953338 | Ma et al. | Sep 1999 | A |
| 5953392 | Rhie et al. | Sep 1999 | A |
| 5953504 | Sokal et al. | Sep 1999 | A |
| 5956391 | Melen et al. | Sep 1999 | A |
| 5956482 | Agraharam et al. | Sep 1999 | A |
| 5956697 | Usui | Sep 1999 | A |
| 5958016 | Chang et al. | Sep 1999 | A |
| 5960416 | Block | Sep 1999 | A |
| 5966427 | Shaffer et al. | Oct 1999 | A |
| 5966434 | Schafer et al. | Oct 1999 | A |
| 5970065 | Miloslavsky | Oct 1999 | A |
| 5978773 | Hudetz et al. | Nov 1999 | A |
| 5978840 | Nguyen et al. | Nov 1999 | A |
| 5987108 | Jagadish et al. | Nov 1999 | A |
| 5995503 | Crawley et al. | Nov 1999 | A |
| 5995606 | Civanlar et al. | Nov 1999 | A |
| 5999524 | Corbalis et al. | Dec 1999 | A |
| 6011975 | Emery et al. | Jan 2000 | A |
| 6014379 | White et al. | Jan 2000 | A |
| 6014437 | Acker et al. | Jan 2000 | A |
| 6014687 | Watanabe et al. | Jan 2000 | A |
| 6016307 | Kaplan et al. | Jan 2000 | A |
| 6018567 | Dulman | Jan 2000 | A |
| 6021126 | White et al. | Feb 2000 | A |
| 6021263 | Kujoory et al. | Feb 2000 | A |
| 6023724 | Bhatia et al. | Feb 2000 | A |
| 6026441 | Ronen | Feb 2000 | A |
| 6029203 | Bhatia et al. | Feb 2000 | A |
| 6035028 | Ward et al. | Mar 2000 | A |
| 6041109 | Cardy et al. | Mar 2000 | A |
| 6041117 | Androski et al. | Mar 2000 | A |
| 6044081 | Bell et al. | Mar 2000 | A |
| 6047051 | Ginzboorg et al. | Apr 2000 | A |
| 6047326 | Kilkki | Apr 2000 | A |
| 6049545 | Stephenson et al. | Apr 2000 | A |
| 6052445 | Bashoura et al. | Apr 2000 | A |
| 6052450 | Allison et al. | Apr 2000 | A |
| 6058113 | Chang | May 2000 | A |
| 6067516 | Levay et al. | May 2000 | A |
| 6069890 | White et al. | May 2000 | A |
| 6073160 | Grantham et al. | Jun 2000 | A |
| 6078582 | Curry et al. | Jun 2000 | A |
| 6084956 | Turner et al. | Jul 2000 | A |
| 6088358 | Tomita et al. | Jul 2000 | A |
| 6088431 | LaDue | Jul 2000 | A |
| 6097722 | Graham et al. | Aug 2000 | A |
| 6097804 | Gilbert et al. | Aug 2000 | A |
| 6098094 | Barnhouse et al. | Aug 2000 | A |
| 6101182 | Sistanizadeh et al. | Aug 2000 | A |
| 6104704 | Buhler et al. | Aug 2000 | A |
| 6108314 | Jones et al. | Aug 2000 | A |
| 6108704 | Hutton et al. | Aug 2000 | A |
| 6115737 | Ely et al. | Sep 2000 | A |
| 6125113 | Farris et al. | Sep 2000 | A |
| 6131095 | Low et al. | Oct 2000 | A |
| 6134433 | Joong et al. | Oct 2000 | A |
| 6137777 | Vaid et al. | Oct 2000 | A |
| 6141413 | Waldner et al. | Oct 2000 | A |
| 6141686 | Jackowski et al. | Oct 2000 | A |
| 6144647 | Lopez-Torres | Nov 2000 | A |
| 6144661 | Katsube et al. | Nov 2000 | A |
| 6144667 | Doshi et al. | Nov 2000 | A |
| 6151319 | Dommety et al. | Nov 2000 | A |
| 6154777 | Ebrahim | Nov 2000 | A |
| 6157648 | Voit et al. | Dec 2000 | A |
| 6167445 | Gai et al. | Dec 2000 | A |
| 6169735 | Allen, Jr. et al. | Jan 2001 | B1 |
| 6169748 | Barbas et al. | Jan 2001 | B1 |
| 6175618 | Shah et al. | Jan 2001 | B1 |
| 6181690 | Civanlar | Jan 2001 | B1 |
| 6181703 | Christie et al. | Jan 2001 | B1 |
| 6185198 | LaDue | Feb 2001 | B1 |
| 6188677 | Oyama et al. | Feb 2001 | B1 |
| 6195355 | Demizu | Feb 2001 | B1 |
| 6198738 | Chang et al. | Mar 2001 | B1 |
| 6205148 | Takahashi et al. | Mar 2001 | B1 |
| 6212162 | Horlin | Apr 2001 | B1 |
| 6233604 | Van Horne et al. | May 2001 | B1 |
| 6240091 | Ginzboorg et al. | May 2001 | B1 |
| 6243373 | Turock | Jun 2001 | B1 |
| 6252869 | Silverman | Jun 2001 | B1 |
| 6260067 | Barnhouse et al. | Jul 2001 | B1 |
| 6278693 | Aldred et al. | Aug 2001 | B1 |
| 6278704 | Creamer et al. | Aug 2001 | B1 |
| 6282281 | Low | Aug 2001 | B1 |
| 6298120 | Civanlar et al. | Oct 2001 | B1 |
| 6298383 | Gutman et al. | Oct 2001 | B1 |
| 6308216 | Goldszmidt et al. | Oct 2001 | B1 |
| 6310873 | Rainis et al. | Oct 2001 | B1 |
| 6324264 | Wiener et al. | Nov 2001 | B1 |
| 6324279 | Kalmanek, Jr. et al. | Nov 2001 | B1 |
| 6347085 | Kelly | Feb 2002 | B2 |
| 6359880 | Curry et al. | Mar 2002 | B1 |
| 6381321 | Brown et al. | Apr 2002 | B1 |
| 6385193 | Civanlar et al. | May 2002 | B1 |
| 6418461 | Barnhouse et al. | Jul 2002 | B1 |
| 6418467 | Schweitzer et al. | Jul 2002 | B1 |
| 6434624 | Gai et al. | Aug 2002 | B1 |
| 6446200 | Ball et al. | Sep 2002 | B1 |
| 6449650 | Westfall et al. | Sep 2002 | B1 |
| 6456617 | Oda et al. | Sep 2002 | B1 |
| 6463470 | Mohaban et al. | Oct 2002 | B1 |
| 6466570 | Low et al. | Oct 2002 | B1 |
| 6466984 | Naveh et al. | Oct 2002 | B1 |
| 6470081 | Sbisa et al. | Oct 2002 | B1 |
| 6498788 | Emilsson et al. | Dec 2002 | B1 |
| 6519254 | Chuah et al. | Feb 2003 | B1 |
| 6529516 | Parzych | Mar 2003 | B1 |
| 6556659 | Bowman-Amuah | Apr 2003 | B1 |
| 6584093 | Salama et al. | Jun 2003 | B1 |
| 6587433 | Borella et al. | Jul 2003 | B1 |
| 6594254 | Kelly | Jul 2003 | B1 |
| 6600733 | Deng | Jul 2003 | B2 |
| 6636485 | Fijolek et al. | Oct 2003 | B1 |
| 6654357 | Wiedeman | Nov 2003 | B1 |
| 6671285 | Kirkby et al. | Dec 2003 | B1 |
| 6678264 | Gibson | Jan 2004 | B1 |
| 6690788 | Bauer et al. | Feb 2004 | B1 |
| 6718380 | Mohaban et al. | Apr 2004 | B1 |
| 6754181 | Elliott et al. | Jun 2004 | B1 |
| 6768793 | Sbisa et al. | Jul 2004 | B1 |
| 6775519 | Wiedeman et al. | Aug 2004 | B1 |
| 6810033 | Derks | Oct 2004 | B2 |
| 6882643 | Mauger et al. | Apr 2005 | B1 |
| 6891945 | Porter et al. | May 2005 | B2 |
| 6983040 | Kalmanek Jr. et al. | Jan 2006 | B1 |
| 7013001 | Felger | Mar 2006 | B1 |
| 7024450 | Deo et al. | Apr 2006 | B1 |
| 7032022 | Shanumgam et al. | Apr 2006 | B1 |
| 7061923 | Dugan et al. | Jun 2006 | B2 |
| 7065571 | Schweitzer et al. | Jun 2006 | B2 |
| 7088705 | Curry et al. | Aug 2006 | B2 |
| 7170887 | Rosenberg | Jan 2007 | B2 |
| 7185073 | Gai et al. | Feb 2007 | B1 |
| 7236575 | Kim et al. | Jun 2007 | B2 |
| 7286562 | Vargo et al. | Oct 2007 | B1 |
| 20010039576 | Kanada | Nov 2001 | A1 |
| 20010040885 | Jonas et al. | Nov 2001 | A1 |
| 20020041590 | Donovan | Apr 2002 | A1 |
| 20020064149 | Elliott et al. | May 2002 | A1 |
| 20020083166 | Dugan et al. | Jun 2002 | A1 |
| 20020114324 | Low et al. | Aug 2002 | A1 |
| 20020167940 | Low et al. | Nov 2002 | A1 |
| 20030039210 | Jin et al. | Feb 2003 | A1 |
| 20030193933 | Jonas et al. | Oct 2003 | A1 |
| 20030198335 | Porter et al. | Oct 2003 | A1 |
| 20040005046 | Deo et al. | Jan 2004 | A1 |
| 20040215787 | Gibson et al. | Oct 2004 | A1 |
| 20050021713 | Dugan et al. | Jan 2005 | A1 |
| 20050191989 | Plush et al. | Sep 2005 | A1 |
| 20060239254 | Short et al. | Oct 2006 | A1 |
| 20070050492 | Jorgensen | Mar 2007 | A1 |
| 20070204036 | Mohaban et al. | Aug 2007 | A1 |
| 20070263644 | Christie et al. | Nov 2007 | A1 |
| Number | Date | Country |
|---|---|---|
| 0559979 | Sep 1993 | EP |
| 0654930 | May 1995 | EP |
| 0729281 | Aug 1996 | EP |
| 0740445 | Oct 1996 | EP |
| 0767568 | Apr 1997 | EP |
| 0781016 | Jun 1997 | EP |
| 0802690 | Oct 1997 | EP |
| 0812089 | Dec 1997 | EP |
| 0823809 | Feb 1998 | EP |
| 0729281 | Jan 2000 | EP |
| 1091528 | Nov 2001 | EP |
| 1091528 | Nov 2001 | EP |
| 09168051 | Jun 1997 | JP |
| 09168063 | Jun 1997 | JP |
| 09168064 | Jun 1997 | JP |
| 09168065 | Jun 1997 | JP |
| 09172459 | Jun 1997 | JP |
| 09172462 | Jun 1997 | JP |
| 9107839 | May 1991 | WO |
| 9325035 | Dec 1993 | WO |
| 9411813 | May 1994 | WO |
| 9423523 | Oct 1994 | WO |
| 9522221 | Aug 1995 | WO |
| 9529564 | Nov 1995 | WO |
| 9609714 | Mar 1996 | WO |
| 9620553 | Apr 1996 | WO |
| 9620448 | Jul 1996 | WO |
| 9620553 | Jul 1996 | WO |
| 9632800 | Oct 1996 | WO |
| 9634341 | Oct 1996 | WO |
| 9638018 | Nov 1996 | WO |
| 9714238 | Apr 1997 | WO |
| 9716007 | May 1997 | WO |
| 9720424 | Jun 1997 | WO |
| 9722211 | Jun 1997 | WO |
| 9723078 | Jun 1997 | WO |
| 9726749 | Jul 1997 | WO |
| 9728628 | Aug 1997 | WO |
| 9732427 | Sep 1997 | WO |
| 9733412 | Sep 1997 | WO |
| 9823080 | May 1998 | WO |
| 9834391 | Aug 1998 | WO |
| 9834391 | Aug 1998 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20090219923 A1 | Sep 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10052285 | Jan 2002 | US |
| Child | 11066880 | US | |
| Parent | 09077795 | US | |
| Child | 10052285 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11066880 | Feb 2005 | US |
| Child | 12389851 | US |
