System and method of binding a client to a server

Information

  • Patent Grant
  • 8606874
  • Patent Number
    8,606,874
  • Date Filed
    Monday, August 31, 2009
    14 years ago
  • Date Issued
    Tuesday, December 10, 2013
    10 years ago
Abstract
Systems and methods to bind a client with a server are provided. A particular method includes establishing a connection between a server and a client. A list of best-fit server IP addresses is received at the client via the connection. A determination is made whether the server is identified in the list of best-fit server IP addresses. When the server is not identified in the list of best-fit server IP addresses, the connection to the server is terminated.
Description
FIELD OF THE DISCLOSURE

The present disclosure relates generally to implementation of client-server networks. More particularly, the disclosure provides systems and methods for maintaining the binding of a client, particularly a client with limited computational and storage resources, with at least one server.


BACKGROUND

The Internet has had a profound impact on the way society communicates. Today, the Internet is used for personal communications, for business communications, for shopping, for entertainment, for news, and more.


There are many applications that rely on a client being in constant contact with a server in order to perform a task. The client to server connection (binding) may be mission critical and may be maintained constantly. For example, an interruption in communications of approximately thirty seconds within a one-hour interval may be intolerable. Factors that may influence the client being in constant contact with the server include:

    • The client may reside on a small, specialized computer, with limited computational and storage resources (herein, an “Internet Appliance”).
    • To remove the potential for a “single point of failure” multiple servers may be deployed, geographically separated and independently addressable on the Internet. The number of servers may range into the hundreds.
    • When many clients (e.g., millions of clients) are expected, clients may be distributed across available servers to reduce the impact of a server failing and to maintain responsiveness of client/server bindings.
    • The binding between client and server may be dynamic. There are many potential causes for a client to need to change the server to which it is bound.


The desire for dynamic binding between a client and server may be related to a number of factors. To ensure that combined server resources are being allocated to provide optimal service to all clients, clients are distributed among servers. The distribution takes into account the “routing distance” between a client and the server (the number of Internet hops as well as message delivery latency). As more clients are added, the distribution may become sub-optimum and adjustment may be appropriate. In turn, some clients may be redirected to different servers. Another benefit of dynamic binding between client and server may be to provide for continuity of client services in the event a server fails or is pulled off-line for maintenance.


One approach for a client to identify and then bind with a server relies on the Internet Distributed Name Service (DNS), which can associate a static list of Internet IP addresses with a name. While machines respond to IP addresses in the form of number strings, humans are not as adept at remembering number strings. A name server (or DNS server) receives a name from a client, associates the name with an IP address, and sends the IP address to a client. The client then communicates with a server via the server's IP address.


The DNS is, however, far from simple. Name servers may receive millions of requests each day. Because a single name server may not know the address associated with a particular name, name servers may also be able to contact other name servers. A name server may start its search for an IP address by contacting one of the root name servers. The root name servers may know the IP address for all of the name servers that handle the top-level domains. For example, a name server might “ask” a root name server for the IP address associated with www.yahoo.com, and the root name server might “respond” (assuming no caching), that it does not know the IP address for www.yahoo.com, and instead provide the IP address for the COM name server. One of the keys to making this work is redundancy. There may be multiple name servers at every level, so if one fails, there are others to handle the requests.


To speed up the process, name servers may cache the IP addresses returned in response to requests. Name servers may not cache forever, though. The caching may use a component, called the Time To Live (TTL) that controls how long a name server will cache a piece of information. When a name server receives an IP address, it may receive the TTL with it. The name server may cache the IP address for that period of time (ranging from minutes to days) and then discard it. Using TTL enables changes to propagate to the name servers.


Not all name servers respect the TTL they receive, however. This means that new information and old information may reside in the DNS at the same time. Sometimes, it may take weeks for a change in an IP address to propagate throughout the Web. Additionally, implementing a DNS protocol on an Internet Appliance may require additional computational, program storage and data storage resources that may not be available or desirable to add.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates the interaction of an Internet Appliance with a server according to particular embodiments.



FIG. 2 illustrates a process according to particular embodiments in which an Internet Appliance (client) uses best-fit IP address to create a binding with a server.



FIG. 3 illustrates a process of receiving and verifying a best-fit list by a client according to particular embodiments.





