Systems and methods for enabling wide area multicast domain name system

Information

  • Patent Grant
  • 10439877
  • Patent Number
    10,439,877
  • Date Filed
    Tuesday, July 25, 2017
    7 years ago
  • Date Issued
    Tuesday, October 8, 2019
    5 years ago
Abstract
Systems, methods, and computer-readable media for implementing zero-configuration networking over a wide area network. Disclosed are systems, methods, and computer-readable storage media for implementing zero-configuration networking over a wire area network by utilizing agents, application programming interfaces (API), and a controller. The controller can implement polices for communication between the agents and APIs, enabling zero-configuration network
Description
TECHNICAL FIELD

The present technology pertains to zero-configuration networking and more specifically to wide area multicast domain name system in zero-configuration networking.


BACKGROUND

Zero-configuration networking automatically creates a usable computer network between networked devices (e.g., computers, printers, peripherals, etc.) based on the Transmission Control Protocol and Internet Protocol (TCP/IP). Zero-configuration networking includes service discovery, address assignment and hostname resolution. The networked devices can be automatically connected using multicast Domain Name Systems.


However, there are several configurations where zero-configuration networking cannot operate. For example, discovery of networked devices is bound to a simple VLAN, Multicast DNS frames cannot cross single subnet, can only operate over a single gateway solution, limited in scale and performance in large scale networked environments and further there is no heterogeneous solution for communication between different protocols (e.g., wireless, wired, etc).





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. 1 illustrates a diagram of an example prior art communication network;



FIG. 2 illustrates a diagram of an example network architecture of a data center;



FIG. 3A illustrates a diagram of an example session management of a network;



FIG. 3B illustrates example agent policies;



FIG. 4 illustrates a diagram of an example flow process of a network;



FIGS. 5-10 illustrate example packet structures for communication of a wide area zero configuration network.



FIG. 11 illustrates an example network device; and



FIG. 12 illustrates example system embodiments.





DESCRIPTION OF EXAMPLE EMBODIMENTS

Various 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.


Various 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.


Overview


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.


The approaches set forth herein can be used to implement zero-configuration networking over a wide area network. Disclosed are systems, methods, and computer-readable storage media for configuring a wide area multicast domain name system. The system, method and computer-readable storage media configured to receive, at a controller, a request to advertise a first device from a first local area network and verify one or more policies are configured to enable the first device to advertise one or more services. The system, method and computer-readable storage media are also configured to receive, at the controller, a query to discover advertised services from a second device from a second local area network, verify the one or more policies are configured to enable the second device to discover the advertised services and in response to the verification, providing the second device with the advertised services. In some examples, the first local area network and second local area network connected by a wide area network. In some examples, the connections (e.g., advertising and discovery) between the controller and first device and the second device are facilitated by one or more agent running on one or more gateway server. In some examples, the connections facilities by the one or more agents and the controller expires after a predetermined time. In some examples, the predetermined time can be reset when the agent sends a heartbeat to the controller.


The system, method and computer-readable storage media are also configured to connect from the second device to the first device, and send and receive data between the first device and the second device over the wide area network. In some examples, the connections between each of the devices and the one or more agents is verified by one or more local area agent policies and the connections between the one or more agents and the controller is verified by one or more wide area agent policies.


Description


The disclosed technology addresses the need in the art for implementing zero-configuration networking over a wide area network. Disclosed are systems, methods, and computer-readable storage media for implementing zero-configuration networking over a wire area network by utilizing agents, application programming interfaces (API), and a controller. The controller can implement polices for communication between the agents and APIs, enabling zero-configuration network A description of network computing environments and architectures, as illustrated in FIGS. 1-2, is first disclosed herein. A discussion of session management and flow as illustrated in FIGS. 3-4 will then follow. A discussion of packet structure as illustrated in FIG. 5-10 will then follow. The discussion then concludes with a description of example devices, as illustrated in FIGS. 11 and 12. These variations shall be described herein as the various embodiments are set forth. The disclosure now turns to FIG. 1.



FIG. 1 is a schematic block diagram of a prior art communication network 100 illustratively including networks 110, 120 and 130. In FIG. 1, networks 110, 120 and 130 are unable to automatically configure communication between devices using a zero-configuration networking.



