This patent application relates generally to monitoring the quality of a telephone call transmitted over a network.
Voice over Internet Protocol (VoIP) enables users to make telephone calls over a computer network, such as the Internet. VoIP is used to convert a voice signal from a telephone into a digital signal, which can be transmitted over the computer network. At a receiving end, VoIP is used to convert the digital signal back into a voice signal.
SIP is a signaling protocol for VoIP. In particular, SIP is a request/response protocol that allows devices to set up a communication session over a network. Real-time transport protocol (RTP) is typically used during the communication session to carry voice and other data between the devices on the network.
Problems can arise during transmission of telephone calls over a network. For example, excessive network traffic can create a bottleneck at a node on the network, thereby affecting the quality of telephone calls transmitted through the node. Also, a node on the network can fail or function improperly, which can also have a deleterious effect on telephone calls transmitted through the network. These problems are not unique to telephone calls that are implemented using VoIP (e.g., telephone calls routed over a computer network), but rather such problems can occur in any network over which telephone calls are routed.
This patent application describes methods and apparatus, including computer program products, for monitoring quality of a telephone call transmitted over a network.
The details of one or more examples are set forth in the accompanying drawings and the description below. Further features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.
Like reference numerals in different figures indicate like elements.
Network 10 may be an IP-enabled network, and may include a local area network (LAN), such as an intranet, and/or a wide area network (WAN), which may, or may not, include the Internet. Network 10 may be wired, wireless, or a combination of the two. Network 10 may also include part of the public switched telephone network (PSTN).
For the purposes of this description, network 10 can be conceptualized as a set of nodes. These nodes include endpoint devices (or simply, “endpoints”) 12a to 12e and intermediary devices 14a to 14h for routing data, including telephone calls, between the various endpoints. Examples of intermediary devices include, but are not limited to, routers, switches, gateways, or the like. Examples of endpoints include servers for routing telephone calls, monitoring call quality, and adjusting routing based on call quality, as described in more detail below. Other examples of endpoints include servers or other computers that are maintained by services provides including, but not limited to, long-distance providers, such as MCI® and Sprint®, or VoIP providers.
Each of endpoints 12a to 12e may be identical in structure and function, or at least have certain structure and functionality in common. This common structure and functionality is described with respect to endpoint 12a (
Endpoint 12a may include one server 15a or multiple server 15a to 15c (servers 15b and 15c are depicted using dashed lines to indicate that they are optional). Each of servers 15a to 15c may have the same, or similar, hardware and/or software configuration. In this implementation, servers 15a to 15c act together to perform the various functions described below. In other implementations, a single server may perform all of the server functions. In the case of multiple servers, server 15a may act as a controller or “load balancer” for the remaining servers 15b and 15c. In this role, server 15a may route data, requests, and instructions between a client (e.g., a VoIP communication device) and a “slave” device, such as server 15b. Server 15a may store information locally, then route data to another device, such as device 15b. For the purposes of the following, such internal communications between server 15a and any slave devices will be assumed.
Server 15a may be any type of processing device that is capable of receiving and storing data, and of communicating with VoIP clients. As shown in
As shown in
Referring to
According to process 25, endpoint 12a makes (30) a telephone call over network 10. That is, endpoint 12a receives call data from a communication device 11a, such as a telephone. Endpoint 12a may then formulate a call, e.g., to another endpoint 12d, such as a server for a long distance provider. In this implementation, the call is established using SIP and data packets for the call are transferred using RTP. Real-time transfer control protocol (RTCP) is used to provide out-of-band control information for RTP. RTCP provides feedback on the quality of service (QoS) being provided by RTP. QoS may also be based on evaluation of the RTP packets. One feature of RTCP is that it provides for monitoring of lost data packets and jitter at the source of a call, at the destination of a call, and at one or more nodes between the source and destination. Jitter is a variation in packet transit delay, which may be caused by several factors including, but not limited to, queuing, contention and serialization effects. With respect to monitoring lost data packets, data packets are typically sequential. RTCP is able to identify lost data packets based on a break in the packet sequence.
By using RTP and RTCP collected data, faults can be associated with a local network, an inbound network, or an outbound network. Furthermore, changes in call quality may vary by time-of-day, e.g., times with greater amounts of traffic may experience lower call quality. The RTP and RTCP may be used to identify the times of day that provide lowest call quality for given network conditions.
Once the call is established, process 25 performs (31) a traceroute for the call. Generally speaking, a traceroute identifies a path that data packets for the call take through network 10 and the amount of time it took to arrive at each node (i.e., hop) of the network. The traceroute may be implemented by sending a “ping” to each hop on the network. Initially, the traceroute is performed at a predetermined frequency, such as every five seconds. The traceroute thus establishes a baseline for the network. The baseline may be a point to which subsequent operation of the network may be compared.
The traceroute also establishes the network topology for use in identification of command and unique paths for multiple endpoints. This may be done in order to facilitate fault location, e.g., by observing which endpoints experience a problem, which do not, and then correlating the common and unique parts of the paths through the network. For example, network paths that are unique to selected endpoints are more likely to contain a fault if the selected endpoints are experiencing problems and other endpoints (e.g., that share common network paths with the selected endpoints) are not. There may also be a correlation of data packet loss over time in a traceroute from a single endpoint, which can aid in location of the network fault.
Process 25 obtains (32), via the traceroute, one or more metrics associated with the call. That is, in response to the ping, the device that initiated the traceroute receives information (the metrics) from the device that was “pinged”. In this implementation, the metrics include, but are not limited to, amounts of jitter and packet loss between the source and destination of the call. As indicated above, RTCP provides for monitoring of lost data packets and jitter from the source of a call. The traceroute obtains this RTCP-maintained information. The traceroute also enables identification of nodes of network 10 that have failed or that are not working properly. Referring to
After process 25 obtains the metrics, process 25 performs a comparison (34) of the metrics to a predetermined threshold. The individual metrics may be compared to separate corresponding thresholds or, alternatively, the metrics may be combined into a single metric and compared to a single threshold. If one or more metric(s) exceed one or more of the threshold(s), process 25 increases (35) the frequency of the traceroute (e.g., from five second intervals to one second intervals), and returns to block 32, where part 36 of process 25 is repeated until the metric(s) are below the threshold(s). The frequency is increased in order to obtain additional information from the network.
In this implementation, a threshold may correspond to an acceptable QoS, and may relate, e.g., to an acceptable amount of jitter and/or an acceptable packet loss (e.g., twenty packets lost in a five second interval). The amount of call degradation represented by the threshold may not be detectable by the human ear. Thus, routing corrections may be made, as described below, before call degradation on a route reaches an audible level.
Process 25 continues to perform traceroutes as described above during the course of the call. The information obtained via the traceroutes may be stored in endpoint 12a. As explained above, this information defines the QoS associated with the call, and may include the number of packets lost during the call or during a predefined period of the call, the amount of jitter during the call or during a predefined period, and information indicating problems in network 10, such as which network nodes are disabled.
In this implementation, the QoS information is obtained for multiple calls made by the same endpoint and for multiple devices on the same network 10. In some implementations, the information is obtained for every call made by each endpoint and for every endpoint on network 10. In any case, the information may be sent to a central monitoring system, which may coordinate call routing, as described below. The central monitoring system may be a designated endpoint or other device on network 10.
More specifically, the central monitoring system receives the QoS information from the various endpoints (or other devices) on network 10 and, based on that information, designates call routes through network 10. The central monitoring system may designate routes that have the fewest number of packets lost, routes that have the least jitter, routes in which no device are inoperable or disabled, routes that have the shortest path to a destination, or some combination thereof.
In designating its routes, the central monitoring system may use information from the various endpoints to identify, with greater precision, faults on network 10. Since the central monitoring system receives information from endpoints that have used different routes through the network, the central monitoring system is able to use triangulation to identify faults on network 10. For example, the central monitoring system may receive information from device 12d that it does not receive traceroute information beyond node 14e. The central monitoring system may also receive information from device 12e that it is able to access endpoint 12b. Knowing this, and the configuration of network 10, the central monitoring system is able to ascertain that node 14d is not operating properly and, as such, designate routes that do not include node 14d in an attempt to avoid network faults. Factors other than those described above may also be taken into consideration by the central monitoring system when designating routes through network 10. For example, the central monitoring system may correlate data packet loss and jitter over the network based on a sequence of traceroutes (or pings) to determine loss over the network. The correlation may also be over time, and from a single or multiple node, in order to determine the location of a fault on the network.
The designated routes may be distributed from the central monitoring system to the various endpoints. Updates to these routes may be made via process 25, which may be performed on a continuous basis in order to keep the routes up-to-date. Each endpoint may then route subsequent telephone calls in accordance with its designated route(s). For example, the subsequent telephone calls may be routed to avoid problems on network 10.
The central monitoring system may designate routes that are advantageous for each device given the device's location on network 10. Also, weights may be assigned to QoS information from different endpoints. As a result, some endpoints (e.g., predefined trusted endpoints) may have a greater effect on the routes designated by the central monitoring system than others. In like manner, a group or groups of endpoints may be given greater weight than others endpoints.
Process 25 and its various modifications (hereinafter referred to as “the processes”) can be implemented, at least in part, via a computer product, i.e., a computer program tangibly embodied in one or more information carriers, e.g., in one or more machine-readable storage media, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers.
A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a network.
Actions associated with implementing the processes can be performed by one or more programmable processors executing one or more computer programs to perform the functions of the calibration process. All or part of the processes can be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) and/or an ASIC (application-specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only storage area or a random access storage area or both. Elements of a computer (including a server) include one or more processors for executing instructions and one or more storage area devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from, or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile storage area, including by way of example, semiconductor storage area devices, e.g., EPROM, EEPROM, and flash storage area devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
The processes are not limited to use with VoIP-enabled telephones or to any particular network configuration. Likewise, the processes are not limited to the specific hardware and protocols described herein.
Elements of different implementations described herein may be combined to form other implementations not specifically set forth above. Other implementations not specifically described herein are also within the scope of the following claims.
This patent application claims the benefit of, and priority to U.S. patent application Ser. No. 11/751,355 filed on May 21, 2007, which also claims the benefit of, and priority to U.S. Provisional Application No. 60/809,063 filed on May 26, 2006. The contents of the U.S. patent application Ser. No. 11/751,355 and U.S. Provisional Application No. 60/809,063 are hereby incorporated by reference into this patent application as if set forth herein full.
Number | Name | Date | Kind |
---|---|---|---|
4354062 | Mussman | Oct 1982 | A |
4656366 | Davis et al. | Apr 1987 | A |
4763317 | Lehman et al. | Aug 1988 | A |
4905233 | Cain et al. | Feb 1990 | A |
5796795 | Mussman et al. | Aug 1998 | A |
6104711 | Voit | Aug 2000 | A |
6154463 | Aggarwal et al. | Nov 2000 | A |
6188687 | Mussman et al. | Feb 2001 | B1 |
6243388 | Mussman et al. | Jun 2001 | B1 |
6282574 | Voit | Aug 2001 | B1 |
6684247 | Santos et al. | Jan 2004 | B1 |
6763380 | Mayton et al. | Jul 2004 | B1 |
6795858 | Jain et al. | Sep 2004 | B1 |
6804712 | Kracht | Oct 2004 | B1 |
7075922 | Mussman et al. | Jul 2006 | B2 |
7215643 | Mussman et al. | May 2007 | B2 |
7339934 | Mussman et al. | Mar 2008 | B2 |
7346043 | Olshansky et al. | Mar 2008 | B1 |
7363381 | Mussman et al. | Apr 2008 | B2 |
7379471 | Mitsumori et al. | May 2008 | B2 |
7388946 | Mussman et al. | Jun 2008 | B1 |
8457000 | West et al. | Jun 2013 | B2 |
20020012363 | Beidas et al. | Jan 2002 | A1 |
20020159440 | Mussman et al. | Oct 2002 | A1 |
20030012178 | Mussman et al. | Jan 2003 | A1 |
20030088698 | Singh et al. | May 2003 | A1 |
20030091165 | Bearden et al. | May 2003 | A1 |
20030142633 | Wall et al. | Jul 2003 | A1 |
20030204619 | Bays | Oct 2003 | A1 |
20040139209 | Mussman et al. | Jul 2004 | A1 |
20050025043 | Mussman et al. | Feb 2005 | A1 |
20050025123 | Mitsumori et al. | Feb 2005 | A1 |
20050117562 | Wrenn | Jun 2005 | A1 |
20050189401 | Butzer et al. | Sep 2005 | A1 |
20050243725 | Wrenn et al. | Nov 2005 | A1 |
20050243816 | Wrenn et al. | Nov 2005 | A1 |
20050243817 | Wrenn et al. | Nov 2005 | A1 |
20050243830 | Wrenn et al. | Nov 2005 | A1 |
20060031519 | Helliwell et al. | Feb 2006 | A1 |
20060209701 | Zhang et al. | Sep 2006 | A1 |
20060274733 | Mussman et al. | Dec 2006 | A1 |
20070070976 | Mussman et al. | Mar 2007 | A1 |
20070133567 | West et al. | Jun 2007 | A1 |
20070143449 | West et al. | Jun 2007 | A1 |
20070165607 | Mussman et al. | Jul 2007 | A1 |
20070283042 | West et al. | Dec 2007 | A1 |
20070286361 | West et al. | Dec 2007 | A1 |
20080070528 | Joyner et al. | Mar 2008 | A1 |
20080112327 | Mussman et al. | May 2008 | A1 |
Number | Date | Country |
---|---|---|
1 335 525 | Aug 2003 | EP |
2003-0023898 | Mar 2003 | KR |
WO 2007140164 | Dec 2007 | WO |
WO 2007140165 | Dec 2007 | WO |
Entry |
---|
International Preliminary Report (incl. Written Opinion Jul. 3, 2008) in Application No. PCT/US2007/069378, dated Nov. 27, 2008, 3 pages. |
Supplementary Search Report dated Nov. 9, 2009 in European Patent Application No. 07797624. |
Extended Search Report in Application No. EP 07797624.9 dated Nov. 24, 2009, 6 pages. |
Varela et al., “Multi-Service Routing—A New QoS Routing Approach Supporting Service Differentiation”, Telecommunications 2005, Advanced Industrial Conference on Telecom/Service Assurance with Partial and Intermitted Resources Conference/E-Learning on Telecom. Workshop. AICT/SAPIR/ELETE 2005, Proc. Jul. 17-20, 2005 7 pages. |
International Search Report and Written Opinion in Application No. PCT/US2007/69378, dated Jul. 3, 2008 9 pages. |
International Search Report and Written Opinion in Application No. PCT/US2007/69375, dated Jul. 17, 2008 12 pages. |
Reply to Final Office Action of Jun. 9, 2011, in U.S. Appl. No. 11/751,391, filed Dec. 8, 2011, 29 pages. |
International Preliminary Report on Patentability in Application No. PCT/US2007/069375, dated Mar. 3, 2009. |
Machine Translation of Korean Patent Application No. 2003-0023898 (Pub. Date: Mar. 26, 2003), 6 pages. |
Reply to EP Examination Report in EP Application No. 07797624.9, filed Sep. 1, 2010, 16 pages. |
EP Communication dated Mar. 22, 2010 in EP Application No. 07797624.9, 1 page. |
Office Action dated Jan. 21, 2011 for U.S. Appl. No. 11/751,355, filed May 21, 2007, 11 pages. |
Response to Office Action dated Jan. 21, 2011 for U.S. Appl. No. 11/751,355, filed Jul. 21, 2011, 12 pages. |
Office Action dated Oct. 20, 2011 for U.S. Appl. No. 11/751,355, filed May 21, 2007, 10 pages. |
Response to Office Action dated Oct. 20, 2011 for U.S. Appl. No. 11/751,355, filed Oct. 31, 2012, 11 pages. |
Office Action dated May 29, 2012 for U.S. Appl. No. 11/751,355, 10 pages. |
Response to Office Action dated May 29, 2012 for U.S. Appl. No. 11/751,355, 13 pages. |
Notice of Allowance dated Feb. 11, 2013 for U.S. Appl. No. 11/751,355, filed May 21, 2007, 7 pages. |
U.S. Appl. No. 11/751,355, Part 1 of 6, 168 pages. |
U.S. Appl. No. 11/751,355, Part 2 of 6, 168 pages. |
U.S. Appl. No. 11/751,355, Part 3 of 6, 168 pages. |
U.S. Appl. No. 11/751,355, Prt 4 of 6, 168 pages. |
U.S. Appl. No. 11/751,355, Part 5 of 6, 168 pages. |
U.S. Appl. No. 11/751,355, Part 6 of 6, 3 pages. |
U.S. Appl. No. 11/751,591, Part 1 of 5, 172 pages. |
U.S. Appl. No. 11/751,391, Part 2 of 5, 172 pages. |
U.S. Appl. No. 11/751,391, Part 3 of 5, 172 pages. |
U.S. Appl. No. 11/751,391 Part 4 of 5, 172 pages. |
U.S. Appl. No. 11/751,391, Part 5 of 5, 172 pages. |
Number | Date | Country | |
---|---|---|---|
20130308760 A1 | Nov 2013 | US |
Number | Date | Country | |
---|---|---|---|
60809063 | May 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11751355 | May 2007 | US |
Child | 13872681 | US |