DETAILED DESCRIPTION

Embodiments disclosed herein enable a client to receive and maintain a set of “best-fit” server IP addresses. The best fit server IP addresses establish a hierarchy of server addresses that are used by a client to maintain a binding with a server without using the DNS. In the case of an Internet Appliance, the set of best-fit server IP addresses may be relatively small. In one embodiment, an Internet Appliance maintains a set of three best-fit server IP addresses. However, this is not meant as a limitation. As will be apparent to those skilled in the art, any number of best-fit server IP addresses may be maintained by a client/Internet Appliance without departing from the scope of the present disclosure. Communicating the set of best-fit server IP addresses to a specific client may be accomplished using extensions of a network protocol already used to support client/server communications, thus minimizing the amount of code needed to support the additional information transfer.


It is therefore an aspect of particular embodiments to provide and maintain a set of best-fit server IP addresses with a client.


It is an aspect of particular embodiments to provide a set of best-fit server IP addresses to a client via a protocol used by the client and server to establish and/or conduct communications.


It is an aspect of particular embodiments to use a set of best-fit server IP addresses to dynamically bind a client with a server, either at the initialization of a session between the client and server or as a result of a loss of connectivity between the client and server, without using DNS.


Another aspect of particular embodiments is to minimize overhead required to dynamically bind a client with a server without using DNS.


These and other aspects of particular embodiments will become apparent from a review of the general and detailed descriptions that follow.


A particular embodiment provides a method for maintaining the binding of a client with a server. A server creates a list including of a list of best-fit server IP addresses for a client. Optionally, the list of best-fit server IP addresses are ordered according to network distribution criteria, such as a routing distance between the client and each server associated with each of the list of best-fit server IP addresses, a message delivery latency, and server loading. A transmission protocol used by the client and the server is extended for communications to transport the best-fit server IP list. The best-fit server IP list is sent to the client. In another embodiment, a Session Initiation Protocol (SIP) protocol message is extended and the best-fit server IP list is sent to the client using the extended SIP protocol message including the best-fit server IP list.


Another particular embodiment provides a method for initiating the binding of a client with a server. A best-fit server IP address is selected by a client from a list of best-fit server IP addresses. An attempt is made by the client to initiate a session with a server using the selected best-fit server IP address. In the event the first attempt to initiate a session fails, a next best-fit server IP address is selected from a best-fit server IP address list. The client makes a next attempt to initiate a session with a server using the next selected best-fit server IP address. In another embodiment, the best-fit server IP address list is ordered according to network distribution criteria. Optionally, the distribution criteria may include a routing distance between the client and each server associated with each of the list of best-fit server IP addresses, message delivery latency, and server loading. Selecting the first and next best-fit server IP addresses from a best-fit server IP address list includes selecting the best-fit server IP addresses according to the order in which the best-fit server IP addresses appear on the best-fit server IP address list.


Another particular embodiment provides a method for maintaining the binding of a client with a server. A transmission protocol used by the client and the server is extended for communications. The extended transmission protocol is used by the client to request a best-fit server IP list from the server, wherein the best-fit server IP list includes a list of best-fit server IP addresses. The best-fit server IP list is received and stored by the client. In an embodiment, a Simple Traversal of User Datagram Protocol through Network Address Translators (NATs) (STUN) protocol message is extended and used to request the best-fit server IP list.


In yet another embodiment, the client determines whether the IP address of a server is on the best-fit IP address list. In the event that the server is not on the best-fit IP address list, the client terminates its association with the server and selects a best-fit server IP address from a best-fit server IP address list. An attempt may be made by the client to initiate a session using the selected best-fit server IP address. In the event the first attempt to initiate a session fails, a next best-fit server IP address may be selected from the best-fit server IP address list. A next attempt may be made by the client to initiate a session using the next selected best-fit server IP address. Optionally, the best-fit server IP addresses may be ordered according to network distribution criteria. The network distribution criteria may include a routing distance between the client and each server associated with each of the list of best-fit server IP addresses, message delivery latency, and server loading.


In another embodiment, the client determines whether a connection between the client and a server has been lost. In the event that the connection has been lost, a best-fit server IP address is selected from the best-fit server IP address list. An attempt is made by the client to initiate a session using the selected best-fit server IP address. In the event the first attempt to initiate a session fails, a next best-fit server IP address is selected from a best-fit server IP address list. The client makes a next attempt to initiate a session using the next selected best-fit server IP address.