FIG. 2 is a schematic block diagram of an example communication network 200 illustratively including networks 110, 120 and 130. Each network (e.g., 110, 120, 130, etc.) can have one or more devices 212, 222, 232 (e.g., servers, computing devices, printers, smart phones, networked components, televisions, endpoints, etc.). Each network (e.g., 110, 120, 130, etc.) can run zero-configuration services, including, but not limited to multicast Domain Name System 214, 224, 234 (mDNS). Each network can also be local area service discovery gateways (SDG). mDNS (e.g., 214, 224, 234, etc.) can resolve host names to IP addresses within small networks that do not include a local name server. Each mDNS of a local area network works with the agents to announce, advertise and query for services that exist beyond the local area network.


Each network (e.g., 110, 120, 130, etc.) can also run one or more zero-configuration agents 216, 226, 236. The one or more agents (e.g., 216, 226, 236) can run on one or more gateways (not shown) and can communicate (e.g., wired, wireless, etc.) with zero configuration controller 250 over wide area network 140 (e.g., the Internet, etc.) through wide area service SDG 240. The agents can configured for high availability, dynamic load balancing, and horizontal scaling. In some examples, the agents can use loopback interfaces (e.g., that provide state full protocol reliable connection during network failures, automatic load-balance, form trusted connections, etc.). The wide area SDG can enable mDNS to operate across layer 3 boundaries (and enable zero-configuration over the wide area network). In some examples, an agent can send an advertisement to the controller, advertising services the devices (within the network the agent is connected) can provide to other networked devices across the wide area network (e.g., printing, file sharing, screen sharing, audio/video, etc.) Once connected, the agents and controller can keep an active connection (e.g., maintain the state), for example, until an agent sends a withdraw messages or a heartbeat is not received at the server from the agent. While connected, the advertised devices can be available for connection by other networked device based on one or more policies. For example, controller 250 can execute one or more policies (e.g., wide area controller policies, etc.) for enabling communication between the devices (e.g., 212, 222, 232, etc.) of the networks (e.g., 110, 120, 130, etc.) via the agents (e.g., 216, 226, 236) as shown in FIG. 3A. Agents (e.g., 216, 226, 236, etc.) can also run one or more policies (e.g., local area agent polices, wide area agent policies, etc.). In some examples, there can be more than one controller. In some examples, the controllers can run in an active/standby configuration. In some examples, the controller can be a distributed system, for example, multiple controllers can operate in a distributed fashion, however, the agents would perceive one controller.



FIG. 3A illustrates a schematic block diagram of an example communication network 300 illustratively including policies. Controller 250 can have one or more policies implemented from the one or more agents (e.g., 216, 226, 236, etc.). The policy can specify the network type, for example, the source will enable connection to devices with a wired connection type, but not other types (e.g., wireless). The policy can also deny connections from devices of other networks not in the policy, for example, devices 222 (through agent 226) of network 120) cannot communication with the wired connected devices 212 of network 110. Policies can include, local area policies and wide area policies. The policies can include attributes including, but not limited to: subnets, networks, devices, services, VLAN, port, mac address, port, service text record, etc.


An example policy 360 (e.g., wide area controller policy) can include a source (e.g., agent 216 of network 110 via 10.0.0.1) and a receiver (e.g., agent 236 of network 130 via 10.0.0.2). Under example policy 360, wired networked devices at agent 216 can connected to wired or wireless networked device at agent 236. Networked devices connected to agent 226 cannot connect to controller 250.


There can be at least three types of policies implemented in wide area zero configuration networking: local area agent policy (e.g., 361, 363, etc.), wide area agent policy (e.g., 362, 364, etc.) and wide area controller policy (e.g., 360). The local area agent policy can be enforced on the agent (e.g., gateway running agent) between the devices in the local network. The enforcement is in the layer 2 network domain and can be bi-directional. The local area agent policies can be enforced towards mDNS end-points in Layer 2 network domain. The local area agent policies can determine whether to permit or deny announcement and cache the service for further distribution. Similarly it can determines whether to listen request from another end-point to provide response. If permitted then an agent response can be based on local cache (e.g., at the agent). If denied, then the request can be denied. The wide area agent policy can be enforced on the agent for export control to the controller. The wide area agent policy can be uni-directional (egress) from the agent to the controller. This uni-directional policy is outbound towards the controller (e.g., central wide area bonjour naming server). The wide area agent policies can determine what locally discovered services are permitted/deny to be globally distributed thru the controller and what service request from local clients can be discovered from wide area network (e.g., wide area service SDG, Bonjour domain, etc.). The wide area controller policy can be enforced on the controller. The wide area controller policy can be enabled for global discovery and distribution to the agents and can be bi-directional. An example wide area controller policy can be seen in FIG. 3A.


