Patent Grant
7257642
The present invention relates to communication systems and in particular to systems for handling remote access connections.
Many providers of communication services employ a plurality of remote-access servers, such as modems, Fax handlers and voice Internet Protocol (VoIP) services connected to telephone switches. A channel router receives incoming communication requests and determines which remote-access server is to handle each incoming request. Some remote access servers are multi-channel servers which have a capacity to handle concurrently a plurality of connections up to a predetermined maximal number. In addition, some remote-access servers which are implemented mainly in software, such as the Surf Multi-access Pool (SMP) from Surf Communication Solutions Ltd., and servers 3Com, Ascend, Access, ADI, Connexent, Telogy, and Hothaus, can handle different types of connections concurrently.
When an incoming connection is received by the channel router, the router finds a remote-access server which can handle the type of the incoming connection and which is handling less than the maximal number of connections of its capacity. If no such server is found, a busy signal is returned in response to the incoming connection.
The processing power required for handling a single connection depends on the type of the connection. For example, handling a modem connection usually requires more processing power than a Fax connection, and therefore a multi-channel multi-connection-type remote access server can handle concurrently different numbers of connections according to the types of the connections. In some cases, the exact processing power needed to handle a connection is not known until the handling of the connection actually begins. In order not to overload a server beyond its capacity, existing channel routers usually assume conservative numbers for the number of channels which can be handled concurrently by a multi-channel server, for example, assuming that all the connections the server handles require a maximal processing power required by any connection. This causes waste in the usage of the multi-channel remote access servers in a multi-service system. This waste, however, provides additional assurance that the servers will be able to handle the connections they are assigned.
An aspect of some embodiments of the present invention relates to a channel router which routes incoming connections to multi-access servers based on the actual processing resources (e.g., processing power, memory) required for the connection and the available resources of the servers. Possibly, the channel router keeps track not only of the number of connections handled at any specific moment by each remote access server, but of the type of the connections and/or the resources that these connections require. Alternatively or additionally, the channel router is constantly updated by the remote access servers of their available unused resources, or of data from which the amount of available resources may be determined. Accordingly, the channel router selects, for each incoming connection, a server which handles the connection. The selection is possibly performed in a manner which maximizes the number of connections which are handled concurrently by the system. In some embodiments of the invention, the selection is performed using packing theory algorithms.
An aspect of some embodiments of the present invention relates to a channel router which keeps track of the processing resources of the remote access servers by receiving from at least some of the servers updates relating to the available resources of the servers. Possibly, the updates state the unused processing resources of the servers. Alternatively or additionally, the updates state the numbers and/or types of connections currently being handled by the servers.
In some embodiments of the present invention, the router re-routes connections between servers while the connections are in progress. In some cases an incoming connection requires an amount of resources which is not available on any of the servers but is available on two or more servers together. Possibly, the router re-routes one or more connections which require less resources than the incoming connection between the servers in order to make a single server have sufficient resources to handle the incoming connection.
There is therefore provided in accordance with an embodiment of the present invention, a method of channel routing, including receiving an incoming connection, determining an amount of processing resources required to handle the incoming connection, and selecting a remote access server to handle the incoming connection, responsive to the determined amount of processing resources. Possibly, determining the amount of processing resources includes determining an amount of processing power and/or an amount of memory.
Possibly, determining the amount of processing power includes selecting an amount of processing power from a look up table. Alternatively or additionally, determining the amount of processing resources includes determining a plurality of suitable combinations of resources. Possibly, determining the amount of processing resources includes determining responsive to a type of the received incomimg connection and/or to a quality of service of the received incoming connection.
Possibly, determining the amount of processing resources includes determining separately for each remote access server responsive to capabilities of the remote access server.
Possibly, selecting the remote access server includes determining an amount of available processing resources for each of a plurality of remote access servers.
Possibly, determining the amount of available processing resources for each of the remote access servers includes receiving indications of the available processing power from the remote access servers. Possibly, receiving indications of the available processing resources includes receiving indications periodically irrespective of the receiving of the incoming connection. Possibly, determining the amount of available processing resources for each of the remote access servers includes keeping track of the assignment of connections to be handled by the servers. Possibly, selecting the remote access server includes selecting based on packing theory. Possibly, selecting the remote access server includes selecting according to a priority of the received incoming connection.
Possibly, the method includes requesting from the selected remote access server to lower the amount of processing resources assigned to one or more currently handled connections in order to vacate resources for the received incoming connection.
There is further provided in accordance with some embodiments of the present invention, a method of managing a plurality of remote access servers by a channel router, including receiving by the channel router from at least one of the remote access servers, data on the current usage of the server, and determining available processing resources of the at least one server responsive to the received data.
Possibly, receiving the data includes receiving indication of the available processing power. Possibly, receiving the data includes receiving data on of the connections currently handled by the server. Possibly, receiving the data includes receiving an indication of the number of connections currently handled by the server. Possibly, receiving the data includes receiving the data periodically. Possibly, receiving the data periodically includes receiving at periods determined responsive to attributes of the servers sending the updates. Possibly, receiving the data includes receiving the data responsive to prompting the servers for the data.
There is further provided in accordance with some embodiments of the present invention, a method of channel routing, including receiving an incoming connection, selecting a remote access server to handle the incoming connection, and instructing the selected remote access server to reduce the amount of processing resources assigned to one or more currently handled connections of the server in order to vacate resources for the received incoming connection.
There is further provided in accordance with some embodiments of the present invention, a switch system which handles incoming connections, including a plurality of remote access servers, and a channel router which determines for each incoming connection an amount of processing resources required to handle the incoming connection and which selects one of the remote access servers to handle the connection, responsive to the determined amount of processing resources.
Possibly, the plurality of remote access servers includes at least one software based server. Possibly, the plurality of remote access servers includes at least one server which can handle connections of a plurality of different types. Possibly, at least one of the plurality of remote access servers sends updates relating to the available resources of the at least one server to the channel router.
Possibly, the channel router manages a table of the available resources of each of the plurality of servers. Possibly, at least one of the servers includes an array of servers managed by an internal channel router.
The invention will be more clearly understood by reference to the following description of embodiments thereof in conjunction with the figures, in which:
In some embodiments of the invention, a server 24 may comprise an array of a plurality of servers connected by a router, such as a router 22 in accordance with any of the embodiments of the present invention or any router known in the art. Thus, routers 22 may be implemented in a hierarchy of routers and servers.
Table 1 is an example of a table of servers 24 in system 20 managed by channel router 22, in accordance with an embodiment of the present invention. For each remote access server 24, channel router 22 possibly lists information on the capabilities of the server, such as the types of connections the server can handle (line 1). For multi-channel multi-connection-type servers, such as software based servers, the table possibly also lists the total processing resources of the server (lines 2, 3 and 4). For other servers, the table possibly lists the number of connections which can be handled concurrently by the server (line 2, server D).
Possibly, channel router 22 also comprises a list of the processing resources required for each type of connection. In an embodiment of the invention, each server has a separate list of required processing resources (possibly part of table 1) according to the particular capabilities of the server (not shown).
Table 1 possibly includes for each server 24 a list of the connections currently handled by the server (line 5, the numbers represent identities of connections) and/or the number of connections of each type handled by the server. Alternatively or additionally, table 1 lists the utilized and/or available (line 4) processing power of the server.
In some embodiments of the invention, each time a connection is assigned to a server 24 and each time a connection is terminated, channel router 22 updates the server table so as to keep track of the available processing resources of each server 24. Possibly, servers 24 send updates also when the resources required to handle a currently handled connection change, for example, when the rate of a modem connection changes. Alternatively or additionally, some or all of servers 24 send updates to router 22, which updates are used to update the server table. Possibly, the updates include the currently available processing resources of the server. Alternatively or additionally, the updates include listings of the connections currently handled by the servers 24.
In some embodiments of the invention, the updates are sent periodically every predetermined amount of time, such as every few seconds or minutes. Alternatively or additionally, the updates are sent each time there is a substantial change in the available processing resources of a server and/or in the number of connections handled by the server. Further alternatively or additionally, servers 24 send updates at rates determined according to the importance of their updates to the routing decisions made by router 22. The importance of the updates may be a function of the types of connections handled by the servers 24 and/or of the available processing resources of the servers. For example, in an exemplary embodiment of the invention, servers which have little available processing resources send frequent updates to channel router 24 while servers which have a large amount of available processing resources send updates less frequently.
In some embodiments of the invention, channel router 22 prompts servers 24 for the updates. Optionally, each time an incoming connection is received, router 22 prompts for updates those servers 24 which are candidates to handle the connection. Alternatively or additionally, router 22 prompts servers 24 without relation to the incoming connections.
In some embodiments of the invention, the required processing resources are determined based on the type of the incoming connection, e.g., Fax, voice, Fax over IP (FoIP), VoIP, video, modem, and xDSL. Optionally, the required processing resources are determined based on other connection attributes, such as, connection speeds, allowed delays (average, maximal), quality of service (QoS), class of service and encoding schemes of the data on the connection. The type of connection is possibly determined using any method known in the art, such as by automatic call identification and/or by using different telephone numbers for different types of connections and/or for connections with different attributes.
In some embodiments of the present invention, incoming connections are referred to a temporary server 24 which begins handling the connection. Router 22 monitors the connection in order to determine the type of the connection and/or the processing resources required to handle the connection. After a server 24 to handle the connection is selected (54), the connection is re-routed to the selected server, while the connection is being handled.
In an embodiment of the invention, the processing resources include one or more of processing power, memory, and connection bandwidth. The processing power required to handle a connection refers to a number of instructions per second which need to be performed in order to handle the connection and/or to an amount of time required to handle the connection per time unit. The processing power may be measured, for example, in MIPS, clock cycles and/or time. The processing power of a server 24 refers to the number of instructions the server can perform per second or to a similar measure. The connection bandwidth of a server 24 refers to the maximal amount of bandwidth the connection may receive along the links entering the server. The bandwidth may be referred to in some systems using numbers of PCM time slots.
It is noted that in some embodiments of the invention there are a plurality different combinations of processing resources which can handle the same connection. In some embodiments of the present invention, the processing power required to handle a connection is a function of the memory allocated to the handling of the connection. That is, a certain connection may require x processing power if the connection is allocated y memory bytes and 2× processing power if the connection is allocated y/2 memory bytes. In this embodiment, the determining (52) of the processing resources comprises determining a plurality of resource combinations which are sufficient to handle the connection.
In some embodiments of the invention, router 22 determines (52) the required processing resources by consulting a look up table. Alternatively or additionally, the required processing resources are calculated as a function of the type of the connection and the other attributes of the connection.
In some embodiments of the invention, all of servers 24 require substantially the same amount of processing resources to handle the same connection. In this embodiment, channel router 22 possibly manages a single look up table from which the required processing resources are determined. In another embodiment of the invention, for example in which one or more of servers 24 are optimized for specific types of connections, the server-table lists for each server, the processing power required for each type of connection and for each different attribute value.
Referring in more detail to selecting (54) a server 24 to handle the incoming connection, the selected server 24 is possibly one which can handle the specific type of the incoming connection, and has sufficient available processing resources to do so (at least the determined processing resources of the incoming connection). In some embodiments of the invention, the selection is performed using theoretical models, such as packing theory methods, in order to maximize the chances that at least one of servers 24 will have sufficient processing resources to handle subsequent incoming connections.
For example, in an embodiment of the present invention, channel router 22 gives first precedence to selecting a server 24 which has sufficient available processing power to handle the incoming connection but does not have sufficient available processing power to handle connections which require more processing power.
In some embodiments of the invention, router 22 attempts to leave available resources on servers 24 which are handling connections which are not utilizing maximal resources. For example, a server 24 which is handling a plurality of modem connections which are not working at their maximal speed is optionally left (if possible) with available resources to allow for higher modem rates, if required at a later time.
In some embodiments of the present invention, router 22 stores incoming connection statistics, for example as a function of the time and/or date, and accordingly router 22 performs the connection assignments to servers 24. For example, if it is known that during the night most incoming connections are modern connections router 24 will attempt to leave room in servers 24 for as many as possible modem connections rather than leaving room for Fax and voice connections.
In some embodiments of the present invention, the selection of a server 24 is performed based on the priorities of the various incoming connections. That is, router 22 maximizes the chances that connections of high priority will be handled. Connections of high priority, may be for example, connections of a certain type or connections from a certain caller. Alternatively or additionally, the selection of server 24 is performed to meet required QoS and classes of service of incoming connections.
In some embodiments of the present invention, the selection of servers 24 to handle the incoming connections is performed in a manner which attempts to achieve an even distribution of the connections between the servers. An even distribution distributes the damage in case one of servers 24 suddenly fails. Alternatively to attempting to achieve an even distribution of all the connections, those connections which require high classes of service, e.g., high reliability, are divided evenly between servers 24 and the rest of the connections are divided according to other criterions. High reliability connections are possibly defined according to QoS and/or according to the type of the connection. For example, failure of VoIP connections is usually considered more annoying than failure of Fax connections and therefore VoIP connections require higher reliability.
Alternatively to dividing some or all of the connections evenly, servers 24 are graded according to their reliability, and the number of connections assigned to specific servers 24 is determined according to the reliability of the servers.
In some embodiments of the present invention, incoming connections may be serviced at different levels of service resulting in different usage levels of the resources of server 24. For example, modem connections may be handled at different rates. Possibly, in times when a large number of connections are expected, router 22 assigns lower levels of service to connections of low QoS and/or of types which are less urgent. Thus, router 22 leaves resources for incoming high priority connections.
In some cases, none of servers 22 have sufficient available resources to handle an incoming connection. In an exemplary embodiment of the invention, upon receiving a connection of high priority when none of servers 24 have sufficient available resources to handle the connection, router 22 instructs one of servers 24 to lower the rate of one or more connections to make room for the newly coming high priority connection.
Alternatively or additionally, upon receiving a connection which requires an amount of resources which is not available on any of servers 24, router 22 re-routes between the servers one or more connections which are in progress, in order to accumulate free resources on a single server which could handle the newly received connection. For example, two servers 24 may each have available resources which equal half the available resources required for a modem connection. Assuming a Fax connection requires half the resources of a modem connection, each one of these two servers 24 could handle an additional Fax connection. Therefore, router 22 possibly re-routes a Fax connection from one of the two servers to the other, freeing the required resources on the former server 24 to handle the incoming modem connection.
In some embodiments of the invention, some or all of servers 24 have a common memory (not shown) in which status information of the connections, is stored. When a router 22 determines that a connection is to be transferred from a first server 24 to a second server 24 while the connection is being handled, router 22 instructs the first server 24 to stop processing the connection. The first server 24 optionally performs a final handling session of the connection and then acknowledges to the router that it is not handling the connection. Alternatively, the first server 24 immediately acknowledges that it is not handling the connection. Optionally in this alternative, if the first server 24 is in the middle of a handling session of the connection it first finishes the handling session. Thereafter, router 22 instructs the second server 24 to handle the connection. Optionally, the second server 24 immediately performs a processing session of the newly received connection. Alternatively, the connection is posted to wait its turn according to regular scheduling methods. Alternatively or additionally, other methods for transferring a connection between servers 24 may be used, such as described in relation to processors of a DSL modem pool in PCT application PCT/IL00/00266, filed May 9, 2000, the disclosure of which is incorporated herein by reference.
Possibly, the methods described above for selecting (54) a server 24 for handling incoming connections, apply also to selecting servers for re-routed connections. The connections for which a server 24 is chosen may be re-routed for any reason, such as to make room for an incoming connection as described above and/or in case a server 24 fails and some or all of the connections it handled are re-routed. In some embodiments of the invention, router 22 determines periodically for each of servers 24 to which other servers its connections will be re-routed in case the server fails. Possibly, router 22 may operate in a backup mode in which servers 24 have at any time sufficient resources to handle the connections of one of the servers which fails and there exists a re-routing scheme which can re-route the connections of the failed server to the other servers. Possibly, in the backup mode router 22 routes the incoming connections accordingly and declines connections if necessary.
Possibly, in the backup mode there is a re-routing scheme for the failure of any of servers 24. Alternatively, there is a re-routing scheme only for a sub-group of servers 24. Possibly, high priority connections are routed to servers 24 in the sub-group. In some embodiments of the invention, only a predetermined percentage of the connections on any single server 24 are included in the re-routing scheme in the backup mode. That is, router 22 will ensure that in case a server 24 fails while the router operates in the backup mode, that at least the predetermined percentage of the connections of the failing server will be able to be re-routed to other servers 24.
It will be appreciated that the above described methods may be varied in many ways, including, changing the order of steps, and the exact implementation used. It should also be appreciated that the above described description of methods and apparatus are to be interpreted as including apparatus for carrying out the methods and methods of using the apparatus.
The present invention has been described using non-limiting detailed descriptions of embodiments thereof that are provided by way of example and are not intended to limit the scope of the invention. Variations of embodiments described will occur to persons of the art. Furthermore, the terms “comprise,” “include,” “have” and their conjugates, shall mean, when used in the claims, “including but not necessarily limited to.” The scope of the invention is limited only by the following claims:
| Number | Date | Country | Kind |
|---|---|---|---|
| 132888 | Nov 1999 | IL | national |
| PCT/IL00/00266 | May 2000 | IL | national |
This application is a U.S. national filing of PCT Application No. PCT/IL00/00703, filed Nov. 1, 2000. This application is also a continuation-in-part of U.S. application Ser. No. 09/501,078, filed Feb. 9, 2000, the disclosure of which is incorporated herein by reference.
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/IL00/00703 | 11/1/2000 | WO | 00 | 5/9/2002 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO01/35575 | 5/17/2001 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4827499 | Warty et al. | May 1989 | A |
| 4965641 | Blackwell et al. | Oct 1990 | A |
| 4974256 | Cyr et al. | Nov 1990 | A |
| 5287461 | Moore | Feb 1994 | A |
| 5349682 | Rosenberry | Sep 1994 | A |
| 5412656 | Brand et al. | May 1995 | A |
| 5446730 | Lee et al. | Aug 1995 | A |
| 5546388 | Lin | Aug 1996 | A |
| 5546456 | Vilsoet et al. | Aug 1996 | A |
| 5590345 | Barker et al. | Dec 1996 | A |
| 5598536 | Slaughter et al. | Jan 1997 | A |
| 5649108 | Spiegel et al. | Jul 1997 | A |
| 5687167 | Bertin et al. | Nov 1997 | A |
| 5701482 | Harrison et al. | Dec 1997 | A |
| 5721830 | Yeh et al. | Feb 1998 | A |
| 5729542 | Dupont | Mar 1998 | A |
| 5748629 | Caldara et al. | May 1998 | A |
| 5774668 | Choquier et al. | Jun 1998 | A |
| 5790533 | Burke et al. | Aug 1998 | A |
| 5790534 | Kokko et al. | Aug 1998 | A |
| 5790781 | Cox et al. | Aug 1998 | A |
| 5794058 | Resnick | Aug 1998 | A |
| 5799064 | Sridhar et al. | Aug 1998 | A |
| 5805827 | Chau et al. | Sep 1998 | A |
| 5809066 | Suomi et al. | Sep 1998 | A |
| 5828847 | Gehr et al. | Oct 1998 | A |
| 5852655 | McHale et al. | Dec 1998 | A |
| 5881050 | Chevalier et al. | Mar 1999 | A |
| 5892818 | Lee | Apr 1999 | A |
| 5896376 | Alperovich et al. | Apr 1999 | A |
| 5896386 | Johnston | Apr 1999 | A |
| 5905725 | Sindhu et al. | May 1999 | A |
| 5909384 | Tal et al. | Jun 1999 | A |
| 5920599 | Igarashi | Jul 1999 | A |
| 5925114 | Hoang | Jul 1999 | A |
| 5931950 | Hsu | Aug 1999 | A |
| 5935249 | Stern et al. | Aug 1999 | A |
| 5940459 | Hsu et al. | Aug 1999 | A |
| 5949977 | Hernandez | Sep 1999 | A |
| 5960035 | Sridhar et al. | Sep 1999 | A |
| 5982750 | Tabe et al. | Nov 1999 | A |
| 5982776 | Manning et al. | Nov 1999 | A |
| 5982814 | Yeh et al. | Nov 1999 | A |
| 5983282 | Yucebay | Nov 1999 | A |
| 5987135 | Johnson et al. | Nov 1999 | A |
| 5995540 | Draganic | Nov 1999 | A |
| 5999809 | Watanabe | Dec 1999 | A |
| 6006318 | Hansen et al. | Dec 1999 | A |
| 6070192 | Holt et al. | May 2000 | A |
| 6088732 | Smith et al. | Jul 2000 | A |
| 6112243 | Downs et al. | Aug 2000 | A |
| 6148006 | Dyke et al. | Nov 2000 | A |
| 6154445 | Farris et al. | Nov 2000 | A |
| 6160843 | McHale et al. | Dec 2000 | A |
| 6161201 | Payne et al. | Dec 2000 | A |
| 6163599 | McHale | Dec 2000 | A |
| 6181694 | Pickett | Jan 2001 | B1 |
| 6185698 | Wesley et al. | Feb 2001 | B1 |
| 6226277 | Chuah | May 2001 | B1 |
| 6307836 | Jones et al. | Oct 2001 | B1 |
| 6349123 | Kim | Feb 2002 | B1 |
| 6360263 | Kurtzberg et al. | Mar 2002 | B1 |
| 6385203 | McHale et al. | May 2002 | B2 |
| 6411617 | Kilkki et al. | Jun 2002 | B1 |
| 6457037 | Maytal | Sep 2002 | B1 |
| 6466976 | Alles et al. | Oct 2002 | B1 |
| 6473781 | Skagerwall et al. | Oct 2002 | B1 |
| 6490287 | Kilkki | Dec 2002 | B1 |
| 6516350 | Lumelsky et al. | Feb 2003 | B1 |
| 6523065 | Combs et al. | Feb 2003 | B1 |
| 6553376 | Lewis et al. | Apr 2003 | B1 |
| 6577871 | Budka et al. | Jun 2003 | B1 |
| 6603745 | Antonio et al. | Aug 2003 | B1 |
| 6614794 | Adas et al. | Sep 2003 | B1 |
| 6631354 | Leymann et al. | Oct 2003 | B1 |
| 6667972 | Foltan et al. | Dec 2003 | B1 |
| 6711159 | Grabelsky et al. | Mar 2004 | B1 |
| 6714532 | Kawaguchi | Mar 2004 | B1 |
| 6741572 | Graves et al. | May 2004 | B1 |
| 6907462 | Li et al. | Jun 2005 | B1 |
| 6963551 | Uebayashi et al. | Nov 2005 | B2 |
| Number | Date | Country |
|---|---|---|
| 0 491 489 | Jun 1992 | EP |
| 0 831 624 | Mar 1998 | EP |
| 0 859 492 | Aug 1998 | EP |
| 0 913 770 | May 1999 | EP |
| WO9854868 | Dec 1998 | WO |
| WO9906913 | Feb 1999 | WO |
| WO9920033 | Apr 1999 | WO |
| WO9939530 | Aug 1999 | WO |
| WO 0011843 | Mar 2000 | WO |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09501078 | Feb 2000 | US |
| Child | 10129743 | US |