Optionally, the best-fit server IP addresses may be ordered according to network distribution criteria. The network distribution criteria may include a routing distance between the client and each server associated with each of the list of best-fit server IP addresses, message delivery latency, and server loading.


Embodiments enable a client to receive and maintain a set of “best-fit” server IP addresses. The best fit server IP addresses may establish a hierarchy of server addresses that may be used by a client to maintain a binding with a server without using the DNS. In the case of an Internet Appliance, the set of best-fit server IP addresses may be relatively small. In one embodiment, an Internet Appliance maintains a set of three best-fit server IP addresses. Communicating the set of best-fit server IP addresses to a specific client may be accomplished using extensions of network protocols already used to support client/server communications, thus minimizing the amount of code needed to support the additional information transfer.



FIG. 1 illustrates the interaction of an Internet Appliance with a server according to particular embodiments. Referring to FIG. 1, an Internet Appliance (client) 100 includes a protocol engine 110 connected to the Internet 115. The protocol engine 110 communicates via the Internet 115 with a corresponding protocol engine 145 in a server 140. As part of this communication, a protocol message 160 listing best-fit server IP addresses is passed from the server 140 to the Internet Appliance (client) 100. The Internet Appliance (client) 100 extracts this information from the protocol message 160 and saves this information in persistent memory (not illustrated) as a best-fit server IP list 105.


In order to construct the protocol message 160 including the best-fit IP addresses, the protocol engine 145 on the server 140 is integrated with a best-fit solutions database 155. In this embodiment, the best-fit solutions database 155 is updated by an optimizer program 150 that runs as a background application on the server 140. However, this is not meant as a limitation. As would be apparent to those skilled in the art, other means may be used to create the best-fit IP addresses. By way of illustration and not as a limitation, in an embodiment, the best-fit IP addresses are computed on-the-fly (by the protocol engine 145 or a linked device) based on the latest routing and server availability information.



FIG. 2 illustrates a process according to embodiments in which an Internet Appliance (client) uses best-fit IP address to create a binding with a server. Referring to FIG. 2, a client initiates contact with a server using a first best-fit IP address in a list at 200. If the connection is bound at 210, the binding process ends at 230. If the client is not bound to a server at 210, a check is made at 215 to determine if the last-tried best-fit address was the last address. If the last-tried best-fit address was the last address, the binding process is restarted at 225. If the last-tried best-fit address is not the last address, contact is initiated using the next best-fit address at 220.


When a binding is successful (at 230), the connection may be checked at 235 to determine if the connection has been lost at 240. If the connection has not been lost at 240, the checking process is repeated at 235. If the connection has been lost, the binding process is restarted at 225. If none of the servers in the best-fit server IP address list (shown in FIG. 1 at 105) responds then, a “catastrophic” failure has occurred. This could be because the user's Internet access has been impaired, because a sufficiently large part of the Internet is disabled preventing access to any of the servers in the best-fit list, or because a sufficiently large physical event has caused all the servers in the best-fit list to become inoperable. When a “catastrophic” failure occurs, the client continues to contact the servers on its best-fit server IP list until the network problem is corrected. This re-use of the initialization procedure helps address the constraint of scarce storage resources on the Internet Appliance.


In an embodiment, the list of best-fit server IP addresses (shown in FIG. 1 at 105) is ordered such that elements closer to the top of the list are “more optimal” than lower items on the list. Thus, the binding process illustrated in FIG. 2 attempts to bind with the more optimal server first. In this context, “more optimal” reflects the result of analysis done prior to the last download of the best-fit list from the server to the client. Note subsequent to the last sending of the best-fit list and the time when the client is bound to a server, the physical location or Internet “routing distance” may have changed thereby changing the optimization of the best-fit list.



FIG. 3 illustrates a process of receiving and verifying a best-fit server IP address list by a client according to particular embodiments. Referring to FIG. 3, a client binds with a server at 300. A new best-fit server IP address list is received and stored by the client 305 for access during power up initialization. Once stored, the client determines whether it is currently bound to a server having the first best-fit address in the new list at 310. If it is not, then the client initiates a binding process as illustrated in FIG. 2. If the client is currently bound to the server having the first best-fit server IP address in the new best-fit server IP address list, the validation process ends at 315.