The policies can also operate in different modes. For example, a single source to single query mode (e.g., two agent service policy configuration—source and query agents either wired or wireless connecting agents). In another example, a multiple source to multiple query mode (e.g., balanced any-to-any service boundary—wired-to-wired, wireless-to-wireless, wired-to-wireless, wireless-to-wired). In another example, multiple source to single query mode (e.g., a policy configuration from broader discovery points such as LAN agents, but single distribution point such as WAN agents).


In some examples, the agent can manage the devices within its network. For example, when a networked device (e.g., networked television 212, etc.) comes online the networked device can send notification to the agent (e.g., 216), for example, online and device type notifications. The agent can then check its policies (e.g., local area agent policy 361, wide area agent policy 362 (examples of each agent policy illustrated in FIG. 3B)) to determine if the networked device should be advertised, or should be allowed to communicate with other devices (i.e., through the zero configuration networking). The agent can then store details of the networked device in a local cache (e.g., to determine the networked device is still reachable and maintain timers). The timer can be similar to a heartbeat. For example, the timer can be a predetermined amount of time (e.g., 15 seconds, etc.) to which the agent should received a heartbeat or stay alive packet (from the networked device). Upon receiving the heartbeat, the timer resets. When the heartbeat is not received, the timer expires and the policy for accessing the networked device is deactivated. In some examples, the policy can be reactivated (when details are still available in the cache). In other examples, the policies need to be reconfigured. The agent can also work as a local proxy, for example, to facilitate communication to and from the networked device. In some examples, a timer (or heartbeat) can be between the agent (e.g., 216, 226, 236, etc.) and the controller (e.g., 250).



FIG. 4 illustrates an example flow of a communication session using zero configuration networking. Device 212 (e.g., networked television) can make announcement 472 to agent 216. For example, device 212 wishes to be available for discovery by other networked devices. Agent 216 can look up a policy (e.g., local area agent policy) for device 212 and can determine details for routing stored in cache. Agent 216 can then advertise 474 services of device 212 to controller 250 (according to wide area agent policies (e.g., egress)). Controller 250 can then verify wide area controller polices are configured to enable discovery of devices connected to agent 216.


Device 232 (e.g., receiver) can query 480 to agent 236. Agent 236 can look up the local area agent policy to determine if device 232 can communicate with agent 236. Agent 236 can then look up the wide area agent policy (e.g., egress) to determine if agent 236 can communicate with controller 250. Agent 236 can then send request 482 to controller 250 for connection. Controller 250 can then send response 484 back to agent 236 to verify agent 236 can communicate with controller 250 (and devices connected with agent 236 can discover advertised devices from controller 250). Agent 236 can then send a response 486 (to query 480) to device 232 acknowledging device 232 can discover advertised devices on wide area network 140 (and wide area service SDG 240). For example, that device 232 can discover device 212. In response to a successful query device 232 can then discover and connect to devices advertising (e.g., networked television 212). Once connected, device 232 can send and receive data 488 to device 212. The communications above can be facilitated by specific packets as shown through FIGS. 5-10.



FIG. 5 illustrates an example TCP/IP packet structure with a Bonjour Control Protocol (BCP) header and payload. In some examples, the payload can be secured using a hashing scheme (e.g., MD5). FIG. 6 illustrates an example detailed view of the BCP header. The BCP header can include a type flag (e.g., advertise, query, query response, etc.). FIG. 7 illustrates an example detailed header values of the BCP header. FIG. 8 illustrates an example advertise packet structure (e.g., as used in advertise 474 of FIG. 4). For example, the advertise packet can export services to the control based on local defined policies. FIG. 9 illustrates an example query packet structure (e.g., as used in advertise 480 of FIG. 4). FIG. 10 illustrates an example query response packet structure (e.g., as used in advertise 486 of FIG. 4).


The disclosure now turns to the example network device and system illustrated in FIGS. 11 and 12.



FIG. 11 illustrates an example network device 1100 suitable for routing, switching, forwarding, traffic management, and load balancing. Network device 1100 can be, for example, a router, a switch, a controller, a server, a gateway, and/or any other L2 and/or L3 device.


Network device 1100 can include a master central processing unit (CPU) 1104, interfaces 1102, and a bus 1110 (e.g., a PCI bus). When acting under the control of appropriate software or firmware, the CPU 1104 is responsible for executing packet management, error detection, load balancing operations, and/or routing functions. The CPU 1104 can accomplish all these functions under the control of software including an operating system and any appropriate applications software. CPU 1104 may include one or more processors 1108, such as a processor from the Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, processor 1108 is specially designed hardware for controlling the operations of network device 1110. In a specific embodiment, a memory 1106 (such as non-volatile RAM and/or ROM) also forms part of CPU 1104. However, there are many different ways in which memory could be coupled to the system.


