The subject matter of this disclosure relates in general to the field of web conferencing, and more specifically to techniques for a web conferencing operator to mitigate distributed denial of service (DDOS) attacks.
Web conferencing is a technology that facilitates the distribution of real-time multimedia flows between electronic devices over the Internet or other wide-area network (WAN). The distributed multimedia may include audio, video, Short Message Service (SMS) or instant messenger text, and other digital content (e.g., word processing documents, spreadsheets, powerpoints, web browser content, whiteboard content, polls, surveys, etc.). Users may access a web conferencing platform offered by a software-as-a-service (SaaS) provider off-premises and/or supported by an enterprise data center operating the platform on-premises. Web conferencing can allow users from almost anywhere in the world to collaborate with one another in various ways, such as to conduct business meetings and seminars, lead presentations, provide online education, and offer direct customer support, among other possibilities. While expanding the ways that users can collaborate with one another offers obvious benefits, providing greater accessibility can also render a web conferencing operator's network more susceptible to certain vulnerabilities.
Overview
Various aspects of the subject technology relate to minimize the effects of DDoS attacks. A system may be configured to acquire one-time password (OTP) data for validating one or more connectivity checks for establishing a media session with a media distribution device (MDD). The OTP data may include a sequencing function. A set of passkeys may be determined by applying the sequencing function to a seed value to acquire a first passkey and successively applying the sequencing function to a latest passkey to acquire one or more additional passkeys. The system may receive a request that includes a sequence value and a passkey. The request is for a connectivity check from an endpoint external to the web conferencing network for establishing the media session with the MDD. The system may validate the username based at least in part by applying the sequencing function to the sequence value to acquire a computed value and comparing the computed value to the passkey.
A web conferencing operator allows participants to share multimedia content in real-time despite one or more participants operating from behind a middlebox (e.g., a network address translator (NAT), a firewall, and/or other middlebox(es) that may block traffic) via NAT traversal protocols and tools (e.g., Session Traversal Utilities for NAT (STUN), Traversal Using Relays around NAT (TURN), Interactive Connectivity Establishment (ICE)). In NAT traversal, participants can share a set of transport addresses that the participants may use to establish a joint media session. However, connectivity checks performed during NAT traversal can expose a device for the media session hosted by the web conferencing operator (referred to as a media distribution device (MDD)) to various vulnerabilities, such as distributed denial of service (DDoS) attacks.
A web conferencing operator can minimize the effects of DDoS attacks during connectivity checks at scale and without significant performance degradation by configuring a middlebox to validate the connectivity checks without persistent signaling between the web conferencing operator and the middlebox. In some embodiments, the middlebox can validate an incoming request for a connectivity check on the basis of the username in the request (e.g., a STUN request) based on a one-time password (OTP) scheme, such as the Lamport OTP algorithm. The web conferencing operator can generate a sequencing algorithm F and initial seed value S0 to share with the middlebox for authenticating connectivity checks for a specified number of requests n (or a specified period of time t based on a function T of the average number of requests received per unit of time u). The middlebox can generate a set of passkeys or passkey “cache” for the specified sequence length
In some embodiments, the middlebox can validate an incoming request for a connectivity check on the basis of the message integrity of the request. For example, the web conference operator and the middlebox can negotiate between themselves a secret key, key identifier, counter, and cryptographic hash function (e.g., keyed-hash message authentication code (HMAC)-MDS, HMAC-SHA-1, HMAC-SHA-2, or other suitable HMAC algorithm). The web conference operator can use the key identifier for key management. The web conference operator can create a short-term credential (i.e., username and password) for each participant. The web conference operator can compute the password by applying the secret key, key identifier, counter, and other data to the cryptographic hash function.
The web conference operator can derive the first portion of the username as discussed above, and concatenate the key identifier, counter, and a current timestamp to the first portion of the username. The middlebox can inspect each incoming request for a connectivity check, and use the counter and current timestamp in the username to calculate the password and validate the message integrity of the request. This can also help the middlebox to detect and block replay attacks.
In some embodiments, if a DDoS attack comprising invalid requests for connectivity checks grows beyond the capacity of the middlebox, then the middlebox can operate as a DDoS Open Threat Signaling (DOTS) client and signal a DOTS server (e.g., a third party provider of DDoS mitigation as a service) to take over DDoS mitigation. The middlebox can pass the values and algorithms negotiated with the web conference operator discussed above to the DOTS server, and the DOTS server can handle DDoS mitigation until the number of incoming requests for connectivity checks returns to a volume manageable by the middlebox (or a specified time thereafter to account for secondary DDoS attacks).
Participants 102 can use various types of electronic devices or endpoints to interact with web conferencing network 104, including analog endpoints (e.g., fax machines, modems, telecommunication devices for the deaf (TDDs), teletypewriters (TTYs), analog phones, etc.); enterprise desk phones; video endpoints (e.g., instant messaging clients like Cisco Jabber® provided by Cisco Systems®, Inc. of San Jose, Calif., IP phones with built-in video cameras, telepresence systems, etc.); software-based endpoints or software applications that provide voice and video services (e.g., Cisco® IP Communicator, Cisco Jabber® desktop clients, Cisco Spark™ desktop clients, Cisco UC Integration™, etc.) for personal computing devices (e.g., workstations, desktops, laptops, etc.); and mobile endpoints (e.g., Cisco Jabber® mobile clients, Cisco Spark™ mobile clients (e.g., smartphones, tablets, wearable devices, etc.), Cisco WebEx® Meetings, AnyConnect® Secure mobile clients from Cisco®, etc.). In this example, web participants 102A connect to web conferencing network 104 over a public wide-area network (WAN) (e.g., Internet 106), and enterprise participants 102B connect to web conferencing network 104 from an enterprise network (e.g., private network 108) through network infrastructure 107 and Internet 106. Web conferencing network 104 can also be a participant as it can effectively operate as a hub for conferences.
Web conferencing network 104 is generally a system that enables users (i.e., enterprises or other organizations, individual persons, etc.) in different physical locations to share digital content in real-time (i.e., in a manner with imperceptible delay or a negligible amount of delay with respect to an average person). Web conferencing network 104 can be part of the computing infrastructure of a service provider that offers web conferencing software as a service (SaaS) or part of an enterprise data center that supports web conferencing on-premises. Web conferencing network 104 can support at least voice and video conferencing. In some embodiments, web conferencing network 104 may also support multimedia sharing; analog or digital audio and voice over IP (VoIP) integration; conference recording, editing, and playback; polls and surveys; annotation; virtual whiteboards; and other collaboration functionality. Examples of web conferencing platforms include Cisco WebEx® and Cisco Spark™.
In this example, web conferencing network 104 includes web zone 110 and meeting zone 120. Web zone 110 can generally be responsible for tasks that happen before and after a web conference, such as scheduling, user management, billing, reporting, and streaming recordings, etc. Web zone 110 can include one or more conference servers 112 for coordinating these various pre-conference and post-conference operations. Conference servers 112 can also handle signaling over communication channel 114 (i.e., signaling channel 114) using signaling protocols/mechanisms such as Session Initiation Protocol (SIP), H.323, Skinny Call Control Protocol (SCCP), Extensible Messaging and Presence Protocol (XMPP), Representational State Transfer (REST), and/or other suitable signaling techniques. Participants 102 can join web conferences by first connecting to conference servers 112. Conference servers 112 ensure that participants can establish connectivity and participate in a conference. To maintain the data to perform these various functions, web zone 110 can include conference data storage 116 for storing scheduling, user, billing, reporting, and other data and recording storage 118 for storing web conference recordings (i.e., audio, video, and other digital content shared during a conference).
Meeting zone 120 can generally be responsible for web conference switching once a web conference is in progress. Meeting zone 120 can include one or more audio/video (A/V) devices 122A . . . 122N (collectively, “122”) and one or more collaboration bridges 124A . . . 124N (collectively, “124”). A/V devices 122 can perform audio and video packet processing operations such as A/V packet mixing, switching, encoding, decoding, and transcoding. A/V devices 122 can exchange A/V content with participants 102 over communication channel 126 (i.e., A/V channel 126). Collaboration bridges 124 can switch other content shared during a conference (i.e., content other than A/V content of a web conference), such as data sent as part of a file sharing operation (including music, movies, animations, etc.), a chat operation, a virtual white board application, and other digital content. Collaboration bridges 124 can exchange this type of conference traffic over communication channel 128 (i.e., conference traffic channel 128).
Middleboxes 230 are physical or virtual network appliances that transform, inspect, filter, or otherwise manipulate traffic for purposes other than packet forwarding, and can include network address translators (NATs), firewalls, DDoS mitigators, load balancers, intrusion prevent systems (IPSs), intrusion detection systems (IDSs), WAN optimizers, etc. A middlebox can be a physical network device that performs one or more networking functions. A middlebox can also be a virtual device (e.g., virtual machine (VM), container, or other virtual partition) that performs one or more network services in a service chain.
In this example, participant 202 is behind middlebox 230B, which can operate as a NAT, firewall, or other network device that blocks incoming traffic to participant 202. This type of deployment may prevent web conferencing network 204 from reaching participant 202 if web conferencing network 204 only knew the local interface address of participant 202. Indeed, offer/answer protocols such as SIP can be difficult to operate through NATs, firewalls, and the like. A purpose of such protocols is to establish a flow of media packets, and offer/answer protocols often specify that the network addresses and ports of media sources and destinations reside within their messages. As known to one of ordinary skill, it is generally bad practice to modify the payload of packets, and thus administrators disfavor approaches for enabling communication between endpoints separated by NAT/firewall by altering network addresses and ports contained within the data portion of messages. Offer/answer protocols may also seek to create a direct media flow between participants such that there is no application layer intermediary between them. The intent of such design is to reduce media latency, decrease packet loss, and reduce the operational costs of deploying the application. However, as a skilled artisan knows, this can be difficult to accomplish through NATs/firewalls. An approach for establishing media sessions between endpoints when one or more the endpoints operate from behind NATs/firewalls is to implement a NAT traversal protocol such as Interactive Connectivity Establishment (ICE), as defined in Request for Comments (RFC) 5245 by the Internet Engineering Task Force (IETF).
In ICE, each participant can potentially have a variety of candidate transport addresses (i.e., a combination of network address (e.g., Internet Protocol (IP) address, uniform resource locator (URL), or other identifier) and port for a particular transport protocol (e.g., User Datagram Protocol (UDP), Transmission Control Protocol (TCP), etc.)) for establishing a media session. The candidate transport addresses can include transport addresses on directly attached network interfaces of the endpoints (e.g., candidate 240), translated transport addresses on the public side of a NAT (referred to as a server reflexive addresses) (e.g., candidate 242), and transport addresses allocated from a server supporting the Traversal Using Relay NAT (TURN) protocol (referred to as a relayed address) (e.g., candidate 244). Potentially any of the candidate transport addresses of participant 202 may connect with the candidate transport addresses of web conferencing network 204. In practice, however, many combinations will not work. For example, as participant 202 is behind NAT/firewall 230B, its directly attached interface address(es) is/are unlikely to be able to communicate directly with web conferencing network 204. ICE can discover which pairs of addresses may work for sharing media by systematically trying all possible pairs in a sorted order until one or more pairs work.
ICE can include multiple phases, including a candidates gathering phase, an exchange of candidates phase, a connectivity checks phase, and a final exchange phase. In the candidates gathering phase, each participant can determine its candidate transport addresses. In some embodiments, participants can gather candidates even before initiating a media session. In this example, participant 202 can acquire its server reflexive and relayed candidate transport addresses by sending Session Traversal Utilities for NAT (STUN) (defined in RFC 5389) and/or TURN (defined in RFC 5766) requests to STUN/TURN server 232 and receiving STUN/TURN responses from STUN/TURN server 232 over communication channel 250. Although
In the exchange of candidates phase, each participant can order its candidates from highest to lowest priority. For example, participant 202 (i.e., the caller) can initiate a media session by sending an offer), such as a Session Description Protocol (SDP) offer in an SIP INVITE, to conference server 212 (i.e., the callee) over signaling channel 214. The offer can include information for each candidate transport address (e.g., network address and port, component identifier, foundation, transport protocol, priority, type, related address, etc.), a username fragment, and password. Conference server 212 can send an SDP answer including similar information as the offer (but specific to web conferencing network 204). In this example, conference server 212 may send an SDP answer including transport address information for MDD 226.
In the connectivity checks phase, each participant pairs up its candidates (referred to as local candidates) with the other participants' candidates (referred to as remote candidates) to form candidate pairs. Each participant can send a connectivity check in pair priority order (i.e., a binding request from the local candidate to the remote candidate). Each participant can send a response to a request for a connectivity check that includes a mapped address indicating the source network address and port seen in the request to signal that connectivity has succeeded.
In some embodiments, participants can authenticate and protect the integrity of the connectivity checks based on the usernames and passwords exchanged during the SDP offer and answer. Each participant can construct the username by combining username fragments exchanged in the offer and answer (separated by a colon), and exchanging the passwords from the offer and answer. For example, if participant 202 sends an SDP offer with username fragment “UF_A” and password “PASS_A” and web conferencing network 204 sends the SDP answer with username fragment “UF_B” and password “PASS_B,” then participant 202 must send a request for a connectivity check that includes username “UF_B:UF_A” and password “PASS_B” and web conferencing network 204 must send a request for a connectivity check that includes username “UF_A:UF_B” and password “PASS_A.”
In the final exchange phase, one participant operates as the controlling agent (typically the offeror) and the other participant operates as the controlled agent. The controlling agent is responsible for deciding when connectivity checks should finish and deciding which pairs to use for the session thereafter, such as by sending a request for a connectivity check that includes a flag indicating an end to the connectivity checks and for participants to use the candidate pair generated by the connectivity check that included the flag. Media can flow in each direction once the controlling agent has selected the candidate pairs for each component. In this example, participant 202 and MDD 226 successfully complete connectivity checks and establish a media session over communication channel 252.
ICE also supports a mode referred to as ICE Lite for endpoints that always have public IP addresses (e.g., public switched telephone network (PSTN) gateways, media servers, conference servers, etc.). A participant signals that it is “Lite” in an offer or an answer and has a single candidate transport address (i.e., its host IP address), and such a participant may only need to receive a request for a connectivity check and send a response, process offers and answers, and use the candidate pair based on a flagged connectivity check.
As discussed, the connectivity checks phase can open MDD 226 up to various attacks, including distributed denial of service (DDOS) attacks. Conventional security middleboxes such as DDoS mitigators, intrusion detection systems (IDSs), intrusion prevention systems (IPSs), and similar network appliances may struggle to protect against DDoS attacks at the connectivity checks phase because the middleboxes cannot determine the legitimacy of connectivity check messages. For example, there is no way for middlebox 230A to verify the integrity of connectivity check requests from participant 202 because middlebox 230A was not involved in initiation of the media session when participant 202 and conference server 212 exchanged credentials. It may also be impractical for middlebox 230A to request credentials from conference server 212 for each request for a connectivity check and/or for conference server 212 to continuously push the credentials because of the additional processing, bandwidth, and other computing resources expended to implement such a strategy. In addition, there may be difficulties in associating incoming requests for connectivity checks with the correct participants, handling situations in which participants may receive credentials for a conference but do not actually participate in the conference, participants jumping in and out of conferences, and other similar situations. Any solutions to these problems must also address scale as requests for connectivity checks can number in the thousands or millions in certain embodiments.
Systems and methods in accordance with various embodiments of the present disclosure may overcome one or more of the foregoing or other deficiencies experienced in conventional approaches for DDoS mitigation during connectivity checks for NAT traversal. In various embodiments, a web conferencing operator can configure a middlebox (e.g., NAT, firewall, DDoS mitigator, IDS, IPS, or other network appliance) to verify incoming requests for connectivity checks without persistent signaling between the web conference server and the middlebox. In some embodiments, the middlebox can validate an incoming request for a connectivity check on the basis of the username in the request. In some embodiments, the middlebox can validate an incoming request for a connectivity check on the basis of message integrity of the request.
The process can begin at 302 with conference server 212 implementing a one-time password (OTP) scheme to share with middlebox 230A to mitigate DDoS attacks. For example, conference server 212 can use the Lamport OTP algorithm, which involves generating a sequence of “passkey” values in which each successor value Sn is based on the value of its predecessor Sn−1. In the Lamport OTP scheme, the client/server agree to use a common sequencing algorithm to generate a set of expiring one-time passwords (on the client side), and validate client-provided passkeys included in each client-initiated request (on the server side). The client can generate a finite sequence of values starting with a “seed” value, and each successor value is generated by applying a transforming function F to the previous sequence value:
S0=Seed,S1=F(S0),S2=F(S1), . . . ,Sn=F(Sn−1) (Equation 1)
The particular transforming function can be simple or complex so long as it produces the same result for a given value, i.e., applying the function F to the sequence value Sm always generates the same successor sequence value Sm+1. For example, if the client wants to create a sequence of 10 values, starting with a seed value of 0, and the transforming function adds 3 to the value it's given (i.e., F(S)=S+3), then the resulting sequence (i.e., set of passkeys or passkey “cache”) includes 0, 3, 6, 9, 12, 15, 18, 21, 24, and 27. The client/server can manage the sequence as a traditional last-in, first-out (LIFO) stack or other agreed-upon strategy (e.g., first-in, first-out, random, etc.). The client can consume sequence values one by one, and the server can eliminate consumed sequence values from the set of passkeys. For every client/server interaction, the client can include a client-identifier and one of the generated sequence values (i.e., the passkey) in a message. The server can validate the message by verifying that the particular client's passkey cache includes the provided passkey.
In some embodiments, conference server 212 can implement a variation of the Lamport OTP algorithm. For example, conference server 212 can generate a sequencing algorithm F and initial seed value S0 to share with middlebox 230A, such as at 304 via a secure REST API. In other embodiments, conference server 212 can send the REST API request for middlebox 230A to generate F and S0 and pass them back to conference server 212, such as via REST API response 308. In either case, at 306, middlebox 230A can generate a sequence of passkeys (i.e., passkey cache) by applying the sequencing algorithm F to S0 to acquire the first passkey, and then applying the sequencing algorithm F to resulting passkeys for a specified number of requests n (or a specified period of time t based on a function T of the average number of requests received per unit of time u) to acquire additional passkeys.
In this example, participant 202 has previously acquired its candidate addresses (e.g., by sending STUN/TURN requests to STUN/TURN server 232 for middlebox 230B to bind reflexive and/or relayed candidates). In some embodiments, participant 202 can also perform tasks such as sending keep-alive requests for one or more candidates, prioritizing candidates (e.g., in accordance with RFC 5245 § 4.1.2.1), eliminating one or more redundant candidates, and selecting a default candidate. At 310, participant 202 can send an offer (e.g., an SDP offer in an SIP INVITE) to conference server 212 representing a request to establish a media session and participate in a web conference. The offer can include information for each transport candidate, such as a network address for the candidate, port, transport protocol, priority, foundation, component identifier, type, and related transport addresses. The offer can also include a username fragment and password. Table 1 sets forth an example of an SDP message with ICE attributes.
In a full ICE implementation, upon receiving the offer, a callee may perform tasks such as checking if the caller supports ICE, determining its role (i.e., controlling agent or controlled agent), gathering its transport candidates, prioritizing the candidates, choosing default candidates, forming connectivity check lists, scheduling checks, etc. However, in this example, conference server 212 has a public network address, and MDD 226 may have a public network address or conference server 212 can readily acquire one. Thus, conference server 212/MDD 226 can implement ICE Lite and forego many of these pre-answer tasks of the callee. At 312, conference server 212 can receive the SDP offer and determine a host address to provide in the SDP response for establishing the media session. In some embodiments, conference server 212 can operate as a cloud orchestrator to provision MDD 226 and acquire a network address for the provisioned resource. In other embodiments, conference server 212 can acquire a direct network address to MDD 226 or an address to one or more middleboxes (e.g., load balancers, inner NATs, inner firewalls, etc.) that ultimately reach MDD 226. Still other embodiments may use other techniques for acquiring a public network address known to those of ordinary skill in the art.
In addition, conference server 212 can generate a username and password to include in the SDP response. For instance, conference server 212 can set the username to be the combination of the last generated passkey Sn, a delimiter (other than a colon), and the sequence value Sn−1 associated with the last generated passkey Sn. However, this implementation permits the use of any (unused) sequence value-passkey pair from the passkey cache because participants may not initiate connectivity checks in the order they received the SDP answers. In this example, conference server can set the ICE password by using the short-term credential mechanism defined for STUN in RFC 5389 § 15.4.
At 314, conference server 212 can encode the SDP response to include a (direct or indirect) public network address (e.g., IP address, URL, etc.) for MDD 226, associated address information (e.g., port, component identifier, foundation, transport protocol, priority, type, related address, etc.), the sequence value-passkey pair (i.e., the OTP) as the username, and the ICE password for validating message integrity, and send the SDP response to participant 202.
At 316, participant 202 can initiate the connectivity checks phase by attempting to send a STUN request to MDD 226. The STUN request includes the username contained in the SDP response concatenated with a colon and a fragment of the username of participant 202 (e.g., “OTP:AFRAG”) and the password contained in the SDP answer (e.g., “PASS_B”).
At 318, middlebox 230A can inspect the STUN request to extract the sequence number and passkey from the username of the request. Middlebox 230A can validate the STUN request by applying the sequencing algorithm F to the sequence value to determine whether the result matches the passkey. If they do not match, middlebox 230A can drop the request. If the result of applying F to the sequence value matches the passkey within the username, middlebox 230A can forward the request to MDD 226. Middlebox 230A can also purge the sequence value-passkey pair from the passkey cache to prevent its reuse.
At 320, MDD 226 can receive the STUN request and send a STUN response at 322 to complete ICE processing (because conference server 212/MDD 226 implement ICE Lite), and media can flow from MDD 226 to participant 202 and vice versa (e.g., via Secure Real-Time Transport Protocol (SRTP) flows 324 and 326). In other embodiments where conference server 212/MDD 226 implement full ICE, there can be multiple STUN requests/responses before completion of the connectivity checks.
This process can be repeated for one or more additional participants who also want to attend the same or a different web conference within a period of time that the passkey cache remains valid. However, at 312, conference server 212 will select a different sequence value and corresponding passkey not yet exhausted in offers/answers to other participants.
In this example, the process can begin with conference server 212 negotiating with middlebox 230A to determine a secret key K, key identifier KID, counter C, and cryptographic hash function H (e.g., keyed-hash message authentication code (HMAC)-MDS, HMAC-SHA-1, HMAC-SHA-2, or other suitable HMAC algorithm) via a secure REST API request 402 and response 404. The REST API request/response 402-404 can be part of the same REST request/response sequence as 304-308 or can be a separate REST API request/response sequence. Conference server 212 can use the key identifier for key management.
At 406, participant 202 can send an offer (e.g., an SDP offer in an SIP INVITE) to conference server 212 representing a request to establish a media session and participate in a web conference. At 408, conference server 212 can create a short-term credential (i.e., username and password) for participant 202. Conference server 212 can determine the username using a similar process described with respect to
Conference server 212 can compute the password using a second OTP scheme, such as a variation of the hash-based OTP (HOTP) algorithm set forth in the RFC 4226:
P=Truncate(H(K,C∥TS)), (Equation 2)
where
At 410, conference server 212 can encode the SDP answer to include a (direct or indirect) public network address for MDD 226, associated address information, the username (i.e., OTP+KID+C+TS, where OTP=Sm+Sm+1), and the password P, and send the SDP answer to participant 202.
At 412, participant 202 can initiate the connectivity checks phase by attempting to send a STUN request to MDD 226. The STUN request includes the username contained in the SDP response concatenated with a colon and a fragment of the username of participant 202 (e.g., “OTP+KID+C+TS:AFRAG”) and the password P contained in the SDP answer.
At 414, middlebox 230A can inspect each incoming request for a connectivity check. Middlebox 230A can extract the sequence number Sm, passkey Sm+1, key identifier KID, counter C, and timestamp TS from the username of the request. Middlebox 230A can validate the username by applying the sequencing algorithm F to the sequence value Sm to determine whether the result matches the passkey Sm+1. Middlebox 230A can also validate the message integrity of the STUN request by applying the counter C and timestamp TS extracted from the username and the key K negotiated at 402-404 to Equation 2 to determine whether the result matches the password P encoded in the STUN request. If they do not match, middlebox 230A can drop the request. If they match, middlebox 230A can forward the request to MDD 226. An additional advantage of this approach is that the counter C and timestamp TS can also help the middlebox to detect and block replay attacks. For example, once middlebox 230A validates this particular value for the counter C, middlebox 230A can drop any other request including the same value.
At 416, MDD 226 can receive the STUN request and send a STUN response at 418 to complete ICE processing (because conference 212/MDD 226 implement ICE Lite), and media can flow from MDD to participant 202 at 420 and vice versa at 422.
This process repeats for one or more additional participants who also want to attend the same or a different web conference within a period of time that the secret key remains valid. However, at 408, conference server 212 will increment the counter C and acquire a new timestamp TS and calculate a new password for each additional participant.
Under some circumstances, a DDoS attack can overwhelm a middlebox if the number of invalid requests for connectivity checks grows beyond the capacity of the middlebox. In some embodiments, the middlebox can operate as a DDoS Open Threat Signaling (DOTS) client and signal a DOTS server (e.g., a third party provider of DDoS mitigation as a service) to take over DDoS mitigation. The middlebox can pass the values and algorithms negotiated with the web conference operator discussed with respect to
Network configuration 500 also includes web security service provider network 570. A web security service provider can offer various network management and security services, such as authentication, key and security certificate management, virus/malware/spyware detection and prevention, web application firewall (WAF) services, intrusion detection and prevention, DDoS mitigation, regulatory compliance, security event management, log management, and other security services. In this example, web security service provider network 570 includes DOTS server 572 and DDoS mitigation devices 574 for mitigating the effects of DDoS attacks against the web security service provider's customers, such as the provider of web conferencing network 504.
Process 600 can begin at 602 with a conference server and a middlebox exchanging one or more sets of one-time password (OTP) data for authenticating requests for connectivity checks. An example of an OTP scheme is the Lamport OTP algorithm, and the data for this scheme can include a sequencing algorithm F, a seed value S0, and a sequence length L. Another example of an OTP algorithm is HOTP (defined in RFC 4226), and the data for this algorithm can include a secret key K, a key identifier kid, a counter C, a cryptographic hash function H (e.g., HMAC-MDS, HMAC-SHA-1, HMAC-SHA-2, etc.), and a timestamp TS. In some embodiments, the OTP data exchange can occur via one or more secure REST API request/response sequences.
At 604, participants to a media session (e.g., participants 102, 202, and 502; web conferencing network 104, 204, and 504; A/V devices 122; collaboration bridges 124; MDDs 226 and 526, etc.) can gather candidate transport addresses (e.g., IP addresses, URLs, etc.) for the media session. The candidate transport addresses can include one or more network addresses on directly attached network interfaces of endpoints, server reflexive addresses, and/or relayed addresses. The participants may send requests to one or more servers that support STUN and/or TURN to acquire server reflexive and/or relayed addresses. The STUN/TURN servers can reside within a publicly accessible portion of a caller's network (e.g., a public DMZ), in the Internet, or a publicly accessible portion of a callee's network, among other possibilities. In some situations, a participant may always be associated with a public network address and can forego candidate gathering and other actions, and implement a streamlined connectivity establishment protocol (e.g., ICE LITE).
At 606, the participants (e.g., an endpoint in a private network and a conference server) can exchange offers/answers for establishing a media session. In some embodiments, this exchange can occur over a signaling channel using SDP or other suitable signaling protocol. The offer or answer from the conference server can include a username and/or password derived or determined from the set(s) of OTP data exchanged between the conference server and the middlebox. For example, in some embodiments, the username can comprise a sequence value Sm and its associated passkey Sm+1. In some embodiments, the username can also include other OTP data, such as a key identifier KID, a counter C, and a current timestamp TS. In some embodiments, the password can be computed by applying a cryptographic hash function (e.g., RFC 4226 or a variation thereof) using certain OTP data (e.g., secret key K, counter C, and timestamp TS). The offer or answer from the conference server can also include a (direct or indirect) public network address to an MDD.
One of the participant or the conference server can begin connectivity checks by sending binding requests (e.g., STUN requests) to determine connectivity between a local candidate-remote candidate pair of transport addresses. During this connectivity checks, the participant will send at least one binding request which a middlebox can receive at 608. The middlebox can reside in the same network as the conference server in between the Internet and the MDD. The middlebox can include logic for mitigating DDoS attacks by dropping invalid requests.
At 610, the middlebox can inspect a request for a connectivity check to determine whether the request is valid. The middlebox possesses secret data that only legitimate participants to a media session would also possess, i.e., secret data exchanged with a conference server and transmitted to a legitimate participant in an offer/answer to establish the media session. In some embodiments, the middlebox can verify the request on the basis of the username contained in the request. For example, the middlebox can implement a variant of the Lamport OTP algorithm whose secret data includes a sequencing algorithm F. The middlebox and conference server can also share a seed value S0 and a sequence length L. The middlebox can generate a set of passkey values (i.e., a passkey cache) by applying the function F to S0 and successively applying the function F to S1 . . . L−1 to acquire a set of sequence values S0 . . . L−1 that map to a set of passkeys S1 . . . L. The conference server can pass a sequence value-passkey pair as at least part of the user name to the legitimate participant in an SDP offer or answer. The participant can include this sequence value-passkey pair as at least part of the username in a STUN request (e.g., username=“Sm+Sm+1:UF_A”). The middlebox can extract the sequence value Sm and the passkey Sm+1 from the username contained in the request and apply F to Sm. If the result matches Sm+1, the middlebox can allow the request to proceed to its next destination (e.g., an MDD) and for process 600 to proceed to 612. In addition, the middlebox can purge the sequence value-passkey pair from the passkey cache to prohibit its reuse. On the other hand, if the result does not match, the middlebox can drop the request and process 600 can come to an end.
In some embodiments, the middlebox can also extract a counter C and a timestamp TS from the username in the request for the connectivity check. The middlebox can validate message integrity of the request by applying a cryptographic hash function (e.g., RFC 4226) using the secret key K exchanged at 602 and the counter C and timestamp TS extracted from the username. If the result of the application of the cryptographic hash function matches the password extracted from the request, then the middlebox can allow process 600 to advance to 612. Otherwise, the middlebox can drop the request and conclude process 600.
At 612, after an MDD receives a STUN request, the MDD can send a STUN response at 614. If the MDD implements ICE LITE, the connectivity checks phase ends, and media can flow between the participant and the MDD. If the MDD implements full ICE, the participant and the MDD can exchange one or more additional STUN requests/responses until both the MDD and the participant have completed their respective connectivity checks and settled on one or more candidate pairs for exchanging media. At 616, the MDD and the participant can send media using a transport protocol (e.g., Secure Real-Time Transport Protocol (SRTP) (defined in RFC 3711), SRTP Control Protocol (SRTCP), Real-Time Transport Protocol (RTP) (defined in RFC 3550), RTP Control Protocol (RTCP) (defined in RFC 3605), or other suitable transport protocol(s)).
To enable user interaction with computing system 700, input device 745 can represent any number of input mechanisms, such as a microphone for speech, a touch-protected screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. Output device 735 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with computing system 700. Communications interface 740 can govern and manage the user input and system output. There may be no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.
Storage device 730 can be a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs), read only memory (ROM), and hybrids thereof. Storage device 730 can include software modules 732, 734, 736 for controlling CPU 710.
In some embodiments, a computing system that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as CPU 710, bus 705, output device 735, and so forth, to carry out the function.
Computing system 750 can also include bridge 780 for interfacing with a variety of user interface components 785 and chipset 760. User interface components 785 can include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. Inputs to computing system 750 can come from any of a variety of sources, machine generated and/or human generated.
Chipset 760 can also interface with one or more communication interfaces 790 that can have different physical interfaces. Communication interfaces 790 can include interfaces for wired and wireless LANs, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using user interfaces disclosed in the present disclosure can include receiving ordered datasets over the physical interface or generating the data by processor 755 analyzing data stored in storage device 770 or the RAM 775. Further, computing system 750 can receive inputs from a user via user interface components 785 and execute appropriate functions, such as browsing functions by interpreting these inputs using CPU 755.
One of ordinary skill in the art will appreciate that computing systems 700 and 750 can have more than one processor 710 and 755, respectively, or can be part of a group or cluster of computing devices networked together to provide greater processing capability.
For clarity of explanation, in some instances the various embodiments may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.
In some embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.
Methods according to the above-described embodiment can reside within computer-executable instructions stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media used to store instructions, information used, and/or information created during methods according to described examples can include magnetic or optical disks, flash memory, universal serial bus (USB) devices provided with non-volatile memory, networked storage devices, and so on.
Devices implementing methods according to the present disclosure can comprise hardware, firmware, and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rack-mount devices, standalone devices, and so on. Functionality described in the present disclosure can also reside in peripherals or add-in cards. Such functionality can also reside on a circuit board among different chips or different processes executing in a single device, by way of further example.
The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.
Although a variety of examples and other information explain aspects within the scope of the appended claims, one of ordinary skill will understand not to imply any limitation based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although the present disclosure may describe some subject matter in language specific to examples of structural features and/or method steps, one of ordinary skill will understand that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
3629512 | Yuan | Dec 1971 | A |
4769811 | Eckberg, Jr. et al. | Sep 1988 | A |
5408231 | Bowdon | Apr 1995 | A |
5491690 | Alfonsi et al. | Feb 1996 | A |
5557609 | Shobatake et al. | Sep 1996 | A |
5600638 | Bertin et al. | Feb 1997 | A |
5687167 | Bertin et al. | Nov 1997 | A |
6115384 | Parzych | Sep 2000 | A |
6167438 | Yates et al. | Dec 2000 | A |
6400681 | Bertin et al. | Jun 2002 | B1 |
6661797 | Goel et al. | Dec 2003 | B1 |
6687229 | Kataria et al. | Feb 2004 | B1 |
6799270 | Bull et al. | Sep 2004 | B1 |
6888828 | Partanen et al. | May 2005 | B1 |
6993593 | Iwata | Jan 2006 | B2 |
7027408 | Nabkel et al. | Apr 2006 | B2 |
7062567 | Benitez et al. | Jun 2006 | B2 |
7095715 | Buckman et al. | Aug 2006 | B2 |
7096212 | Tribble et al. | Aug 2006 | B2 |
7139239 | Mcfarland et al. | Nov 2006 | B2 |
7165107 | Pouyoul et al. | Jan 2007 | B2 |
7197008 | Shabtay et al. | Mar 2007 | B1 |
7197660 | Liu et al. | Mar 2007 | B1 |
7209435 | Kuo et al. | Apr 2007 | B1 |
7227872 | Biswas et al. | Jun 2007 | B1 |
7231462 | Berthaud et al. | Jun 2007 | B2 |
7333990 | Thiagarajan et al. | Feb 2008 | B1 |
7443796 | Albert et al. | Oct 2008 | B1 |
7458084 | Zhang et al. | Nov 2008 | B2 |
7472411 | Wing et al. | Dec 2008 | B2 |
7486622 | Regan et al. | Feb 2009 | B2 |
7536396 | Johnson et al. | May 2009 | B2 |
7552201 | Areddu et al. | Jun 2009 | B2 |
7558261 | Arregoces et al. | Jul 2009 | B2 |
7567504 | Darling et al. | Jul 2009 | B2 |
7571470 | Arregoces et al. | Aug 2009 | B2 |
7573879 | Narad et al. | Aug 2009 | B2 |
7610375 | Portolani et al. | Oct 2009 | B2 |
7643468 | Arregoces et al. | Jan 2010 | B1 |
7644182 | Banerjee et al. | Jan 2010 | B2 |
7647422 | Singh et al. | Jan 2010 | B2 |
7657898 | Sadiq | Feb 2010 | B2 |
7657940 | Portolani et al. | Feb 2010 | B2 |
7668116 | Wijnands et al. | Feb 2010 | B2 |
7684321 | Muirhead et al. | Mar 2010 | B2 |
7738469 | Shekokar et al. | Jun 2010 | B1 |
7751409 | Carolan | Jul 2010 | B1 |
7793157 | Bailey et al. | Sep 2010 | B2 |
7814284 | Glass et al. | Oct 2010 | B1 |
7831693 | Lai | Nov 2010 | B2 |
7852785 | Lund et al. | Dec 2010 | B2 |
7860095 | Forissier et al. | Dec 2010 | B2 |
7860100 | Khalid et al. | Dec 2010 | B2 |
7895425 | Khalid et al. | Feb 2011 | B2 |
7899012 | Ho et al. | Mar 2011 | B2 |
7899861 | Feblowitz et al. | Mar 2011 | B2 |
7907595 | Khanna et al. | Mar 2011 | B2 |
7908480 | Firestone et al. | Mar 2011 | B2 |
7983174 | Monaghan et al. | Jul 2011 | B1 |
7990847 | Leroy et al. | Aug 2011 | B1 |
8000329 | Fendick et al. | Aug 2011 | B2 |
8018938 | Fromm et al. | Sep 2011 | B1 |
8094575 | Vadlakonda et al. | Jan 2012 | B1 |
8095683 | Balasubramanian Chandra | Jan 2012 | B2 |
8116307 | Thesayi et al. | Feb 2012 | B1 |
8166465 | Feblowitz et al. | Apr 2012 | B2 |
8180909 | Hartman et al. | May 2012 | B2 |
8191119 | Wing et al. | May 2012 | B2 |
8195774 | Lambeth et al. | Jun 2012 | B2 |
8280354 | Smith et al. | Oct 2012 | B2 |
8281302 | Durazzo et al. | Oct 2012 | B2 |
8291108 | Raja et al. | Oct 2012 | B2 |
8305900 | Bianconi | Nov 2012 | B2 |
8311045 | Quinn et al. | Nov 2012 | B2 |
8316457 | Paczkowski et al. | Nov 2012 | B1 |
8355332 | Beaudette et al. | Jan 2013 | B2 |
8442043 | Sharma et al. | May 2013 | B2 |
8451817 | Cheriton | May 2013 | B2 |
8464336 | Wei et al. | Jun 2013 | B2 |
8473981 | Gargi | Jun 2013 | B1 |
8479298 | Keith et al. | Jul 2013 | B2 |
8498414 | Rossi | Jul 2013 | B2 |
8520672 | Guichard et al. | Aug 2013 | B2 |
8601152 | Chou | Dec 2013 | B1 |
8605588 | Sankaran et al. | Dec 2013 | B2 |
8612612 | Dukes et al. | Dec 2013 | B1 |
8627328 | Mousseau et al. | Jan 2014 | B2 |
8645952 | Biswas et al. | Feb 2014 | B2 |
8676965 | Gueta | Mar 2014 | B2 |
8676980 | Kreeger et al. | Mar 2014 | B2 |
8700892 | Bollay et al. | Apr 2014 | B2 |
8724466 | Kenigsberg et al. | May 2014 | B2 |
8730980 | Bagepalli et al. | May 2014 | B2 |
8743885 | Khan et al. | Jun 2014 | B2 |
8751420 | Hjelm et al. | Jun 2014 | B2 |
8762534 | Hong et al. | Jun 2014 | B1 |
8762707 | Killian et al. | Jun 2014 | B2 |
8792490 | Jabr et al. | Jul 2014 | B2 |
8793400 | Mcdysan et al. | Jul 2014 | B2 |
8812730 | Vos et al. | Aug 2014 | B2 |
8819419 | Carlson et al. | Aug 2014 | B2 |
8825070 | Akhtar et al. | Sep 2014 | B2 |
8830834 | Sharma et al. | Sep 2014 | B2 |
8904037 | Haggar et al. | Dec 2014 | B2 |
8984284 | Purdy, Sr. et al. | Mar 2015 | B2 |
9001827 | Appenzeller | Apr 2015 | B2 |
9071533 | Hui et al. | Jun 2015 | B2 |
9077661 | Andreasen et al. | Jul 2015 | B2 |
9088584 | Feng et al. | Jul 2015 | B2 |
9130872 | Kumar et al. | Sep 2015 | B2 |
9143438 | Khan et al. | Sep 2015 | B2 |
9160797 | Mcdysan | Oct 2015 | B2 |
9178812 | Guichard et al. | Nov 2015 | B2 |
9189285 | Ng et al. | Nov 2015 | B2 |
9203711 | Agarwal et al. | Dec 2015 | B2 |
9253274 | Quinn et al. | Feb 2016 | B2 |
9300579 | Frost et al. | Mar 2016 | B2 |
9300585 | Kumar et al. | Mar 2016 | B2 |
9311130 | Christenson et al. | Apr 2016 | B2 |
9319324 | Beheshti-Zavareh et al. | Apr 2016 | B2 |
9325565 | Yao et al. | Apr 2016 | B2 |
9338097 | Anand et al. | May 2016 | B2 |
9344337 | Kumar et al. | May 2016 | B2 |
9374297 | Bosch et al. | Jun 2016 | B2 |
9379931 | Bosch et al. | Jun 2016 | B2 |
9385950 | Quinn et al. | Jul 2016 | B2 |
9398486 | La Roche, Jr. et al. | Jul 2016 | B2 |
9407540 | Kumar et al. | Aug 2016 | B2 |
9413655 | Shatzkamer et al. | Aug 2016 | B2 |
9424065 | Singh et al. | Aug 2016 | B2 |
9436443 | Chiosi et al. | Sep 2016 | B2 |
9444675 | Guichard et al. | Sep 2016 | B2 |
9473570 | Bhanujan et al. | Oct 2016 | B2 |
9479443 | Bosch et al. | Oct 2016 | B2 |
9491094 | Patwardhan et al. | Nov 2016 | B2 |
9537836 | Maller et al. | Jan 2017 | B2 |
9558029 | Behera et al. | Jan 2017 | B2 |
9559970 | Kumar et al. | Jan 2017 | B2 |
9571405 | Pignataro et al. | Feb 2017 | B2 |
9608896 | Kumar et al. | Mar 2017 | B2 |
9614739 | Kumar et al. | Apr 2017 | B2 |
9660909 | Guichard et al. | May 2017 | B2 |
9723106 | Shen et al. | Aug 2017 | B2 |
9774533 | Zhang et al. | Sep 2017 | B2 |
9794379 | Kumar et al. | Oct 2017 | B2 |
9882776 | Aybay et al. | Jan 2018 | B2 |
9929945 | Schultz et al. | Mar 2018 | B2 |
10003530 | Zhang et al. | Jun 2018 | B2 |
20010023442 | Masters | Sep 2001 | A1 |
20020085562 | Hufferd et al. | Jul 2002 | A1 |
20020131362 | Callon | Sep 2002 | A1 |
20020156893 | Pouyoul et al. | Oct 2002 | A1 |
20020167935 | Nabkel et al. | Nov 2002 | A1 |
20030023879 | Wray | Jan 2003 | A1 |
20030026257 | Xu et al. | Feb 2003 | A1 |
20030037070 | Marston | Feb 2003 | A1 |
20030088698 | Singh et al. | May 2003 | A1 |
20030110081 | Tosaki et al. | Jun 2003 | A1 |
20030120816 | Berthaud et al. | Jun 2003 | A1 |
20030214913 | Kan et al. | Nov 2003 | A1 |
20030226142 | Rand | Dec 2003 | A1 |
20040109412 | Hansson et al. | Jun 2004 | A1 |
20040148391 | Shannon, Sr. et al. | Jul 2004 | A1 |
20040199812 | Earl | Oct 2004 | A1 |
20040213160 | Regan et al. | Oct 2004 | A1 |
20040264481 | Darling et al. | Dec 2004 | A1 |
20040268357 | Joy et al. | Dec 2004 | A1 |
20050044197 | Lai | Feb 2005 | A1 |
20050058118 | Davis | Mar 2005 | A1 |
20050060572 | Kung | Mar 2005 | A1 |
20050086367 | Conta et al. | Apr 2005 | A1 |
20050120101 | Nocera | Jun 2005 | A1 |
20050152378 | Bango et al. | Jul 2005 | A1 |
20050157645 | Rabie et al. | Jul 2005 | A1 |
20050160180 | Rabje et al. | Jul 2005 | A1 |
20050204042 | Banerjee et al. | Sep 2005 | A1 |
20050210096 | Bishop et al. | Sep 2005 | A1 |
20050257002 | Nguyen | Nov 2005 | A1 |
20050281257 | Yazaki et al. | Dec 2005 | A1 |
20050286540 | Hurtta et al. | Dec 2005 | A1 |
20050289244 | Sahu et al. | Dec 2005 | A1 |
20060005240 | Sundarrajan et al. | Jan 2006 | A1 |
20060031374 | Lu et al. | Feb 2006 | A1 |
20060045024 | Previdi et al. | Mar 2006 | A1 |
20060074502 | Mcfarland | Apr 2006 | A1 |
20060092950 | Arregoces et al. | May 2006 | A1 |
20060095960 | Arregoces et al. | May 2006 | A1 |
20060112400 | Zhang et al. | May 2006 | A1 |
20060155862 | Kathi et al. | Jul 2006 | A1 |
20060168223 | Mishra et al. | Jul 2006 | A1 |
20060233106 | Achlioptas et al. | Oct 2006 | A1 |
20060233155 | Srivastava | Oct 2006 | A1 |
20070061441 | Landis et al. | Mar 2007 | A1 |
20070067435 | Landis et al. | Mar 2007 | A1 |
20070094397 | Krelbaum et al. | Apr 2007 | A1 |
20070143851 | Nicodemus et al. | Jun 2007 | A1 |
20070237147 | Quinn et al. | Oct 2007 | A1 |
20070250836 | Li et al. | Oct 2007 | A1 |
20080056153 | Liu | Mar 2008 | A1 |
20080080509 | Khanna et al. | Apr 2008 | A1 |
20080080517 | Roy et al. | Apr 2008 | A1 |
20080170542 | Hu | Jul 2008 | A1 |
20080177896 | Quinn et al. | Jul 2008 | A1 |
20080181118 | Sharma et al. | Jul 2008 | A1 |
20080196083 | Parks et al. | Aug 2008 | A1 |
20080209039 | Tracey et al. | Aug 2008 | A1 |
20080219287 | Krueger et al. | Sep 2008 | A1 |
20080225710 | Raja et al. | Sep 2008 | A1 |
20080291910 | Tadimeti et al. | Nov 2008 | A1 |
20090003364 | Fendick et al. | Jan 2009 | A1 |
20090006152 | Timmerman et al. | Jan 2009 | A1 |
20090037713 | Khalid et al. | Feb 2009 | A1 |
20090094684 | Chinnusamy et al. | Apr 2009 | A1 |
20090204612 | Keshavarz-nia et al. | Aug 2009 | A1 |
20090271656 | Yokota et al. | Oct 2009 | A1 |
20090300207 | Giaretta et al. | Dec 2009 | A1 |
20090305699 | Deshpande et al. | Dec 2009 | A1 |
20090328054 | Paramasivam et al. | Dec 2009 | A1 |
20100058329 | Durazzo et al. | Mar 2010 | A1 |
20100063988 | Khalid | Mar 2010 | A1 |
20100080226 | Khalid | Apr 2010 | A1 |
20100165985 | Sharma et al. | Jul 2010 | A1 |
20100191612 | Raleigh | Jul 2010 | A1 |
20100211658 | Hoogerwerf et al. | Aug 2010 | A1 |
20110023090 | Asati et al. | Jan 2011 | A1 |
20110032833 | Zhang et al. | Feb 2011 | A1 |
20110055845 | Nandagopal et al. | Mar 2011 | A1 |
20110131338 | Hu | Jun 2011 | A1 |
20110137991 | Russell | Jun 2011 | A1 |
20110142056 | Manoj | Jun 2011 | A1 |
20110161494 | Mcdysan et al. | Jun 2011 | A1 |
20110222412 | Kompella | Sep 2011 | A1 |
20110255538 | Srinivasan et al. | Oct 2011 | A1 |
20110267947 | Dhar et al. | Nov 2011 | A1 |
20120131662 | Kuik et al. | May 2012 | A1 |
20120147894 | Mulligan et al. | Jun 2012 | A1 |
20120324442 | Barde | Dec 2012 | A1 |
20120331135 | Alon et al. | Dec 2012 | A1 |
20130003735 | Chao et al. | Jan 2013 | A1 |
20130003736 | Szyszko et al. | Jan 2013 | A1 |
20130040640 | Chen et al. | Feb 2013 | A1 |
20130044636 | Koponen et al. | Feb 2013 | A1 |
20130121137 | Feng et al. | May 2013 | A1 |
20130124708 | Lee et al. | May 2013 | A1 |
20130163594 | Sharma et al. | Jun 2013 | A1 |
20130163606 | Bagepalli et al. | Jun 2013 | A1 |
20130238806 | Moen | Sep 2013 | A1 |
20130272305 | Lefebvre et al. | Oct 2013 | A1 |
20130311675 | Kancherla | Nov 2013 | A1 |
20130329584 | Ghose et al. | Dec 2013 | A1 |
20140010083 | Hamdi et al. | Jan 2014 | A1 |
20140010096 | Kamble et al. | Jan 2014 | A1 |
20140036730 | Nellikar et al. | Feb 2014 | A1 |
20140050223 | Foo et al. | Feb 2014 | A1 |
20140067758 | Boldyrev et al. | Mar 2014 | A1 |
20140105062 | McDysan et al. | Apr 2014 | A1 |
20140181267 | Wadkins et al. | Jun 2014 | A1 |
20140254603 | Banavalikar et al. | Sep 2014 | A1 |
20140259012 | Nandlall et al. | Sep 2014 | A1 |
20140279863 | Krishnamurthy et al. | Sep 2014 | A1 |
20140280836 | Kumar et al. | Sep 2014 | A1 |
20140317261 | Shatzkamer et al. | Oct 2014 | A1 |
20140321459 | Kumar et al. | Oct 2014 | A1 |
20140334295 | Guichard et al. | Nov 2014 | A1 |
20140344439 | Kempf et al. | Nov 2014 | A1 |
20140362682 | Guichard et al. | Dec 2014 | A1 |
20140362857 | Guichard et al. | Dec 2014 | A1 |
20140369209 | Khurshid et al. | Dec 2014 | A1 |
20140376558 | Rao et al. | Dec 2014 | A1 |
20150003455 | Haddad et al. | Jan 2015 | A1 |
20150012584 | Lo et al. | Jan 2015 | A1 |
20150012988 | Jeng et al. | Jan 2015 | A1 |
20150029871 | Frost et al. | Jan 2015 | A1 |
20150032871 | Allan et al. | Jan 2015 | A1 |
20150052516 | French et al. | Feb 2015 | A1 |
20150071285 | Kumar et al. | Mar 2015 | A1 |
20150074276 | DeCusatis et al. | Mar 2015 | A1 |
20150082308 | Kiess et al. | Mar 2015 | A1 |
20150085635 | Wijnands et al. | Mar 2015 | A1 |
20150085870 | Narasimha et al. | Mar 2015 | A1 |
20150089082 | Patwardhan et al. | Mar 2015 | A1 |
20150092564 | Aldrin | Apr 2015 | A1 |
20150103827 | Quinn et al. | Apr 2015 | A1 |
20150117308 | Kant | Apr 2015 | A1 |
20150124622 | Kowali et al. | May 2015 | A1 |
20150131484 | Aldrin | May 2015 | A1 |
20150131660 | Shepherd et al. | May 2015 | A1 |
20150156035 | Foo et al. | Jun 2015 | A1 |
20150180725 | Varney et al. | Jun 2015 | A1 |
20150180767 | Tam et al. | Jun 2015 | A1 |
20150181309 | Shepherd et al. | Jun 2015 | A1 |
20150188949 | Mahaffey et al. | Jul 2015 | A1 |
20150195197 | Yong et al. | Jul 2015 | A1 |
20150222516 | Deval et al. | Aug 2015 | A1 |
20150222533 | Birrittella et al. | Aug 2015 | A1 |
20150236948 | Dunbar et al. | Aug 2015 | A1 |
20150319078 | Lee et al. | Nov 2015 | A1 |
20150319081 | Kasturi et al. | Nov 2015 | A1 |
20150326473 | Dunbar et al. | Nov 2015 | A1 |
20150333930 | Aysola et al. | Nov 2015 | A1 |
20150334027 | Bosch et al. | Nov 2015 | A1 |
20150341285 | Aysola et al. | Nov 2015 | A1 |
20150365495 | Fan et al. | Dec 2015 | A1 |
20150381465 | Narayanan et al. | Dec 2015 | A1 |
20150381557 | Fan et al. | Dec 2015 | A1 |
20160028604 | Chakrabarti et al. | Jan 2016 | A1 |
20160028640 | Zhang et al. | Jan 2016 | A1 |
20160043952 | Zhang et al. | Feb 2016 | A1 |
20160050117 | Voellmy et al. | Feb 2016 | A1 |
20160050132 | Zhang | Feb 2016 | A1 |
20160080263 | Park et al. | Mar 2016 | A1 |
20160099853 | Nedeltchev et al. | Apr 2016 | A1 |
20160119159 | Zhao et al. | Apr 2016 | A1 |
20160119253 | Kang | Apr 2016 | A1 |
20160127139 | Tian et al. | May 2016 | A1 |
20160134518 | Callon et al. | May 2016 | A1 |
20160134535 | Callon | May 2016 | A1 |
20160139939 | Bosch et al. | May 2016 | A1 |
20160164776 | Biancaniello | Jun 2016 | A1 |
20160165014 | Nainar et al. | Jun 2016 | A1 |
20160173373 | Guichard et al. | Jun 2016 | A1 |
20160173464 | Wang et al. | Jun 2016 | A1 |
20160182336 | Doctor et al. | Jun 2016 | A1 |
20160182342 | Singaravelu et al. | Jun 2016 | A1 |
20160182684 | Connor et al. | Jun 2016 | A1 |
20160212017 | Li et al. | Jul 2016 | A1 |
20160226742 | Apathotharanan et al. | Aug 2016 | A1 |
20160248685 | Pignataro et al. | Aug 2016 | A1 |
20160277250 | Maes | Sep 2016 | A1 |
20160285720 | Mäenpää et al. | Sep 2016 | A1 |
20160323165 | Boucadair et al. | Nov 2016 | A1 |
20160352629 | Wang et al. | Dec 2016 | A1 |
20160380966 | Gunnalan et al. | Dec 2016 | A1 |
20160380967 | Moore | Dec 2016 | A1 |
20170019303 | Swamy et al. | Jan 2017 | A1 |
20170031804 | Ciszewski et al. | Feb 2017 | A1 |
20170078175 | Xu et al. | Mar 2017 | A1 |
20170142165 | Moore | May 2017 | A1 |
20170187609 | Lee et al. | Jun 2017 | A1 |
20170208000 | Bosch et al. | Jul 2017 | A1 |
20170214627 | Zhang et al. | Jul 2017 | A1 |
20170237656 | Gage et al. | Aug 2017 | A1 |
20170250917 | Ruckstuhl et al. | Aug 2017 | A1 |
20170272470 | Gundamaraju et al. | Sep 2017 | A1 |
20170279712 | Nainar et al. | Sep 2017 | A1 |
20170310611 | Kumar et al. | Oct 2017 | A1 |
20170331741 | Fedyk et al. | Nov 2017 | A1 |
20180013841 | Nainar et al. | Jan 2018 | A1 |
20180026884 | Nainar et al. | Jan 2018 | A1 |
20180026887 | Nainar et al. | Jan 2018 | A1 |
20180041470 | Schultz et al. | Feb 2018 | A1 |
20180062991 | Nainar et al. | Mar 2018 | A1 |
20180124123 | Moore | May 2018 | A1 |
Number | Date | Country |
---|---|---|
103716123 | Apr 2014 | CN |
103716137 | Apr 2014 | CN |
3160073 | Apr 2017 | EP |
2016149686 | Aug 2016 | JP |
WO-2011029321 | Mar 2011 | WO |
WO 2012056404 | May 2012 | WO |
WO 2015065353 | May 2015 | WO |
WO 2015180559 | Dec 2015 | WO |
WO 2015187337 | Dec 2015 | WO |
WO-2016004556 | Jan 2016 | WO |
WO 2016058245 | Apr 2016 | WO |
WO 2017011607 | Jan 2017 | WO |
Entry |
---|
Alizadeh, Mohammad, et al., “CONGA: Distributed Congestion-Aware Load Balancing for Datacenters,” SIGCOMM '14, Aug. 17-22, 2014, 12 pages. |
Author Unknown, “IEEE Standard for the Functional Architecture of Next Generation Service Overlay Networks, IEEE Std. 1903-2011,” IEEE, Piscataway, NJ, Oct. 7, 2011; 147 pages. |
Author Unknown, “OpenNebula 4.6 User Guide,” Jun. 12, 2014, opennebula.org, 87 pages. |
Author Unknown, “Service-Aware Network Architecture Based on SDN, NFV, and Network Intelligence,” 2014, 8 pages. |
Bi, Jing, et al., “Dynamic Provisioning Modeling for Virtualized Multi-tier Applications in Cloud Data Center,” 2010 IEEE 3rd International Conference on Cloud Computing, Jul. 5, 2010, pp. 370-377, IEEE Computer Society. |
Bitar, N., et al., “Interface to the Routing System (I2RS) for the Service Chaining: Use Cases and Requirements,” draft-bitar-i2rs-service-chaining-01, Feb. 14, 2014, pp. 1-15. |
Bremler-Barr, Anat, et al., “Deep Packet Inspection as a Service,” CoNEXT '14, Dec. 2-5, 2014, pp. 271-282. |
Cisco Systems, Inc. “Cisco VN-LINK: Virtualization-Aware Networking,” 2009, 9 pages. |
Dunbar, et al., “Architecture for Chaining Legacy Layer 4-7 Service Functions,” IETF Network Working Group Internet Draft, draft-dunbar-sfc-legacy-14-17-chain-architecture-03.txt, Feb. 10, 2014; 17 pages. |
Farrel, A., et al., “A Path Computation Element (PCE)—Based Architecture,” RFC 4655, Network Working Group, Aug. 2006, 40 pages. |
Jiang, Y., et al., “An Architecture of Service Function Chaining,” IETF Network Working Group Internet Draft, draft-jiang-sfc-arch-01.txt, Feb. 14, 2014; 12 pages. |
Katsikas, Goergios P., et al., “Profiling and accelerating commodity NFV service chains with SCC,” The Journal of Systems and Software, vol. 127, Jan. 2017, pp. 12-27. |
Kumbhare, Abhijit, et al., “Opendaylight Service Function Chaining Use-Cases,” Oct. 14, 2014, 25 pages. |
Li, Hongyu, “Service Function Chaining Use Cases”, IETF 88 Vancouver, Nov. 7, 2013, 7 pages. |
Mortensen, A., et al., “Distributed Denial of Service (DDoS) Open Threat Signaling Requirements,” DOTS, Mar. 18, 2016, 16 pages; https://tools.ietf.org/pdf/draft-ietf-dots-requirements-01.pdf. |
Newman, David, “Review: FireEye fights off multi-stage malware,” Network World, May 5, 2014, 7 pages. |
Nguyen, Kim-Khoa, et al. “Distributed Control Plane Architecture of Next Generation IP Routers,” IEEE, 2009, 8 pages. |
Quinn, P., et al., “Network Service Header,” Network Working Group, Mar. 24, 2015, 42 pages; https://tools.ietf.org/pdf/draft-ietf-sfc-nsh-00.pdf. |
Quinn, P., et al., “Network Service Chaining Problem Statement,” draft-quinn-nsc-problem-statement-03.txt, Aug. 26, 2013, 18 pages. |
Quinn, Paul, et al., “Service Function Chaining: Creating a Service Plane via Network Service Headers,” IEEE Computer Society, 2014, pp. 38-44. |
Zhang, Ying, et al. “StEERING: A Software-Defined Networking for Inline Service Chaining,” IEEE, 2013, IEEE, p. 10 pages. |
Aldrin, S., et al. “Service Function Chaining Operation, Administration and Maintenance Framework,” Internet Engineering Task Force, Oct. 26, 2014, 13 pages. |
Author Unknown, “ANSI/SCTE 35 2007 Digital Program Insertion Cueing Message for Cable,” Engineering Committee, Digital Video Subcommittee, American National Standard, Society of Cable Telecommunications Engineers, © Society of Cable Telecommunications Engineers, Inc. 2007 All Rights Reserved, 140 Philips Road, Exton, PA 19341; 42 pages. |
Author Unknown, “AWA Lambda Developer Guide,” Amazon Web Services Inc., May 2017, 416 pages. |
Author Unknown, “CEA-708,” from Wikipedia, the free encyclopedia, Nov. 15, 2012; 16 pages http://en.wikipedia.org/w/index.php?title=CEA-708&oldid=523143431. |
Author Unknown, “Cisco and Intel High-Performance VNFs on Cisco NFV Infrastructure,” White Paper, Cisco and Intel, Oct. 2016, 7 pages. |
Author Unknown, “Cloud Functions Overview,” Cloud Functions Documentation, Mar. 21, 2017, 3 pages; https://cloud.google.com/functions/docs/concepts/overview. |
Author Unknown, “Cloud-Native VNF Modelling,” Open Source Mano, © ETSI 2016, 18 pages. |
Author Unknown, “Digital Program Insertion,” from Wikipedia, the free encyclopedia, Jan. 2, 2012; 1 page http://en.wikipedia.org/w/index.php?title=Digital_Program_Insertion&oldid=469076482. |
Author Unknown, “Dynamic Adaptive Streaming over HTTP,” from Wikipedia, the free encyclopedia, Oct. 25, 2012; 3 pages, http://en.wikipedia.org/w/index.php?title=Dynamic_Adaptive_Streanning_over_HTTP&oldid=519749189. |
Author Unknown, “GStreamer and in-band metadata,” from RidgeRun Developer Connection, Jun. 19, 2012, 5 pages https://developersidgerun.conn/wiki/index.php/GStreanner_and_in-band_nnetadata. |
Author Unknown, “ISO/IEC JTC 1/SC 29, Information Technology—Dynamic Adaptive Streaming over HTTP (DASH)—Part 1: Media Presentation Description and Segment Formats,” International Standard © ISO/IEC 2012—All Rights Reserved; Jan. 5, 2012; 131 pages. |
Author Unknown, “M-PEG 2 Transmission,” © Dr. Gorry Fairhurst, 9 pages [Published on or about Jan. 12, 2012] http://www.erg.abdn.ac.ul/future-net/digital-video/mpeg2-trans.html. |
Author Unknown, “MPEG Transport Stream,” from Wikipedia, the free encyclopedia, Nov. 11, 2012; 7 pages, http://en.wikipedia.org/w/index.php?title=MPEG_transport_streann&oldid=522468296. |
Author Unknown, “Network Functions Virtualisation (NFV); Use Cases,” ETSI, GS NFV 001 v1.1.1, Architectural Framework, © European Telecommunications Standards Institute, Oct. 2013, 50 pages. |
Author Unknown, “Understanding Azure, A Guide for Developers,” Microsoft Corporation, Copyright © 2016 Microsoft Corporation, 39 pages. |
Baird, Andrew, et al. “AWS Serverless Multi-Tier Architectures; Using Amazon API Gateway and AWS Lambda,” Amazon Web Services Inc., Nov. 2015, 20 pages. |
Boucadair, Mohamed, et al., “Differentiated Service Function Chaining Framework,” Network Working Group Internet Draft draft-boucadair-network-function-chaining-03, Aug. 21, 2013, 21 pages. |
Cisco Systems, Inc. “Cisco NSH Service Chaining Configuration Guide,” Jul. 28, 2017, 11 pages. |
Ersue, Mehmet, “ETSI NFV Management and Orchestration—An Overview,” Presentation at the IETF#88 Meeting, Nov. 3, 2013, 14 pages. |
Fayaz, Seyed K., et al., “Efficient Network Reachability Analysis using a Succinct Control Plane Representation,” 2016, ratul.org, pp. 1-16. |
Halpern, Joel, et al., “Service Function Chaining (SFC) Architecture,” Internet Engineering Task Force (IETF), Cisco, Oct. 2015, 32 pages. |
Hendrickson, Scott, et al. “Serverless Computation with OpenLambda,” Elastic 60, University of Wisconson, Madison, Jun. 20, 2016, 7 pages, https://www.usenix.org/system/files/conference/hotcloud16/hotcloud16_hendrickson.pdf. |
Jiang, Yuanlong, et al., “Fault Management in Service Function Chaining,” Network Working Group, China Telecom, Oct. 16, 2015, 13 pages. |
Kumar, Surendra, et al., “Service Function Path Optimization: draft-kumar-sfc-sfp-optimization-00.txt,” Internet Engineering Task Force, IETF; Standard Working Draft, May 10, 2014, 14 pages. |
Penno, Reinaldo, et al. “Packet Generation in Service Function Chains,” draft-penno-sfc-packet-03, Apr. 29, 2016, 25 pages. |
Penno, Reinaldo, et al. “Services Function Chaining Traceroute,” draft-penno-sfc-trace-03, Sep. 30, 2015, 9 pages. |
Pierre-Louis, Marc-Arhtur, “OpenWhisk: A quick tech preview,” DeveloperWorks Open, IBM, Feb. 22, 2016, modified Mar. 3, 2016, 7 pages; https://developer.ibm.com/open/2016/02/22/openwhisk-a-quick-tech-preview/. |
Pujol, Pua Capdevila, “Deployment of NFV and SFC scenarios,” EETAC, Master Thesis, Advisor: David Rincon Rivera, Universitat Politecnica De Catalunya, Feb. 17, 2017, 115 pages. |
Quinn, Paul, et al., “Network Service Header,” Network Working Group, draft-quinn-nsh-00.txt, Jun. 13, 2013, 20 pages. |
Quinn, Paul, et al., “Network Service Header,” Network Working Group Internet Draft draft-quinn-nsh-01, Jul. 12, 2013, 20 pages. |
Wong, Fei, et al., “SMPTE-TT Embedded in ID3 for HTTP Live Streaming, draft-smpte-id3-http-live-streaming-00,” Information Internet Draft, Jun. 2012, 7 pages http://tools.ietf.org/htnnl/draft-snnpte-id3-http-live-streaming-00. |
Yadav, Rishi, “What Real Cloud-Native Apps Will Look Like,” Crunch Network, posted Aug. 3, 2016, 8 pages; https://techcrunch.com/2016/08/03/what-real-cloud-native-apps-will-look-like/. |
3GPP TR 23.401 V9.5.0 (Jun. 2010) Technical Specification: Group Services and Systems Aspects; General Packet Radio Service (GPRS) Enhancements for Evolved Universal Terrestrial Radio Access Network (E-UTRAN) Access (Release 9), 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Jun. 2010; 259 pages. |
3GPP TR 23.803 V7.0.0 (Sep. 2005) Technical Specification: Group Services and System Aspects; Evolution of Policy Control and Charging (Release 7), 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Val bonne—France, Sep. 2005; 30 pages. |
3GPP TS 23.203 V8.9.0 (Mar. 2010) Technical Specification: Group Services and System Aspects; Policy and Charging Control Architecture (Release 8), 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Val bonne—France, Mar. 2010; 116 pages. |
3GPP TS 23.401 V13.5.0 (Dec. 2015) Technical Specification: 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; General Packet Radio Service (GPRS) enhancements for Evolved Universal Terrestrial Radio Access Network (E-UTRAN) access (Release 13), 3GPP, 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Dec. 2015. |
3GPP TS 29.212 V13.1.0 (Mar. 2015) Technical Specification: 3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Policy and Chargig Control (PCC); Reference points (Release 13), 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Mar. 2015; 230 pages. |
U.S. Appl. No. 15/252,028, filed Aug. 30, 2016, entitled “System and Method for Managing Chained Services in a Network Environment,” Inventor(s): Hendrikus G.P. Bosch, et al. |
P. Quinn, et al., “Network Service Header,” Network Working Group, Feb. 14, 2014, 21 pages; https://svn.tools.ietf.org/html/draft-quinn-sfc-nsh-02. |
P. Quinn, et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, May 5, 2014, 31 pages; https://svn.tools.ietf.org/html/draft-quinn-sfc-arch-05. |
International Search Report and Written Opinion from the International Searching Authority, dated Aug. 30, 2017, for the corresponding International Application No. PCT/US2017/040575, 13 pages. |
Number | Date | Country | |
---|---|---|---|
20190020678 A1 | Jan 2019 | US |