专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120008494A1 Offering Incentives under a Flat Rate Charging System 失效
标题翻译：在统一收费系统下提供奖励
公开(公告)号：US20120008494A1
公开(公告)日：2012-01-12
申请号：US12832417
申请日：2010-07-08
申请人： Nikolaos Laoutaris , Parminder Chhabra , Pablo Rodriguez Rodriguez , Ravi Sundaram
发明人： Nikolaos Laoutaris , Parminder Chhabra , Pablo Rodriguez Rodriguez , Ravi Sundaram
IPC分类号： H04L12/56
CPC分类号： H04L41/0896 , H04L12/14 , H04L43/067 , H04L47/822 , H04L47/826
摘要： The invention describes a method of providing incentives to users via supporting mechanisms and algorithms for facilitating the move of DT traffic to off-peak hours. It proposes an efficient utilization of the network resources during peak hour under a flat-rate pricing scheme with the cooperation and blessing of the users and without adding complexity to billing.
摘要翻译：本发明描述了一种通过支持机制和算法为用户提供激励以便于将DT流量移动到非高峰时间的方法。提出在高峰时段，在统一费率定价方案下，通过用户的合作和祝福，有效利用网络资源，不增加计费的复杂性。

2. 发明申请

US20130132549A1 METHOD AND A DEVICE FOR BULK DATA TRANSFER IN DELAY-TOLERANT NETWORKS 审中-公开
标题翻译：用于在延迟网络中进行大容量数据传输的方法和装置
公开(公告)号：US20130132549A1
公开(公告)日：2013-05-23
申请号：US13699117
申请日：2011-05-19
申请人： Pablo Rodriguez , Parminder Chhabra , Vijay Erramilli , Nikolaos Laoutaris , Ravi Sundaram
发明人： Pablo Rodriguez , Parminder Chhabra , Vijay Erramilli , Nikolaos Laoutaris , Ravi Sundaram
IPC分类号： H04L12/24
CPC分类号： H04L41/14 , H04L45/00 , H04L45/125
摘要： The method comprises modelling a delay-tolerant dynamic network comprising time-varying links transforming it into a static time-expanded network graph, and managing bulk data transfer on the basis of said static time-expanded network graph.The device comprises a scheduler unit with processing capabilities implementing an algorithm which processes arc costs (cijt) and storage costs (pit) as per the method of the first aspect of the invention.
摘要翻译：该方法包括对包含时变链路的延迟容忍动态网络进行建模，将其变换为静态时间扩展网络图，以及基于所述静态时间扩展网络图来管理批量数据传输。该装置包括具有处理能力的调度器单元，该处理能力实现根据本发明第一方面的方法处理电弧成本（cijt）和存储成本（凹坑）的算法。

3. 发明授权

US08713125B2 Method and system for scaling usage of a social based application on an online social network 失效
标题翻译：用于在在线社交网络上扩展基于社会的应用程序的使用的方法和系统
公开(公告)号：US08713125B2
公开(公告)日：2014-04-29
申请号：US12968515
申请日：2010-12-15
申请人： Josep M. Pujol , Georgos Siganos , Vijay Erramilli , Xiaoyuan Yang , Nikolaos Laoutaris , Parminder Chabbra , Pablo Rodriguez
发明人： Josep M. Pujol , Georgos Siganos , Vijay Erramilli , Xiaoyuan Yang , Nikolaos Laoutaris , Parminder Chabbra , Pablo Rodriguez
IPC分类号： G06F15/16
CPC分类号： H04L67/1095 , G06Q10/10 , H04L67/306
摘要： Method, system and computer program to provide transparent scalability to Online Social Networks and better performance of its back-end databases, by an efficient partitioning of the underlying community structure and replicating of user profiles, ensuring that every user has a master or slave replica of all his neighbors on the same partition where he is located.
摘要翻译：方法，系统和计算机程序，通过有效划分底层社区结构和复制用户配置文件，为在线社交网络提供透明的可扩展性和更好的后端数据库性能，确保每个用户都拥有主他所在的邻居在他所在的同一个分区上。

4. 发明授权

US08446821B2 Offering incentives under a flat rate charging system 失效
标题翻译：在统一收费系统下提供奖励
公开(公告)号：US08446821B2
公开(公告)日：2013-05-21
申请号：US12832417
申请日：2010-07-08
申请人： Nikolaos Laoutaris , Parminder Chhabra , Pablo Rodriguez Rodriguez , Ravi Sundaram
发明人： Nikolaos Laoutaris , Parminder Chhabra , Pablo Rodriguez Rodriguez , Ravi Sundaram
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L41/0896 , H04L12/14 , H04L43/067 , H04L47/822 , H04L47/826
摘要： The invention describes a method of providing incentives to users via supporting mechanisms and algorithms for facilitating the move of DT traffic to off-peak hours. It proposes an efficient utilization of the network resources during peak hour under a flat-rate pricing scheme with the cooperation and blessing of the users and without adding complexity to billing.
摘要翻译：本发明描述了一种通过支持机制和算法为用户提供激励以便于将DT流量移动到非高峰时间的方法。提出在高峰时段，在统一费率定价方案下，通过用户的合作和祝福，有效利用网络资源，不增加计费的复杂性。

