Container networking using communication tunnels

Information

  • Patent Grant
  • 10904342
  • Patent Number
    10,904,342
  • Date Filed
    Monday, July 30, 2018
    5 years ago
  • Date Issued
    Tuesday, January 26, 2021
    3 years ago
Abstract
Systems, methods, and computer-readable media for enabling container networking are disclosed. In one aspect, a method includes receiving a request from a first network container on a source server to establish a data session with a second network container on a destination server; determining a destination switch of the destination server based on the request; identifying a communication tunnel between the source server and the destination server; generating a data stream to be embedded in the pre-established communication tunnel, wherein a communication protocol associated with the request is different from a communication protocol used by the data stream; receiving a data packet to be sent to the destination container; mapping the data packet to the data stream; and sending the data packet to the destination server via the data stream over the communication tunnel.
Description
TECHNICAL FIELD

The present technology pertains in general to interconnecting containers for micro-service based applications and more specifically to enabling traffic flow and data communication between network containers hosted on different physical hosts without performing a handshake process for establishing a communication channel therebetween.


BACKGROUND

With the introduction of microservices architecture into cloud computing, it is now common to see different services of an application distributed into different containers. For example, in a service chaining environment, it is common to see different service functions instantiated as different containers over one or more physical hosts/servers.


Traffic between such containers is usually carried with Secure Socket Layer (SSL)/Transport Layer Security (TSL) encoded traffic on top of Hyper Text Transfer Protocol (HTTP)1/2 layers. This transport requires a handshake process to be completed between containers, which consume a significant number of CPU cycles. Considering highly meshed applications and services, a number of requested and active Transport Control Protocol (TCP) connections between containers grows with a square of the number of containers (e.g., by (N(N−1)/2, with N being the number of containers).


Furthermore, in such highly meshed applications and with multiple micro-services implementing such applications, the number of active flows increases. This increase is problematic for some Network Fabric elements that cannot scale with the increase of number of flows such as Natural Address Translation (NAT), Load Balancing, Reflexive Access Lists (ACLs) elements. For example, there can be increased latency and CPU cycles used to setup connections between containers and there can be a large number of flows and states used for container networking in Network fabrics.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1A illustrates an example cloud computing architecture, according to one aspect of the present disclosure;



FIG. 1B illustrates an example fog computing architecture, according to one aspect of the present disclosure;



FIG. 2 illustrates a schematic diagram of an example network architecture, according to one aspect of the present disclosure;



FIG. 3 illustrates an example structure of containers instantiated over two physical hosts, according to one aspect of the present disclosure;



FIG. 4 is a method of container networking, according to one aspect of the present disclosure; and



FIG. 5 illustrates an example system including various hardware computing components, according to an aspect of the present disclosure.





DETAILED DESCRIPTION

Various example embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure. Thus, the following description and drawings are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding of the disclosure. However, in certain instances, well-known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure can be references to the same embodiment or any embodiment; and, such references mean at least one of the embodiments.


Reference to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others.


The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Alternative language and synonyms may be used for any one or more of the terms discussed herein, and no special significance should be placed upon whether or not a term is elaborated or discussed herein. In some cases, synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and is not intended to further limit the scope and meaning of the disclosure or of any example term. Likewise, the disclosure is not limited to various embodiments given in this specification.


Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods and their related results according to the embodiments of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the disclosure. Unless otherwise defined, technical and scientific terms used herein have the meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions will control.


Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.


As referenced herein, a Function Router can include a service that provides for registration and management of execution endpoints, FaaS services, functions, clients, locations, and routing rules on an account. The Function Router can receive requests for function execution from clients and dynamically route them to the ‘best’ endpoint to execute that function based on defined rules.


An Execution Endpoint (EE) can include a compute-capable system that can run functions. Non-limiting examples can include computers, laptops, IoT devices, servers, switches (e.g., virtual switches and routers (vswitches/vrouters), mobile phones, kiosks, workstations, etc. EEs can be registered in the Function Router for use in executing functions. Execution endpoints can run various FaaS runtime environments and services.


A client can include a device and/or application seeking to execute a function on an Execution Endpoint. Non-limiting examples of a client can include a robot arm, mobile phone, hand scanner, application, printer, kiosk, etc.


A function can include a piece of code. The piece of code can represent, for example, an ephemeral, self-contained set of business logic. Serverless functions can be compared to stored procedures in that they do a specific thing, and are called and executed when needed, only to go back to being dormant (but ready) when execution completes.


A location can include a physical location (e.g., a building, a floor, etc.) and/or a logical location. A location can be associated with specific latitude and longitude coordinates. For example, a location can refer to specific latitude and longitude coordinates corresponding to the manufacturing floor where a robot resides or a conference room where an FaaS device is plugged in, or a region associated with an environment.


Function routing rules can include policies and controls around who, what, when, where, why, and/or how for function execution. The rules can include IT-defined guardrails that affect the entire system, and other rules specified by IT or a development team for a specific function. Example rules can include: Function A can run on any endpoint but Function B must only run on a private endpoint; or Function A can be called by any client in a specific location, but function B can only be called by specific clients in any location.


Overview


Disclosed are systems, methods, and computer-readable media for enabling traffic flow and data communication between network containers hosted on different physical hosts without performing a handshake process for establishing a communication channel therebetween.


In one aspect of the present disclosure, a method includes receiving, at a source switch, a request from a first network container on a source server to establish a data session with a second network container on a destination server; determining, by the source switch, a destination switch of the destination server based on the request; identifying, by the source switch, a pre-established communication tunnel between the source server and the destination server; generating, by the source switch, a data stream to be embedded in the pre-established communication tunnel, wherein a communication protocol associated with the request is different from a communication protocol used by the data stream for communicating data between the first and second network containers; receiving a data packet, at the source switch, to be sent to the destination container; mapping, by the source switch, the data packet to the data stream; and sending, by the source switch, the data packet to the destination server via the data stream over the communication tunnel.


In one aspect of the present disclosure, a device includes one or more network containers implemented thereon and a network switch configured that is configured to receive a request from a first network container of the one or more network containers on the server to establish a data session with a second network container on a destination server; determine a destination switch of the destination network based on the request; identify a communication tunnel between the server and the destination server; generate a data stream to be embedded in the communication tunnel for exchange of data packets between the first network container and the second network container, wherein a communication protocol associated with the request received from the first network container is different from a communication protocol used by the data stream for facilitating the exchange of data packets between the first and second network containers; receive a data packet from the first network container to be sent to the destination container; map the data packet to the data stream; and send the data packet to the destination server via the data stream over the communication tunnel.


In one aspect of the present disclosure, one or more non-transitory computer-readable medium have computer-readable instructions stored thereon, which when executed by one or more processors, cause the one or more processors to function as a virtual switch of a server to receive a request from a first network container on the server to establish a transfer control protocol (TCP) session with a second network container on a destination server; determine a destination switch of the destination network based on the request; identify a communication tunnel between the server and the destination server; generate a data stream to be embedded in the communication tunnel for exchange of data packets between the first network container and the second network container, wherein a communication used by the data stream for facilitating the exchange of data packets between the first and second network containers is different from a TCP protocol used for the TCP session; receive a TCP data packet from the first network container to be sent to the destination container; map the TCP data packet to the data stream; and transmit the TCP data packet to the destination server via the data stream over the communication tunnel.


DETAILED DESCRIPTION

The disclosed technology addresses the need in the art for reducing latency and CPU cycles used to setup connections between network containers and the large number of flows and states used for container networking in Network fabrics.


The disclosure begins with a description of example network environments and architectures which can be implemented for serverless computing and service function chaining, as illustrated in FIGS. 1A, 1B, and 2, is first disclosed herein.



FIG. 1A illustrates an example cloud computing architecture, according to one aspect of the present disclosure. FIG. 1A illustrates a diagram of an example cloud computing architecture 100 or simply architecture 100. Architecture 100 can include a cloud 102. Cloud 102 can include one or more private clouds, public clouds, and/or hybrid clouds. Moreover, cloud 102 can include cloud elements 104-114. Cloud elements 104-114 can include, for example, servers 104, virtual machines (VMs) 106, one or more software platforms 108, applications or services 110, software containers 112, and infrastructure nodes 114. The infrastructure nodes 114 can include various types of nodes, such as compute nodes, storage nodes, network nodes, management systems, etc.


Cloud 102 can provide various cloud computing services via cloud elements 104-114, such as software as a service (SaaS) (e.g., collaboration services, email services, enterprise resource planning services, content services, communication services, etc.), infrastructure as a service (IaaS) (e.g., security services, networking services, systems management services, etc.), platform as a service (PaaS) (e.g., web services, streaming services, application development services, etc.), function as a service (FaaS), and other types of services such as desktop as a service (DaaS), information technology management as a service (ITaaS), managed software as a service (MSaaS), mobile backend as a service (MBaaS), etc.


Client endpoints 116 can connect with cloud 102 to obtain one or more specific services from cloud 102. Client endpoints 116 can communicate with elements 104-114 via one or more public networks (e.g., Internet), private networks, and/or hybrid networks (e.g., virtual private network). Client endpoints 116 can include any device with networking capabilities, such as a laptop computer, a tablet computer, a server, a desktop computer, a smartphone, a network device (e.g., an access point, a router, a switch, etc.), a smart television, a smart car, a sensor, a GPS device, a game system, a smart wearable object (e.g., smartwatch, etc.), a consumer object (e.g., Internet refrigerator, smart lighting system, etc.), a city or transportation system (e.g., traffic control, toll collection system, etc.), an internet of things (IoT) device, a camera, a network printer, a transportation system (e.g., airplane, train, motorcycle, boat, etc.), or any smart or connected object (e.g., smart home, smart building, smart retail, smart glasses, etc.), and so forth.



FIG. 1B illustrates an example fog computing architecture, according to one aspect of the present disclosure. FIG. 1B illustrates a diagram of an example fog computing architecture 150. Fog computing architecture 150 can include cloud layer 154, which includes cloud 102 and any other cloud system or environment, and fog layer 156, which includes fog nodes 162. Client endpoints 116 can communicate with cloud layer 154 and/or fog layer 156. Architecture 150 can include one or more communication links 152 between cloud layer 154, fog layer 156, and client endpoints 116. Communications can flow up to cloud layer 154 and/or down to client endpoints 116.


Fog layer 156 or “the fog” provides the computation, storage and networking capabilities of traditional cloud networks, but closer to the endpoints. Fog 156 can thus extend cloud 102 to be closer to client endpoints 116. Fog nodes 162 can be the physical implementation of fog networks. Moreover, fog nodes 162 can provide local or regional services and/or connectivity to the client endpoints 116. As a result, traffic and/or data can be offloaded from cloud 102 to fog layer 156 (e.g., via fog nodes 162). Fog layer 156 can thus provide faster services and/or connectivity to client endpoints 116, with lower latency, as well as other advantages such as security benefits from keeping the data inside the local or regional network(s).


Fog nodes 162 can include any networked computing devices, such as servers, switches (e.g., vswitches/vrouters), routers, controllers, cameras, access points, kiosks, gateways, etc. Moreover, fog nodes 162 can be deployed anywhere with a network connection, such as a factory floor, a power pole, alongside a railway track, in a vehicle, on an oil rig, in an airport, on an aircraft, in a shopping center, in a hospital, in a park, in a parking garage, in a library, etc.


In some configurations, one or more fog nodes 162 can be deployed within fog instances 158, 160. Fog instances 158, 160 can be local or regional clouds or networks. For example, fog instances 158, 160 can be a regional cloud or data center, a local area network, a network of fog nodes 162, etc. In some configurations, one or more fog nodes 162 can be deployed within a network, or as standalone or individual nodes, for example. Moreover, one or more of fog nodes 162 can be interconnected with each other via links 164 in various topologies, including star, ring, mesh or hierarchical arrangements, for example.


In some cases, one or more fog nodes 162 can be mobile fog nodes. The mobile fog nodes can move to different geographic locations, logical locations or networks, and/or fog instances while maintaining connectivity with cloud layer 154 and/or endpoints 116. For example, a particular fog node can be placed in a vehicle, such as an aircraft or train, which can travel from one geographic location and/or logical location to a different geographic location and/or logical location. In this example, the particular fog node may connect to a particular physical and/or logical connection point with cloud 154 while located at the starting location and switch to a different physical and/or logical connection point with cloud 154 while located at the destination location. The particular fog node can thus move within particular clouds and/or fog instances and, therefore, serve endpoints from different locations at different times.



FIG. 2 illustrates a schematic diagram of an example network architecture, according to one aspect of the present disclosure. FIG. 2 illustrates example network architecture 200. In some examples, the architecture 200 can include a data center, which can support and/or host cloud 102. Moreover, architecture 200 includes a network fabric 212 with spines 202A, 202B, . . . , 202N (collectively “202”) connected to leafs 204A, 204B, 204C, . . . , 204N (collectively “204”) in network fabric 212. Spines 202 and leafs 204 can be Layer 2 and/or Layer 3 devices, such as vswitches or vrouters. For the sake of clarity, they will be referenced herein as spine switches 202 and leaf switches 204.


Spine switches 202 can connect to leaf switches 204 in fabric 212. Leaf switches 204 can include access ports (or non-fabric ports) and fabric ports. Fabric ports can provide uplinks to spine switches 202, while access ports can provide connectivity for devices, hosts, endpoints, VMs, or external networks to fabric 212.


Leaf switches 204 can reside at the boundary between fabric 212 and the tenant or customer space. Leaf switches 204 can route and/or bridge the tenant packets and apply network policies. In some cases, a leaf switch can perform one or more additional functions, such as implementing a mapping cache, sending packets to the proxy function when there is a miss in the cache, encapsulate packets, enforce ingress or egress policies, etc.


Moreover, leaf switches 204 can contain virtual switching and/or tunneling functionalities, such as a virtual tunnel endpoint (VTEP) function. Thus, leaf switches 204 can connect fabric 212 to an overlay (e.g., VXLAN network).


Network connectivity in fabric 212 can flow through leaf switches 204. Leaf switches 204 can provide servers, resources, endpoints, external networks, containers, or VMs access to fabric 212, and can connect leaf switches 204 to each other. Leaf switches 204 can connect applications and/or endpoint groups (“EPGs”) to other resources inside or outside of fabric 212 as well as any external networks.


Endpoints 210A-E (collectively “210”) can connect to fabric 212 via leaf switches 204. For example, endpoints 210A and 210B can connect directly to leaf switch 204A, which can connect endpoints 210A and 210B to fabric 212 and/or any other of leaf switches 204. Similarly, endpoint 210E can connect directly to leaf switch 204C, which can connect endpoint 210E to fabric 212 and/or any other of leaf switches 204. On the other hand, endpoints 210C and 210D can connect to leaf switch 204A and 204B via network 206. Moreover, wide area network (WAN) 208 can connect to leaf switches 204N.


Endpoints 210 can include any communication device or resource, such as a computer, a server, a cluster, a switch, a container, a VM, a virtual application, etc. In some cases, endpoints 210 can include a server or switch configured with a virtual tunnel endpoint functionality which connects an overlay network with fabric 212. For example, in some cases, endpoints 210 can represent hosts (e.g., servers) with virtual tunnel endpoint capabilities, and running virtual environments (e.g., hypervisor, virtual machine(s), containers, etc.). An overlay network associated with the endpoints 210 can host physical devices, such as servers; applications; EPGs; virtual segments; virtual workloads; etc. Likewise, endpoints 210 can also host virtual workloads and applications, which can connect with fabric 212 or any other device or network, including an external network.



FIG. 3 illustrates an example structure of containers instantiated over two physical hosts, according to one aspect of the present disclosure.


Environment 300 includes two physical hosts 302 and 304 (which can be the same as two of servers 104 shown in and described with reference to FIG. 1A). Each one of physical hosts 302 and 304 can have a Contiv HostAgent operating thereon such as Contiv HostAgents 306 and 308. Contiv HostAgents 306 and 308 can deliver policy-based management of various service functions deployed/instantiated as containers on a corresponding physical host.


Physical host 302 can have one or more containers (network containers) instantiated thereon such as containers 310, 312, 314 and/or 316. A container may also be referred to as a Point of Delivery (pod). For example, each container 310, 312, 314 can provide one service function (SF) such as one of SF1, SF2 or SF3 on physical host 302. Furthermore, physical host 302 can have a service function forwarder (SFF) 316, provided by a separate container running on physical host 302 or alternatively provided by one of containers 310, 312, 314 providing SF1, SF2 and/or SF3 that can direct data traffic and tasks to different containers depending on the specific function to be performed. Each of containers 310, 213, 314,316 can interface with Contiv HostAgent 306 via a virtual port thereof (i.e., one of ETH0-ETH4) and corresponding virtual ports of Contiv HostAgent 306 (i.e., one of Vport1-Vport4). Similarly, physical host 304 can have a SF4 running on container 318. Container 318 can also act as a SFF in a similar manner as SFF running on container 316. Container 318 can interface with Contiv HostAgent 308 via a virtual port thereof (i.e., ETH5) and corresponding virtual port of Contiv HostAgent 308 (i.e., Vport5).


Physical host 302 may have a physical port 320 through which data from client end points such as client endpoints 116 of FIG. 1A are received via cloud 322. For example, cloud 322 can be cloud 102 of FIG. 1A or fog 156 of FIG. 1B. Incoming data may be sent to container 316 (SFF) to be directed to one or more of containers 310, 312, 314 and/or 318 for servicing. An example data flow 323 through physical hosts 302/304 and containers 310, 312, 314, 316, 318 is shown in FIG. 3. However, inventive concepts are not limited thereto.


Furthermore, physical host 302 can have a switch 324 which may be a physical or virtual switch (vswitch) for establishing connection with other network components such as physical host 304 and container 318 running thereon. Similarly, physical host 304 can have a switch 326 which may be a physical or a virtual switch (vswitch) for establishing connection with other network components such as physical host 302 and containers 310, 312, 314, 316 running thereon.


In one example, SF1-SF4 provide a firewall service to one or more customers such as client endpoints 116 of FIG. 1A. Accordingly, in the example of FIG. 3, different service functions are instantiated as different ones of containers 310, 312, 314 and 318 on two different physical hosts, namely physical hosts 302 and 304. This distribution of service functions over different physical hosts can be due to, for example, high demand for particular service function being provided by a container on a given physical host and can be done for purposes of load balancing.


Accordingly, one of more of containers 310, 312, 314 on physical host 302 may attempt to establish a connection with container 318 on physical host 304. As briefly mentioned above, data traffic between such containers is usually carried via Secure Socket Layer (SSL)/Transport Layer Security (TSL) encoded traffic on top of Hyper Text Transfer Protocol (HTTP)1/2 layers. This transport requires a handshake process to be completed between containers, which consumes a significant number of CPU cycles. Considering highly meshed applications and services, a number of requested and active Transport Control Protocol (TCP) connections between containers grows with a square of the number of containers (e.g., by (N(N−1)/2, with N being the number of containers). Furthermore, in such highly meshed applications and multiple containers implementing such applications, the number of active flows increases. This increase is problematic for some Network Fabric elements that cannot scale with the increase of number of flows such as Natural Address Translation (NAT), Load Balancing, Reflexive Access Lists (ACLs) elements.


Hereinafter a process will be described for establishing a data communication session between network containers without performing the handshake process. This will be further described below with reference to FIG. 4.


For the functionalities, which will be described with reference to FIG. 4, the following assumptions can be taken into consideration: First, a server, physical or virtual such as physical host 302 or 304, has one virtual switch/router (vswitches 324 or 326, respectively) and has at least one IPv4 or IPv6 address. Second, a network container has at least one IPv4 or IPv6 address associated therewith. Third, when a server/physical host joins a cluster of servers/physical hosts, the joining server/physical host establishes an HTTP2 tunnel over a SSL connection to every other server in the cluster, such as tunnel 328 between physical hosts 302 and 304. Another example communication tunnel over a SSL connection is a Quick User Datagram Protocol (UDP) Internet Connection (QUIC) tunnel. While HTTP2 and QUIC are provided as example protocols for establishing communication tunnels over a SSL connection, the present disclosure is not limited thereto and any other known, or to be developed, applicable communication protocol may be used.


While FIG. 3 illustrates only two physical hosts, as the number of physical hosts increase, it is easy to see that any two physical host can be connected via a communication tunnel such as tunnel 328, thus resulting in a mesh of tunnels, each having one or more data streams embedded therein for establishing a data session between containers residing on the two corresponding physical hosts.


With the above assumptions, the disclosure now turns to FIG. 4. FIG. 4 is a method of container networking, according to some aspects of the present disclosure. FIG. 4 will be described from the perspective of switch 324 of physical host 302. However, it is readily ascertainable that the method of FIG. 4 can be implemented by switch 326 of physical host 304 or a switch of any other network connected server/physical host providing resources for running container-based services and applications. Furthermore, in describing FIG. 4, switch 324 may be referred as the source switch, switch 326 may be referred to as the destination switch, physical host 302 may be referred to as the source server and physical host 304 may be referred to as the destination server.


At S400, switch 324 receives a connection request from a first container (e.g., one of containers 310, 312, 314, 316 hosted on physical host 302) to establish a data session with a second container (e.g., container 318 hosted on physical host 304). This connection and the requested data session can also be referred to as a container-to-container connection request and a container-to-container data session. The requested data session may be a TCP session to the second container for exchanging data.


In one example, as part of the connection request, switch 324 receives a TCP synchronization (TCP SYN) packet from the first container. TCP SYN packet can include various information including, but not limited to, an IP address of container 318 (second container), which can be a virtual or actual IP address assigned to container 318. This may be referred to as the destination IP address.


In one example, if the destination IP address is a virtual IP address, switch 324 may assign an actual (physical) IP address of the destination container 318 thereto using any known or to be developed selection algorithm (e.g., cluster IP mode implemented in Kubernetes or Contiv-VPP).


In one example, and upon receiving the connection request, switch 324 can establish a TCP session between first network container, from which the connection request is received at S400 and switch 324.


At S402, switch 324 identifies a switch (a destination switch) of the destination server based on the destination IP address. Included in the TCP SYN packet. This can be switch 326 of physical host 304 in FIG. 3.


In one example, each of the source switch (e.g., switch 324) and the destination switch (e.g., switch 326) can be a virtual switch/virtual router or a physical switch/physical router.


At S404 and after identifying the destination server and destination switch at S402, switch 324 identifies a pre-established/existing communication tunnel between the source and destination servers (e.g., the HTTP2 tunnel 328 of FIG. 3 established between physical host 302 and physical host 304).


At S406, switch 324 generates a data stream to be embedded in the communication tunnel for communicating data packets (e.g., TCP data packets) received from the source container to be sent to the destination. The data stream may be an HTTP2 stream in the HTTP2 tunnel. In one example, switch 324 generates the HTTP2 stream by creating a packet using a “:connect” method in a header field of the packet and including the destination IP address and ports (e.g., virtual ports connection Contiv HostAgent 306 to the source container (e.g., one of containers 310, 312, 314, 316), which can be extracted from the TCP SYN packet.


In another example and when a QUIC stream in a QUIC tunnel is used instead of HTTP2, appropriate QUIC headers and methods may be utilized to generate the data stream.


Accordingly, the communication protocol used by the data stream for sending and receiving data between physical hosts 302 and 304 is different from the communication protocol originally requested by the source container at S400 (e.g., HTTP2 v. TCP).


In one example, switch 324 (the source switch) has a flow table created for mapping 5-tuple of container to container TCP connection requested at S400 to an identifier of the HTTP2 stream.


Having established the HTTP2 stream, at S408, switch 324 receives data packets from the source container (e.g., one of containers 310, 312, 314, 316).


In one example, at S408, the data packet received by switch 324 can be an outgoing TCP data packet originating from the source container and destined for the destination container, as described above. In the alternative, the data packet received by switch 324 at S408 can be an incoming HTTP2 Data (or alternatively, QUIC data), which was originally sent by another container (e.g., container 318) hosted on a different server (e.g., physical host 304) as a TCP data packet but converted and transmitted by the switch (e.g., switch 326) of the different server into HTTP2 data before transmission thereof to switch 324 and ultimately to the target container (e.g., one of containers 310, 312, 314, 316 hosted on physical host 302).


Therefore, at S410, switch 324 determines if a received data packet is an outgoing packet or an incoming packet. If at S410, switch 324 determines that the packet is an outgoing TCP data packet, then at S412, switch 324 extracts the payload of the TCP data packet received at S408 and embeds the same into data packets portion of the HTTP2 stream.


In one example and at any given point, switch 324 may have multiple HTTP2 sessions created, all of which can be multiplexed onto the HTTP2 tunnel destined for the destination server and containers hosted thereon. Therefore, using the flow table, switch 324 can manage the incoming/outgoing data packets and map them to the correct HTTP2 streams.


Thereafter, at S414, switch 324 sends the HTTP2 stream over the HTTP2 tunnel to the destination switch (e.g., switch 326). By using the HTTP2 session over an existing HTTP2 tunnel, the need for establishing a TCP connection between the source and destination containers and the underlying handshake process is eliminated.


At S416, switch 324 determines if the data session (e.g., the TCP session) has been terminated. Switch 324 may determine the termination of the TCP session by receiving a notification of termination from the source container.


If at S416, switch 324 determines that the TCP session is still active/alive (NO at S416), the process reverts back to S408 and switch 324 continues to receive TCP packets. However, if at S416, switch 324 determines that the TCP session is terminated, then at S418, switch 324 closes the data stream (HTTP2 stream) and updates the flow table accordingly (e.g., removes the corresponding TCP connection-HTTP2 stream mapping entry from the flow table).


Referring back to S410, if switch 324 determines that the received packet is an incoming HTTP2 data packet, then at S420, switch 324 extracts the data from the received HTTP2 data packet and embeds the same into an existing TCP data packet to be sent to the target container (e.g., one of containers 310, 312, 314, 316) for which a TCP session with switch 324 is active. Thereafter, the process reverts back to S416 and S416 and S418 are repeated.


The process of FIG. 4 can provide the following advantages. First, the number of active and open TCP sessions grows with the square of the number of servers/physical hosts in a cluster of connected servers and not the square of the number of containers (there can be multiple containers on a single physical host). Given that containers are spawned very frequently to provide services, persistent connections between the containers are no longer needed but instead existing persistent connection between their physical hosts to create “as-needed” container-to-container connections as streams embedded in an HTTP2 tunnel between physical hosts.


Second, connections between source and destination containers are no longer visible at the physical infrastructure since they are tunneled through HTTP2 streams established on-demand. Furthermore, TCP connections between containers and hence the network resource consuming handshake process thereof are also eliminated, which reduces the number of flows in the network Fabric generated as a result of the large number of containers that implement highly meshed applications


The disclosure now turns to FIG. 5, which illustrates an example device. These example device can function as any one of network components such as physical host 302 and/or 304 of FIG. 3 to enable instantiation of containers that in turn provide service functions to end client devices and perform the above described method of FIG. 4.



FIG. 5 illustrates an example system including various hardware computing components, according to an aspect of the present disclosure. The more appropriate embodiment will be apparent to those of ordinary skill in the art when practicing the present technology. Persons of ordinary skill in the art will also readily appreciate that other system embodiments are possible.



FIG. 5 illustrates a system bus computing system architecture 500 wherein the components of the system are in electrical communication with each other using a connection 506. Exemplary system 500 includes a processing unit (CPU or processor) 504 and a system connection 506 that couples various system components including the system memory 520, such as read only memory (ROM) 518 and random access memory (RAM) 516, to the processor 504. The system 500 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 504. The system 500 can copy data from the memory 520 and/or the storage device 508 to the cache 502 for quick access by the processor 504. In this way, the cache can provide a performance boost that avoids processor 504 delays while waiting for data. These and other modules can control or be configured to control the processor 504 to perform various actions. Other system memory 520 may be available for use as well. The memory 520 can include multiple different types of memory with different performance characteristics. The processor 504 can include any general purpose processor and a service component, such as service 1510, service 2512, and service 3514 stored in storage device 508, configured to control the processor 504 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 504 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing device 500, an input device 522 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 524 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 the computing device 500. The communications interface 526 can generally govern and manage the user input and system output. There is 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 508 is 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) 516, read only memory (ROM) 518, and hybrids thereof.


The system 500 can include an integrated circuit 528, such as an application-specific integrated circuit (ASIC) configured to perform various operations. The integrated circuit 528 can be coupled with the connection 506 in order to communicate with other components in the system 500.


The storage device 508 can include software services 510, 512, 514 for controlling the processor 504. Other hardware or software modules are contemplated. The storage device 508 can be connected to the system connection 506. In one aspect, a hardware module 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 the processor 504, connection 506, output device 524, and so forth, to carry out the function.


For clarity of explanation, in some instances the present technology 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 example 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 examples can be implemented using computer-executable instructions that are 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 that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures 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, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented 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 was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied 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 some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood 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.


Claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A and B” means A, B, or A and B.

Claims
  • 1. A method comprising: receiving, at a source switch, a request from a first network container on a source server to establish a data session with a second network container on a destination server;identifying, by the source switch, a pre-established communication tunnel between the source server and the destination server;generating, by the source switch, a data stream to be embedded in the pre-established communication tunnel, wherein a communication protocol associated with the request is different from a communication protocol used by the data stream for communicating data between the first network container and the second network container;receiving a data packet, at the source switch, to be sent to the destination server;mapping, by the source switch, the data packet to the data stream; andsending, by the source switch, the data packet to the destination server via the data stream over the communication tunnel.
  • 2. The method of claim 1, wherein the data session requested by the first network container is a transmission control protocol (TCP) session.
  • 3. The method of claim 2, further comprising: determining, by the source switch, a destination switch of the destination server based on the request, wherein determining the destination switch is based on an IP address included in a TCP SYN packet received as part of the request.
  • 4. The method of claim 2, wherein mapping the data packet to the data stream is based on a flow table that maps a 5-tuple of the TCP session to the data stream.
  • 5. The method of claim 1, wherein the communication tunnel is a Hyper Text Transfer Protocol 2 (HTTP2) tunnel and the data stream is an HTTP2 stream; orthe communication tunnel is a Quick UDP Internet Connection (QUIC) tunnel and the data stream is a QUIC stream; andthe communication tunnel is part of a mesh of communication tunnels between a pair of servers, each communication tunnel being configured to have at least one data stream embedded therein for enabling communication between two network containers on a corresponding pair of servers.
  • 6. The method of claim 1, wherein mapping the data packet to the data stream comprises: extracting payload of the data packet to yield extracted payload; andembedding the extracted payload into a data field of the data stream.
  • 7. The method of claim 1, further comprising: determining whether the data session has been terminated or not; andin response to determining that the data session has been terminated, closing the data stream and updating a corresponding flow table for maintaining mapping of one or more data sessions to one or more data streams.
  • 8. A device comprising: one or more network containers implemented thereon; anda network switch configured to: receive a request from a first network container of the one or more network containers on the server to establish a data session with a second network container on a destination server;identify a communication tunnel between the server and the destination server;generate a data stream to be embedded in the communication tunnel for exchange of data packets between the first network container and the second network container, wherein a communication protocol associated with the request received from the first network container is different from a communication protocol used by the data stream for facilitating the exchange of data packets between the first network container and the second network container;receive a data packet from the first network container to be sent to the destination server;map the data packet to the data stream; andsend the data packet to the destination server via the data stream over the communication tunnel.
  • 9. The device of claim 8, wherein the switch is a virtual switch.
  • 10. The device of claim 8, wherein the data session requested by the first network container is a transmission control protocol (TCP) session.
  • 11. The device of claim 10, wherein the switch is configured to determine the destination switch based on an IP address included in a TCP SYN packet received as part of the request.
  • 12. The device of claim 10, wherein the switch is configured to map the data packet to the data stream based on a flow table that maps a 5-tuple of the TCP session to the data stream.
  • 13. The device of claim 8, wherein the communication tunnel is a Hyper Text Transfer Protocol 2 (HTTP2) tunnel and the data stream is an HTTP2 stream; orthe communication tunnel is a Quick UDP Internet Connection (QUIC) tunnel and the data stream is a QUIC stream; andthe communication tunnel is part of a mesh of communication tunnels between a pair of servers, each communication tunnel being configured to have at least one data stream embedded therein for enabling communication between two network containers on a corresponding pair of servers.
  • 14. The device of claim 8, wherein the switch is configured to map the data packet to the data stream by: extracting payload of the data packet to yield extracted payload; andembedding the extracted payload into a data field of the data stream.
  • 15. The device of claim 8, wherein the switch is further configured to: determine whether the data session has been terminated or not; andin response to determining that the data session has been terminated, close the data stream and update a corresponding flow table for maintaining mapping of one or more data sessions to one or more data streams.
  • 16. The device of claim 8, wherein multiple data streams are multiplexed onto the communication tunnel for carrying data packets to the destination server.
  • 17. One or more non-transitory computer-readable medium having computer-readable instructions stored therein, which when executed by one or more processors, cause the one or more processors to function as a virtual switch of a server to: receive a request from a first network container on the server to establish a transfer control protocol (TCP) session with a second network container on a destination server;identify a communication tunnel between the server and the destination server;generate a data stream to be embedded in the communication tunnel for exchange of data packets between the first network container and the second network container, wherein a communication used by the data stream for facilitating the exchange of data packets between the first network container and the second network container is different from a TCP protocol used for the TCP session;receive a TCP data packet from the first network container to be sent to the destination container;map the TCP data packet to the data stream; andtransmit the TCP data packet to the destination server via the data stream over the communication tunnel.
  • 18. The one or more non-transitory computer-readable medium of claim 17, wherein the virtual switch is configured to map the TCP data packet to the data stream based on a flow table that maps a 5-tuple of the TCP session to the data stream.
  • 19. The one or more non-transitory computer-readable medium of claim 17, wherein the communication tunnel is a Hyper Text Transfer Protocol 2 (HTTP2) tunnel and the data stream is an HTTP2 stream; orthe communication tunnel is a Quick UDP Internet Connection (QUIC) tunnel and the data stream is a QUIC stream; andthe communication tunnel is part of a mesh of communication tunnels between a pair of servers, each communication tunnel being configured to have at least one data stream embedded therein for enabling communication between two network containers on a corresponding pair of servers.
  • 20. The one or more non-transitory computer-readable medium of claim 17, wherein the virtual switch is configured to: determine whether the data session has been terminated or not; andin response to determining that the data session has been terminated, close the data stream and update a corresponding flow table for maintaining mapping of one or more data sessions to one or more data streams.
US Referenced Citations (431)
Number Name Date Kind
5812773 Norin Sep 1998 A
5825772 Dobbins Oct 1998 A
5889896 Meshinsky et al. Mar 1999 A
6108782 Fletcher et al. Aug 2000 A
6178453 Mattaway et al. Jan 2001 B1
6298153 Oishi Oct 2001 B1
6343290 Cossins et al. Jan 2002 B1
6643260 Kloth et al. Nov 2003 B1
6683873 Kwok et al. Jan 2004 B1
6721804 Rubin et al. Apr 2004 B1
6733449 Krishnamurthy et al. May 2004 B1
6735631 Oehrke et al. May 2004 B1
6996615 McGuire Feb 2006 B1
7054930 Cheriton May 2006 B1
7058706 Lyer et al. Jun 2006 B1
7062571 Dale et al. Jun 2006 B1
7111177 Chauvel et al. Sep 2006 B1
7212490 Kao et al. May 2007 B1
7277948 Igarashi et al. Oct 2007 B2
7313667 Pullela et al. Dec 2007 B1
7379846 Williams et al. May 2008 B1
7480672 Hahn et al. Jan 2009 B2
7496043 Leong et al. Feb 2009 B1
7536476 Alleyne May 2009 B1
7567504 Darling et al. Jul 2009 B2
7583665 Duncan et al. Sep 2009 B1
7606147 Luft et al. Oct 2009 B2
7606929 Gbadegesin Oct 2009 B2
7644437 Volpano Jan 2010 B2
7647594 Togawa Jan 2010 B2
7773510 Back et al. Aug 2010 B2
7808897 Mehta et al. Oct 2010 B1
7881957 Cohen et al. Feb 2011 B1
7917647 Cooper et al. Mar 2011 B2
8010598 Tanimoto Aug 2011 B2
8028071 Mahalingam et al. Sep 2011 B1
8041714 Aymeloglu et al. Oct 2011 B2
8121117 Amdahl et al. Feb 2012 B1
8171415 Appleyard et al. May 2012 B2
8234377 Cohn Jul 2012 B2
8244559 Horvitz et al. Aug 2012 B2
8250215 Stienhans et al. Aug 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8284664 Aybay et al. Oct 2012 B1
8301746 Head et al. Oct 2012 B2
8345692 Smith Jan 2013 B2
8406141 Couturier et al. Mar 2013 B1
8407413 Yucel et al. Mar 2013 B1
8448171 Donnellan et al. May 2013 B2
8477610 Zuo et al. Jul 2013 B2
8495356 Ashok et al. Jul 2013 B2
8495725 Ahn Jul 2013 B2
8510469 Portolani Aug 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8533687 Greifeneder et al. Sep 2013 B1
8547974 Guruswamy et al. Oct 2013 B1
8560639 Murphy et al. Oct 2013 B2
8560663 Baucke et al. Oct 2013 B2
8589543 Dutta et al. Nov 2013 B2
8590050 Nagpal et al. Nov 2013 B2
8611356 Yu et al. Dec 2013 B2
8612625 Andreis et al. Dec 2013 B2
8630291 Shaffer et al. Jan 2014 B2
8639787 Lagergren et al. Jan 2014 B2
8656024 Krishnan et al. Feb 2014 B2
8660129 Brendel et al. Feb 2014 B1
8719804 Jain May 2014 B2
8775576 Hebert et al. Jul 2014 B2
8797867 Chen et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8850002 Dickinson et al. Sep 2014 B1
8850182 Fritz et al. Sep 2014 B1
8856339 Mestery et al. Oct 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8938775 Roth et al. Jan 2015 B1
8959526 Kansal et al. Feb 2015 B2
8977754 Curry, Jr. et al. Mar 2015 B2
9009697 Breiter et al. Apr 2015 B2
9015324 Jackson Apr 2015 B2
9043439 Bicket et al. May 2015 B2
9049115 Rajendran et al. Jun 2015 B2
9063789 Beaty et al. Jun 2015 B2
9065727 Liu et al. Jun 2015 B1
9075649 Bushman et al. Jul 2015 B1
9130846 Szabo et al. Sep 2015 B1
9164795 Vincent Oct 2015 B1
9167050 Durazzo et al. Oct 2015 B2
9201701 Boldyrev et al. Dec 2015 B2
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244776 Koza et al. Jan 2016 B2
9251114 Ancin et al. Feb 2016 B1
9264478 Hon et al. Feb 2016 B2
9294408 Dickinson et al. Mar 2016 B1
9313048 Chang et al. Apr 2016 B2
9361192 Smith et al. Jun 2016 B2
9379982 Krishna et al. Jun 2016 B1
9380075 He et al. Jun 2016 B2
9432245 Sorenson, III et al. Aug 2016 B1
9432294 Sharma et al. Aug 2016 B1
9444744 Sharma et al. Sep 2016 B1
9473365 Melander et al. Oct 2016 B2
9503530 Niedzielski Nov 2016 B1
9558078 Farlee et al. Jan 2017 B2
9571570 Mutnuru Feb 2017 B1
9613078 Vermeulen et al. Apr 2017 B2
9628471 Sundaram et al. Apr 2017 B1
9658876 Chang et al. May 2017 B2
9692802 Bicket et al. Jun 2017 B2
9755858 Bagepalli et al. Sep 2017 B2
9847938 Chanda et al. Dec 2017 B2
10498654 Shalev Dec 2019 B2
10516496 Kits van Heyningen Dec 2019 B2
20010055303 Horton et al. Dec 2001 A1
20020073337 Ioele et al. Jun 2002 A1
20020143928 Maltz et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020174216 Shorey et al. Nov 2002 A1
20030018591 Komisky Jan 2003 A1
20030056001 Mate et al. Mar 2003 A1
20030228585 Inoko et al. Dec 2003 A1
20040004941 Malan et al. Jan 2004 A1
20040034702 He Feb 2004 A1
20040088542 Daude et al. May 2004 A1
20040095237 Chen et al. May 2004 A1
20040131059 Ayyakad et al. Jul 2004 A1
20040197079 Latvala et al. Oct 2004 A1
20040264481 Darling et al. Dec 2004 A1
20050060418 Sorokopud Mar 2005 A1
20050125424 Herriott et al. Jun 2005 A1
20060062187 Rune Mar 2006 A1
20060104286 Cheriton May 2006 A1
20060126665 Ward et al. Jun 2006 A1
20060146825 Hofstaedter et al. Jul 2006 A1
20060155875 Cheriton Jul 2006 A1
20060168338 Bruegl et al. Jul 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20070174663 Crawford et al. Jul 2007 A1
20070223487 Kajekar et al. Sep 2007 A1
20070242830 Conrado et al. Oct 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080080524 Tsushima et al. Apr 2008 A1
20080084880 Dharwadkar Apr 2008 A1
20080165778 Ertemalp Jul 2008 A1
20080198752 Fan et al. Aug 2008 A1
20080198858 Townsley et al. Aug 2008 A1
20080201711 Amir Husain Aug 2008 A1
20080235755 Blaisdell et al. Sep 2008 A1
20090006527 Gingell, Jr. et al. Jan 2009 A1
20090019367 Cavagnari et al. Jan 2009 A1
20090031312 Mausolf et al. Jan 2009 A1
20090083183 Rao et al. Mar 2009 A1
20090138763 Arnold May 2009 A1
20090177775 Radia et al. Jul 2009 A1
20090178058 Stillwell, III et al. Jul 2009 A1
20090182874 Morford et al. Jul 2009 A1
20090265468 Annambhotla et al. Oct 2009 A1
20090265753 Anderson et al. Oct 2009 A1
20090293056 Ferris Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090323706 Germain et al. Dec 2009 A1
20090328031 Pouyadou et al. Dec 2009 A1
20100036903 Ahmad et al. Feb 2010 A1
20100042720 Stienhans et al. Feb 2010 A1
20100061250 Nugent Mar 2010 A1
20100115341 Baker et al. May 2010 A1
20100131765 Bromley et al. May 2010 A1
20100149966 Achlioptas et al. Jun 2010 A1
20100191783 Mason et al. Jul 2010 A1
20100192157 Jackson et al. Jul 2010 A1
20100205601 Abbas et al. Aug 2010 A1
20100211782 Auradkar et al. Aug 2010 A1
20100293270 Augenstein et al. Nov 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100325199 Park et al. Dec 2010 A1
20100325441 Laurie et al. Dec 2010 A1
20100333116 Prahlad et al. Dec 2010 A1
20110016214 Jackson Jan 2011 A1
20110035754 Srinivasan Feb 2011 A1
20110055396 Dehaan Mar 2011 A1
20110055398 Dehaan et al. Mar 2011 A1
20110055470 Portolani Mar 2011 A1
20110072489 Parann-Nissany Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110110382 Jabr et al. May 2011 A1
20110116443 Yu et al. May 2011 A1
20110126099 Anderson et al. May 2011 A1
20110138055 Daly et al. Jun 2011 A1
20110145413 Dawson et al. Jun 2011 A1
20110145657 Bishop et al. Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110185063 Head et al. Jul 2011 A1
20110185065 Stanisic et al. Jul 2011 A1
20110206052 Tan et al. Aug 2011 A1
20110213966 Fu et al. Sep 2011 A1
20110219434 Betz et al. Sep 2011 A1
20110231715 Kunii et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110252327 Awasthi et al. Oct 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110283013 Grosser et al. Nov 2011 A1
20110295998 Ferris et al. Dec 2011 A1
20110305149 Scott et al. Dec 2011 A1
20110307531 Gaponenko et al. Dec 2011 A1
20110320870 Kenigsberg et al. Dec 2011 A1
20120005724 Lee Jan 2012 A1
20120036234 Staats et al. Feb 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072318 Akiyama et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072581 Tung et al. Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120072992 Arasaratnam et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120102193 Rathore et al. Apr 2012 A1
20120102199 Hopmann et al. Apr 2012 A1
20120131174 Ferris et al. May 2012 A1
20120137215 Kawara May 2012 A1
20120158967 Sedayao et al. Jun 2012 A1
20120159097 Jennas, II et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173710 Rodriguez Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120180044 Donnellan et al. Jul 2012 A1
20120182891 Lee et al. Jul 2012 A1
20120185913 Martinez et al. Jul 2012 A1
20120192016 Gotesdyner et al. Jul 2012 A1
20120192075 Ebtekar et al. Jul 2012 A1
20120201135 Ding et al. Aug 2012 A1
20120214506 Skaaksrud et al. Aug 2012 A1
20120222106 Kuehl Aug 2012 A1
20120236716 Anbazhagan et al. Sep 2012 A1
20120240113 Hur Sep 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120272025 Park et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120281708 Chauhan et al. Nov 2012 A1
20120290647 Ellison et al. Nov 2012 A1
20120297238 Watson et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120324092 Brown et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20130003567 Gallant et al. Jan 2013 A1
20130013248 Brugler et al. Jan 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130066940 Shao Mar 2013 A1
20130080509 Wang Mar 2013 A1
20130080624 Nagai et al. Mar 2013 A1
20130091557 Gurrapu Apr 2013 A1
20130097601 Podvratnik et al. Apr 2013 A1
20130104140 Meng et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130117337 Dunham May 2013 A1
20130124712 Parker May 2013 A1
20130125124 Kempf et al. May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130144978 Jain et al. Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130159097 Schory et al. Jun 2013 A1
20130159496 Hamilton et al. Jun 2013 A1
20130160008 Cawlfield et al. Jun 2013 A1
20130162753 Hendrickson et al. Jun 2013 A1
20130169666 Pacheco et al. Jul 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198374 Zalmanovitch et al. Aug 2013 A1
20130201989 Hu et al. Aug 2013 A1
20130204849 Chacko Aug 2013 A1
20130232491 Radhakrishnan et al. Sep 2013 A1
20130246588 Borowicz et al. Sep 2013 A1
20130250770 Zou et al. Sep 2013 A1
20130254415 Fullen et al. Sep 2013 A1
20130262347 Dodson Oct 2013 A1
20130283364 Chang et al. Oct 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318240 Hebert et al. Nov 2013 A1
20130318546 Kothuri et al. Nov 2013 A1
20130339949 Spiers et al. Dec 2013 A1
20140006481 Frey et al. Jan 2014 A1
20140006535 Reddy Jan 2014 A1
20140006585 Dunbar et al. Jan 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140052877 Mao Feb 2014 A1
20140056146 Hu et al. Feb 2014 A1
20140059310 Du et al. Feb 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140075048 Yuksel et al. Mar 2014 A1
20140075108 Dong et al. Mar 2014 A1
20140075357 Flores et al. Mar 2014 A1
20140075501 Srinivasan et al. Mar 2014 A1
20140089727 Cherkasova et al. Mar 2014 A1
20140098762 Ghai et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140122560 Ramey et al. May 2014 A1
20140136779 Guha et al. May 2014 A1
20140140211 Chandrasekaran et al. May 2014 A1
20140141720 Princen et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164486 Ravichandran et al. Jun 2014 A1
20140188825 Muthukkaruppan et al. Jul 2014 A1
20140189095 Lindberg et al. Jul 2014 A1
20140189125 Amies et al. Jul 2014 A1
20140215471 Cherkasova Jul 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140233384 Howard Aug 2014 A1
20140244851 Lee Aug 2014 A1
20140245298 Zhou et al. Aug 2014 A1
20140281173 Im et al. Sep 2014 A1
20140282536 Dave et al. Sep 2014 A1
20140282611 Campbell et al. Sep 2014 A1
20140282889 Ishaya et al. Sep 2014 A1
20140289200 Kato Sep 2014 A1
20140295831 Karra et al. Oct 2014 A1
20140297569 Clark et al. Oct 2014 A1
20140297835 Buys Oct 2014 A1
20140310391 Sorensen, III et al. Oct 2014 A1
20140310417 Sorensen, III et al. Oct 2014 A1
20140310418 Sorensen, III et al. Oct 2014 A1
20140314078 Jilani Oct 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140321278 Cafarelli et al. Oct 2014 A1
20140330976 van Bemmel Nov 2014 A1
20140330977 van Bemmel Nov 2014 A1
20140334488 Guichard et al. Nov 2014 A1
20140362682 Guichard et al. Dec 2014 A1
20140365680 van Bemmel Dec 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140369204 Anand et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20140379938 Bosch et al. Dec 2014 A1
20150033086 Sasturkar et al. Jan 2015 A1
20150043576 Dixon et al. Feb 2015 A1
20150052247 Threefoot et al. Feb 2015 A1
20150052517 Raghu et al. Feb 2015 A1
20150058382 St. Laurent et al. Feb 2015 A1
20150058459 Amendjian et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150085870 Narasimha et al. Mar 2015 A1
20150089082 Patwardhan et al. Mar 2015 A1
20150100471 Curry, Jr. et al. Apr 2015 A1
20150103827 Quinn et al. Apr 2015 A1
20150106802 Ivanov et al. Apr 2015 A1
20150106805 Melander et al. Apr 2015 A1
20150117199 Chinnaiah Sankaran et al. Apr 2015 A1
20150117458 Gurkan et al. Apr 2015 A1
20150120914 Wada et al. Apr 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150138973 Kumar et al. May 2015 A1
20150178133 Phelan et al. Jun 2015 A1
20150189009 van Bemmel Jul 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150227405 Jan et al. Aug 2015 A1
20150242204 Hassine et al. Aug 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150263901 Kumar et al. Sep 2015 A1
20150280980 Bitar Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150281113 Siciliano et al. Oct 2015 A1
20150309908 Pearson et al. Oct 2015 A1
20150319063 Zourzouvillys et al. Nov 2015 A1
20150326524 Tankala et al. Nov 2015 A1
20150339210 Kopp et al. Nov 2015 A1
20150358850 La Roche, Jr. et al. Dec 2015 A1
20150365324 Kumar et al. Dec 2015 A1
20150373108 Fleming et al. Dec 2015 A1
20160011925 Kulkarni et al. Jan 2016 A1
20160013990 Kulkarni et al. Jan 2016 A1
20160026684 Mukherjee et al. Jan 2016 A1
20160062786 Meng et al. Mar 2016 A1
20160094389 Jain et al. Mar 2016 A1
20160094398 Choudhury et al. Mar 2016 A1
20160094453 Jain et al. Mar 2016 A1
20160094454 Jain et al. Mar 2016 A1
20160094455 Jain et al. Mar 2016 A1
20160094456 Jain et al. Mar 2016 A1
20160094480 Kulkarni et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160099847 Melander et al. Apr 2016 A1
20160099853 Nedeltchev et al. Apr 2016 A1
20160099864 Akiya et al. Apr 2016 A1
20160105393 Thakkar et al. Apr 2016 A1
20160127184 Bursell May 2016 A1
20160134557 Steinder et al. May 2016 A1
20160156708 Jalan et al. Jun 2016 A1
20160164780 Timmons et al. Jun 2016 A1
20160164914 Madhav et al. Jun 2016 A1
20160182378 Basavaraja et al. Jun 2016 A1
20160188527 Cherian et al. Jun 2016 A1
20160234071 Nambiar et al. Aug 2016 A1
20160239399 Babu et al. Aug 2016 A1
20160253078 Ebtekar et al. Sep 2016 A1
20160254968 Ebtekar et al. Sep 2016 A1
20160261564 Foxhoven et al. Sep 2016 A1
20160277355 Shetty et al. Sep 2016 A1
20160277368 Narayanaswamy et al. Sep 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026294 Basavaraja et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170093921 Duan Mar 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170147297 Krishnamurthy et al. May 2017 A1
20170149878 Mutnuru May 2017 A1
20170163531 Kumar et al. Jun 2017 A1
20170171158 Hoy et al. Jun 2017 A1
20170214550 Kumar Jul 2017 A1
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 A1
20180143885 Dong May 2018 A1
Foreign Referenced Citations (16)
Number Date Country
101719930 Jun 2010 CN
101394360 Jul 2011 CN
102164091 Aug 2011 CN
104320342 Jan 2015 CN
105740084 Jul 2016 CN
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2645253 Nov 2014 EP
10-2015-0070676 May 2015 KR
M394537 Dec 2010 TW
WO-2004043014 May 2004 WO
W0 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
2016187168 Nov 2016 WO
2017053441 Mar 2017 WO
Non-Patent Literature Citations (67)
Entry
Cask Data, Inc., Flows and Flowlets, 2014-2016, https://docs.cask.co/cdap/3.6.0/en/developers-manual/building-blocks/flows-flowlets/index.html. (Year: 2016).
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages.
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages.
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page.
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages.
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages.
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages.
Author Unknown, “cloudControl Documentation,” Aug. 25, 2013, 14 pages.
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages.
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages.
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages.
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages.
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-ISO0103, Jun. 16, 2010, 75 pages.
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages.
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page.
Baker, F., “Requirements for IP Version 4 Routers,” Jun. 1995, 175 pages, Network Working Group, Cisco Systems.
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages.
Blanchet, M., “A Flexible Method for Managing the Assignment of Bits of an IPv6 Address Block,” Apr. 2003, 8 pages, Network Working Group, Viagnie.
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages.
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages.
Broadcasters Audience Research Board, “What's Next,” http://lwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages.
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white_paper_c11-558242.pdf.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages.
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages.
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages.
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages.
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages.
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages.
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php.
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, Cisco Systems, Jan. 2012, 12 pages.
Ford, Bryan, et al., Peer-to-Peer Communication Across Network Address Translators, in USENIX Annual Technical Conference, 2005, pp. 179-192.
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages.
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages.
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages.
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524.
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages.
Kenhui, “Musings on Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf.
Kumar, S., et al., “Infrastructure Service Forwarding for NSH,” Service Function Chaining Internet Draft, draft-kumar-sfc-nsh-forwarding-00, Dec. 5, 2015, 10 pages.
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages.
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages.
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages.
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages.
Meraki, “meraki releases industry's first cloud-managed routers,” Jan. 13, 2011, 2 pages.
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages.
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov. 17, 2003, pp. 1-11.
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com.
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages.
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages.
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html.
Quinn, P., et al., “Network Service Header,” Internet Engineering Task Force Draft, Jul. 3, 2014, 27 pages.
Quinn, P., et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, Internet Draft, draft-quinn-sfc-arch-03.txt, Jan. 22, 2014, 21 pages.
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages.
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages.
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, 2011, 4, 803-811, 9 pages.
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages.
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages.
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages.
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter_%28software%29&oldid=594544359.
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index.php?title=Pipeline2/028Unix%29&oldid=606980114.
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computer and Information Science, 2012 IEEE, 5 pages.
Related Publications (1)
Number Date Country
20200036796 A1 Jan 2020 US