The interfaces 1102 are typically provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the network device 1100. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 1104 to efficiently perform routing computations, network diagnostics, security functions, etc.


Although the system shown in FIG. 11 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc. is often used. Further, other types of interfaces and media could also be used with the router.


Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 1106) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc.



FIG. 12 shows an example of computing system 1200 in which the components of the system are in communication with each other using connection 1205. Connection 1205 can be a physical connection via a bus, or a direct connection into processor 1210, such as in a chipset or system-on-chip architecture. Connection 1205 can also be a virtual connection, networked connection, or logical connection.


In some embodiments computing system 1200 is a distributed system in which the functions described in this disclosure can be distributed within a datacenter, multiple datacenters, a peer network, throughout layers of a fog network, etc. In some embodiments, one or more of the described system components represents many such components each performing some or all of the function for which the component is described. In some embodiments, the components can be physical or virtual devices.


Example system 1200 includes at least one processing unit (CPU or processor) 1210 and connection 1205 that couples various system components including system memory 1215, read only memory (ROM) 1220 or random access memory (RAM) 1225 to processor 1210. Computing system 1200 can include a cache of high-speed memory 1212 connected directly with, in close proximity to, or integrated as part of processor 1210.


Processor 1210 can include any general purpose processor and a hardware service or software service, such as services 1232, 1234, and 1236 stored in storage device 1230, configured to control processor 1210 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. Processor 1210 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, computing system 1200 includes an input device 1245, which 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, etc. Computing system 1200 can also include output device 1235, which can 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/output to communicate with computing system 1200. Computing system 1200 can include communications interface 1240, which can generally govern and manage the user input and system output, and also connect computing system 1200 to other nodes in a network. 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 1230 can be a non-volatile memory device 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, battery backed random access memories (RAMs), read only memory (ROM), and/or some combination of these devices.


The storage device 1230 can include software services, servers, services, etc., that when the code that defines such software is executed by the processor 1210, it causes the system to perform a function. In some embodiments, a hardware service 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 processor 1210, connection 1205, output device 1235, etc., 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 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. Moreover, 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.