5. 发明申请

US20140013321A1 METHOD FOR PROVIDING CLOUD COMPUTING RESOURCES 审中-公开
标题翻译：提供云计算资源的方法
公开(公告)号：US20140013321A1
公开(公告)日：2014-01-09
申请号：US13541888
申请日：2012-07-05
申请人： Nikolaos LAOUTARIS , Rade STANOJEVIC , John S. OTTO
发明人： Nikolaos LAOUTARIS , Rade STANOJEVIC , John S. OTTO
IPC分类号： G06F9/455
CPC分类号： G06F9/5072
摘要： A method is described for providing cloud computing resources. The cloud computing resources having a plurality of virtual machine hours and/or bandwidth storage to be provided by a user and intended to attend a number of requests from the user, the requests including a plurality of tasks per second, the method portioning the virtual machine hours uniformly divided in units among several periods of time and providing access to the units virtual machine hours in response to said user's requests and dynamically allocating the cloud computing resources provided, by means of a temporal load awareness scheme.
摘要翻译：描述了一种用于提供云计算资源的方法。云计算资源具有由用户提供的多个虚拟机小时和/或带宽存储，并且意图参加来自用户的多个请求，该请求包括每秒多个任务，分配虚拟机的方法小时在几个时间段内统一划分，并根据所述用户的请求提供对虚拟机时间的访问，并通过时间负载识别方案动态分配所提供的云计算资源。

6. 发明申请

US20130311555A1 METHOD FOR DISTRIBUTING LONG-TAIL CONTENT 审中-公开
标题翻译：分配长尾含量的方法
公开(公告)号：US20130311555A1
公开(公告)日：2013-11-21
申请号：US13475131
申请日：2012-05-18
申请人： Nikolaos LAOUTARIS , Vijay ERRAMILLI
发明人： Nikolaos LAOUTARIS , Vijay ERRAMILLI
IPC分类号： G06F15/16
CPC分类号： H04L12/6418
摘要： A method for distributing long-tail content, including the steps of: a) loading, a first user, into a local PoP to which said first user is remotely connected an amount of long-tail content to be distributed and shared; and b) geo replicating, at selected times, the amount of long-tail content to a at least one remote PoP, to which at least a second user is remotely connected, by pushing said amount of content to be distributed and shared to the at least one remote PoP. The method including selecting, before performing steps a) and b), the at least second user, based on the probability that the amount of long-tail content generated by the first user will be requested by the at least second user, the probability being estimated by historical preference information generated between the first user and the at least second user.
摘要翻译：一种用于分发长尾内容的方法，包括以下步骤：a）将第一用户加载到所述第一用户远程连接的本地PoP中要分配和共享的长尾内容量; 以及b）在选定的时间，将至少一个远程PoP的长尾内容的量地理复制，至少一个第二用户被远程连接到该远程PoP，通过将所述要分配和共享的内容的量推送到至少一个远程PoP。所述方法包括在执行步骤a）和b）之前，基于由所述至少第二用户请求由所述第一用户生成的长尾内容的量的概率来选择所述至少第二用户，概率为由在第一用户和至少第二用户之间生成的历史偏好信息来估计。

7. 发明申请

US20110276649A1 Method for Efficient Partition and Replication of Social-Based Applications 失效
标题翻译：基于社会的应用程序的高效分区和复制方法
公开(公告)号：US20110276649A1
公开(公告)日：2011-11-10
申请号：US12968515
申请日：2010-12-15
申请人： Josep M. Pujol , Georgos Siganos , Vijay Erramilli , Xiaoyuan Yang , Nikolaos Laoutaris , Parminder Chabbra , Pablo Rodriquez
发明人： Josep M. Pujol , Georgos Siganos , Vijay Erramilli , Xiaoyuan Yang , Nikolaos Laoutaris , Parminder Chabbra , Pablo Rodriquez
IPC分类号： G06F15/16
CPC分类号： H04L67/1095 , G06Q10/10 , H04L67/306
摘要： Method, system and computer program to provide transparent scalability to Online Social Networks and better performance of its back-end databases, by an efficient partitioning of the underlying community structure and replicating of user profiles, ensuring that every user has a master or slave replica of all his neighbours on the same partition where he is located.
摘要翻译：方法，系统和计算机程序，通过有效划分底层社区结构和复制用户配置文件，为在线社交网络提供透明的可扩展性和更好的后端数据库性能，确保每个用户都拥有主他所在的邻居在他所在的同一个分区上。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式