As previously noted, the server may determine the best-fit list of server IP addresses and may communicate this information to the client via a extension of a network protocol currently used by the client and server to establish or maintain existing communications. In an embodiment, a protocol engine at the server is extended to accept a best-fit server IP address list and communicate it to each client associated with that server. In the event the server associated with a client is no longer on the list of best-fit server IP addresses, the client will terminate the association and attempt to connect with a server on the last-received list. The server represented by the first server IP address on the new best-fit server IP address list is then associated with the client.


In a particular embodiment, a network protocol used by a client and server to convey information relating to the best-fit server IP address list is extended. In order to avoid issues with firewalls and network address translation systems, a preferred protocol may support sessions initiated by the client that allow subsequent responses by the server. Additionally, the preferred protocol may support communication at a frequency that facilitates timely communication of new best-fit server IP address lists and may be adaptable to accept the simple payload data used for the best-fit server IP address list.


In an exemplary embodiment, a client and server use multiple protocols to send and update best-fit server IP address information. By way of illustration and not as a limitation, a server may communicate with a client via Session Initiation Protocol (SIP). This protocol meets the preferred criteria that a session is initiated by the client while allowing the server to send the client a message at any time. However, processing of the SIP protocol for both the client and the server requires considerable work. This is of particular concern where the client resides on an Internet Appliance with very little computation resources. In addition to SIP, the client in this exemplary embodiment may also use the Simple Traversal of User Datagram Protocol through Network Address Translators (NATs) (STUN) protocol. STUN lacks that quality of being able to respond to a server-generated message at any time, but has the advantage that it is very simple to process and extend. These two protocols, however, may be used in combination to perform the tasks of sending a list of best-fit server IP addresses to the client and sending the client notice that the list has been updated. The server may use a SIP protocol extension to notify the client. The client may use the STUN protocol to request and receive the new list.


A system and method for permitting a client running on an Internet Appliance to dynamically bind with at least one server without using DNS has been illustrated. It will be understood by those skilled in the art that the present disclosure may be embodied in other specific forms without departing from the scope of the disclosure and that the examples and embodiments described herein are in all respects illustrative and not restrictive. Those skilled in the art will recognize that other embodiments using the concepts described herein are also possible.