Claims
  • 1. A method comprising: receiving from a zero configuration compatible first agent of a zero configuration incompatible first local area network, at a zero configuration controller, a request to advertise a first device from the first local area network;verifying, by the controller, that one or more policies are configured to enable the first device to advertise one or more services;receiving from a zero configuration compatible second agent of a zero configuration incompatible second local area network, at the controller, a query to discover advertised services from a second device from the second local area network;verifying, by the controller, that the one or more policies are configured to enable the second device to discover the advertised services; andin response to the verification that the one or more policies are configured to enable the second device to discover the advertised services, providing the second device with the advertised services;wherein the zero configuration incompatible status of the first and second network renders the first and second networks unable to automatically configure communications between using zero-configuration networking.
  • 2. The method of claim 1, wherein the first local area network and second local area network connected by a wide area network.
  • 3. The method of claim 2, further comprising: connecting, from the second device, to the first device; andsending and receiving data between the first device and the second device over the wide area network.
  • 4. The method of claim 1, wherein advertising and discovery connections between the controller and first device and the second device are facilitated by one or more agent running on one or more gateway server.
  • 5. The method of claim 4, wherein the connections facilitated by the one or more agents and the controller expires after a predetermined time.
  • 6. The method of claim 5, wherein the predetermined time can be reset when the agent sends a heartbeat to the controller.
  • 7. The method of claim 4, wherein the connections between each of the devices and the one or more agents is verified by one or more local area agent policies and the connections between the one or more agents and the controller is verified by one or more wide area agent policies.
  • 8. A zero configuration controller comprising: a processor; anda memory storing instructions, which when executed by the processor causes the controller to perform operations comprising: receive from a zero configuration compatible first agent of a zero configuration incompatible first local area network a request to advertise a first device from a first local area network;verify one or more policies are configured to enable the first device to advertise one or more services;receive from a zero configuration compatible second agent of a zero configuration incompatible second local area network a query to discover advertised services from a second device from the second local area network;verify the one or more policies are configured to enable the second device to discover the advertised services; andin response to verification that the one or more policies are configured to enable the second device to discover the advertised services, providing the second device with the advertised services;wherein the zero configuration incompatible status of the first and second network renders the first and second networks unable to automatically configure communications between using zero-configuration networking.
  • 9. The controller of claim 8, wherein the first local area network and second local area network connected by a wide area network.
  • 10. The controller of claim 9, the operations further comprising: connecting, from the second device, to the first device; andsending and receiving data between the first device and the second device over the wide area network.
  • 11. The controller of claim 8, wherein advertising and discovery connections between the controller and first device and the second device are facilitated by one or more agent running on one or more gateway server.
  • 12. The controller of claim 11, wherein the connections facilitated by the one or more agents and the controller expires after a predetermined time.
  • 13. The controller of claim 12, wherein the predetermined time can be reset when the agent sends a heartbeat to the controller.
  • 14. The controller of claim 11, wherein the connections between each of the devices and the one or more agents is verified by one or more local area agent policies and the connections between the one or more agents and the controller is verified by one or more wide area agent policies.
  • 15. At least one non-transitory computer readable medium comprising instructions which when executed by a processor causes a zero configuration controller to perform operations comprising: receive from a zero configuration compatible first agent of a zero configuration incompatible first local area network a request to advertise a first device from the first local area network;verify one or more policies are configured to enable the first device to advertise one or more services;receive from a zero configuration compatible second agent of a zero configuration incompatible second local area network a query to discover advertised services from a second device from a second local area network;verify the one or more policies are configured to enable the second device to discover the advertised services; andin response to the verification that the one or more policies are configured to enable the second device to discover the advertised services, providing the second device with the advertised services;wherein the zero configuration incompatible status of the first and second network renders the first and second networks unable to automatically configure communications between using zero-configuration networking.
  • 16. The at least one non-transitory computer readable medium of claim 15, wherein the first local area network and second local area network connected by a wide area network.
  • 17. The at least one non-transitory computer readable medium of claim 16, the operations further comprising: connecting, from the second device, to the first device; andsending and receiving data between the first device and the second device over the wide area network.
  • 18. The at least one non-transitory computer readable medium of claim 15, wherein advertising and discovery connections between the controller and first device and the second device are facilitated by one or more agent running on one or more gateway server.
  • 19. The at least one non-transitory computer readable medium of claim 18, wherein the connections facilitated by the one or more agents and the controller expires after a predetermined time.
  • 20. The at least one non-transitory computer readable medium of claim 18, wherein the connections between each of the devices and the one or more agents is verified by one or more local area agent policies and the connections between the one or more agents and the controller is verified by one or more wide area agent policies.
CROSS-REFERENCE

This application claims benefit of U.S. provisional application Ser. No. 62/524,823 filed Jun. 26, 2017 and entitled “Systems and Methods for Enabling Wide Area Multicast Domain Name System,” which is hereby incorporated by reference in its entirety.

US Referenced Citations (437)
Number Name Date Kind
5812773 Norin Sep 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
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
8130677 Barker et al. Mar 2012 B2
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
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
20030095524 Stephens May 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
20060291412 Naqvi Dec 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
20140122481 Petronijevic May 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
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 Sorenson, III et al. Oct 2014 A1
20140310417 Sorenson, III et al. Oct 2014 A1
20140310418 Sorenson, 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
20150100700 Ishvarchandra 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
20160127890 Qi 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
20160277368 Narayanaswamy et al. Sep 2016 A1
20160359999 Yanagihara Dec 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170006117 Kafle Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026294 Basavaraja et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170034669 Dronadula et al. Feb 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170055203 Lee Feb 2017 A1
20170078408 Lepp Mar 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170126512 Seed May 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
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 A1
20170372368 Kwon Dec 2017 A1
20180083791 Shanbhag Mar 2018 A1
20180091361 Smith Mar 2018 A1
20180191666 Rahman Jul 2018 A1
Foreign Referenced Citations (13)
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 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
Non-Patent Literature Citations (68)
Entry
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, httbs://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.ora/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, https://docs.openstack.org/nova/latest/user/filter-scheduler.html. accessed on Dec. 18, 2017.
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.
International Search Report and Written Opinion from the International Searching Authority, dated Sep. 27, 2018, 12 pages, for corresponding International Patent Application No. PCT/US2018/039418.
“Chapter 25: Managing Bonjour Services for BYOD,” Cisco Bring Your Own Device (BYOD) CVD, Mar. 6, 2014, 34 pages.
Related Publications (1)
Number Date Country
20180375732 A1 Dec 2018 US
Provisional Applications (1)
Number Date Country
62524823 Jun 2017 US