Patent Grant
9621733
This invention relates generally to the telephony field, and more specifically to a new and useful multitenancy telephone network in the telephony field.
A telephone network has historically used a channel architecture for a telephone session or connection. This channel architecture has a foundation in the history of telephony; a physical wired connection or channel needed to be physically connected to make a telephone call. The concept of channels is still used today. Subscribers to a telephone network are conventionally required to pay on a per channel basis. Users that wish to have a public branch exchange (“PBX”), call center, or similar telephony application typically subscribe to a service and have a fixed number of channels that are available to them and only them. As the number of channels is part of their contract, they cannot exceed that number of channels (or else the call or telephone session will fail). Since most applications only see full capacity usage on rare occasions, the user often pays for more channels than are typically used.
In contrast to the channel based architecture of the telephone network, packet based network innovations have seen a rise in recent years, such as voice over internet protocol (VOIP), internet based applications, and internet-based telephony applications. With newer technology coming to the telephony field there are unique challenges arriving for handling the hardware and software capacity demands. Dedicated hardware and software often perform tasks during a telephone call session or even act as an intermediary system for connecting a caller to an internet based application. Telephone systems generally have higher performance expectations than a website based application. While a user of a website expects a website and software to take time to load and process information, a caller experiences frustration in delays or unresponsive interactions while on the phone. Additionally, the telephony applications are still dependent on the channel based telephone system, which adds yet another barrier to scalability. The telephone network and existing telephone application software and hardware architecture limit the growing capabilities of the telephony application field. Thus, there is a need in the telephony field to create a new and useful multitenancy telephone network. This invention provides such a new and useful system and method.
The present invention provides a system and method for providing a multitenancy telephone network for telephony applications. One objective of the present invention is to manage shared resource usage in a multi-user environment and to dynamically scale resources to satisfy capacity requirements. A related effect of this objective is that the sum total of the apparent number of resources available to each user is greater than the actual number of resources used to implement the multi-tenant telephone network. Another objective of the present invention is to efficiently use resources of a telephony platform by provisioning the processing and storage resources to satisfy capacity requirements, effectively leaving other unused resources for alternative applications, powered off for power saving, or any suitable functions. Another objective of the present invention is to make the use of a cluster of telephony resources transparent to an application of a user. This transparency is preferably preserved despite situations where operation of an application is distributed between a plurality of telephone service resources and may involve a plurality of telephone sessions on different channels. These and other objects of the invention are accomplished by the preferred embodiments of the invention, including a system for multitenancy telephone network, a method for operating a multitenant telephone network, a method of operating a dynamic telephone network, and a method of distributing calls between telephone hardware, each described in the following sections.
The following description of the preferred embodiments of the invention is not intended to limit the invention to these preferred embodiments, but rather to enable any person skilled in the art to make and use this invention.
1. System for a Multitenancy Telephone Network
As shown in
The telephony resource cluster 110 (or “cluster”) functions as a scalable (expandable and/or contractible) collection of resources, where at least one resource is used to create a phone call session requested by a user. The cluster 110 is preferably a collection of hardware and/or software components that can dynamically adjust to satisfy processing and/or storage requirements. The cluster 110 preferably appears as a hardware and/or software cloud to outside devices, such that management of hardware allocation and usage is handled internally by the system. In one variation shown in
The telephony resources 112 are preferably software or hardware resources that are provisioned for a particular telephony processing task. There are preferably a plurality of telephony resources 112, and there may be a plurality of types of telephony resources that perform different dedicated tasks. A telephony resource 112 preferably includes a computer processors and/or computer storage devices. The telephony resource 112 may be a physical hardware device, virtual machine, a software program/routine, and/or any suitable combination to provide the processing and storage operations of a telephony resource 112. In some cases, a telephony resource 112 may include dedicated hardware or software. Since the telephony resources 112 share the basic functionally as either processing power or data storage, the core functionality of a telephony resource 112 may be reprovisioned such that the telephony resource 112 performs a different dedicated task. The resource allocator 140 (and more specifically the load balancer 142) preferably reprovisions telephony resources 112 to act as different parts of the resource cluster 110. For example, the cluster may include a number of text-to-speech servers and a number of call routers, but at some point in time there may be a low number of text-to-speech operations being performed and an increased number of telephony applications, and so a text-to-speech server is preferably reprovisioned as a call router. In one variation, the plurality of telephony resources 112 (i.e., the cluster 110) preferably includes a plurality of call routers 114. Additionally or alternatively, the cluster may include other hardware devices or software instances such as media processing systems, transcription systems, text-to-speech systems, call recorders, call data storage, or any suitable hardware (physical device or virtual machine) or software. The resource allocator 140 for the cluster preferably includes a load balancer 142 that manages the distribution of processing tasks and the operation of the plurality of telephony resources 112. Additionally, the cluster may include a service application and/or a call router network that can cooperatively resolve issues that result from using a plurality of resources.
The plurality of call routers 114 functions to initiate or receive calls from telephony devices and provide telephony application related processing. Preferably, the call routers connect to an application server, which is preferably the source of the call request. The plurality of call routers 114 is preferably a dynamic number of call routers 114 that can be adjusted according to capacity requirements. As stated above, in alternative embodiments the plurality of call routers 114 may be replaced by or combined with other suitable telephony hardware or software resources such as media processing systems, transcription systems, text-to-speech systems, or other specialized hardware or software resources that are used in a telephony application. In one example, a plurality of transcription hardware or virtualized resources may be used in place of call routers for transcribing phone calls, as shown in
A call router 114 is preferably connected to a Public Switched Telephone Network (PSTN) device over the PSTN network, such that it can receive and make calls from PSTN-connected devices, such as landlines, cellular phones, satellite phones, or any other suitable PSTN-connected devices, as well as non-PSTN devices, such as Voice-Over-Internet-Protocol (VOIP) phones, SIP devices, Skype, Gtalk, or other Internet addressable voice devices. Thus the call routers 112 can preferably create connections to the telephone network of the distributed telephone controller. The call router 112 may alternatively or additionally function as or include a message router for use with telephony messaging such as SMS (Short Message Service) messages or MMS (Multi Media Messaging). The call router 112 can preferably connect to a messaging network, such that it can receive and send messages from SMS/MMS network devices, cellular phones, computers, smartphones, or any suitable SMS/MMS network devices. The call router 112 may also send or receive text messages, multimedia messages, emails, faxes and other suitable PSTN-compatible communication messages. The call router 112 preferably communicates with the application server using an application layer protocol, more preferably using the HTTP (Hypertext Transfer Protocol), or secure HTTPS (Hypertext Transfer Protocol Secure), protocol. The application server preferably hosts a telephony application, sound file, text file, a database, and/or any suitable media, resource or file that can be used by the call router for telephone interactions. The call router 112 may additionally generate call router resources. The call router resources are preferably accessible by the application server and other devices (such as other call routers) through a call router API. The call router resource functions as an addressable representation of call router meta-data, internal call router state, or the state of a given resource used by the call router. For example a call router 114 may record a call and save the recording as a call router resource.
Additionally, the telephony resource cluster 110 of the preferred embodiment may include a service application 116 that functions as a messaging component to coordinate functionality of an application that has been distributed across various call routers 114, hardware resources, and/or software resources. The service application 116 is preferably an internal resource that is used when normal operation of an application is prevented because the operation of an application is distributed amongst various hardware and software resources of the cluster 110. The service application 116 is preferably a messaging service that offers reliable messaging where a message is delivered to a particular destination (such as to another call router 114). The service application 116 may alternatively offer broadcasting messaging that announces a message without knowing who receives a message of if the message was received. As a first example, a hang-up service application 116 may be used to coordinate hanging up call sessions on different call routers 114. The hang-up service is preferably used to communicate to the appropriate call routers 114 to cancel outgoing calls when, for example, an application wants to dial a plurality of numbers but then hang up all unanswered calls once one of the calls is answered. As a second example, a multiple input service may gather and input commands from multiple telephone devices. So dual-tone multi-frequency (DTMF) input or voice commands may be issued by any caller and communicated to the application even if the calls are distributed over multiple call routers 114 within the cluster. This may be used in voting applications within a conference call. In this way, a telephone application does not need to actively account for processing and call handling being distributed within the cluster, and the hardware and software resources of the cluster preferably appear as a single entity to outside applications because of the internal service applications 116.
Additionally, the telephony resource cluster 110 of the preferred embodiment may include a call router network 118 that functions to allow a level of communication and synchronization between various call routers 114. The call router network 118 may additionally or alternatively be applied to other hardware or software resources. The call router network 118 is preferably used to access shared resources or as a communication channel. In one exemplary application, a voice over internet protocol (VOIP) connection is established over the call router network 118 for mixing audio from various call routers. The VOIP connection is preferably used in implementing conference calls distributed over multiple call routers 114. As another example, the call router network 118 may additionally be used to stream audio from a call router to a realtime internet audio stream. As another example, the call router network 118 may be used to access data on another telephony resource 112 such as by using the call router API to access a call router resource. The service application 116 and the call router network 118 may additionally cooperate in synchronizing applications distributed within the cluster.
The call queue 120 of the preferred embodiment functions to manage a stack of call requests. The call queue 120 is preferably a list of outbound call requests that have not been serviced or been assigned necessary resources. The requests are preferably serviced at a rate suitable for the current capacity of the network 150 and telephony resource cluster 110. The servicing rate may alternatively be adjusted according to the capacity of the distributed telephony controller 144, the telephony resource cluster 110, and/or number of requests in the queue 120. A call request (such as one made by a telephony application) is preferably placed in the call queue 120 when capacity is exceeded or alternatively placed in the call queue 120 for every request or based on any suitable rule.
In one variation, an application preferably has associated user limits, in particular: an inter-call request rate limit (throttle) and a total limit (cap). The throttle and cap are preferably used to determine the positioning of requests in the call queue. The limits may alternatively be assigned to an account, phone number, or any suitable entity. Telephony messages (e.g., SMS or MMS) are one variation of a call request that can additionally be placed in the call queue. Inbound and outbound telephony message can preferably be queued because inbound messages do not require immediate action unlike inbound calls. The SMS message is preferably sent after the request is serviced in the queue. SMS messages and/or MMS messages may alternatively be queued in a dedicated message queue. SMS message may have a rate limit (throttle) and total limit (caps) that varies from requests. Requests received at any rate from a user are preferably spaced in time in the call queue according to the throttle. There is preferably a latency enforced between call requests from an application. Requests of different users are preferably ordered in the queue in a staggered or alternating fashion as shown in
In another variation, the call queue 120 is dedicated to requests of a single user entity. In this variation, there is preferably a plurality of individually assigned call queues 120. Call requests are preferably organized into a call queue 120 for each user. Telephony message requests alternatively have a queue for each phone number. A user requests can preferably be added to the individually assigned queue 120 at any time. Each queue is preferably serviced (i.e., dequeued) on a schedule that considers the per-user limits (such as resource limits, system-wide limits, etc.). In other words the dequeuing occurs in an alternating fashion between the plurality of call queues 120. The individually assigned call queues may additionally be for particular resources, and the dequeuing preferably occurs according to the dequeuing rate of the particular resource. The dequeuing rate is preferably related to the capacity of the resource but may alternatively be based on any suitable criteria. As with the other queuing variations, queuing may alternatively occur according to any suitable queuing methodology such as randomly, in a round-robin fashion, with fair queuing, with weighted fair queuing, based on actual resource utilization, and/or any suitable methodology. As an alternative to queuing based on account/phone number, call or message requests may be queued based on time, priority, usage history, or any suitable aspect. There may additionally be a control queue used to coordinate the dequeuing of individually assigned call queues (or message queues) 120.
As mentioned above, the call queue 120 may include an additional or alternative system for handling telephony messages (e.g., SMS or MMS messages). SMS messages preferably have additional limitations on their servicing rates and restrictions. SMS messages are preferably not only queued for sharing telephone network access with various users, but rates are also preferably implemented to prevent SMS messages from a single user from being rate limited, identified as spam. A call queue 120 for telephony messages may include at least two types of queues: a control queue and a phone number queue. The phone number queue preferably functions as a personal queue of a single user for telephone messages the user wants to send, and the control queue functions substantially similar to the multi-user queue described above for the call queue 120. The individually assigned call queue 120 may alternatively be used without the control queue, and the individually assigned call queue 120 may be based on account phone number or any suitable assignment. The control queue and phone number queue preferably functions to isolate the queuing of messages for a particular application and the messages of the plurality of messages. The content of the SMS message (the text) or MMS message (the multimedia) is preferably not stored in the call queue directly, and a reference to the SMS message content is preferably stored. This functions to reduce the load on the queue. The SMS/MMS content is preferably stored and accessed when the queued reference is serviced.
A queue popper 122 (i.e., a dequeuer) is preferably a software or hardware mechanism that functions to select call requests to service from the call queue The queue popper 122 preferably selects call requests at a preferred rate, but the queue popper 122 may alternatively select calls requests according to capacity or available resources, or a combination thereof. There may additionally be a plurality of queue poppers 122 that function to simultaneously select call requests from the call queue 120. The number of call poppers 122 may be variable. Additional or special queue poppers 122 may be used for the additional SMS call queues. The call queue(s) 120, the queue popper(s) 122, or any suitable combination are preferably used to control the throttling (or servicing rate) of the call requests. The throttling may be performed on a per-phone number, per-account (as in a multi-tenant application), and/or according to any call/message attribute.
The analysis system 130 of the preferred embodiment functions to analyze the system to predict resource requirements. The analysis system 130 preferably monitors a plurality of aspects of the system. The analysis system 130 may monitor the current capacity such as network or hardware operation levels or trends (increasing or decreasing); usage history such as logged data to find correlations in capacity (e.g., detecting patterns); queue length and queue entry latency; analysis of applications such as historical patterns from past usage of an application; and/or any suitable aspects. Patterns in capacity needs are preferably found related to the time of day, day of the week, yearly patterns, usage patterns (such as if an increase in capacity needs by one user indicates increase in capacity needs by other users), call location, call duration of calls, and/or any suitable indicator. The analysis system 130 preferably makes distinctions between inbound and outbound capacity for telephone network channels. The analysis system preferably generates data for the resource allocator 140, a distributed telephone controller 144, a load balancer 142, and/or additionally the call queue 120. The predictions or data from the analysis system may additionally be used for provisioning capacity of the distributed call controller, planning capacity requirements of the static capacity of the telephone network, the number of call routers, hardware or software resources within the cluster, and/or parameters of queue management. The analysis system 130 preferably compares expected and actual load, and provides data that is used to compensate for the variability in utilization of resources of the system.
The resource allocator 140 of the preferred embodiment functions to scale and manage the operation of the telephony cluster 110. The resource allocator 140 additionally preferably reprovisions telephony resources 112 of the cluster 110, allocates new telephony resources 112, deallocates telephony resources, and/or any other suitable allocation process. The resource allocator 140 may additionally control the provisioning of call queues and other devices of the system. The resource allocator 140 preferably uses data of the analysis system 130 in determining the provisioning and operation of resources. The resource allocator 140 preferably uses information from the analysis system 130 to predict required telephony resource 112 capacity. The resource allocator 140 preferably uses the predicted capacity requirements to determine how many hardware (physical or virtualized) or software resources need to be operating, and the resource allocator preferably allocates, deallocates, or reprovisions telephony resources 112 (e.g., call routers and/or other hardware or software resources) as necessary. The resource allocator 140 may additionally use startup time, operation cost, or other parameters of hardware and software resources when determining the number and ratio of resources to have allocated at a particular time. The resource allocator 140 also preferably keeps track of the quantity of resources currently available, and makes resource availability information available to other system components, including dequeuers, load balancers etc. Such resource availability information is preferably used by other system components to adjust operation of the system components. The resource allocator 150 preferably monitors the resources and reprovisions resources in real time.
The resource allocator 140 of the preferred embodiment preferably includes a load balancer 142 that functions to distribute processing tasks amongst the call routers and other hardware. The load balancer 142 of the preferred embodiment preferably optimizes the distribution of processing tasks such that the plurality of call routers 114 is operated at or near an optimal level. The operation of the call routers 114 may be optimized for performance, energy, cost, and/or any suitable conditions. The load balancer 142 preferably directs tasks (e.g., servicing of call requests/sessions) to appropriate call routers 142 (or telephony resource 112) as the tasks are created. A task is preferably an operation of a telephony application, but may alternatively be a call request or call session. In one example, one hundred call routers 114 may provide the call router tasks for one hundred telephony applications. In a second example, one hundred call routers 114 may each handle a single call session associated with one telephony application, such as for a conference call application with one hundred participants. The resource allocator 140 preferably sends notifications as to the current status of resources of the system (the load of resources, the number of resources, etc.) to the load balancer 142. The load balancer 142 distributes requests to currently available and running resources matching the requirements of the application being load balanced, based on data provided by the resource allocator 140.
The resource allocator 140 of the preferred embodiment may include a distributed call controller 144 that functions to controls usage and operation of the telephone network 150 by the system. The distributed call controller preferably manages the shared usage of the telephone network channels 150 by the plurality of telephony resources. The distributed call controller 144 may alternatively be a subset of multiple telephone networks if multiple network providers or carriers are used. The operation of the distributed call controller 144 preferably functions to operate an allocated number of channels for current capacity requirements of the telephone network 150. The allocated channels are preferably channels within the available static channel capacity that are in use or prepared for use. The distributed call controller preferably has less than or equal capacity as the static channel capacity at any given time. The capacity of the distributed call controller 150 can preferably be increased by allocating more resources of the telephone network to the call controller, and the capacity of the distributed call controller 144 can preferably be decreased by deallocating resources of the telephone network. As an example, a commodity hardware node may be added to the telephone network to run a telephony software stack during high capacity requirements. The distributed call controller 144 preferably uses the analysis system 130 to predict or respond to the desired capacity requirements. The telephone network 150 may additionally be divided into inbound channels, outbound channels, and bidirectional channels that can be used for receiving calls, making calls, and both, respectively. The telephone network 150 may further include SMS or MMS inbound and outbound channels. The distributed call controller 144 preferably manages the usage of the type of channels according to predicted usage. The bidirectional channels are preferably used for flexibility in capacity requirements. As one example, if inbound call load is expected to be high, then outbound calls are preferably directed to outbound channels to leave more capacity for inbound calls. The distributed call controller 144 may additionally manage the number and usage of allocated channels according to subscription or contracts from network providers. Channels may be used allocated or deallocated to ensure that volume pricing thresholds or other network conditions are satisfied.
A telephone network with a static number of channels 150 is preferably the base infrastructure for providing users with telephone network access. Telephony sessions are preferably communicated over the telephone network and the telephony sessions preferably include telephony voice sessions and/or text/media messaging (telephony messaging). The static number of channels is preferably the total number of concurrent telephony sessions or calls that can be supported at one time. The number of channels is typically limited by the number of interconnections available to a specific carrier or network. The telephone network 150 may alternatively be composed of multiple carriers or network providers or the Public Switched Telephone Network, but the plurality of carriers or networks is preferably managed or handled as one telephone network. The static number of channels is preferably a set number for a period of time (usually based on a contract with a telephone company), and the number is preferably large enough to provide sufficient capacity. The static number of channels preferably determines the capacity of a network and the ability of the telephone network to connect with other networks. The operation of the telephone network is preferably handled by providing applications access to a channel of the telephone network. The telephone network may have a given number of channels not being used at any given time. In one variation, the telephone network may alternatively operate unused channels in an unused-mode. The unused mode may be a full or partial hardware power down mode, a hardware sleep mode, a secondary use (such as for non-crucial uses that can preferably be interrupted with minimal adverse effects), and/or any suitable way. The unused mode would function to reduce operation cost and/or maximize the utility of unused capacity. The telephony network channels 150 are preferably Public Switched Telephone Network (PSTN) connections but may alternatively be Session Initiation Protocol (SIP) trunks or any suitable device to create a telephony network connection to a telephony device.
2. Method of Operating a Multitenant Telephone Network
As shown in
Step S110, which includes multiplexing call requests of a plurality of users to a telephony resource, functions to share the use of a telephony resource between a plurality of users. A single telephony resource is preferably shared between a plurality of users/applications. The multiplexing preferably occurs in a form of time division multiplexing in which call requests are sent to telephony resource in an alternating fashion. The time division multiplexing is preferably based on completion of complete call sessions or processes. In other words, users take turns using the telephony resource to create a call session and run an application. For example, a first customer preferably has a call request serviced by a telephony resource and upon completion of the call session of the call request, a second user may have a call request serviced by the same telephony resource. A call request is preferably received from a user or more specifically a telephony application residing on an external server, but the call request may alternatively be sent from any suitable source. The call request is preferably received over a packet-based communication channel, in other words a non-direct communication channel. In one variation, the call request is preferably received in a HTTP or HTTPS message but may alternatively be received through any suitable application communication protocol. Step S110 may additionally include queuing a call request of a user S112, which functions to gate or prioritize incoming call requests. The call queue is preferably used for outbound requests, while inbound calls are preferably handled immediately (or else the call session will most likely fail). Alternatively, an inbound call may be queued for full service, with a “ringing” audio played back while call is waiting in the queue to be fully serviced. A queue may, however, be used for inbound telephony messages because telephony messages such as SMS messages and MMS messages will be resent if not received on the first attempt. The call queue is preferably a list of pending call requests from a plurality of users. An additional queue may additionally or alternatively be used for telephony messages. The call requests are preferably ordered within the queue in a way that balances access to resources. Each user (e.g., account, application, or phone number) is preferably assigned an inter call request limit (a throttle) and a limit on the maximum number of call requests that can be made in a specified amount of time (a cap). Call requests are preferably selected for servicing at a specified rate or by a device (i.e., a queue popper), which may be selecting calls based on current load on the telephony resource cluster. The queue may alternatively be operated in any suitable variation such as those described above. A queue may be assigned to each user or phone number. Queuing may alternatively occur according to any suitable queuing methodology such as randomly, in a round-robin fashion, with fair queuing, with weighted fair queuing, based on actual resource utilization, and/or any suitable methodology. A load balancer preferably distributes call requests to a telephony resource that has the least capacity. The load balancer and the call request queue preferably cooperatively distribute the load as described above.
As an additional step, method 100′ preferably includes provisioning resources of the telephony resource cluster S120, which functions to scale the capacity of the telephony resource cluster to adequately multiplex a call request to a telephony resource. Step S120 may include reprovisioning an existing telephony resource of the telephony resource cluster, allocating additional resources to the telephony resource cluster, and/or deallocating resources of the telephony resource cluster, and/or re-allocating resources from one type of resource to another in realtime. The telephony resource cluster preferably includes a plurality of telephony resources performing various functions or operations as described above. For example, the telephony resource cluster may include a plurality of call routers, transcription systems, media processing systems, and text-to-speech systems. A telephony resource preferably is composed of a computer processor and/or storage resources for a first purpose. As part of S120, a resource of the telephony resource cluster a processor and/or storage device of a telephony resource is preferably reprovisioned for a new second purpose. For example a text-to-speech may be reprovisioned to function as a call router at times when more calls need to be served. Additionally, more resources may be allocated or deallocated which may include adding new resources to the system and/or activating resources, or re-allocating resources from another customer of a shared resource environment. The resources are preferably those provided by a multitenant shared virtualized computing environment such as a cloud hosting provider (i.e., a web service that provides resizable compute capacity that allows a user to boot a machine image to create a virtual machine resource), but may alternatively be physical machines either co-located or distributed. For example, a number of resources may be operating in a powered down state. When the more capacity is required, the resources may be turned on/booted (i.e., allocated) to serve as a new resource of the telephony resource cluster. Similarly, when the telephony resource cluster has more capacity than is currently required a resource may be powered down, returned to a pool of resources for use by other companies (i.e., deallocated), or any suitable action to end current use of the resource.
Additionally, Step S120 may include analyzing resource capacity requirements S122 which functions to collect data on real-time or imminent capacity requirements. Data may be collected from the call request queue, from stored history on capacity requirements, current load of the telephony resource cluster, data from an analysis of applications, or any suitable source of predicting capacity requirements. Data from the call request queue may provide information such as number of pending call requests, the type or details of the call request, or any suitable queue related information. Stored capacity history preferably provides insight to capacity patterns such as temporal patterns throughout the day, week, or year. Current load of the telephony resource cluster preferably provides information such as the current number of resources of the telephony resource, number of available resources of the telephony resource, the division of type of resources, the number of deallocated resources, the number of telephone network channels, etc. Application analysis data preferably is data from the telephone applications of users on expected or predicted capacity requirements. An analysis is preferably performed on the operation of the application and or gathered from a user on the expected capacity requirements of the application such as number of calls, peak time for calls, what type of calls (e.g., conference calls, SMS messages etc.). The analysis information is preferably used to control the provisioning, allocation, and deallocation of resources of Step S120. Additionally, after analyzing the capacity requirements, other components of the system such as the telephony resource cluster, telephony resources, call queue, dequeuers, resource allocator are preferably notified of relevant analysis information. Particular analysis information may be specifically sent to a component. For example, the load balancers and the dequeuers are preferably informed about available resources and adjust operation according to the capacity information.
Step S130, which includes creating a first call session from the call request through the telephony resource, functions to convert the call request into a call session using the telephony resource. Step S130 preferably additionally includes additional processing and steps specific to a particular application. In a preferred variation, a call router preferably processes telephony instructions of a call request to identify the destination phone number and then establishes a connection to the destination phone number as part of Step S140. A transcription server may initiate recording or prepare to record a conversation of the call session.
Step S140, which includes multiplexing the call session with a plurality of additional call sessions to a telephony channel, functions to establish a telephone network connection to a telephony device. The telephony channel is preferably a PSTN (Public Switched Telephone Network) connection. This may be a physical wire or some interfacing infrastructure to connect to the PSTN. In some cases the concept of a channel is preferably subscribed to or rented from a telephone network. In one alternative, a SIP (Session Initiation Protocol) trunk may be used as an internet based gateway to a telephone network. The multiplexing preferably occurs in a form of time division multiplexing in which call sessions are connected to telephony channel in an alternating fashion. The time division multiplexing is preferably based on completion of complete call session. For example, a particular network channel may first be utilized for a call session of a first user, and upon completion of the call, a second call session may be established with the particular network channel for a second user. As part of Step S140, the telephony channels may additionally include provisioning telephony channels S142. This functions to adjust the number of available telephone network capacity of the system. By provisioning gateways to the telephone network (e.g., call routers or SIP trunks), channels or gateways to channels may be allocated or deallocated. Such scaling of telephony network channels preferably allows operation near the current telephone network capacity requirements. If such scalability was not in use then there would be a set limit on the number of channels that could be simultaneously used.
3. Method of Operating a Dynamic Telephone Network
As shown in
Step S210, which includes operating a telephone network with a static number of channels, functions to be the base infrastructure for providing users with telephone network access. The static number of channels is preferably the total number of concurrent telephony sessions or calls that can be supported at one time. The number of channels is conventionally limited by the number of interconnections available to a specific carrier or network. The telephone network may, however, be composed of multiple carriers or network providers or the Public Switched Telephone Network, but the plurality of carriers or networks is preferably managed or handled as one telephone network. The static number of channels is preferably a set number for a period of time (usually based on contract with a telephone company), and the number is preferably large enough to provide sufficient capacity. The static number of channels is preferably an indication of the capacity of a network and the ability of the telephone network to connect with other networks. The operation of the telephone network is preferably handled by providing users access to a channel of the telephone network. The telephone network may have a given number of channels not being used at any given time. In one variation, the telephone network may alternatively operate unused channels in an unused-mode. The unused mode may be a full or partial hardware power down mode, a hardware sleep mode, a secondary use (such as for non-crucial uses that can preferably be interrupted with minimal adverse effects), and/or any suitable way. The unused mode would function to reduce operation cost and/or maximize the utility of unused capacity.
As an additional alternative to the preferred embodiment, the method may include operating a distributed call controller as a subset of the telephone network S212. The distributed call controller may alternatively be a subset of multiple telephone networks if multiple network providers or carriers are used. The operation of the distributed call controller preferably functions to operate an allocated number of channels for current capacity requirements of the telephone network. The distributed call controller preferably has less than or equal capacity as the static channel capacity at any given time. The capacity of the distributed call controller can preferably be increased by allocating more resources of the telephone network to the call controller, and the capacity of the distributed call controller can preferably be decreased by deallocating resources of the telephone network. Access to the telephony network is preferably facilitated by virtualized hardware or software (such as call routers or SIP trunks). Allocation of more resources of the telephone network may additionally include a virtualization of a device to access a telephony network. For example a virtualization of a network access channel may be added to add further access capacity to the telephony network. As another example, a commodity hardware node may be added to the telephone network to run a telephony software stack during high capacity requirements.
Step S220, which includes providing telephone network channel access to a plurality of users, functions to allow a plurality of different parties to access the channels of the telephone network. The users preferably subscribe to a service of the operator of the telephone network. The users of the telephone network are preferably operating telephony applications such as call centers, Private Branch Exchanges (PBX), phone trees, Interactive Voice Response (IVR) applications, internet-telephony applications, VOIP services, and/or any suitable telephony application. The user preferably does not subscribe to the service based on any specific number of channels. From the viewpoint of the user, the number of channels is preferably infinite or an irrelevant point for the operation of an application of the user. The user is preferably presented a per usage or time perspective (e.g., pricing and/or application usage perspective), while the telephone network is being operated on a per channel basis. The operator of the telephone network preferably converts costs associated with the operation of the telephone network (e.g. fixed capital costs of leasing from a telephone company or operation cost) into variable costs for the users. The access to the telephone network is preferably operated, leased, and/or on contract from a telephone company (such as AT&T) by a per channel basis. A lease agreement or contract may alternatively be negotiated to minimize per-channel (capacity) cost and preferably emphasize per usage or per time costs, or alternatively, any suitable leasing agreement or contract may be used. Users preferably pay by usage, a flat rate for a time period, per minute, a combination of usage and time charges, and/or any suitable pricing model.
Step S230, which includes managing usage of channels to allow a user access to a number of channels that exceeds normal operation S130, functions to provide high capacity capabilities to users while ensuring that the quality and reliability of the telephone network is not aversely affected by the usage of other users. An individual user of the plurality of users is preferably allowed to use a number of channels greater than an equal division between the plurality of users of the static number of channels. The sum total of the maximum number of channels an individual user uses at given times may preferably be greater than the static number of channels. The given times where an individual user has access a maximum number of channels is preferably when demand on the telephone network by other users is low. Usage of the telephone network and the telephony resource cluster is preferably time based multiplex based on the completion of telephony sessions (i.e., users share the use of the resources and network). In a simplified example, a telephone network has 10 channels available and there are five users. When distributed uniformly, the users would each have 2 channels available for usage, but in one preferred embodiment all five users may have access of up to 10 channels each, assuming no other user is using the channels. During regular use of the telephony network, the user still has the ability to access the maximum number of telephone network channels but the call requests are preferably gated by user limits implemented by a call queue. In another example extending on the above example, analysis might indicate that 4 users may use 2 channels at a given point of time, thus 8 may be available to the 5th user, while keeping capacity available for the first 4 users. Managing the usage of the channels preferably includes managing the usage of resources such as by: managing a call queue, enforcing user limits, predicting and/or analyzing usage and capacity requirements, adjusting capacity based on the capacity of the distributed call controller, and/or any suitable steps of managing the resources of the telephone network. Capacity of the distributed call controller may additionally be controlled or affected by predictions and analysis and user limits may additionally be affected.
The method of the preferred embodiment may additionally include the step of managing a call queue of requests from the plurality of users S232. Step S232 functions to prioritize the handling of call requests from users. The call queue is preferably a program or hardware managed stack that is operated as part of a control architecture of the telephone network. The control architecture preferably manages the telephone network and usage by the plurality of users. The call queue is preferably a list of call requests awaiting service by the telephone network including telephony voice session requests and/or SMS/MMS message requests. The requests are preferably serviced at a rate suitable for the current capacity of the network and for each user. The servicing rate may alternatively be adjusted according to the capacity of the distributed call center or number of requests in the queue. A user request is preferably placed in the call queue when capacity is exceeded or alternatively placed in the call queue for every request or based on any suitable rule. A user preferably has associated user limits, in particular: a call rate limit (throttle) and a total limit (cap). The throttle and cap are preferably used to determine the positioning of requests in the call queue. Requests from a user are preferably spaced in time in the call queue according to the throttle. Requests of different users are preferably ordered in the queue in a staggered or alternating fashion as shown in
The method of the preferred embodiment may additionally include the step of predicting capacity requirements for the distributed call controller S234. Step S234 functions to assess indicators that correlate to the number of telephone network channels needed at a later point. The predicting of capacity is preferably accomplished by programmatically or mathematically (through pattern detection or any suitable algorithm) analyzing current and past information but any suitable method may alternatively be used. Patterns in capacity needs are preferably found related to the time of day, day of the week, yearly patterns, usage patterns (such as if an increase in capacity needs by one user indicates increase in capacity needs by other users), call location, call duration of calls, and/or any suitable indicator. The predictions of Step S234 may additionally be used for realtime provisioning, deprovisioning, and/or reprovisioning capacity of the distributed call controller or planning capacity requirements of the static capacity of the telephone network.
The method of the preferred embodiment may additionally include the step of reacting to capacity needs of the call queue S236. Step S236 functions to use the call queue and other current capacity indicators to adjust the distributed call controller for the current capacity requirements or anticipated near term requirements. The call queue is preferably assessed through software or alternatively by any suitable monitoring of the call queue. The number of calls currently in the queue, the total number of users currently using the telephone network, incoming calls (that may be not be queued), the frequency of user requests, and/or any suitable characteristic of the telephone network or the call queue preferably cause a reaction to the capacity needs. The reaction is preferably for current overall capacity needs but may alternatively be for current capacity needs of an individual user or any suitable party. The reactions may include adjusting the settings of the call queue (such as call queue service rate or ordering), modifying user limits, adjusting capacity of the distributed telephone controller, and/or any suitable action. In one example, a call queue may have many calls scheduled for 100 seconds after the current time, the distributed call controller may increase capacity to accommodate the anticipated capacity requirements.
The method of the preferred embodiment may additionally include the step of analyzing capacity needs of a user and predicting the telephone network capacity needs S238. Step S238 functions to detect individual capacity needs to determine total capacity requirements of the telephone network. Capacity needs of a user are preferably acquired by analyzing a telephony application of a user. Part of the analysis preferably includes detecting periodic events that indicate capacity needs of an individual application. An example of such an event might be an application associated with a weekly TV show where callers call in around the air time of the show. The analysis may alternatively or additionally include detecting typical call duration for an individual application. Some applications may only be used for a brief amount of time (such as when a short message is played), while other applications may require longer durations of use (such as when a user must navigate a long phone tree). Additionally, application history may be used to determine usage patterns such as by monitoring maximum, minimum, and/or average capacity requirements, frequency of requests, duration of requests, number of SMS messages sent in a particular time duration, and/or any suitable call characteristic. Usage characteristics of the individual applications of users are preferably combined with the usage characteristics of the other users to determine the total usage characteristics and capacity needs of the telephone network. Preferably, the code of the application is preferably analyzed to assess the functionality and usage patterns of the application. The application code or operation is preferably programmatically analyzed, but any suitable method may be used. Alternatively, the user and/or a second party may characterize the application and/or telephony service of the user. This characterization is preferably performed by the user while signing up, and preferably includes user expectations for the frequency of use, times of use, duration of calls, and/or any suitable characteristic of the application. The user may additionally prioritize when capacity should be highest for their application. Any suitable steps may be used to analyze an individual application.
As an additional alternative to the preferred embodiment, the method may include adjusting capacity of the distributed call controller S240. Step S240 functions to change the number of active channels of the telephone network to appropriately handle the capacity requirements. Step S240 is preferably used in combination with Step S212, which includes operating a distributed call controller. The adjustments to the distributed call controller adjust the capacity capability that the operator offers. The capacity is preferably adjusted based on the management of the usage of channels of the telephone network. The capacity is more preferably adjusted based on the predictions and analysis of Steps of S234 and/or S236, but may alternatively be adjusted in cooperation with Step S232, Step S238, and/or for any suitable reason. When more capacity is needed, more resources, such as CPU, RAM, DISK, etc., capable of handling simultaneous channels or providing more channels, are preferably allocated to the distributed telephone controller, and conversely when less capacity is required, resources are preferably deallocated from the distributed telephone controller. The adjustment of capacity is preferably made to handle the expected or predicted capacity. The static capacity of the telephone network may alternatively or additionally be adjusted. As the telephone network capacity is typically less flexible. Adjustments to the telephone network capacity are preferably made for long-term capacity needs (e.g., on a per month basis). Any suitable adjustment to the system for more or less capacity may alternatively be used.
4. Method of Distributing Calls Between Telephony Hardware
As shown in
Step S310, which includes queuing a call request, functions to manage a call request until the necessary resources are available to service the call. A call request is preferably instantiated by a telephony application, a call router, a telephony device, and/or any suitable source of a call request. The call request may additionally be a SMS or MMS message request. The call request is preferably outgoing. An incoming call is preferably viewed as a more urgent call request than an outgoing request, and an incoming call may not be queued but alternatively may be passed directly to an available resource. Alternatively incoming call requests (call session initiations) may be queued, but since incoming calls have more immediacy they are preferably prioritized or the system must be have short queuing wait where a short wait is less than the time it would take for an incoming call to fail. The incoming call may alternatively be placed near the front of a queue or positioned in the queue according to separate rules appropriate for the higher priority of the call request. Similarly, a synchronous outgoing call request may be queued with high priority. A synchronous call is a call that another caller is relying on to proceed, as opposed to a new call initiated by an application in which a user will not notice a delay. Call requests are preferably ordered in the queue according to rules based on the throttle, caps, real-time urgency (priority) and/or any suitable factors.
Step S320, which includes selecting a load balancing call router, functions to identify a call router that should handle the call to preferably optimize the operation of a telephone resource cluster. The selected call router is typically the call router with the least load, but may alternatively be selected to optimize cost, energy usage, processing capability, and/or any suitable variable. Step S320 may additionally be applied to other hardware or software resources in addition to or alternatively to a call router. Call routers of a telephone resource cluster may have variable capacity and performance depending on hardware and/or software specs. The variability between the plurality call routers is preferably considered in selecting a call router. A load balancer substantially similar to the one described above is preferably the component that implements step S320, though step S320 may be performed by any suitable device. The load balancer is preferably capable of allocating and deallocating resources of the cluster, and so resources may be allocated and/or deallocated as a substep of S320. The resource allocator can preferably allocate and deallocate call routers, hardware resources, and/or software resources. The resources are preferably allocated or deallocated based on current or predicted utilization, but the resources may alternatively be allocated or deallocated as a function of other resources. For example, one media processing resource may be allocated (e.g., operating) for every five call routers. The selection of a load balancing call router preferably uses data from an analysis system. So that the step of selecting a load balancing call router may include selecting a call router that will balance load at a future time.
Step S330, which includes connecting a call with a selected call router, functions to pass control of the call to the specified resource. For an outgoing call, a call router preferably connects through a telephone network to the designated phone number. For an incoming call, the call router preferably connects to the specified telephony application; PSTN-connected device(s), such as landlines, cellular phones, satellite phones, or any other suitable PSTN-connected devices; non-PSTN devices, such as Voice-Over-Internet-Protocol (VOIP) phones, SIP devices, Skype, Gtalk, or other Internet addressable voice devices; and/or any suitable device associated with the number of the incoming call.
The method of the preferred embodiment may additionally include networking call routers that have a shared application S340. Step S340 functions to allow communication between multiple call routers. This is preferably useful in situations where functionality of an application is distributed over multiple resources (e.g., multiple call routers). The network preferably allows sharing of resources between call routers. Audio channels of call routers may additionally be mixed and shared between call routers. A VOIP channel is preferably formed over the network for bridging audio of different call routers. For example, a conference call may use the network to bridge audio of multiple call sessions from different call routers.
The method of the preferred embodiment may additionally include synchronizing applications with a service application S350. The service application functions to monitor an application distributed over a call router cluster and coordinate operation of the application. The service application may additionally be used to share state information between the call routers. The service application preferably provides a specific functionality such as a hang up service or a multiple input service as described above. Any suitable application may be implemented by the service application such as input-gathering, multi-dialing, call splitting, call merging, and any suitable feature. Any number of service applications may be used.
As a person skilled in the art will recognize from the previous detailed description and from the figures and claims, modifications and changes can be made to the preferred embodiments of the invention without departing from the scope of this invention defined in the following claims.
This application is a continuation of co-pending U.S. patent application Ser. No. 14/626,427, filed 19 Feb. 2015, which is a continuation of U.S. patent application Ser. No. 14/158,281, filed 17 Jan. 2014, now issued as U.S. Pat. No. 8,995,641, which is a continuation of U.S. patent application Ser. No. 13/632,872, filed 1 Oct. 2012, which is a continuation of U.S. patent application Ser. No. 12/716,127, filed 2 Mar. 2010, now issued as U.S. Pat. No. 8,315,369, which claims the benefit of U.S. Provisional Application No. 61/156,758, filed 2 Mar. 2009, U.S. Provisional Application No. 61/249,493, filed 7 Oct. 2009, and U.S. Provisional Application No. 61/296,270, filed 19 Jan. 2010, all of which are incorporated in their entirety by this reference. This application is related to prior application Ser. No. 12/417,630, filed 2 Apr. 2009, which is incorporated in its entirety by this reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5274700 | Gechter et al. | Dec 1993 | A |
| 5526416 | Dezonno et al. | Jun 1996 | A |
| 5581608 | Jreij et al. | Dec 1996 | A |
| 5598457 | Foladare et al. | Jan 1997 | A |
| 5867495 | Elliott et al. | Feb 1999 | A |
| 5934181 | Adamczewski | Aug 1999 | A |
| 5978465 | Corduroy et al. | Nov 1999 | A |
| 6026440 | Shrader et al. | Feb 2000 | A |
| 6034946 | Roginsky et al. | Mar 2000 | A |
| 6094681 | Shaffer et al. | Jul 2000 | A |
| 6138143 | Gigliotti et al. | Oct 2000 | A |
| 6185565 | Meubus et al. | Feb 2001 | B1 |
| 6192123 | Grunsted et al. | Feb 2001 | B1 |
| 6206564 | Adamczewski | Mar 2001 | B1 |
| 6223287 | Douglas et al. | Apr 2001 | B1 |
| 6232979 | Shochet | May 2001 | B1 |
| 6269336 | Ladd et al. | Jul 2001 | B1 |
| 6317137 | Rosasco | Nov 2001 | B1 |
| 6363065 | Thornton et al. | Mar 2002 | B1 |
| 6373836 | Deryugin et al. | Apr 2002 | B1 |
| 6425012 | Trovato et al. | Jul 2002 | B1 |
| 6426995 | Kim et al. | Jul 2002 | B1 |
| 6430175 | Echols et al. | Aug 2002 | B1 |
| 6434528 | Sanders | Aug 2002 | B1 |
| 6445694 | Swartz | Sep 2002 | B1 |
| 6445776 | Shank et al. | Sep 2002 | B1 |
| 6459913 | Cloutier | Oct 2002 | B2 |
| 6463414 | Su et al. | Oct 2002 | B1 |
| 6493558 | Bernhart et al. | Dec 2002 | B1 |
| 6496500 | Nance et al. | Dec 2002 | B2 |
| 6501739 | Cohen | Dec 2002 | B1 |
| 6501832 | Saylor et al. | Dec 2002 | B1 |
| 6507875 | Mellen-Garnett et al. | Jan 2003 | B1 |
| 6571245 | Chun et al. | May 2003 | B2 |
| 6574216 | Farris et al. | Jun 2003 | B1 |
| 6577721 | Vainio et al. | Jun 2003 | B1 |
| 6600736 | Ball et al. | Jul 2003 | B1 |
| 6606596 | Zirngibl et al. | Aug 2003 | B1 |
| 6614783 | Sonesh et al. | Sep 2003 | B1 |
| 6625258 | Ram et al. | Sep 2003 | B1 |
| 6625576 | Kochanski et al. | Sep 2003 | B2 |
| 6636504 | Albers et al. | Oct 2003 | B1 |
| 6662231 | Drosset et al. | Dec 2003 | B1 |
| 6704785 | Koo et al. | Mar 2004 | B1 |
| 6707889 | Saylor et al. | Mar 2004 | B1 |
| 6711129 | Bauer et al. | Mar 2004 | B1 |
| 6711249 | Weissman et al. | Mar 2004 | B2 |
| 6738738 | Henton | May 2004 | B2 |
| 6757365 | Bogard | Jun 2004 | B1 |
| 6765997 | Zirngibl et al. | Jul 2004 | B1 |
| 6768788 | Langseth et al. | Jul 2004 | B1 |
| 6778653 | Kallas et al. | Aug 2004 | B1 |
| 6785266 | Swartz | Aug 2004 | B2 |
| 6788768 | Saylor et al. | Sep 2004 | B1 |
| 6792086 | Saylor et al. | Sep 2004 | B1 |
| 6792093 | Barak et al. | Sep 2004 | B2 |
| 6798867 | Zirngibl et al. | Sep 2004 | B1 |
| 6807529 | Johnson et al. | Oct 2004 | B2 |
| 6807574 | Partovi et al. | Oct 2004 | B1 |
| 6819667 | Brusilovsky et al. | Nov 2004 | B1 |
| 6820260 | Flockhart et al. | Nov 2004 | B1 |
| 6829334 | Zirngibl et al. | Dec 2004 | B1 |
| 6831966 | Tegan et al. | Dec 2004 | B1 |
| 6834265 | Balasuriya | Dec 2004 | B2 |
| 6836537 | Zirngibl et al. | Dec 2004 | B1 |
| 6842767 | Partovi et al. | Jan 2005 | B1 |
| 6850603 | Eberle et al. | Feb 2005 | B1 |
| 6870830 | Schuster et al. | Mar 2005 | B1 |
| 6873952 | Bailey et al. | Mar 2005 | B1 |
| 6874084 | Dobner et al. | Mar 2005 | B1 |
| 6885737 | Gao et al. | Apr 2005 | B1 |
| 6888929 | Saylor et al. | May 2005 | B1 |
| 6895084 | Saylor et al. | May 2005 | B1 |
| 6898567 | Balasuriya | May 2005 | B2 |
| 6912581 | Johnson et al. | Jun 2005 | B2 |
| 6922411 | Taylor | Jul 2005 | B1 |
| 6928469 | Duursma et al. | Aug 2005 | B1 |
| 6931405 | El-Shimi et al. | Aug 2005 | B2 |
| 6937699 | Schuster et al. | Aug 2005 | B1 |
| 6940953 | Eberle et al. | Sep 2005 | B1 |
| 6941268 | Porter et al. | Sep 2005 | B2 |
| 6947417 | Laursen et al. | Sep 2005 | B2 |
| 6947988 | Saleh | Sep 2005 | B1 |
| 6961330 | Cattan et al. | Nov 2005 | B1 |
| 6964012 | Zirngibl et al. | Nov 2005 | B1 |
| 6970915 | Partovi et al. | Nov 2005 | B1 |
| 6977992 | Zirngibl et al. | Dec 2005 | B2 |
| 6985862 | Stroem et al. | Jan 2006 | B2 |
| 6999576 | Sacra | Feb 2006 | B2 |
| 7003464 | Ferrans et al. | Feb 2006 | B2 |
| 7006606 | Cohen et al. | Feb 2006 | B1 |
| 7010586 | Allavarpu et al. | Mar 2006 | B1 |
| 7020685 | Chen et al. | Mar 2006 | B1 |
| 7039165 | Saylor et al. | May 2006 | B1 |
| 7062709 | Cheung | Jun 2006 | B2 |
| 7065637 | Nanja | Jun 2006 | B1 |
| 7076037 | Gonen et al. | Jul 2006 | B1 |
| 7076428 | Anastasakos et al. | Jul 2006 | B2 |
| 7089310 | Ellerman et al. | Aug 2006 | B1 |
| 7103003 | Brueckheimer et al. | Sep 2006 | B2 |
| 7103171 | Annadata et al. | Sep 2006 | B1 |
| 7106844 | Holland | Sep 2006 | B1 |
| 7111163 | Haney | Sep 2006 | B1 |
| 7136932 | Schneider | Nov 2006 | B1 |
| 7140004 | Kunins et al. | Nov 2006 | B1 |
| 7143039 | Stifelman et al. | Nov 2006 | B1 |
| 7197331 | Anastasakos et al. | Mar 2007 | B2 |
| 7197461 | Eberle et al. | Mar 2007 | B1 |
| 7197462 | Takagi et al. | Mar 2007 | B2 |
| 7197544 | Wang et al. | Mar 2007 | B2 |
| 7225232 | Elberse | May 2007 | B2 |
| 7227849 | Rasanen | Jun 2007 | B1 |
| 7260208 | Cavalcanti | Aug 2007 | B2 |
| 7266181 | Zirngibl et al. | Sep 2007 | B1 |
| 7269557 | Bailey et al. | Sep 2007 | B1 |
| 7272212 | Eberle et al. | Sep 2007 | B2 |
| 7272564 | Phillips et al. | Sep 2007 | B2 |
| 7277851 | Henton | Oct 2007 | B1 |
| 7283515 | Fowler | Oct 2007 | B2 |
| 7286521 | Jackson et al. | Oct 2007 | B1 |
| 7287248 | Adeeb | Oct 2007 | B1 |
| 7289453 | Riedel et al. | Oct 2007 | B2 |
| 7296739 | Mo et al. | Nov 2007 | B1 |
| 7298732 | Cho | Nov 2007 | B2 |
| 7298834 | Homeier et al. | Nov 2007 | B1 |
| 7308085 | Weissman | Dec 2007 | B2 |
| 7308408 | Stifelman et al. | Dec 2007 | B1 |
| 7324633 | Gao et al. | Jan 2008 | B2 |
| 7324942 | Mahowald et al. | Jan 2008 | B1 |
| 7328263 | Sadjadi | Feb 2008 | B1 |
| 7330463 | Bradd et al. | Feb 2008 | B1 |
| 7330890 | Partovi et al. | Feb 2008 | B1 |
| 7340040 | Saylor et al. | Mar 2008 | B1 |
| 7349714 | Lee et al. | Mar 2008 | B2 |
| 7369865 | Gabriel et al. | May 2008 | B2 |
| 7373660 | Guichard et al. | May 2008 | B1 |
| 7376223 | Taylor et al. | May 2008 | B2 |
| 7376586 | Partovi et al. | May 2008 | B1 |
| 7376733 | Connelly et al. | May 2008 | B2 |
| 7376740 | Porter et al. | May 2008 | B1 |
| 7412525 | Cafarella et al. | Aug 2008 | B2 |
| 7418090 | Reding et al. | Aug 2008 | B2 |
| 7428302 | Zirngibl et al. | Sep 2008 | B2 |
| 7440898 | Eberle et al. | Oct 2008 | B1 |
| 7447299 | Partovi et al. | Nov 2008 | B1 |
| 7454459 | Kapoor et al. | Nov 2008 | B1 |
| 7457249 | Baldwin et al. | Nov 2008 | B2 |
| 7457397 | Saylor et al. | Nov 2008 | B1 |
| 7473872 | Takimoto | Jan 2009 | B2 |
| 7486780 | Zirngibl et al. | Feb 2009 | B2 |
| 7496054 | Taylor | Feb 2009 | B2 |
| 7496188 | Saha et al. | Feb 2009 | B2 |
| 7500249 | Kampe et al. | Mar 2009 | B2 |
| 7505951 | Thompson et al. | Mar 2009 | B2 |
| 7519359 | Chiarulli et al. | Apr 2009 | B2 |
| 7522711 | Stein et al. | Apr 2009 | B1 |
| 7536454 | Balasuriya | May 2009 | B2 |
| 7552054 | Stifelman et al. | Jun 2009 | B1 |
| 7571226 | Partovi et al. | Aug 2009 | B1 |
| 7606868 | Le et al. | Oct 2009 | B1 |
| 7613287 | Stifelman et al. | Nov 2009 | B1 |
| 7623648 | Oppenheim et al. | Nov 2009 | B1 |
| 7630900 | Strom | Dec 2009 | B1 |
| 7631310 | Henzinger | Dec 2009 | B1 |
| 7644000 | Strom | Jan 2010 | B1 |
| 7657433 | Chang | Feb 2010 | B1 |
| 7657434 | Thompson et al. | Feb 2010 | B2 |
| 7668157 | Weintraub et al. | Feb 2010 | B2 |
| 7672295 | Andhare et al. | Mar 2010 | B1 |
| 7675857 | Chesson | Mar 2010 | B1 |
| 7676221 | Roundtree et al. | Mar 2010 | B2 |
| 7715547 | Ibbotson et al. | May 2010 | B2 |
| 7742499 | Erskine et al. | Jun 2010 | B1 |
| 7779065 | Gupta et al. | Aug 2010 | B2 |
| 7875836 | Imura et al. | Jan 2011 | B2 |
| 7882253 | Pardo-Castellote et al. | Feb 2011 | B2 |
| 7920866 | Bosch et al. | Apr 2011 | B2 |
| 7926099 | Chakravarty et al. | Apr 2011 | B1 |
| 7936867 | Hill et al. | May 2011 | B1 |
| 7962644 | Ezerzer et al. | Jun 2011 | B1 |
| 7979555 | Rothstein et al. | Jul 2011 | B2 |
| 8023425 | Raleigh | Sep 2011 | B2 |
| 8024785 | Andress et al. | Sep 2011 | B2 |
| 8046378 | Zhuge et al. | Oct 2011 | B1 |
| 8046823 | Begen et al. | Oct 2011 | B1 |
| 8069096 | Ballaro et al. | Nov 2011 | B1 |
| 8078483 | Hirose et al. | Dec 2011 | B1 |
| 8081958 | Soederstroem et al. | Dec 2011 | B2 |
| 8103725 | Gupta et al. | Jan 2012 | B2 |
| 8126128 | Hicks, III et al. | Feb 2012 | B1 |
| 8139730 | Palma et al. | Mar 2012 | B2 |
| 8149716 | Ramanathan et al. | Apr 2012 | B2 |
| 8150918 | Edelman et al. | Apr 2012 | B1 |
| 8156213 | Deng et al. | Apr 2012 | B1 |
| 8175007 | Jain et al. | May 2012 | B2 |
| 8185619 | Maiocco et al. | May 2012 | B1 |
| 8196133 | Kakumani et al. | Jun 2012 | B2 |
| 8233611 | Zettner | Jul 2012 | B1 |
| 8238533 | Blackwell et al. | Aug 2012 | B2 |
| 8243889 | Taylor et al. | Aug 2012 | B2 |
| 8249552 | Gailloux et al. | Aug 2012 | B1 |
| 8266327 | Kumar et al. | Sep 2012 | B2 |
| 8295272 | Boni et al. | Oct 2012 | B2 |
| 8306021 | Lawson et al. | Nov 2012 | B2 |
| 8315198 | Corneille et al. | Nov 2012 | B2 |
| 8319816 | Swanson et al. | Nov 2012 | B1 |
| 8326805 | Arous et al. | Dec 2012 | B1 |
| 8346630 | McKeown | Jan 2013 | B1 |
| 8355394 | Taylor et al. | Jan 2013 | B2 |
| 8417817 | Jacobs | Apr 2013 | B1 |
| 8429827 | Wetzel | Apr 2013 | B1 |
| 8438315 | Tao et al. | May 2013 | B1 |
| 8462670 | Chien et al. | Jun 2013 | B2 |
| 8467502 | Sureka et al. | Jun 2013 | B2 |
| 8503639 | Reding et al. | Aug 2013 | B2 |
| 8503650 | Reding et al. | Aug 2013 | B2 |
| 8509068 | Begall et al. | Aug 2013 | B2 |
| 8532686 | Schmidt et al. | Sep 2013 | B2 |
| 8542805 | Agranovsky et al. | Sep 2013 | B2 |
| 8543665 | Ansari et al. | Sep 2013 | B2 |
| 8565117 | Hilt et al. | Oct 2013 | B2 |
| 8577803 | Chatterjee et al. | Nov 2013 | B2 |
| 8582450 | Robesky | Nov 2013 | B1 |
| 8594626 | Woodson et al. | Nov 2013 | B1 |
| 8601136 | Fahlgren et al. | Dec 2013 | B1 |
| 8611338 | Lawson et al. | Dec 2013 | B2 |
| 8613102 | Nath | Dec 2013 | B2 |
| 8649268 | Lawson et al. | Feb 2014 | B2 |
| 8667056 | Proulx et al. | Mar 2014 | B1 |
| 8675493 | Buddhikot et al. | Mar 2014 | B2 |
| 8695077 | Gerhard et al. | Apr 2014 | B1 |
| 8755376 | Lawson et al. | Jun 2014 | B2 |
| 8767925 | Sureka et al. | Jul 2014 | B2 |
| 8806024 | Toba Francis et al. | Aug 2014 | B1 |
| 8837465 | Lawson et al. | Sep 2014 | B2 |
| 8838707 | Lawson et al. | Sep 2014 | B2 |
| 8861510 | Fritz | Oct 2014 | B1 |
| 8879547 | Maes | Nov 2014 | B2 |
| 8938053 | Cooke et al. | Jan 2015 | B2 |
| 8948356 | Nowack et al. | Feb 2015 | B2 |
| 8964726 | Lawson et al. | Feb 2015 | B2 |
| 9014664 | Kim et al. | Apr 2015 | B2 |
| 9015702 | Bhat | Apr 2015 | B2 |
| 9306982 | Lawson et al. | Apr 2016 | B2 |
| 9307094 | Nowack et al. | Apr 2016 | B2 |
| 9344573 | Wolthuis et al. | May 2016 | B2 |
| 9456008 | Lawson et al. | Sep 2016 | B2 |
| 20010038624 | Greenberg et al. | Nov 2001 | A1 |
| 20010043684 | Guedalia et al. | Nov 2001 | A1 |
| 20010051996 | Cooper et al. | Dec 2001 | A1 |
| 20020006124 | Jimenez et al. | Jan 2002 | A1 |
| 20020006125 | Josse et al. | Jan 2002 | A1 |
| 20020006193 | Rodenbusch et al. | Jan 2002 | A1 |
| 20020057777 | Saito et al. | May 2002 | A1 |
| 20020064267 | Martin et al. | May 2002 | A1 |
| 20020067823 | Walker et al. | Jun 2002 | A1 |
| 20020077833 | Arons et al. | Jun 2002 | A1 |
| 20020126813 | Partovi et al. | Sep 2002 | A1 |
| 20020133587 | Ensel et al. | Sep 2002 | A1 |
| 20020136391 | Armstrong | Sep 2002 | A1 |
| 20020165957 | Devoe et al. | Nov 2002 | A1 |
| 20020176378 | Hamilton et al. | Nov 2002 | A1 |
| 20020184361 | Eden | Dec 2002 | A1 |
| 20020198941 | Gavrilescu et al. | Dec 2002 | A1 |
| 20030006137 | Wei et al. | Jan 2003 | A1 |
| 20030012356 | Zino et al. | Jan 2003 | A1 |
| 20030014665 | Anderson et al. | Jan 2003 | A1 |
| 20030018830 | Chen et al. | Jan 2003 | A1 |
| 20030023672 | Vaysman | Jan 2003 | A1 |
| 20030026426 | Wright et al. | Feb 2003 | A1 |
| 20030046366 | Pardikar et al. | Mar 2003 | A1 |
| 20030051037 | Sundaram et al. | Mar 2003 | A1 |
| 20030058884 | Kallner et al. | Mar 2003 | A1 |
| 20030059020 | Meyerson et al. | Mar 2003 | A1 |
| 20030060188 | Gidron et al. | Mar 2003 | A1 |
| 20030061317 | Brown et al. | Mar 2003 | A1 |
| 20030061404 | Atwal et al. | Mar 2003 | A1 |
| 20030088421 | Maes et al. | May 2003 | A1 |
| 20030097447 | Johnston | May 2003 | A1 |
| 20030097639 | Niyogi et al. | May 2003 | A1 |
| 20030103620 | Brown et al. | Jun 2003 | A1 |
| 20030123640 | Roelle et al. | Jul 2003 | A1 |
| 20030195950 | Huang et al. | Oct 2003 | A1 |
| 20030195990 | Greenblat | Oct 2003 | A1 |
| 20030196076 | Zabarski et al. | Oct 2003 | A1 |
| 20030204616 | Billhartz et al. | Oct 2003 | A1 |
| 20030211842 | Kempf et al. | Nov 2003 | A1 |
| 20030231647 | Petrovykh | Dec 2003 | A1 |
| 20030233276 | Pearlman et al. | Dec 2003 | A1 |
| 20040008635 | Nelson et al. | Jan 2004 | A1 |
| 20040011690 | Marfino et al. | Jan 2004 | A1 |
| 20040044953 | Watkins et al. | Mar 2004 | A1 |
| 20040052349 | Creamer et al. | Mar 2004 | A1 |
| 20040071275 | Bowater et al. | Apr 2004 | A1 |
| 20040101122 | Palma et al. | May 2004 | A1 |
| 20040102182 | Reith et al. | May 2004 | A1 |
| 20040117788 | Karaoguz et al. | Jun 2004 | A1 |
| 20040136324 | Steinberg et al. | Jul 2004 | A1 |
| 20040165569 | Sweatman et al. | Aug 2004 | A1 |
| 20040172482 | Weissman et al. | Sep 2004 | A1 |
| 20040199572 | Hunt et al. | Oct 2004 | A1 |
| 20040205101 | Radhakrishnan | Oct 2004 | A1 |
| 20040205689 | Ellens et al. | Oct 2004 | A1 |
| 20040213400 | Golitsin et al. | Oct 2004 | A1 |
| 20040216058 | Chavers et al. | Oct 2004 | A1 |
| 20040218748 | Fisher | Nov 2004 | A1 |
| 20040228469 | Andrews et al. | Nov 2004 | A1 |
| 20040240649 | Goel | Dec 2004 | A1 |
| 20050005109 | Castaldi et al. | Jan 2005 | A1 |
| 20050005200 | Matena et al. | Jan 2005 | A1 |
| 20050010483 | Ling | Jan 2005 | A1 |
| 20050021626 | Prajapat et al. | Jan 2005 | A1 |
| 20050025303 | Hostetler | Feb 2005 | A1 |
| 20050038772 | Colrain | Feb 2005 | A1 |
| 20050043952 | Sharma et al. | Feb 2005 | A1 |
| 20050047579 | Salame | Mar 2005 | A1 |
| 20050060411 | Coulombe et al. | Mar 2005 | A1 |
| 20050083907 | Fishler | Apr 2005 | A1 |
| 20050091336 | DeHamer et al. | Apr 2005 | A1 |
| 20050091572 | Gavrilescu et al. | Apr 2005 | A1 |
| 20050108770 | Karaoguz et al. | May 2005 | A1 |
| 20050125251 | Berger et al. | Jun 2005 | A1 |
| 20050125739 | Thompson et al. | Jun 2005 | A1 |
| 20050128961 | Miloslavsky et al. | Jun 2005 | A1 |
| 20050135578 | Ress et al. | Jun 2005 | A1 |
| 20050141500 | Bhandari et al. | Jun 2005 | A1 |
| 20050147088 | Bao et al. | Jul 2005 | A1 |
| 20050177635 | Schmidt et al. | Aug 2005 | A1 |
| 20050181835 | Lau et al. | Aug 2005 | A1 |
| 20050198292 | Duursma et al. | Sep 2005 | A1 |
| 20050228680 | Malik | Oct 2005 | A1 |
| 20050238153 | Chevalier | Oct 2005 | A1 |
| 20050240659 | Taylor | Oct 2005 | A1 |
| 20050243977 | Creamer et al. | Nov 2005 | A1 |
| 20050246176 | Creamer et al. | Nov 2005 | A1 |
| 20050289222 | Sahim | Dec 2005 | A1 |
| 20060008065 | Longman et al. | Jan 2006 | A1 |
| 20060008073 | Yoshizawa et al. | Jan 2006 | A1 |
| 20060008256 | Khedouri et al. | Jan 2006 | A1 |
| 20060015467 | Morken et al. | Jan 2006 | A1 |
| 20060021004 | Moran et al. | Jan 2006 | A1 |
| 20060023676 | Whitmore et al. | Feb 2006 | A1 |
| 20060047666 | Bedi et al. | Mar 2006 | A1 |
| 20060067506 | Flockhart et al. | Mar 2006 | A1 |
| 20060098624 | Morgan et al. | May 2006 | A1 |
| 20060129638 | Deakin | Jun 2006 | A1 |
| 20060143007 | Koh et al. | Jun 2006 | A1 |
| 20060146792 | Ramachandran et al. | Jul 2006 | A1 |
| 20060146802 | Baldwin et al. | Jul 2006 | A1 |
| 20060168334 | Potti et al. | Jul 2006 | A1 |
| 20060203979 | Jennings | Sep 2006 | A1 |
| 20060209695 | Archer et al. | Sep 2006 | A1 |
| 20060212865 | Vincent et al. | Sep 2006 | A1 |
| 20060215824 | Mitby et al. | Sep 2006 | A1 |
| 20060217823 | Hussey | Sep 2006 | A1 |
| 20060217978 | Mitby et al. | Sep 2006 | A1 |
| 20060222166 | Ramakrishna et al. | Oct 2006 | A1 |
| 20060256816 | Yarlagadda et al. | Nov 2006 | A1 |
| 20060262915 | Marascio et al. | Nov 2006 | A1 |
| 20060270386 | Yu et al. | Nov 2006 | A1 |
| 20060285489 | Francisco et al. | Dec 2006 | A1 |
| 20070002744 | Mewhinney et al. | Jan 2007 | A1 |
| 20070036143 | Alt et al. | Feb 2007 | A1 |
| 20070038499 | Margulies et al. | Feb 2007 | A1 |
| 20070050306 | McQueen | Mar 2007 | A1 |
| 20070064672 | Raghav et al. | Mar 2007 | A1 |
| 20070070906 | Thakur | Mar 2007 | A1 |
| 20070070980 | Phelps et al. | Mar 2007 | A1 |
| 20070071223 | Lee et al. | Mar 2007 | A1 |
| 20070074174 | Thornton | Mar 2007 | A1 |
| 20070088836 | Tai et al. | Apr 2007 | A1 |
| 20070091907 | Seshadri et al. | Apr 2007 | A1 |
| 20070107048 | Halls et al. | May 2007 | A1 |
| 20070121651 | Casey et al. | May 2007 | A1 |
| 20070127691 | Lert | Jun 2007 | A1 |
| 20070127703 | Siminoff | Jun 2007 | A1 |
| 20070130260 | Weintraub et al. | Jun 2007 | A1 |
| 20070133771 | Stifelman et al. | Jun 2007 | A1 |
| 20070147351 | Dietrich et al. | Jun 2007 | A1 |
| 20070149166 | Turcotte et al. | Jun 2007 | A1 |
| 20070153711 | Dykas et al. | Jul 2007 | A1 |
| 20070167170 | Fitchett et al. | Jul 2007 | A1 |
| 20070192629 | Saito | Aug 2007 | A1 |
| 20070201448 | Baird et al. | Aug 2007 | A1 |
| 20070208862 | Fox et al. | Sep 2007 | A1 |
| 20070232284 | Mason et al. | Oct 2007 | A1 |
| 20070239761 | Baio et al. | Oct 2007 | A1 |
| 20070242626 | Altberg et al. | Oct 2007 | A1 |
| 20070255828 | Paradise | Nov 2007 | A1 |
| 20070265073 | Novi et al. | Nov 2007 | A1 |
| 20070286180 | Marquette et al. | Dec 2007 | A1 |
| 20070291734 | Bhatia et al. | Dec 2007 | A1 |
| 20070291905 | Halliday et al. | Dec 2007 | A1 |
| 20070293200 | Roundtree et al. | Dec 2007 | A1 |
| 20070295803 | Levine et al. | Dec 2007 | A1 |
| 20080005275 | Overton et al. | Jan 2008 | A1 |
| 20080025320 | Bangalore et al. | Jan 2008 | A1 |
| 20080037715 | Prozeniuk et al. | Feb 2008 | A1 |
| 20080037746 | Dufrene et al. | Feb 2008 | A1 |
| 20080040484 | Yardley | Feb 2008 | A1 |
| 20080049617 | Grice et al. | Feb 2008 | A1 |
| 20080052395 | Wright et al. | Feb 2008 | A1 |
| 20080091843 | Kulkarni | Apr 2008 | A1 |
| 20080101571 | Harlow et al. | May 2008 | A1 |
| 20080104348 | Kabzinski et al. | May 2008 | A1 |
| 20080120702 | Hokimoto | May 2008 | A1 |
| 20080123559 | Haviv et al. | May 2008 | A1 |
| 20080134049 | Gupta et al. | Jun 2008 | A1 |
| 20080139166 | Agarwal et al. | Jun 2008 | A1 |
| 20080146268 | Gandhi et al. | Jun 2008 | A1 |
| 20080152101 | Griggs | Jun 2008 | A1 |
| 20080154601 | Stifelman et al. | Jun 2008 | A1 |
| 20080155029 | Helbling et al. | Jun 2008 | A1 |
| 20080162482 | Ahern et al. | Jul 2008 | A1 |
| 20080165708 | Moore et al. | Jul 2008 | A1 |
| 20080172404 | Cohen | Jul 2008 | A1 |
| 20080177883 | Hanai et al. | Jul 2008 | A1 |
| 20080192736 | Jabri et al. | Aug 2008 | A1 |
| 20080201426 | Darcie | Aug 2008 | A1 |
| 20080209050 | Li | Aug 2008 | A1 |
| 20080212945 | Khedouri et al. | Sep 2008 | A1 |
| 20080222656 | Lyman | Sep 2008 | A1 |
| 20080229421 | Hudis et al. | Sep 2008 | A1 |
| 20080232574 | Baluja et al. | Sep 2008 | A1 |
| 20080235230 | Maes | Sep 2008 | A1 |
| 20080256224 | Kaji et al. | Oct 2008 | A1 |
| 20080275741 | Loeffen | Nov 2008 | A1 |
| 20080307436 | Hamilton | Dec 2008 | A1 |
| 20080310599 | Purnadi et al. | Dec 2008 | A1 |
| 20080313318 | Vermeulen et al. | Dec 2008 | A1 |
| 20080316931 | Qiu et al. | Dec 2008 | A1 |
| 20080317222 | Griggs et al. | Dec 2008 | A1 |
| 20080317232 | Couse et al. | Dec 2008 | A1 |
| 20080317233 | Rey et al. | Dec 2008 | A1 |
| 20090046838 | Andreasson | Feb 2009 | A1 |
| 20090052437 | Taylor et al. | Feb 2009 | A1 |
| 20090052641 | Taylor et al. | Feb 2009 | A1 |
| 20090059894 | Jackson et al. | Mar 2009 | A1 |
| 20090063502 | Coimbatore et al. | Mar 2009 | A1 |
| 20090074159 | Goldfarb et al. | Mar 2009 | A1 |
| 20090075684 | Cheng et al. | Mar 2009 | A1 |
| 20090083155 | Tudor et al. | Mar 2009 | A1 |
| 20090089165 | Sweeney | Apr 2009 | A1 |
| 20090089352 | Davis et al. | Apr 2009 | A1 |
| 20090089699 | Saha et al. | Apr 2009 | A1 |
| 20090093250 | Jackson et al. | Apr 2009 | A1 |
| 20090125608 | Werth et al. | May 2009 | A1 |
| 20090129573 | Gavan et al. | May 2009 | A1 |
| 20090136011 | Goel | May 2009 | A1 |
| 20090170496 | Bourque | Jul 2009 | A1 |
| 20090171659 | Pearce et al. | Jul 2009 | A1 |
| 20090171669 | Engelsma et al. | Jul 2009 | A1 |
| 20090171752 | Galvin et al. | Jul 2009 | A1 |
| 20090182896 | Patterson et al. | Jul 2009 | A1 |
| 20090193433 | Maes | Jul 2009 | A1 |
| 20090217293 | Wolber et al. | Aug 2009 | A1 |
| 20090220057 | Waters | Sep 2009 | A1 |
| 20090221310 | Chen et al. | Sep 2009 | A1 |
| 20090222341 | Belwadi et al. | Sep 2009 | A1 |
| 20090225748 | Taylor | Sep 2009 | A1 |
| 20090225763 | Forsberg et al. | Sep 2009 | A1 |
| 20090228868 | Drukman et al. | Sep 2009 | A1 |
| 20090232289 | Drucker et al. | Sep 2009 | A1 |
| 20090234965 | Viveganandhan et al. | Sep 2009 | A1 |
| 20090235349 | Lai et al. | Sep 2009 | A1 |
| 20090241135 | Wong et al. | Sep 2009 | A1 |
| 20090252159 | Lawson et al. | Oct 2009 | A1 |
| 20090276771 | Nickolov et al. | Nov 2009 | A1 |
| 20090288012 | Hertel et al. | Nov 2009 | A1 |
| 20090288165 | Qiu et al. | Nov 2009 | A1 |
| 20090300194 | Ogasawara | Dec 2009 | A1 |
| 20090316687 | Kruppa | Dec 2009 | A1 |
| 20090318112 | Vasten | Dec 2009 | A1 |
| 20100027531 | Kurashima | Feb 2010 | A1 |
| 20100037204 | Lin et al. | Feb 2010 | A1 |
| 20100054142 | Moiso et al. | Mar 2010 | A1 |
| 20100070424 | Monk | Mar 2010 | A1 |
| 20100071053 | Ansari et al. | Mar 2010 | A1 |
| 20100082513 | Liu | Apr 2010 | A1 |
| 20100087215 | Gu et al. | Apr 2010 | A1 |
| 20100088187 | Courtney et al. | Apr 2010 | A1 |
| 20100088698 | Krishnamurthy | Apr 2010 | A1 |
| 20100094758 | Chamberlain et al. | Apr 2010 | A1 |
| 20100103845 | Ulupinar et al. | Apr 2010 | A1 |
| 20100115041 | Hawkins et al. | May 2010 | A1 |
| 20100138501 | Clinton et al. | Jun 2010 | A1 |
| 20100142516 | Lawson et al. | Jun 2010 | A1 |
| 20100150139 | Lawson et al. | Jun 2010 | A1 |
| 20100167689 | Sepehri-Nik et al. | Jul 2010 | A1 |
| 20100188979 | Thubert et al. | Jul 2010 | A1 |
| 20100191915 | Spencer | Jul 2010 | A1 |
| 20100208881 | Kawamura | Aug 2010 | A1 |
| 20100217837 | Ansari et al. | Aug 2010 | A1 |
| 20100217982 | Brown et al. | Aug 2010 | A1 |
| 20100232594 | Lawson et al. | Sep 2010 | A1 |
| 20100235539 | Carter et al. | Sep 2010 | A1 |
| 20100250946 | Korte et al. | Sep 2010 | A1 |
| 20100251329 | Wei | Sep 2010 | A1 |
| 20100251340 | Martin et al. | Sep 2010 | A1 |
| 20100265825 | Blair et al. | Oct 2010 | A1 |
| 20100281108 | Cohen | Nov 2010 | A1 |
| 20100291910 | Sanding et al. | Nov 2010 | A1 |
| 20100312919 | Lee et al. | Dec 2010 | A1 |
| 20100332852 | Vembu et al. | Dec 2010 | A1 |
| 20110026516 | Roberts et al. | Feb 2011 | A1 |
| 20110029882 | Jaisinghani | Feb 2011 | A1 |
| 20110029981 | Jaisinghani | Feb 2011 | A1 |
| 20110053555 | Cai et al. | Mar 2011 | A1 |
| 20110078278 | Cui et al. | Mar 2011 | A1 |
| 20110081008 | Lawson et al. | Apr 2011 | A1 |
| 20110083069 | Paul et al. | Apr 2011 | A1 |
| 20110083179 | Lawson et al. | Apr 2011 | A1 |
| 20110093516 | Geng et al. | Apr 2011 | A1 |
| 20110096673 | Stevenson et al. | Apr 2011 | A1 |
| 20110110366 | Moore et al. | May 2011 | A1 |
| 20110131293 | Mori | Jun 2011 | A1 |
| 20110143714 | Keast et al. | Jun 2011 | A1 |
| 20110145049 | Udo et al. | Jun 2011 | A1 |
| 20110149810 | Koren et al. | Jun 2011 | A1 |
| 20110149950 | Petit-Huguenin et al. | Jun 2011 | A1 |
| 20110151884 | Zhao | Jun 2011 | A1 |
| 20110167172 | Roach et al. | Jul 2011 | A1 |
| 20110170505 | Rajasekar et al. | Jul 2011 | A1 |
| 20110176537 | Lawson et al. | Jul 2011 | A1 |
| 20110211679 | Mezhibovsky et al. | Sep 2011 | A1 |
| 20110251921 | Kassaei et al. | Oct 2011 | A1 |
| 20110253693 | Lyons et al. | Oct 2011 | A1 |
| 20110255675 | Jasper et al. | Oct 2011 | A1 |
| 20110258432 | Rao et al. | Oct 2011 | A1 |
| 20110265168 | Lucovsky et al. | Oct 2011 | A1 |
| 20110265172 | Sharma et al. | Oct 2011 | A1 |
| 20110267985 | Wilkinson et al. | Nov 2011 | A1 |
| 20110274111 | Narasappa et al. | Nov 2011 | A1 |
| 20110276892 | Jensen-Horne et al. | Nov 2011 | A1 |
| 20110276951 | Jain | Nov 2011 | A1 |
| 20110280390 | Lawson et al. | Nov 2011 | A1 |
| 20110283259 | Lawson et al. | Nov 2011 | A1 |
| 20110289126 | Aikas Erkki et al. | Nov 2011 | A1 |
| 20110299672 | Chiu et al. | Dec 2011 | A1 |
| 20110310902 | Xu | Dec 2011 | A1 |
| 20110313950 | Nuggehalli et al. | Dec 2011 | A1 |
| 20110320449 | Gudlavenkatasiva | Dec 2011 | A1 |
| 20110320550 | Lawson et al. | Dec 2011 | A1 |
| 20120000903 | Baarman et al. | Jan 2012 | A1 |
| 20120011274 | Moreman | Jan 2012 | A1 |
| 20120017222 | May | Jan 2012 | A1 |
| 20120023531 | Meuninck et al. | Jan 2012 | A1 |
| 20120023544 | Li et al. | Jan 2012 | A1 |
| 20120027228 | Rijken et al. | Feb 2012 | A1 |
| 20120028602 | Lisi et al. | Feb 2012 | A1 |
| 20120036574 | Heithcock et al. | Feb 2012 | A1 |
| 20120039202 | Song | Feb 2012 | A1 |
| 20120059709 | Lieberman et al. | Mar 2012 | A1 |
| 20120079066 | Li et al. | Mar 2012 | A1 |
| 20120083266 | VanSwol et al. | Apr 2012 | A1 |
| 20120089572 | Raichstein et al. | Apr 2012 | A1 |
| 20120094637 | Jeyaseelan et al. | Apr 2012 | A1 |
| 20120110564 | Ran et al. | May 2012 | A1 |
| 20120114112 | Rauschenberger et al. | May 2012 | A1 |
| 20120149404 | Beattie et al. | Jun 2012 | A1 |
| 20120166488 | Kaushik et al. | Jun 2012 | A1 |
| 20120170726 | Schwartz | Jul 2012 | A1 |
| 20120173610 | Bleau et al. | Jul 2012 | A1 |
| 20120174095 | Natchadalingam et al. | Jul 2012 | A1 |
| 20120179907 | Byrd et al. | Jul 2012 | A1 |
| 20120180021 | Byrd et al. | Jul 2012 | A1 |
| 20120180029 | Hill et al. | Jul 2012 | A1 |
| 20120198004 | Watte | Aug 2012 | A1 |
| 20120201238 | Lawson et al. | Aug 2012 | A1 |
| 20120208495 | Lawson et al. | Aug 2012 | A1 |
| 20120221603 | Kothule et al. | Aug 2012 | A1 |
| 20120226579 | Ha et al. | Sep 2012 | A1 |
| 20120239757 | Firstenberg et al. | Sep 2012 | A1 |
| 20120240226 | Li | Sep 2012 | A1 |
| 20120246273 | Bornstein et al. | Sep 2012 | A1 |
| 20120254828 | Aiylam et al. | Oct 2012 | A1 |
| 20120281536 | Gell et al. | Nov 2012 | A1 |
| 20120288082 | Segall | Nov 2012 | A1 |
| 20120290706 | Lin et al. | Nov 2012 | A1 |
| 20120304245 | Lawson et al. | Nov 2012 | A1 |
| 20120304275 | Ji et al. | Nov 2012 | A1 |
| 20120316809 | Egolf et al. | Dec 2012 | A1 |
| 20120321058 | Eng et al. | Dec 2012 | A1 |
| 20120321070 | Smith et al. | Dec 2012 | A1 |
| 20130029629 | Lindholm et al. | Jan 2013 | A1 |
| 20130031158 | Salsburg | Jan 2013 | A1 |
| 20130036476 | Roever et al. | Feb 2013 | A1 |
| 20130047232 | Tuchman et al. | Feb 2013 | A1 |
| 20130054684 | Brazier et al. | Feb 2013 | A1 |
| 20130058262 | Parreira | Mar 2013 | A1 |
| 20130067232 | Cheung et al. | Mar 2013 | A1 |
| 20130067448 | Sannidhanam et al. | Mar 2013 | A1 |
| 20130097298 | Ting et al. | Apr 2013 | A1 |
| 20130132573 | Lindblom | May 2013 | A1 |
| 20130139148 | Berg et al. | May 2013 | A1 |
| 20130156024 | Burg | Jun 2013 | A1 |
| 20130179942 | Caplis et al. | Jul 2013 | A1 |
| 20130201909 | Bosch et al. | Aug 2013 | A1 |
| 20130204786 | Mattes et al. | Aug 2013 | A1 |
| 20130212603 | Cooke et al. | Aug 2013 | A1 |
| 20130244632 | Spence et al. | Sep 2013 | A1 |
| 20130325934 | Fausak et al. | Dec 2013 | A1 |
| 20130328997 | Desai | Dec 2013 | A1 |
| 20130336472 | Fahlgren et al. | Dec 2013 | A1 |
| 20140058806 | Guenette et al. | Feb 2014 | A1 |
| 20140064467 | Lawson et al. | Mar 2014 | A1 |
| 20140072115 | Makagon et al. | Mar 2014 | A1 |
| 20140101058 | Castel et al. | Apr 2014 | A1 |
| 20140105372 | Nowack et al. | Apr 2014 | A1 |
| 20140106704 | Cooke et al. | Apr 2014 | A1 |
| 20140122600 | Kim et al. | May 2014 | A1 |
| 20140123187 | Reisman | May 2014 | A1 |
| 20140126715 | Lum et al. | May 2014 | A1 |
| 20140129363 | Lorah et al. | May 2014 | A1 |
| 20140153565 | Lawson et al. | Jun 2014 | A1 |
| 20140185490 | Holm et al. | Jul 2014 | A1 |
| 20140254600 | Shibata et al. | Sep 2014 | A1 |
| 20140258481 | Lundell | Sep 2014 | A1 |
| 20140269333 | Boerjesson | Sep 2014 | A1 |
| 20140274086 | Boerjesson et al. | Sep 2014 | A1 |
| 20140282473 | Saraf et al. | Sep 2014 | A1 |
| 20140289391 | Balaji et al. | Sep 2014 | A1 |
| 20140304054 | Orun et al. | Oct 2014 | A1 |
| 20140355600 | Lawson et al. | Dec 2014 | A1 |
| 20140372508 | Fausak et al. | Dec 2014 | A1 |
| 20140372509 | Fausak et al. | Dec 2014 | A1 |
| 20140372510 | Fausak et al. | Dec 2014 | A1 |
| 20140373098 | Fausak et al. | Dec 2014 | A1 |
| 20140379670 | Kuhr | Dec 2014 | A1 |
| 20150004932 | Kim et al. | Jan 2015 | A1 |
| 20150004933 | Kim et al. | Jan 2015 | A1 |
| 20150023251 | Giakoumelis et al. | Jan 2015 | A1 |
| 20150026477 | Malatack et al. | Jan 2015 | A1 |
| 20150066865 | Yara et al. | Mar 2015 | A1 |
| 20150081918 | Nowack et al. | Mar 2015 | A1 |
| 20150082378 | Collison | Mar 2015 | A1 |
| 20150100634 | He et al. | Apr 2015 | A1 |
| 20150119050 | Liao et al. | Apr 2015 | A1 |
| 20150181631 | Lee et al. | Jun 2015 | A1 |
| 20150236905 | Bellan et al. | Aug 2015 | A1 |
| 20150281294 | Nur et al. | Oct 2015 | A1 |
| 20150365480 | Soto et al. | Dec 2015 | A1 |
| 20160112475 | Lawson et al. | Apr 2016 | A1 |
| 20160112521 | Lawson et al. | Apr 2016 | A1 |
| 20160119291 | Zollinger et al. | Apr 2016 | A1 |
| 20160127254 | Kumar et al. | May 2016 | A1 |
| 20160149956 | Birnbaum et al. | May 2016 | A1 |
| 20160205519 | Patel et al. | Jul 2016 | A1 |
| 20160226937 | Patel et al. | Aug 2016 | A1 |
| 20160226979 | Lancaster et al. | Aug 2016 | A1 |
| 20160239770 | Batabyal et al. | Aug 2016 | A1 |
| Number | Date | Country |
|---|---|---|
| 1684587 | Mar 1971 | DE |
| 0282126 | Sep 1988 | EP |
| 1464418 | Oct 2004 | EP |
| 1522922 | Apr 2005 | EP |
| 1770586 | Apr 2007 | EP |
| 2053869 | Apr 2009 | EP |
| 2134107 | Sep 1999 | ES |
| 10294788 | Apr 1998 | JP |
| 2004166000 | Jun 2004 | JP |
| 2004220118 | Aug 2004 | JP |
| 2006319914 | Nov 2006 | JP |
| 9732448 | Sep 1997 | WO |
| 02087804 | Nov 2002 | WO |
| 2006037492 | Apr 2006 | WO |
| 2009018489 | Feb 2009 | WO |
| 2009124223 | Oct 2009 | WO |
| 2010037064 | Apr 2010 | WO |
| 2010040010 | Apr 2010 | WO |
| 2010101935 | Sep 2010 | WO |
| 2011091085 | Jul 2011 | WO |
| Entry |
|---|
| “Ethernet to Token ring Bridge”—Black Box Corporation, Oct. 1999 http://blackboxcanada.com/resource/files/productdetails/17044.pdf. |
| Complaint for Patent Infringement, Telinit Technologies, LLC v. Twilio Inc., dated Oct. 12, 2012. |
| Kim et al. “In-service Feedback QoE Framework” 2010 Third International Conference on Communication Theory. Reliability and Quality of Service. pp. 135-138. 2010. |
| Matos et al. “Quality of Experience-based Routing in Multi-Service Wireless Mesh Networks” Realizing Advanced Video Optimized Wireless Networks. IEEE. pp. 7060-7065. 2012. |
| NPL, “API Monetization Platform”, 2013. |
| RFC 3986: Uniform Resource Identifier (URI): Generic Syntax; T. Bemers-Lee, R. Fielding, L. Masinter; Jan. 2005; The Internet Society. |
| S. barakovic and L. Skorin-Kapov. “Survey and Challenges of QoE Management Issues in Wireless Networks”. 2012, pp. 1-29. |
| Subramanya, et al. “Digital Signatures”, IEEE Potentials, Mar./Apr. 2006, pp. 5-8. |
| Tran et al. “User to User adaptive routing based on QoE” ICNS 2011: The Seventh International Conference on Networking and Services. pp. 170-177. 2011. |
| Nu et al. “Quality Evaluation in Peer-to-Peer IPTV Services” Data Traffic and Monitoring Analysis, LNCS 7754. pp. 302-319. 2013. |
| Abu-Lebdeh et al. “A 3GPP Evolved Packet Core-Based Architecture for QoS-Enabled Mobile Video Surveillance Applications”. 2012 Third International Conference on the Network of the Future (NOF). Nov. 21-23, 2012. pp. 1-6. |
| Archive Microsoft Office 365 Email | Retain Unified Archiving, 2015, GWAVA, Inc., Montreal, Canada. <http://www.gwava.com/Retain/Retain—for—Office—365.php>. |
| Twilio Cloud Communications—APIs for Voice, VoIP, and Text Messaging, Twilio. <http://www.twilio.com/docs/api/rest/call-feedback>, Apr. 12, 2016. |
| Number | Date | Country | |
|---|---|---|---|
| 20160269564 A1 | Sep 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61156758 | Mar 2009 | US | |
| 61249493 | Oct 2009 | US | |
| 61296270 | Jan 2010 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14626427 | Feb 2015 | US |
| Child | 15097206 | US | |
| Parent | 14158281 | Jan 2014 | US |
| Child | 14626427 | US | |
| Parent | 13632872 | Oct 2012 | US |
| Child | 14158281 | US | |
| Parent | 12716127 | Mar 2010 | US |
| Child | 13632872 | US |