Claims
  • 1. A method of binding a client to a server, the method comprising: establishing a connection between a server and a client;receiving, at the client via the connection, a list of best-fit server Internet Protocol (IP) addresses;determining, at the client, whether the server is identified in the list of best-fit server IP addresses;maintaining the connection to the server in response to determining that the server is identified in the list of best-fit server IP addresses; andending the connection to the server in response to determining that the server is not identified in the list of best-fit server IP addresses.
  • 2. A server device, comprising: a processor;a memory accessible to the processor; anda protocol engine executable by the processor to: establish a connection to a client device; andsend a list of best-fit server Internet Protocol (IP) addresses to the client device via the connection, wherein the list of best-fit server IP addresses is determined based on network distribution criteria;wherein the client device ends the connection to the server device in response to determining that an address of the server device is not identified in the list of best-fit server IP addresses; andwherein the client device maintains the connection to the server device in response to determining that the address of the server device is identified in the list of best-fit server IP addresses.
  • 3. A client device, comprising: a processor;a memory accessible to the processor;a protocol engine executable by the processor to: establish a connection between a server and the client device;receive, at the client device via the connection, a list of best-fit server Internet Protocol (IP) addresses; anddetermine whether the server is identified in the list of best-fit server IP addresses;maintain the connection to the server in response to determining that the server is identified in the list of best-fit server IP addresses; andend the connection to the server in response to determining that the server is not identified in the list of best-fit server IP addresses.
  • 4. The method of claim 1, wherein the list of best fit server IP addresses includes at least three server IP addresses.
  • 5. The method of claim 4, wherein the at least three server IP addresses are arranged in an order of preference in the list of best fit server IP addresses.
  • 6. The method of claim 1, further comprising initiating establishment of a connection to at least one server IP address of the list of best fit server IP addresses after ending the connection to the server.
  • 7. The method of claim 1, further comprising: determining, at the client, whether the connection to the server has been lost; andwhen the connection to the server has been lost, initiating establishment of a connection to a first server IP address that is retrieved from the list of best fit server IP addresses.
  • 8. The method of claim 7, wherein, when the connection to the first server IP address is not established, initiating establishment of a connection to a next server IP address in the list of best fit server IP addresses.
  • 9. The method of claim 1, further comprising sending a request for the list of best fit server IP addresses from the client to the server via the connection using a first protocol, wherein the list of best-fit server IP addresses is received by the client using a second protocol.
  • 10. The server device of claim 2, wherein the protocol engine sends the list of best-fit server IP addresses via a Session Initiation. Protocol (SIP) message.
  • 11. The server device of claim 2, wherein the protocol engine sends the list of best-fit server IP addresses in response to a request from the client.
  • 12. The server device of claim 11, wherein the request is received via a Simple Traversal of User Datagram Protocol through Network Address Translators (NATs) (STUN) message.
  • 13. The server device of claim 2, wherein the memory further comprises an optimizer program that is executable by the processor to select the list of best-fit server IP addresses based on routing and availability information.
  • 14. The server device of claim 13, wherein addresses on the list of best-fit server IP addresses are determined based on a database of best-fit solutions.
  • 15. The server device of claim 13, wherein addresses on the list of best-fit server IP addresses are dynamically computed.
  • 16. The server device of claim 13, wherein the optimizer program identifies an order of preference of the IP addresses of the list of best-fit server IP addresses.
  • 17. The server device of claim 13, wherein the routing and availability information includes at least one of a routing distance, a message delivery latency, and server loading.
  • 18. The client device of claim 3, wherein the memory stores the list of best-fit server IP addresses.
  • 19. The client device of claim 18, wherein, after the client device ends the connection to the server, the client device accesses the list of best-fit server IP addresses in the memory, selects a first server from the list of best-fit server IP addresses, and attempts to establish a connection to the first server based on an order of the list of best-fit server IP addresses.
  • 20. The client device of claim 19, wherein, when the client device is not able to establish the connection to the first server, the client device accesses the list of best-fit server IP addresses in the memory, selects a second server from the list of best-fit server IP addresses, and attempts to establish a connection to the second server based on an order of the list of best-fit server IP addresses.
CLAIM OF PRIORITY

The present application claims priority from and is a continuation of patent application Ser. No. 11/043,680 filed on Jan. 26, 2005 and entitled “SYSTEM AND METHOD OF BINDING A CLIENT TO A SERVER,” which claims priority under 35 U.S.C. §119(e) to provisional patent application 60/539,768 filed on Jan. 28, 2004, the contents of both of which are expressly incorporated herein by reference in their entirety.

