This disclosure relates generally to data processing and, more particularly, to management and provisioning of cloud connected devices.
The approaches described in this section could be pursued but are not necessarily approaches that have previously been conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
Conventional cloud computing allows sharing computing resources between various applications. In cloud computing, different services, such as storage and applications can be delivered to organization's computers and devices through the Internet. Cloud computing involves a considerable management effort to support software and technologies designed for operating, monitoring, optimization, and proper interaction between users, applications, data, and services residing in the cloud. Cloud management may also involve numerous tasks including performance monitoring, security and compliance auditing and management, as well as initiating and overseeing disaster recovery and contingency plans.
Conventional solutions to address various security concerns include private cloud platforms implemented on a Local-Area Network (LAN) within an organization's firewall. However, because private cloud storage services are managed internally by the organization, they involve high capital and maintenance costs. Additionally, the organization will need to take the responsibility for running and managing resources instead of outsourcing that responsibility to a third-party cloud provider.
This summary is provided to introduce a selection of concepts in a simplified form that are further described in the Detailed Description below. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
According to an aspect of the present disclosure, a method is provided for provisioning of a service. The method may include receiving one or more availability messages from one or more unbound cloud connected devices. The one or more availability messages may include respective device identifying data. The method may further include receiving, from a user via a web application, a request for the service, the service request including service identifying data. The method may further include correlating the service identifying data to the device identifying data, and based on the correlation, selecting one or more candidate unbound devices from the one or more unbound devices. The method may further include prompting the user to select an unbound device from the one or more candidate unbound devices based on the device identifying data, receiving a selected unbound data device, or a group of devices, from the user, sending a machine generated code to the selected device, prompting the user to confirm ownership of the selected unbound device by entering the machine generated code sent to the selected device, receiving, from the user via the web application, a human entered code. The method may further include comparing the machine generated code to the human entered code and, based on the comparison, selectively binding the selected device to the service.
In certain embodiments, the method may further include handing off communication with the device to a service proxy for further communications between the web application and the selected device. The service proxy may run on a separate machine to provide scalability.
The request for the service may be contingent upon verification of credentials associated with the user. The user service identifying data may include a user public IP address associated with the web application and the device identifying data may include one or more device public IP addresses associated with the one or more unbound devices. The correlating of the service identifying data to the device identifying data may include comparing the user public IP address to the one or more device public IP addresses. In some embodiments, a user may manually provide an IP address.
The web application may be a single-page application running within a web browser. The selected device and the web application can be situated behind the same public IP address. The selected device and the web application may be located within an untrusted domain protected by a firewall.
The web application and the one or more unbound devices may use various security protocols to communicate to the trusted domain. The one or more availability messages from the one or more unbound devices available for binding may be generated automatically when the one or more unbound devices are initialized. The device identifying data may include one or more of the following: an Internet Protocol (IP) address, a host name, a machine address, device identification, cluster identification, and versioning information. The IP address is the source address seen by the backend domain when the device sends messages to the IP address.
In another aspect of the present disclosure, a system is provided for provisioning of a service. The system may comprise a service proxy configured to manage data transmission associated with bound devices utilizing a first data transmission protocol. The system may further include a rendezvous module configured to manage data transmission associated with unbound devices between a website domain utilizing a second data transmission protocol. The website domain may manage a web application accessible to a user. The system may further include a mailbox configured to store identification of the devices.
In another aspect of the present disclosure, the system may further include a supervisor configured to monitor and react to the health of the various services.
In certain embodiments, the website domain may be further configured to authenticate the user and, based on a successful user authentication, associate a web service with an unbound device. The web application may include a Single Page Application (SPA). In certain embodiments, the website domain may be further configured to: receive one or more availability messages from the unbound devices, the one or more availability messages including respective device identifying data, receive, from the user via the web application, a request for the service, the service request including service identifying data, correlate the service identifying data to the device identifying data, based on the correlation, select one or more candidate unbound devices from the one or more unbound devices, prompt the user to select one or a group of unbound devices from the one or more candidate unbound devices based on the device identifying data, receive a selected unbound device or a group of devices from the user, and selectively bind the selected device or group of devices to the service.
In further example embodiments of the present disclosure, the method steps are stored on a machine-readable medium comprising instructions, which when implemented by one or more processors perform the recited steps. In yet further example embodiments, hardware systems or devices can be adapted to perform the recited steps. Other features, examples, and embodiments are described below.
Embodiments are illustrated by way of example, and not by limitation, in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations in accordance with example embodiments. These example embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the present subject matter. The embodiments can be combined, other embodiments can be utilized, or structural, logical, and electrical changes can be made without departing from the scope of what is claimed. The following detailed description is therefore not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents. In this document, the terms “a” and “an” are used, as is common in patent documents, to include one or more than one. In this document, the term “or” is used to refer to a nonexclusive “or,” such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated.
The embodiments disclosed herein may be implemented using a variety of technologies. For example, the methods described herein may be implemented in software executing on a computer system or in hardware utilizing either a combination of microprocessors or other specially designed application-specific integrated circuits (ASICs), programmable logic devices, or various combinations thereof. In particular, the methods described herein may be implemented by a series of computer-executable instructions residing on a storage medium such as a disk drive, or a computer-readable medium.
One of many uses of this technology described herein allows providing efficient and seamless storage allocation and scalability, data security and integrity, and enabling users to select specific storage resources with a proof of ownership.
An example architecture may include a web application such as an SPA running within a web browser and devices located on an enterprise LAN. The example architecture may further include a website domain supporting the web application, a device domain supporting the devices, and a backend domain supporting auto-discovery and registration of services to the devices.
The website domain may include a controller coordinating secure protocol requests, such as Secure Hypertext Transfer Protocol (HTTPS), associated with the web application. The backend domain may include a backbone coordinating secure protocol requests, such as HTTPS, associated with the devices on the enterprise LAN. The backend domain may include a rendezvous module to handle communication exchanges between the website and unbound devices. Typically, the web application and devices are located within an untrusted domain while the website and backend are located within a trusted domain from the perspective of the cloud platform. The trusted and untrusted domains may be separated by a firewall. To ensure data integrity, communications between the untrusted and trusted domains may utilize various secure protocols.
Using one or more protocols, when booted, an unbound device may announce itself by posting a message to the mailbox of the rendezvous module. The message may include a device public IP address and other device-related metadata. Once the unbound device is bound to a service associated with the web application, further communications between the device and web application may be handed off to a service proxy mailbox.
The backend domain may also include a supervisor to manage the lifecycle of service proxy instances. One or more proxies may be distributed among a plurality of machines to provide scalability. The supervisor may continue monitoring the mailbox for messages related to the management of the service proxy.
An example method for provisioning a device discovery and registration service may commence with announcement of the presence of a device associated with the architecture described above. A device may contain an agent that can be used to announce the devices presence to a rendezvous module. The rendezvous module may register agent's availability with a controller in the backend domain. The controller may store agent's availability to a database.
A user, having an account with the service, may, upon a successful login, get redirected to a device discovery wizard. Upon verification of user credentials, the controller may enable the device discovery wizard so that the user is prompted to continue and the controller queries a database to determine whether any unbound device may be under administrative control of the currently logged in user. The correlation allows filtering available devices down to a small set of likely candidates. The correlation may be based on a comparison of IP addresses. For example, a public IP address associated with the web application can be compared to a public IP address of the unbound devices. In some instances, a user outside the LAN may be allowed to utilize the system by providing an IP address manually.
After the comparison is made, possible candidates that can be bound to the service are presented, e.g. displayed, to the user along with other information (e.g., a host name, IP, mac address, device ID, cluster ID, versioning information) associated with the devices. The user may be allowed to request administrative control of one or more of these unbound devices by selecting the one or more unbound devices.
Once the user selects a device, or a group of devices, the user is asked to prove the ownership of the device, or a group of devices, by interacting with the device, or a group of devices, through an independent channel of communications, for example, by observing a display of an output device, such as an LCD display, physically coupled to the device. A code previously unknown to the user, can be sent from the controller to the output device associated with the device. In other words, each selected device, or a group of devices, may make the code available for the user to read, for example, by displaying the code on the LCD display associated with the device. The user may be asked to enter the code in the device discovery wizard to prove the ownership. This is an important step in the secure verification and registration process, since upon entering the code in the device discovery wizard, the administrative control of the user for the selected device, or a group of devices, can be confirmed.
Thus, the secured verification process may involve sending a code through one channel of communication to the coupled output device associated with the device with the user providing the code back to the system on a different channel of communication.
The user may utilize a web application 127 through a browser or other application with a user interface. The web application 127 may include, for example, an SPA or similar web service which can be used for binding the one or more device 110 or one or more groups of devices to a service associated with an organization to enable the user to use its storage or computational resources securely.
The system architecture 100 may also include a web server 130 responsible for communication between a backend domain 135, a website domain 140, and the device domain 105. The web server 130 may employ a firewall 145 separating a trusted domain (i.e., the backend domain 135 and the website domain 140) and an untrusted domain. The web server 130 may communicate and transmit data using HTTP, HTTP Secure (HTTPS), or other secure protocols.
Although it is not shown in
The backend domain 135 may support auto-discovery, management, and support of the devices 110 or the groups of devices. The backend domain 135 may include a backbone 150 for coordinating data transmission and handling device requests from the devices 110 or the groups of devices utilizing secure protocols, for example, HTTP or HTTPS protocols. Each device 110 or group of devices may have two main operational states. The first operational state may be “unregistered”, meaning that the device 110 or the group of devices is not bound to the service. The second operational state may be “registered”, meaning that the device 110 or the group of devices is bound to the service. The backend domain 135 may further include a rendezvous module 160 configured to handle communication exchanges with the website domain 140 for unbound devices 110 or unbound groups of devices and its components utilizing a protocol or protocols, which may be different from the protocol used for communications between service proxy 170, the device 110 or the group of devices, the website domain 140, and the web server 130 after the device or the group of devices is bound to a service. For example, the rendezvous module 160 may utilize JSON-RPC for communication with the website domain 140. The rendezvous module 160 may be associated or operatively coupled to another database referred herein as “mailbox” 180 which can be used by the rendezvous module 160 for sending messages to the unbound devices 110 or the unbound group of devices. Furthermore, the service proxy 170 may be associated or operatively coupled to a database referred herein as “mailbox” 155, which stores identifications, operation statuses and messages of the devices 110 or the groups of devices that have been bound to the service.
Furthermore, the rendezvous module 160 can assign various services to the devices 110 or the group of devices, and associate (bind) the unbound device 110 or the unbound groups of devices with the service once the user of the unbound device 110 or the unbound group of devices is authenticated and proves possession of the unbound device 110 or the unbound group of devices or associated user device(s) or output device(s).
Furthermore, as shown in the figure, the backend domain 135 may include a supervisor 165 for managing the lifecycle of the proxies 170 through monitoring the mailbox 155 for the statuses (flags) of the devices 110 or the group of devices and reacting to the mailbox health of the service. Furthermore, the backend domain 135 may include a backbone 150 through which communication and services may be provided.
Still referring to
Those skilled in the art will understand that the website domain 140 and/or the backend domain 135 may utilize a number of auxiliary components, such as configuration databases, file servers, proxies, storages, computing units, network routers, and so forth, which are omitted for clarity purposes.
As shown in
At operation 210, the website domain may receive, from the user via the web application, a request for the service, which may include service identifying data or other related information. At this step, the user may be authenticated. To these ends, the user may be prompted to provide credentials (such as logins, passwords, pin codes, and so forth), which can be matched to the records of the database.
At operation 215, the controller may correlate the service identifying data to the device identifying data or the group identifying data stored in the mailbox associated with the proxy. In certain embodiments, the service identifying data may include a user public IP address associated with the user, while the device identifying data may include a device public IP address associated with the one or more unbound devices and the group identifying data may include a group public IP address associated with the one or more unbound groups of devices. The user public IP address may include IP address of the user browser. Accordingly, the correlation operation 215 may involve comparing the user public IP address to the device public IP address or the group public IP address. In various embodiments, the user public IP address may be either automatically determined or manually provided by the user.
At operation 220, the controller may select one or more candidate unbound devices from the one or more unbound devices or one or more candidate unbound groups of devices from the one or more unbound groups of devices based on the correlation and data stored in various databases. In certain circumstances, the device public IP address may relate to a plurality of user devices, network devices or other devices. Accordingly, at operation 225, the user is prompted to select one unbound device from the one or more candidate unbound data devices based on the device identifying data, or select one unbound group of devices from the one or more candidate unbound groups of devices based on the group identifying data. For example, the web application may show to the user available devices or available groups of devices and the user may select one device or one group of devices, which is in the possession of the user or which the user wants to utilize. At operation 230, the controller receives a selected unbound device from the user.
At operation 235, the controller (or, in some circumstances, the backend domain) can send a machine generated code to a coupled output device associated with the selected device or the selected group of devices. The code may relate to alpha-numerical message, randomly generated, still or animated image, audio message, or activation instruction. Upon receipt of the machine generated code by the corresponding output device associated with the unbound device or the unbound group of devices, the machine generated code may be shown on a display. It should be understood that the machine generated code is not limited to visual.
At operation 240, the user may be prompted to confirm the ownership of the selected unbound device by entering the machine generated code utilizing the user device or other apparatus associated with the selected device or the selected group of devices. For example, the web application may prompt the user to input the machine generated code.
At operation 245, the controller may receive, from the user via the web application, a human entered code. At operation 250, the controller may compare the machine generated code to the human entered code and, at operation 255, selectively bind the selected device or the selected group of devices to the service based on the results of the comparison. The backend domain can generate a corresponding record in the mailbox. In certain embodiments, the service may be handed off to the proxy to provide secure data communications. Additionally, a number of other security and data integrity policies pertaining to the device or the group of devices may be implemented. The proxy may run on a separate machine (i.e., outside the backend domain) to provide sufficient scalability. The proxy may be responsible for receiving backbone messages in the mailbox, policing inbound messages to ensure that the messages are coming from devices or the group of devices that are bound to the service, monitoring the connection status of the devices or the group of devices and proxying unbound backbone messages that originate from the website domain to the mailbox.
The example computer system 400 includes a processor or multiple processors 405, a disk drive unit 435, a main memory 410 and a static memory 415, which communicate with each other via a bus 420. The computer system 400 may also include a network interface device 445 and coprocessors dedicated for data compression and object identifier cryptographic calculation.
The disk drive unit 435 may include a computer-readable medium 450, which stores one or more sets of instructions 455 embodying or utilized by any one or more of the methodologies or functions described herein. The instructions 455 can also reside, completely or at least partially, within the main memory 410 and/or within the processors 405 during execution thereof by the computer system 400. The main memory 410 and the processors 405 also constitute machine-readable media such as, for example, an HDD or SSD.
While the computer-readable medium 450 is shown in an example embodiment to be a single medium, the term “computer-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “computer-readable medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the machine and that causes the machine to perform any one or more of the methodologies of the present application, or that is capable of storing, encoding, or carrying data structures utilized by or associated with such a set of instructions. The term “computer-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media. Such media can also include, without limitation, hard disks, floppy disks, NAND or NOR flash memory, digital video disks, random access memory (RAM), read only memory (ROM), hard disk drives (HDD), solid state disks (SSD), and the like.
The example embodiments described herein can be implemented in an operating environment comprising computer-executable instructions (e.g., software) installed on a computer, in hardware, or in a combination of software and hardware. The computer-executable instructions can be written in a computer programming language or can be embodied in firmware logic. If written in a programming language conforming to a recognized standard, such instructions can be executed on a variety of hardware platforms and for interfaces to a variety of operating systems. Although not limited thereto, computer software programs for implementing the present method can be written in any number of suitable programming languages such as, for example, C, C++, C#, Python, Go, or other compilers, assemblers, interpreters or other computer languages or platforms.
Thus, methods and systems for provisioning a service in networked architecture are disclosed. Although embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes can be made to these example embodiments without departing from the broader spirit and scope of the present application. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Number | Name | Date | Kind |
---|---|---|---|
4656604 | van Loon | Apr 1987 | A |
4660130 | Bartley et al. | Apr 1987 | A |
5420999 | Mundy | May 1995 | A |
5561778 | Fecteau et al. | Oct 1996 | A |
5812793 | Shakib et al. | Sep 1998 | A |
5950205 | Aviani, Jr. | Sep 1999 | A |
6098079 | Howard | Aug 2000 | A |
6154747 | Hunt | Nov 2000 | A |
6167437 | Stevens et al. | Dec 2000 | A |
6314435 | Wollrath et al. | Nov 2001 | B1 |
6356916 | Yamatari et al. | Mar 2002 | B1 |
6480950 | Lyubashevskiy et al. | Nov 2002 | B1 |
6772162 | Waldo et al. | Aug 2004 | B2 |
6839823 | See et al. | Jan 2005 | B1 |
7043494 | Joshi et al. | May 2006 | B1 |
7177980 | Milillo et al. | Feb 2007 | B2 |
7197622 | Torkelsson et al. | Mar 2007 | B2 |
7266555 | Coates et al. | Sep 2007 | B1 |
7293140 | Kano | Nov 2007 | B2 |
7392421 | Bloomstein et al. | Jun 2008 | B1 |
7403961 | Deepak et al. | Jul 2008 | B1 |
7454592 | Shah et al. | Nov 2008 | B1 |
7509360 | Wollrath et al. | Mar 2009 | B2 |
7539836 | Klinkner | May 2009 | B1 |
7685109 | Ransil et al. | Mar 2010 | B1 |
7725437 | Kirshenbaum et al. | May 2010 | B2 |
7827218 | Mittal | Nov 2010 | B1 |
7895666 | Eshghi et al. | Feb 2011 | B1 |
7990979 | Lu et al. | Aug 2011 | B2 |
8019882 | Rao et al. | Sep 2011 | B2 |
8099605 | Billsrom et al. | Jan 2012 | B1 |
8132168 | Wires et al. | Mar 2012 | B2 |
8195623 | Prahlad et al. | Jun 2012 | B2 |
8239584 | Rabe et al. | Aug 2012 | B1 |
8364887 | Wong et al. | Jan 2013 | B2 |
8407438 | Ranade | Mar 2013 | B1 |
8447733 | Sudhakar | May 2013 | B2 |
8478799 | Beaverson et al. | Jul 2013 | B2 |
8515911 | Zhou et al. | Aug 2013 | B1 |
8572290 | Mukhopadhyay et al. | Oct 2013 | B1 |
8606751 | Starling et al. | Dec 2013 | B1 |
8788628 | Taylor et al. | Jul 2014 | B1 |
8868926 | Hunt et al. | Oct 2014 | B2 |
9009202 | Patterson | Apr 2015 | B2 |
9043567 | Modukuri et al. | May 2015 | B1 |
9235479 | Muntz et al. | Jan 2016 | B1 |
9317511 | Kanfi | Apr 2016 | B2 |
9514137 | Barrus et al. | Dec 2016 | B2 |
9552382 | Barrus | Jan 2017 | B2 |
20020069340 | Tindal et al. | Jun 2002 | A1 |
20020087590 | Bacon et al. | Jul 2002 | A1 |
20030028514 | Lord et al. | Feb 2003 | A1 |
20030028585 | Yeager | Feb 2003 | A1 |
20030056139 | Murray et al. | Mar 2003 | A1 |
20030072259 | Mor | Apr 2003 | A1 |
20030101173 | Lanzatella et al. | May 2003 | A1 |
20030115408 | Milillo et al. | Jun 2003 | A1 |
20040093361 | Therrien et al. | May 2004 | A1 |
20040111610 | Slick et al. | Jun 2004 | A1 |
20040158588 | Pruet | Aug 2004 | A1 |
20040167898 | Margolus et al. | Aug 2004 | A1 |
20050015663 | Armangau et al. | Jan 2005 | A1 |
20050071335 | Kadatch | Mar 2005 | A1 |
20050080928 | Beverly et al. | Apr 2005 | A1 |
20050081041 | Hwang | Apr 2005 | A1 |
20050083759 | Wong et al. | Apr 2005 | A1 |
20050131900 | Palliyll et al. | Jun 2005 | A1 |
20050138271 | Bernstein et al. | Jun 2005 | A1 |
20050160170 | Schreter | Jul 2005 | A1 |
20050226059 | Kavuri et al. | Oct 2005 | A1 |
20050256972 | Cochran et al. | Nov 2005 | A1 |
20060039371 | Castro et al. | Feb 2006 | A1 |
20060083247 | Mehta | Apr 2006 | A1 |
20060101067 | Kilian-Kehr et al. | May 2006 | A1 |
20060156396 | Hochfield et al. | Jul 2006 | A1 |
20060193333 | Baughan et al. | Aug 2006 | A1 |
20060212551 | Kao et al. | Sep 2006 | A1 |
20060271540 | Williams | Nov 2006 | A1 |
20060271604 | Shoens | Nov 2006 | A1 |
20070005746 | Roe et al. | Jan 2007 | A1 |
20070022149 | Bacon et al. | Jan 2007 | A1 |
20070130232 | Therrien et al. | Jun 2007 | A1 |
20070171924 | Eisner et al. | Jul 2007 | A1 |
20070179997 | Nooning | Aug 2007 | A1 |
20070203960 | Guo | Aug 2007 | A1 |
20070230368 | Shi et al. | Oct 2007 | A1 |
20070233828 | Gilbert | Oct 2007 | A1 |
20070271303 | Menendez et al. | Nov 2007 | A1 |
20070276838 | Abushanab et al. | Nov 2007 | A1 |
20070276843 | Lillibridge et al. | Nov 2007 | A1 |
20080005624 | Kakivaya et al. | Jan 2008 | A1 |
20080016507 | Thomas et al. | Jan 2008 | A1 |
20080052446 | Lasser et al. | Feb 2008 | A1 |
20080126434 | Uysal et al. | May 2008 | A1 |
20080133893 | Glew | Jun 2008 | A1 |
20080147872 | Regnier | Jun 2008 | A1 |
20080170550 | Liu et al. | Jul 2008 | A1 |
20080183973 | Aguilera et al. | Jul 2008 | A1 |
20080243879 | Gokhale et al. | Oct 2008 | A1 |
20080243938 | Kottomtharayil et al. | Oct 2008 | A1 |
20080244199 | Nakamura et al. | Oct 2008 | A1 |
20080292281 | Pecqueur et al. | Nov 2008 | A1 |
20090031407 | Kuang | Jan 2009 | A1 |
20090049240 | Oe et al. | Feb 2009 | A1 |
20090094250 | Dhuse et al. | Apr 2009 | A1 |
20090100212 | Boyd et al. | Apr 2009 | A1 |
20090172139 | Wong et al. | Jul 2009 | A1 |
20090198927 | Bondurant et al. | Aug 2009 | A1 |
20090199041 | Fukui et al. | Aug 2009 | A1 |
20090307292 | Li et al. | Dec 2009 | A1 |
20090327312 | Kakivaya et al. | Dec 2009 | A1 |
20100023941 | Iwamatsu et al. | Jan 2010 | A1 |
20100031000 | Flynn et al. | Feb 2010 | A1 |
20100036862 | Das et al. | Feb 2010 | A1 |
20100036870 | Lowry et al. | Feb 2010 | A1 |
20100049735 | Hsu | Feb 2010 | A1 |
20100070725 | Prahlad et al. | Mar 2010 | A1 |
20100114336 | Konieczny et al. | May 2010 | A1 |
20100114905 | Slavik et al. | May 2010 | A1 |
20100122330 | McMillan et al. | May 2010 | A1 |
20100161817 | Xiao et al. | Jun 2010 | A1 |
20100172180 | Paley et al. | Jul 2010 | A1 |
20100191783 | Mason et al. | Jul 2010 | A1 |
20100217953 | Beaman et al. | Aug 2010 | A1 |
20100228798 | Kodama et al. | Sep 2010 | A1 |
20100262797 | Rosikiewicz et al. | Oct 2010 | A1 |
20100306269 | Osmond | Dec 2010 | A1 |
20100318645 | Hoole et al. | Dec 2010 | A1 |
20100325257 | Goel et al. | Dec 2010 | A1 |
20100332456 | Prahlad et al. | Dec 2010 | A1 |
20110022566 | Beaverson et al. | Jan 2011 | A1 |
20110026439 | Rollins | Feb 2011 | A1 |
20110029711 | Dhuse et al. | Feb 2011 | A1 |
20110034176 | Lord et al. | Feb 2011 | A1 |
20110060887 | Thatcher et al. | Mar 2011 | A1 |
20110060918 | Troncoso Pastoriza | Mar 2011 | A1 |
20110082928 | Hasha et al. | Apr 2011 | A1 |
20110106795 | Maim | May 2011 | A1 |
20110131184 | Kirshenbaum | Jun 2011 | A1 |
20110138123 | Gurajada et al. | Jun 2011 | A1 |
20110153822 | Rajan et al. | Jun 2011 | A1 |
20110213754 | Bindal et al. | Sep 2011 | A1 |
20110231374 | Jain et al. | Sep 2011 | A1 |
20110231524 | Lin et al. | Sep 2011 | A1 |
20110264712 | Ylonen | Oct 2011 | A1 |
20110264989 | Resch et al. | Oct 2011 | A1 |
20110271007 | Wang et al. | Nov 2011 | A1 |
20120011337 | Aizman | Jan 2012 | A1 |
20120023070 | Prahlad et al. | Jan 2012 | A1 |
20120030260 | Lu et al. | Feb 2012 | A1 |
20120030408 | Flynn et al. | Feb 2012 | A1 |
20120047181 | Baudel | Feb 2012 | A1 |
20120060072 | Simitci et al. | Mar 2012 | A1 |
20120078915 | Darcy | Mar 2012 | A1 |
20120096217 | Son et al. | Apr 2012 | A1 |
20120147937 | Goss et al. | Jun 2012 | A1 |
20120173790 | Hetzler et al. | Jul 2012 | A1 |
20120179808 | Bergkvist | Jul 2012 | A1 |
20120179820 | Ringdahl et al. | Jul 2012 | A1 |
20120185555 | Regni et al. | Jul 2012 | A1 |
20120210095 | Nellans et al. | Aug 2012 | A1 |
20120233117 | Holt et al. | Sep 2012 | A1 |
20120233251 | Holt et al. | Sep 2012 | A1 |
20120278425 | Maxted | Nov 2012 | A1 |
20120278511 | Alatorre et al. | Nov 2012 | A1 |
20120290535 | Patel et al. | Nov 2012 | A1 |
20120290629 | Beaverson et al. | Nov 2012 | A1 |
20120310892 | Dam et al. | Dec 2012 | A1 |
20120323850 | Hildebrand et al. | Dec 2012 | A1 |
20120331462 | Falko | Dec 2012 | A1 |
20120331528 | Fu et al. | Dec 2012 | A1 |
20130013571 | Sorenson, III et al. | Jan 2013 | A1 |
20130041931 | Brand | Feb 2013 | A1 |
20130054924 | Dudgeon et al. | Feb 2013 | A1 |
20130067270 | Lee et al. | Mar 2013 | A1 |
20130073821 | Flynn et al. | Mar 2013 | A1 |
20130086004 | Chao et al. | Apr 2013 | A1 |
20130086377 | Cilfone et al. | Apr 2013 | A1 |
20130091105 | Bhave et al. | Apr 2013 | A1 |
20130091180 | Vicat-Blanc-Primet et al. | Apr 2013 | A1 |
20130162160 | Ganton | Jun 2013 | A1 |
20130166818 | Sela | Jun 2013 | A1 |
20130179481 | Halevy | Jul 2013 | A1 |
20130185508 | Talagala et al. | Jul 2013 | A1 |
20130218934 | Lin et al. | Aug 2013 | A1 |
20130232313 | Patel | Sep 2013 | A1 |
20130235192 | Quinn et al. | Sep 2013 | A1 |
20130246589 | Klemba et al. | Sep 2013 | A1 |
20130262638 | Kumarasamy et al. | Oct 2013 | A1 |
20130263151 | Li et al. | Oct 2013 | A1 |
20130268644 | Hardin et al. | Oct 2013 | A1 |
20130268770 | Hunt et al. | Oct 2013 | A1 |
20130275381 | De Schrijvr et al. | Oct 2013 | A1 |
20130282798 | McCarthy et al. | Oct 2013 | A1 |
20130282994 | Wires et al. | Oct 2013 | A1 |
20130288668 | Pragada | Oct 2013 | A1 |
20130311574 | Lal | Nov 2013 | A1 |
20130339406 | Kanfi | Dec 2013 | A1 |
20130346591 | Carroll et al. | Dec 2013 | A1 |
20130346839 | Dinha | Dec 2013 | A1 |
20140006580 | Raghu | Jan 2014 | A1 |
20140007178 | Gillum et al. | Jan 2014 | A1 |
20140059405 | Syu et al. | Feb 2014 | A1 |
20140143206 | Pittelko | May 2014 | A1 |
20140149794 | Shetty et al. | May 2014 | A1 |
20140297604 | Brand | Oct 2014 | A1 |
20140317065 | Barrus | Oct 2014 | A1 |
20140335480 | Asenjo et al. | Nov 2014 | A1 |
20140351419 | Hunt et al. | Nov 2014 | A1 |
20140372490 | Barrus et al. | Dec 2014 | A1 |
20140379671 | Barrus et al. | Dec 2014 | A1 |
20150012763 | Cohen | Jan 2015 | A1 |
20150019491 | Hunt et al. | Jan 2015 | A1 |
20150066524 | Fairbrothers et al. | Mar 2015 | A1 |
20150081964 | Kihara et al. | Mar 2015 | A1 |
20150106335 | Hunt et al. | Apr 2015 | A1 |
20150106579 | Barrus | Apr 2015 | A1 |
20150220578 | Hunt et al. | Aug 2015 | A1 |
20150222616 | Tarlano et al. | Aug 2015 | A1 |
20150347043 | Barron et al. | Dec 2015 | A1 |
Number | Date | Country |
---|---|---|
1285354 | Feb 2003 | EP |
1285354 | Mar 2004 | EP |
1802048 | Jun 2007 | EP |
1856853 | Nov 2007 | EP |
2575379 | Apr 2013 | EP |
2834749 | Feb 2015 | EP |
2834943 | Feb 2015 | EP |
2989549 | Mar 2016 | EP |
3000205 | Mar 2016 | EP |
3000289 | Mar 2016 | EP |
3008647 | Apr 2016 | EP |
3011428 | Apr 2016 | EP |
3019960 | May 2016 | EP |
3020259 | May 2016 | EP |
3055794 | Aug 2016 | EP |
3058466 | Aug 2016 | EP |
3080969 | Oct 2016 | EP |
3103023 | Dec 2016 | EP |
3103025 | Dec 2016 | EP |
2004252663 | Sep 2004 | JP |
2008533570 | Aug 2008 | JP |
2010146067 | Jul 2010 | JP |
2011095976 | May 2011 | JP |
2012048424 | Mar 2012 | JP |
5996088 | Sep 2016 | JP |
WO 2012092553 | Jul 2012 | WO |
WO 2013101186 | Jul 2013 | WO |
WO2013152357 | Oct 2013 | WO |
WO2013152358 | Oct 2013 | WO |
WO2014176264 | Oct 2014 | WO |
WO2014190093 | Nov 2014 | WO |
WO2014201270 | Dec 2014 | WO |
WO2014205286 | Dec 2014 | WO |
WO2015006371 | Jan 2015 | WO |
WO2015054664 | Apr 2015 | WO |
WO2015057576 | Apr 2015 | WO |
WO2015088761 | Jun 2015 | WO |
WO2015116863 | Aug 2015 | WO |
WO2015120071 | Aug 2015 | WO |
Entry |
---|
Office Action dated Nov. 5, 2013, U.S. Appl. No. 13/441,715, filed Apr. 6, 2012. |
Notice of Allowance dated Mar. 27, 2014, U.S. Appl. No. 13/441,715, filed Apr. 6, 2012. |
Office Action dated Nov. 13, 2013, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Office Action dated May 19, 2014, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Final Office Action dated Nov. 20, 2014, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Advisory Action dated Feb. 19, 2015, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Final Office Action dated Nov. 27, 2015, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Advisory Action dated Feb. 19, 2016, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Final Office Action dated Nov. 27, 2015, U.S. Appl. No. 14/171,651, filed Feb. 3, 2014. |
Final Office Action dated Nov. 20, 2015, U.S. Appl. No. 14/055,662, filed Oct. 16, 2013. |
Advisory Action dated Jan. 29, 2016, U.S. Appl. No. 14/055,662, filed Oct. 16, 2013. |
Office Action dated Dec. 10, 2015, U.S. Appl. No. 13/939,106, filed Jul. 10, 2013. |
Non-Final Office Action dated Jan. 11, 2016, U.S. Appl. No. 14/284,351, filed May 21, 2014. |
Advisory Action dated Jan. 12, 2016, U.S. Appl. No. 14/171,651, filed Feb. 3, 2014. |
Office Action dated Mar. 15, 2016, U.S. Appl. No. 14/171,651, filed Feb. 3, 2014. |
Office Action dated Apr. 5, 2016, U.S. Appl. No. 14/257,905, filed Apr. 21, 2014. |
International Search Report dated Aug. 6, 2013 5901PCT Application No. PCT/US2013/035675. |
Huck et al. Architectural Support for Translation Table Management in Large Address Space Machines. ISCA '93 Proceedings of the 20th Annual International Symposium on Computer Architecture, vol. 21, No. 2. May 1993. pp. 39-50. |
International Search Report dated Aug. 2, 2013 5847PCT Application No. PCT/US2013/035673. |
International Search Report dated Sep. 10, 2014 6362PCT Application No. PCT/US2014/035008. |
Askitis, Nikolas et al., “HAT-trie: A Cache-conscious Trie-based Data Structure for Strings”. |
International Search Report dated Sep. 24, 2014 6342PCT Application No. PCT/US2014/039036. |
International Search Report dated Oct. 22, 2014 6360PCT Application No. PCT/US2014/043283. |
International Search Report dated Nov. 7, 2014 6361PCT Application No. PCT/US2014/042155. |
International Search Report dated Jan. 1, 2015 6359PCT Application No. PCT/US2014/060176. |
International Search Report dated Feb. 24, 2015 6359PCT Application No. PCT/US2014/060280. |
International Search Report dated Mar. 4, 2015 6337PCT Application No. PCT/US2014/067110. |
International Search Report dated Apr. 2, 2015 6340PCT Application No. PCT/US2014/045822. |
International Sesarch Report dated May 14, 2015 6450PCT Application No. PCT/US2015/013611. |
International Sesarch Report dated May 15, 2015 6341PCT Application No. PCT/US2015/014492. |
Invitation pursuant to Rule 63(1) dated May 19, 2015 5847EP Application No. 13772293.0. |
Extended European Search Report dated Aug. 4, 2015 5901EP Application No. 13771965.4. |
Dabek et al. “Wide-area cooperative storage with CFS”, Proceedings of the ACM Symposium on Operating Systems Principles, Oct. 1, 2001. pp. 202-215. |
Stoica et al. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”, Computer Communication Review, ACM, New York, NY, US, vol. 31, No. 4, Oct. 1, 2001. pp. 149-160. |
Extended European Search Report dated Aug. 20, 2015 5847EP Application No. 13772293.0. |
Office Action dated Mar. 15, 2016 in Japanese Patent Application No. 2015-504769 filed Apr. 8, 2013. |
Extended European Search Report dated Aug. 19, 2016 for European Application No. 14788630.3 filed Apr. 22, 2014, pp. 1-7. |
Lua, Eng Keong et al., “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes,” IEEE Communications Surveys & Tutorials, Second Quarter 2005, vol. 7, No. 2, pp. 72-93. |
Sakr, Sherif et al., “A Survey of Large Scale Data Management Approaches in Cloud Environments,” IEEE Communications Surveys & Tutorials, Third Quarter 2011, vol. 13, No. 3, pp. 311-336. |
Hansen, Jacob Gorm et al., “Lithium: Virtual Machine Storage for the Cloud,” SoCC'10, Jun. 10-11, 2010, 12 pages. |
Extended European Search Report dated Aug. 19, 2016 for European Application No. 14801473.1 filed May 21, 2014, pp. 1-9. |
European Patent Application No. 16185048.2, “Extended European Search Report,” Dec. 15, 2016, 11 pages. |
Golan-Gueta et al., “Scaling Concurrent Log-Structured Data Stores”, The 2014 Ottawa Linux Symposium (OLS '14), Jan. 1, 2015, pp. 1-14. |
European Patent Application No. 148104375, “Extended European Search Report,” Jan. 3, 2017, 8 pages. |
“Extended European Search Report” and “Written Opinion,” European Patent Application No. 14823874.4, Jan. 26, 2017, 7 pages. |
“Extended European Search Report” and “Written Opinion,” European Patent Application No. 16185051.6, dated Jan. 4, 2017, 11 pages. |
Eshghi, Kave et al., “Jumbo Store: Providing Efficient Incremental Upload and Versioning for a Utility Rendering Service,” FAST '07: 5th USENIX Conference on File and Storage Technologies, Feb. 14, 2007, pp. 123-138. |
Rodeh, Ohad, “B-trees, Shadowing, and Clones,” ACM Transactions on Storage, vol. 3 No. 4, Feb. 1, 2008, pp. 1-27. |
“Extended European Search Report” and “Written Opinion,” European Patent Application No. 14813803.5, dated Jan. 23, 2017, 8 pages. |
Office Action dated Mar. 29, 2016 in Japanese Patent Application No. 2015-504768 filed Apr. 8, 2013, pp. 1-16. |
Joao, Jose et al., “Flexible Reference-Counting-Based Hardware Acceleration for Garbage Collection,” Jun. 2009, ISCA '09: Proceedings of the 36th annual international symposium on Computer Architecture, pp. 418-428. |
Office Action dated May 17, 2016, U.S. Appl. No. 14/303,329, filed Jun. 12, 2014. |
Final Office Action dated Jun. 1, 2016, U.S. Appl. No. 14/284,351, filed May 21, 2014. |
Final Office Action dated Jun. 1, 2016, U.S. Appl. No. 14/171,651, filed Feb. 3, 2014. |
Final Office Action dated Jun. 2, 2016, U.S. Appl. No. 13/939,106, filed Jul. 10, 2013. |
Advisory Action dated Jul. 6, 2016, U.S. Appl. No. 13/939,106, filed Jul. 10, 2013. |
Notice of Allowance dated Jul. 14, 2016, U.S. Appl. No. 14/303,329, filed Jun. 12, 2014. |
Non-Final Office Action dated Jul. 25, 2016, U.S. Appl. No. 14/309,796, filed Jun. 19, 2014. |
Non-Final Office Action dated Aug. 23, 2016, U.S. Appl. No. 14/055,662, filed Oct. 16, 2013. |
Notice of Allowance dated Aug. 24, 2016, U.S. Appl. No. 14/257,905, filed Apr. 21, 2014. |
Non-Final Office Action dated Oct. 7, 2016, U.S. Appl. No. 14/171,651, filed Feb. 3, 2014. |
Non-Final Office Action dated Nov. 17, 2016, U.S. Appl. No. 14/512,299, filed Oct. 10, 2014. |
Notice of Allowance dated Dec. 8, 2016, U.S. Appl. No. 13/441,592, filed Apr. 6, 2012. |
Non-Final Office Action dated Jan. 24, 2017, U.S. Appl. No. 14/614,266, filed Feb. 4, 2015. |
Non-Final Office Action dated Jan. 30, 2017, U.S. Appl. No. 14/284,351, filed May 21, 2014. |
Extended European Search Report for corresponding application No. 14869610.7, dated Jun. 16, 2017; pp. 1-9. |
Number | Date | Country | |
---|---|---|---|
20150172114 A1 | Jun 2015 | US |