The present disclosure relates to social networks, and more specifically, to optimization of posting in social networks.
Currently, social networks allow users to post content, such as messages and pictures, and to categorize postings in an ad hoc manner. Users that post content, also referred to as content providers, often use tags to attract more viewers or comments to the content that they post. In typical social networks, when a user posts content to the social network, the posting is published to the social network immediately. Accordingly, whenever a user posts something, it will be uploaded and can be seen in almost real-time to the other users of the social network. One drawback of the real-time posting of content is that the time that the content is posted is often only convenient for viewing by users who share a similar time zone with the content provider.
For users that have a big time zone difference with the content provider, there is typically a large time difference between when the content is posted and when the content is viewed. For example, if a user in New York posts a picture at 2:00 pm EST, which is equivalent to 2:00 am in part of China, the picture may be immediately viewed by people in United States. However, users of the social network in China will likely not immediately view the picture as they would be sleeping at that time. Rather, the picture will probably be viewed by users of the social network in China about seven hours later when the users wake up. The real-time posting issue is compounded by the fact that most social networks display postings in chronological order. Accordingly, in the above example, the posting of the picture will be displayed beneath all of the content posted during the time between the posting of the picture and the time the user accesses the social network.
According to one embodiment, a method for optimizing postings in social networks includes receiving one or more content delivery preferences from a content provider, wherein the one or more content delivery preferences includes one or more tags that correspond to a geography and an optimal time window for the geography. The method also includes optimizing, by a processor, the one or more content delivery preferences by an optimization analyzer to create optimized content delivery preferences. The method further includes receiving a post to the social network from the content provider at a posting time, determining if the post includes one of the one or more tags, and determining if the posting time is within the optimal time window for the geography corresponding to one of the one or more tags. Based on a determining that the post includes at least one of the one or more tags and that the posting time is within the optimal time window for the geography corresponding to the at least one of the one or more tags, the method includes delivering the posting to one or more users in the geography targeted by the posting corresponding to the optimal time window. Based on a determining that the post includes at least one of the one or more tags and that the posting time is not within the optimal time window for the geography corresponding to the at least one of the one or more tags, the method includes delaying delivery of the posting to the one or more users in the geography targeted by the posting corresponding to the optimal time window.
According to another embodiment, a computer program product for optimizing postings in social networks, the computer program product including a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method that includes receiving one or more content delivery preferences from a content provider, wherein the one or more content delivery preferences includes one or more tags that correspond to a geography and an optimal time window for the geography. The method also includes optimizing, by a processor, the one or more content delivery preferences by an optimization analyzer to create optimized content delivery preferences. The method further includes receiving a post to the social network from the content provider at a posting time, determining if the post includes one of the one or more tags, and determining if the posting time is within the optimal time window for the geography corresponding to one of the one or more tags. Based on a determining that the post includes at least one of the one or more tags and that the posting time is within the optimal time window for the geography corresponding to the at least one of the one or more tags, the method includes delivering the posting to one or more users in the geography targeted by the posting corresponding to the optimal time window. Based on a determining that the post includes at least one of the one or more tags and that the posting time is not within the optimal time window for the geography corresponding to the at least one of the one or more tags, the method includes delaying delivery of the posting to the one or more users in the geography targeted by the posting corresponding to the optimal time window.
According to another embodiment, a method for optimizing postings in social networks includes receiving one or more content delivery preferences from a content provider, wherein the one or more content delivery preferences comprises one or more geographical locations and an optimal time window for each of the one or more geographical locations. The method also includes adjusting, by a processor, the one or more content delivery preferences by an optimization analyzer to create optimized content delivery preferences. The method further includes receiving a post to the social network from the content provider at a posting time and determining if the posting time is within the optimal time window for one of the one or more geographical locations. Based on a determining that the posting time is within the optimal time window for one of the one or more geographical locations, the method includes delivering the posting to one or more users in the geography corresponding to the optimal time window. Based on a determining that the posting time is not within the optimal time window for one of the one or more geographical locations, the method includes delaying delivery of the posting to the one or more users in the geography corresponding to the optimal time window for a period of time.
Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with the advantages and the features, refer to the description and to the drawings.
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The forgoing and other features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
In accordance with exemplary embodiments of the disclosure, methods, systems and computer program products for optimizing postings in social networks are provided. In exemplary embodiments, a user can configure optimal viewing times based on the content of the post and/or the geographical location of the viewers.
Referring to
Thus, as configured in
Referring now to
In exemplary embodiments, the social network 210 includes a user interface 212 that is configured to allow the content providers 202 to define target geographical locations for the content that they post to the social network. In one embodiment, the user interface 212 is configured to allow content providers 202 to define one or more target geographical locations where they would like their content to be viewed and a corresponding optimal viewing time for each geography. For example, a content provider 202 can set up preferences that a certain type of content, which can be identified by a specific tag, will be delayed at the receiving end from viewers of different geographical locations. In one embodiment, the content provider 202 may select the amount of time that the display of the content will be delayed. In another embodiment, the content provider 202 may allow the social network 210 to determine the amount of time that the display of the content will be delayed based on the optimum viewing time in each geography calculated by the social network 210.
In one example, a content provider 202 in New York would like to post a picture of food. The content provider 202 uses the user interface 212 to set up a preference that postings of food pictures, which can identified by the use of the hash tag #food or the like, should be delayed for viewing by users 204 until 9:00 am in the time zone that the user 204 is located. Accordingly, the social network 210 allows the content provider 202 to optimize the viewing of certain type of content by users 204 based on the geographical locations of the users 204.
In exemplary embodiments, the optimization analyzer 216 of the social network 210 is configured to analyze historical data of the usage of the social network 210, including the time and geography that each piece of content was viewed. The optimization analyzer 216 is further configured to produce a variety of reports regarding the usage of the social network 210. For example, the optimization analyzer 216 can produce a report of the best time window for comments or reposts per geographical locations based on given tags.
In exemplary embodiments, the optimization analyzer 216 is also configured to analyze related tags, which can be specific to particular geographical locations, that can be added to the content based the existing tags of the content. In one embodiment, the optimization analyzer 216 may be configured to identify tags that are related to one another based on common usage. For example, the hash tag #food may be commonly used with the hash tag #yummy. In addition, the optimization analyzer 216 may identify related tags that have the same meaning in various languages for example the hash tag #yummy may be related to the hash tag #ngonqua, which means “delicious” in Vietnamese, and the hash tag #sarap, which means “delicious” in the Filipino language.
In exemplary embodiments, the geography checker 218 is configured to store the preferences set by the content provider 202 via the user interface 212. For example, the geography checker 218 may store the preferences as seen in Table 1 below.
In exemplary embodiments, the geography checker 218 is configured to check the viewing time of the users 204 according to their geographical location. If the viewing time of the user 204 is not within the optimal time as set by the content provider 202, the geography checker 218 will add the required delay time for each user 204 based on the geography of the user 204. In exemplary embodiments, the geography checker 218 is also configured to consult with the optimization analyzer 216 to find the best time window for comments based on different geographical locations and to adjust the delay accordingly. For example, the optimization analyzer 216 may maintain a database of information regarding the best time window for displaying content based on the hash tags of the content and the geography of the users 204, as shown in Table 2 below.
In exemplary embodiments, the geography checker 218 can also consult the optimization analyzer 216 to determine any related tags that can be added to the content to increase the number of people who will view the content. If there are related tags, the geography checker 218 will append additional tags to the content. In exemplary embodiments, the related tags may be geography specific labels or tags that can be added to a content to increase the number of viewers of the content in different geographical locations. For example, the optimization analyzer 216 may suggest additional tags and/or optimal viewing time as shown in Table 3, the suggested tags being shown in italics.
In exemplary embodiments, the delivery service 220 is configured to prevent the material that is posted by the content provider 202 from being delivered to or shown to the users 204 until the proper time based on the optimal viewing time for the geography of the user 204. In one embodiment, the delivery service 220 checks the optimization preferences stored in Table 1 and prevents access of the material from viewers of the targeted geographical locations until it is within the corresponding optimal viewing window.
In exemplary embodiments, the optimization analyzer 216 optimizes the delivery time of a content item or posting to different geographical locations so that the posting is available for viewing only within a convenient viewing time for the target audience. Accordingly, a content provider 202 can post a picture or message as usual, but the message will be put on hold to viewers until it is a convenient time for the viewers.
In exemplary embodiments, the delivery of content in the social network 210 is not based on posting time. Rather, the delivery of content is optimized based on the tags associated with the content and the targeted audience in different geographical locations. In one embodiment, the content will appear as newly posted content for certain geographical locations even though the actual posting time could be hours ago. In addition, any comments to or re-posts of the original content will also be delayed and then posted once the original content has been published to the user.
In one embodiment, a user can select to optimize posting based solely on the geographical location of the viewers. For example, the user can delay the viewing of his content from various viewers from different geographical locations until the timing is convenient for the viewers, regardless of the content of the posting. In another embodiment, a user can select to optimize posting based on geographical location and the type of content, as defined by tags associated with the content.
In yet another embodiment, a user can select to optimize posting based on an ideal time for generating user comments. For example, the optimization analyzer 216 may determine an optimal time window for posting a content item in order to generate comments on the posting and the user may opt to have the content posted during that time period. In many cases, the goal of a content provider 202 is to get more interactions with the users 204 as a result of the posting. In exemplary embodiments, historical data analyzed to determine what time of the day the viewers' comments are generated. These timestamps or time windows are considered a convenient time window for the active viewers who usually gave the comments. For example, Table 3 above is an example of the result of analyzing historical data. The largest comments were created at the window of 9 pm-3 am EST by Asia viewers. So if a content provider posts a picture at 6 pm EST, the pictures should delayed from viewing by the Asia viewers until it is 9 pm EST to maximize the comments.
Referring now to
Continuing with reference to
In exemplary embodiments, the content provider, the user that posts the content to a social network, has the freedom to post the content at anytime that is convenient to him. From a viewer's perspective, the content will be held until it is within a convenient time for his/her viewing. In one example, a content provider in the United States posts a picture to the social network at 2 pm, which is 2 am for China. Viewers from North America and Europe can view the content immediately once it is posted as the local time for them is convenient for their viewing. However, for users in Asia, the content will not be available for them until 5 or 6 hours later.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one more other features, integers, steps, operations, element components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
The flow diagrams depicted herein are just one example. There may be many variations to this diagram or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention.
While the preferred embodiment to the invention had been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.
Number | Name | Date | Kind |
---|---|---|---|
5815671 | Morrison | Sep 1998 | A |
6128655 | Fields | Oct 2000 | A |
6148330 | Puri | Nov 2000 | A |
6594693 | Borwankar | Jul 2003 | B1 |
6725460 | Nishiyama | Apr 2004 | B1 |
6834195 | Brandenberg | Dec 2004 | B2 |
6886029 | Pecus | Apr 2005 | B1 |
6996393 | Pyhalammi | Feb 2006 | B2 |
7072670 | Sato | Jul 2006 | B2 |
7130908 | Pecus | Oct 2006 | B1 |
7154898 | Pecus | Dec 2006 | B1 |
7174373 | Lausier | Feb 2007 | B1 |
7237017 | Pecus | Jun 2007 | B1 |
7251604 | Thenthiruperai | Jul 2007 | B1 |
7251676 | Kuth | Jul 2007 | B2 |
7313525 | Packingham | Dec 2007 | B1 |
7360160 | Matz | Apr 2008 | B2 |
7398080 | Pyhalammi | Jul 2008 | B2 |
7406329 | Khurana | Jul 2008 | B2 |
7441203 | Othmer | Oct 2008 | B2 |
7568003 | Zhang | Jul 2009 | B2 |
7593939 | Weininger | Sep 2009 | B2 |
7621814 | Garcia | Nov 2009 | B2 |
7627652 | Commons | Dec 2009 | B1 |
7647387 | Bellare | Jan 2010 | B2 |
7698720 | Matz | Apr 2010 | B2 |
7747963 | Othmer | Jun 2010 | B2 |
7751804 | Steelberg | Jul 2010 | B2 |
7805406 | Craig | Sep 2010 | B2 |
7818764 | Matz | Oct 2010 | B2 |
7831512 | Akadiri | Nov 2010 | B2 |
7835993 | Okamoto | Nov 2010 | B2 |
7870125 | Istvan | Jan 2011 | B1 |
7882201 | Frazier | Feb 2011 | B2 |
7949726 | Freeberg | May 2011 | B2 |
7970868 | Garg | Jun 2011 | B2 |
8024342 | Li | Sep 2011 | B2 |
8046435 | Parekh | Oct 2011 | B1 |
8086491 | Matz | Dec 2011 | B1 |
8103741 | Frazier | Jan 2012 | B2 |
8127327 | Ijeomah | Feb 2012 | B2 |
8136135 | Matz | Mar 2012 | B2 |
8209223 | Fink | Jun 2012 | B2 |
8214738 | Othmer | Jul 2012 | B2 |
8219134 | Maharajh | Jul 2012 | B2 |
8219555 | Mianji | Jul 2012 | B1 |
8219618 | Kiyohara | Jul 2012 | B2 |
8219925 | Othmer | Jul 2012 | B2 |
8230087 | Alve | Jul 2012 | B2 |
8230456 | Jacoby | Jul 2012 | B2 |
8284936 | Bangma | Oct 2012 | B2 |
8315949 | Akadiri | Nov 2012 | B2 |
8321527 | Martin | Nov 2012 | B2 |
8386488 | Jones | Feb 2013 | B2 |
8412707 | Mianji | Apr 2013 | B1 |
8452790 | Mianji | May 2013 | B1 |
8504073 | Svendsen | Aug 2013 | B2 |
8522269 | Dharmaji | Aug 2013 | B2 |
8539371 | Othmer | Sep 2013 | B2 |
8543608 | Koul | Sep 2013 | B2 |
8582801 | Goto | Nov 2013 | B2 |
8607295 | Bhatia | Dec 2013 | B2 |
8612450 | Proffit | Dec 2013 | B1 |
8612542 | Frazier | Dec 2013 | B2 |
8615565 | Randall | Dec 2013 | B2 |
8631473 | Bhatia | Jan 2014 | B2 |
8635674 | Bhatia | Jan 2014 | B2 |
8650125 | Akadiri | Feb 2014 | B2 |
8650587 | Bhatia | Feb 2014 | B2 |
8655981 | Kiyohara | Feb 2014 | B2 |
8667520 | Bhatia | Mar 2014 | B2 |
8671021 | Maharajh | Mar 2014 | B2 |
8682794 | Akadiri | Mar 2014 | B2 |
8688582 | Akadiri | Apr 2014 | B2 |
8688671 | Ramer | Apr 2014 | B2 |
8706886 | Aiello | Apr 2014 | B2 |
8707351 | Dharmaji | Apr 2014 | B2 |
8712778 | Thenthiruperai | Apr 2014 | B1 |
8732766 | Fink | May 2014 | B2 |
8762850 | Matz | Jun 2014 | B2 |
8805270 | Maharajh | Aug 2014 | B2 |
8855469 | Maharajh | Oct 2014 | B2 |
8880649 | Randall | Nov 2014 | B2 |
8914375 | Jones | Dec 2014 | B2 |
8923889 | Svendsen | Dec 2014 | B2 |
8930448 | Doyle | Jan 2015 | B2 |
8935722 | Matz | Jan 2015 | B2 |
8938755 | Goodwin | Jan 2015 | B2 |
8943538 | Jacoby | Jan 2015 | B2 |
8955001 | Bhatia | Feb 2015 | B2 |
8978086 | Bhatia | Mar 2015 | B2 |
8995815 | Maharajh | Mar 2015 | B2 |
9009754 | Dharmaji | Apr 2015 | B2 |
9037643 | Kazerani | May 2015 | B2 |
9047626 | Akadiri | Jun 2015 | B2 |
9055074 | Harris | Jun 2015 | B2 |
9064010 | Maharajh | Jun 2015 | B2 |
9064011 | Maharajh | Jun 2015 | B2 |
9106941 | Dharmaji | Aug 2015 | B2 |
9117228 | Akadiri | Aug 2015 | B1 |
9124906 | Robert | Sep 2015 | B2 |
9160802 | Svendsen | Oct 2015 | B2 |
9203927 | Mecklenburg | Dec 2015 | B1 |
9237377 | Bhatia | Jan 2016 | B2 |
9247002 | Randall | Jan 2016 | B1 |
9264764 | Bhatia | Feb 2016 | B2 |
9349136 | Akadiri | May 2016 | B2 |
9369519 | Doyle | Jun 2016 | B2 |
9432713 | Bhatia | Aug 2016 | B2 |
9479838 | Makhlouf | Oct 2016 | B2 |
9547832 | Gordon | Jan 2017 | B2 |
9560478 | Murad | Jan 2017 | B2 |
9571874 | Bhatia | Feb 2017 | B2 |
20020056102 | Dillon | May 2002 | A1 |
20020069261 | Bellare | Jun 2002 | A1 |
20020120667 | Nakano | Aug 2002 | A1 |
20020144283 | Headings | Oct 2002 | A1 |
20030045273 | Pyhalammi | Mar 2003 | A1 |
20030063072 | Brandenberg | Apr 2003 | A1 |
20030065665 | Kinjo | Apr 2003 | A1 |
20040143386 | Yoshihara | Jul 2004 | A1 |
20040168121 | Matz | Aug 2004 | A1 |
20040172655 | Nishiyama | Sep 2004 | A1 |
20040216163 | Whitcomb | Oct 2004 | A1 |
20040255321 | Matz | Dec 2004 | A1 |
20040261096 | Matz | Dec 2004 | A1 |
20050033849 | Matz | Feb 2005 | A1 |
20050043060 | Brandenberg | Feb 2005 | A1 |
20050165686 | Zack | Jul 2005 | A1 |
20050170848 | Sato | Aug 2005 | A1 |
20050203917 | Freeberg | Sep 2005 | A1 |
20050240608 | Jones | Oct 2005 | A1 |
20060019642 | Steelberg | Jan 2006 | A1 |
20060052089 | Khurana | Mar 2006 | A1 |
20060073810 | Pyhalammi | Apr 2006 | A1 |
20060190401 | Akadiri | Aug 2006 | A1 |
20060212516 | Shikatani | Sep 2006 | A1 |
20060230173 | Chen | Oct 2006 | A1 |
20060236257 | Othmer | Oct 2006 | A1 |
20060242267 | Grossman | Oct 2006 | A1 |
20060271959 | Jacoby | Nov 2006 | A1 |
20060271960 | Jacoby | Nov 2006 | A1 |
20060271961 | Jacoby | Nov 2006 | A1 |
20060271997 | Jacoby | Nov 2006 | A1 |
20070061363 | Ramer | Mar 2007 | A1 |
20070110056 | Hwang | May 2007 | A1 |
20070110057 | Hwang | May 2007 | A1 |
20070157251 | Shrivastava | Jul 2007 | A1 |
20070180523 | Jablonski | Aug 2007 | A1 |
20070208737 | Li | Sep 2007 | A1 |
20070239716 | Weininger | Oct 2007 | A1 |
20070243860 | Aiello | Oct 2007 | A1 |
20070255829 | Pecus | Nov 2007 | A1 |
20070256015 | Matz | Nov 2007 | A1 |
20080022003 | Alve | Jan 2008 | A1 |
20080052741 | Dharmaji | Feb 2008 | A1 |
20080104079 | Craig | May 2008 | A1 |
20080104172 | Craig | May 2008 | A1 |
20080104495 | Craig | May 2008 | A1 |
20080104679 | Craig | May 2008 | A1 |
20080182559 | Pyhalammi | Jul 2008 | A1 |
20080195664 | Maharajh | Aug 2008 | A1 |
20080200154 | Maharajh | Aug 2008 | A1 |
20080201225 | Maharajh | Aug 2008 | A1 |
20080201386 | Maharajh | Aug 2008 | A1 |
20080207137 | Maharajh | Aug 2008 | A1 |
20080207182 | Maharajh | Aug 2008 | A1 |
20080244037 | Okuda | Oct 2008 | A1 |
20080250337 | Lemmela et al. | Oct 2008 | A1 |
20080270538 | Garg | Oct 2008 | A1 |
20090037387 | Kim | Feb 2009 | A1 |
20090049408 | Naaman et al. | Feb 2009 | A1 |
20090132378 | Othmer | May 2009 | A1 |
20090132640 | Verma | May 2009 | A1 |
20090138573 | Campbell | May 2009 | A1 |
20090138925 | Headings | May 2009 | A1 |
20090144772 | Fink | Jun 2009 | A1 |
20090248833 | Frazier | Oct 2009 | A1 |
20090319187 | Deeming et al. | Dec 2009 | A1 |
20100027792 | Bangma | Feb 2010 | A1 |
20100030766 | Li | Feb 2010 | A1 |
20100041419 | Svendsen | Feb 2010 | A1 |
20100064007 | Randall | Mar 2010 | A1 |
20100180007 | Suh | Jul 2010 | A1 |
20100180029 | Fourman | Jul 2010 | A1 |
20100223119 | Klish | Sep 2010 | A1 |
20100269058 | Othmer | Oct 2010 | A1 |
20100269059 | Othmer | Oct 2010 | A1 |
20100293246 | Urazoe | Nov 2010 | A1 |
20100318596 | Bergman | Dec 2010 | A1 |
20100325653 | Matz | Dec 2010 | A1 |
20110060649 | Dunk | Mar 2011 | A1 |
20110060727 | Koul | Mar 2011 | A1 |
20110060807 | Martin | Mar 2011 | A1 |
20110072084 | Kiyohara | Mar 2011 | A1 |
20110072088 | Kiyohara | Mar 2011 | A1 |
20110099263 | Patil | Apr 2011 | A1 |
20110113119 | Frazier | May 2011 | A1 |
20110125793 | Erhart | May 2011 | A1 |
20110238762 | Soni et al. | Sep 2011 | A1 |
20110238782 | Akadiri | Sep 2011 | A1 |
20110246482 | Badenes | Oct 2011 | A1 |
20110287786 | Cassapakis | Nov 2011 | A1 |
20110307830 | Robert | Dec 2011 | A1 |
20120016948 | Sinha | Jan 2012 | A1 |
20120047011 | Rippetoe | Feb 2012 | A1 |
20120096361 | Berry et al. | Apr 2012 | A1 |
20120110119 | Levicki | May 2012 | A1 |
20120122489 | Frazier | May 2012 | A1 |
20120124090 | Matz | May 2012 | A1 |
20120136965 | Matz | May 2012 | A1 |
20120185238 | Bhatti | Jul 2012 | A1 |
20120208512 | Maharajh | Aug 2012 | A1 |
20120215839 | Doyle | Aug 2012 | A1 |
20120215890 | Doyle | Aug 2012 | A1 |
20120246685 | Fink | Sep 2012 | A1 |
20120258735 | Monteverde | Oct 2012 | A1 |
20120296991 | Spivack et al. | Nov 2012 | A1 |
20130006980 | Frumin | Jan 2013 | A1 |
20130014136 | Bhatia | Jan 2013 | A1 |
20130014137 | Bhatia | Jan 2013 | A1 |
20130014138 | Bhatia | Jan 2013 | A1 |
20130014141 | Bhatia | Jan 2013 | A1 |
20130014143 | Bhatia | Jan 2013 | A1 |
20130014144 | Bhatia | Jan 2013 | A1 |
20130014145 | Bhatia | Jan 2013 | A1 |
20130014146 | Bhatia | Jan 2013 | A1 |
20130014153 | Bhatia | Jan 2013 | A1 |
20130014158 | Bhatia | Jan 2013 | A1 |
20130014222 | Bhatia | Jan 2013 | A1 |
20130014223 | Bhatia | Jan 2013 | A1 |
20130019258 | Bhatia | Jan 2013 | A1 |
20130019262 | Bhatia | Jan 2013 | A1 |
20130064527 | Maharajh | Mar 2013 | A1 |
20130074009 | Jones | Mar 2013 | A1 |
20130080578 | Murad | Mar 2013 | A1 |
20130097009 | Akadiri | Apr 2013 | A1 |
20130124683 | Watanabe | May 2013 | A1 |
20130179440 | Gordon | Jul 2013 | A1 |
20130218862 | Ghosh | Aug 2013 | A1 |
20130246518 | Nace | Sep 2013 | A1 |
20130254897 | Reedy | Sep 2013 | A1 |
20130262619 | Goodwin | Oct 2013 | A1 |
20130282839 | Alcala | Oct 2013 | A1 |
20130290483 | Svendsen | Oct 2013 | A1 |
20130297429 | Akadiri | Nov 2013 | A1 |
20130297694 | Ghosh | Nov 2013 | A1 |
20130298009 | Akadiri | Nov 2013 | A1 |
20130311408 | Bagga | Nov 2013 | A1 |
20130312028 | Dharmaji | Nov 2013 | A1 |
20130339149 | Akadiri | Dec 2013 | A1 |
20130339152 | Akadiri | Dec 2013 | A1 |
20140019891 | Borah | Jan 2014 | A1 |
20140040371 | Gurevich | Feb 2014 | A1 |
20140040427 | Doyle | Feb 2014 | A1 |
20140057658 | Murad | Feb 2014 | A1 |
20140074984 | Frazier | Mar 2014 | A1 |
20140108613 | Randall | Apr 2014 | A1 |
20140137153 | Fay | May 2014 | A1 |
20140173020 | Reilly | Jun 2014 | A1 |
20140173641 | Bhatia | Jun 2014 | A1 |
20140173643 | Bhatia | Jun 2014 | A1 |
20140201180 | Fatourechi | Jul 2014 | A1 |
20140201258 | Jowett | Jul 2014 | A1 |
20140201785 | Dharmaji | Jul 2014 | A1 |
20140215513 | Ramer | Jul 2014 | A1 |
20140222478 | Wang | Aug 2014 | A1 |
20140223573 | Reedy | Aug 2014 | A1 |
20140258469 | Maharajh | Sep 2014 | A1 |
20140280479 | Kazerani | Sep 2014 | A1 |
20140280480 | Kazerani | Sep 2014 | A1 |
20140316903 | Maharajh | Oct 2014 | A1 |
20140317112 | Maharajh | Oct 2014 | A1 |
20140325030 | Maharajh | Oct 2014 | A1 |
20140342659 | Maharajh | Nov 2014 | A1 |
20140365618 | Doyle | Dec 2014 | A1 |
20150006703 | Jowett | Jan 2015 | A1 |
20150019550 | Maharajh | Jan 2015 | A1 |
20150058378 | Jones | Feb 2015 | A1 |
20150058396 | Frumin | Feb 2015 | A1 |
20150078247 | Maharajh | Mar 2015 | A1 |
20150087224 | Maharajh | Mar 2015 | A1 |
20150109338 | McKinnon | Apr 2015 | A1 |
20150113096 | Svendsen | Apr 2015 | A1 |
20150127758 | Frazier | May 2015 | A1 |
20150143390 | Fay | May 2015 | A1 |
20150150046 | Maharajh | May 2015 | A1 |
20150172729 | Jacoby | Jun 2015 | A1 |
20150178299 | Kazerani | Jun 2015 | A1 |
20150195615 | Dharmaji | Jul 2015 | A1 |
20150199382 | Yamada | Jul 2015 | A1 |
20150334469 | Bhatia | Nov 2015 | A1 |
20150358667 | Bhatia | Dec 2015 | A1 |
20160088333 | Bhatia | Mar 2016 | A1 |
20160261679 | Doyle | Sep 2016 | A1 |
20160337709 | Bhatia | Nov 2016 | A1 |
20160360261 | Makhlouf | Dec 2016 | A1 |
20170124593 | Nickerson | May 2017 | A1 |
20170150219 | Bhatia | May 2017 | A1 |
Entry |
---|
Jiao et al, “Cost Optimization for Online Social Networks on Geo-Distributed Clouds” IEEE 2012 20th IEEE International Conference on Network Protocols (ICNP), Oct. 30-Nov. 2, 2012; pp. 1-10. |
Li et al, “Relationships Between Geographical Cluster and Cyberspace Community: A Case Study onMicroblog”, IEEE 2012 20th International Conference on Geoinformatics (Geoinformatics); Jun. 15-17, 2012; pp. 1-5. |
Number | Date | Country | |
---|---|---|---|
20150113070 A1 | Apr 2015 | US |