US Referenced Citations (138)
Number Name Date Kind
5402481 Waldman Mar 1995 A
5809128 McMullin Sep 1998 A
5987103 Martino Nov 1999 A
6014440 Melkild et al. Jan 2000 A
6091732 Alexander, Jr. et al. Jul 2000 A
6104757 Rhee Aug 2000 A
6118768 Bhatia et al. Sep 2000 A
6125113 Farris et al. Sep 2000 A
6141345 Goeddel et al. Oct 2000 A
6185288 Wong Feb 2001 B1
6205154 Schmidt et al. Mar 2001 B1
6351730 Chen Feb 2002 B2
6359880 Curry et al. Mar 2002 B1
6389005 Cruickshank May 2002 B1
6434139 Liu et al. Aug 2002 B1
6445694 Swartz Sep 2002 B1
6449251 Awadallah et al. Sep 2002 B1
6449647 Colby et al. Sep 2002 B1
6496477 Perkins et al. Dec 2002 B1
6542497 Curry et al. Apr 2003 B1
6597686 Smyk Jul 2003 B1
6603774 Knappe et al. Aug 2003 B1
6618761 Munger et al. Sep 2003 B2
6636504 Albers et al. Oct 2003 B1
6658496 Minakata et al. Dec 2003 B1
6700956 Chang et al. Mar 2004 B2
6725303 Hoguta et al. Apr 2004 B1
6760324 Scott et al. Jul 2004 B1
6763226 McZeal, Jr. Jul 2004 B1
6766348 Combs et al. Jul 2004 B1
6771594 Upadrasta Aug 2004 B1
6788769 Waites Sep 2004 B1
6795540 Mow Sep 2004 B1
6822957 Schuster et al. Nov 2004 B1
6826174 Erekson Nov 2004 B1
6856612 Bjelland et al. Feb 2005 B1
6895000 Lai et al. May 2005 B2
6901438 Davis et al. May 2005 B1
6907031 Ehlinger et al. Jun 2005 B1
6947417 Laursen et al. Sep 2005 B2
6954454 Schuster et al. Oct 2005 B1
6975613 Johansson Dec 2005 B1
6986030 Shmueli et al. Jan 2006 B2
6996615 McGuire Feb 2006 B1
7012888 Schoeneberger et al. Mar 2006 B2
7016481 McElvaney Mar 2006 B2
7046683 Zhao May 2006 B1
7092380 Chen et al. Aug 2006 B1
7113500 Bollinger et al. Sep 2006 B1
7117269 Lu et al. Oct 2006 B2
7139926 Madhav et al. Nov 2006 B1
7145900 Nix et al. Dec 2006 B2
7152111 Allred et al. Dec 2006 B2
7162549 Mambakkam et al. Jan 2007 B2
7165122 Sitaraman et al. Jan 2007 B1
7212622 Delaney et al. May 2007 B2
7213766 Ryan et al. May 2007 B2
7227938 Rodman et al. Jun 2007 B2
7254630 Daude et al. Aug 2007 B1
7269180 Bly et al. Sep 2007 B2
7274658 Bornstein et al. Sep 2007 B2
7275113 Araujo Sep 2007 B1
7283542 Mitchell Oct 2007 B2
7292571 Brown Nov 2007 B2
7302053 Chang et al. Nov 2007 B2
7307982 Burritt et al. Dec 2007 B2
7325133 Fascenda Jan 2008 B2
7359963 Huang et al. Apr 2008 B1
7398301 Hennessey et al. Jul 2008 B2
7430187 Holt et al. Sep 2008 B2
7441045 Skene et al. Oct 2008 B2
7478169 Banerjee et al. Jan 2009 B2
7496648 Manion et al. Feb 2009 B2
7512702 Srivastava et al. Mar 2009 B1
7631055 Stamler et al. Dec 2009 B1
7653746 Touch et al. Jan 2010 B2
7783777 Pabla et al. Aug 2010 B1
7827292 Chen et al. Nov 2010 B2
7853781 Freed et al. Dec 2010 B2
20010038033 Habib Nov 2001 A1
20010052016 Skene et al. Dec 2001 A1
20020029277 Simpson-Young et al. Mar 2002 A1
20020052965 Dowling May 2002 A1
20020097843 Krol et al. Jul 2002 A1
20020131604 Amine Sep 2002 A1
20020138648 Liu Sep 2002 A1
20020184376 Sternagle Dec 2002 A1
20020191621 Jha Dec 2002 A1
20020191768 Stoughton Dec 2002 A1
20030002479 Vortman et al. Jan 2003 A1
20030023669 DeLima et al. Jan 2003 A1
20030110257 Hyun et al. Jun 2003 A1
20030112820 Beach Jun 2003 A1
20030123388 Bradd Jul 2003 A1
20030161453 Veschi Aug 2003 A1
20030204619 Bays Oct 2003 A1
20030214939 Eldumiati et al. Nov 2003 A1
20030219006 Har Nov 2003 A1
20040019539 Raman et al. Jan 2004 A1
20040032860 Mundra et al. Feb 2004 A1
20040047451 Barker et al. Mar 2004 A1
20040086093 Schranz May 2004 A1
20040114581 Hans et al. Jun 2004 A1
20040133668 Nicholas, III Jul 2004 A1
20040141508 Schoeneberger et al. Jul 2004 A1
20040141758 El-Reedy Jul 2004 A1
20040205023 Hafer et al. Oct 2004 A1
20040205165 Melamed et al. Oct 2004 A1
20040205777 Zalenski et al. Oct 2004 A1
20040218583 Adan et al. Nov 2004 A1
20040223458 Gentle Nov 2004 A1
20040248590 Chan et al. Dec 2004 A1
20040258003 Kokot et al. Dec 2004 A1
20050002506 Bender et al. Jan 2005 A1
20050074031 Sunstrum Apr 2005 A1
20050089052 Chen et al. Apr 2005 A1
20050091392 Gesswein et al. Apr 2005 A1
20050094621 Acharya et al. May 2005 A1
20050111494 Kecskemeti May 2005 A1
20050138183 O'Rourke et al. Jun 2005 A1
20050141560 Muthiah Jun 2005 A1
20050165953 Oba et al. Jul 2005 A1
20050180464 McConnell et al. Aug 2005 A1
20050195799 Burne et al. Sep 2005 A1
20050201414 Awais Sep 2005 A1
20050220083 Takeuchi Oct 2005 A1
20050243733 Crawford et al. Nov 2005 A1
20060008059 Ying et al. Jan 2006 A1
20060029062 Rao et al. Feb 2006 A1
20060029063 Rao et al. Feb 2006 A1
20060034296 Talucci Feb 2006 A1
20060037071 Rao et al. Feb 2006 A1
20060039356 Rao et al. Feb 2006 A1
20060088025 Barkley et al. Apr 2006 A1
20060208066 Finn et al. Sep 2006 A1
20060276230 McConnell Dec 2006 A1
20070248081 Barkley et al. Oct 2007 A1
20080025291 Barkley et al. Jan 2008 A1
Non-Patent Literature Citations (17)
Entry
Barlkey et al., U.S. Appl. No. 10/969,516, entitled “Portable VOIP Service Access Module,” filed Oct. 20, 2004 (abandoned).
Bennet, B., “Memory in a Flash,” www.theage.com.au, Jan. 31, 2004, 3 pgs.
“Brief Introduction to QiiQ Communications Inc. and Eccocarrier Inc.,” www.qiiq.com, printed Jun. 10, 2005 and Jul. 17, 2007, 7 pgs.
Camarillo, G. et al, “Integration of Resource Management and Session Initiation Protocol (SIP),” RFC 3312, Oct. 2002, pp. 1-30.
“CommGenie VoIP Suite,” www.nexge.com, printed Jun. 1, 2005, 3 pgs.
EcoCarrier, “Ecophone,” www.ecocarrier.com, printed Jun. 13, 2005, 3 pgs.
“EcoFone + VoIP!Phone Q-FONE-USB,” printed Jun. 10, 2005, 3 pgs.
“Pocki Phone—VoIP Softphone + USB Flash Disk Drive (128M),” www.welltech.com, printed Oct. 5, 2004, 2 pgs.
“Pre-paid Call Credits—Adding Extra Call Credits,” www.2hands.com.au, printed Jun. 1, 2005, 2 pgs.
Rosenberg, J. et al, “STUN—Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs),” RFC 3489, Mar. 2003, 47 pgs.
Rosenberg, J. et al, “SIP: Session Initiation Protocol,” RFC 3261, Jun. 2002, 18 pgs.
Schulzrinne, H., “Dynamic Host Configuration Protocol (DHCP-for-IPv4) Option for Session Initiation Protocol (SIP) Servers,” RFC 3361, Aug. 2002, 7 pgs.
“SIPphoneCasting. Inspired by: Skype Podcast Recorder = SkypeCasters,” www.linuxathome.com, Dec. 29, 2004, 4 pgs.
Tittel, E. “Cool Tools: USB Desktop Peripherals and Devices,” www.certmag.com, Jun. 2005, 7 pgs (accessed Jul. 20, 2007).
Tittel, E. “Cool Tools: USB Desktop Peripherals and Devices,” www.certmag.com, Jun. 2005, 3 pgs (accessed Jul. 16, 2009).
Trembley, J. “VoIP makes real-time billing a necessity,” Billing Plus, vol. 6, No. 17, Oct. 4, 2004, pp. 13.
“Web Based VoIP Billing, VoIP Routing, and VoIP Management Software,” www.webvoip.com, printed Jun. 1, 2005, 2 pgs.
Related Publications (1)
Number Date Country
20090327414 A1 Dec 2009 US
Provisional Applications (1)
Number Date Country
60539768 Jan 2004 US
Continuations (1)
Number Date Country
Parent 11043680 Jan 2005 US
Child 12551299 US