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

1. 发明申请

US20070211633A1 Competitive and considerate congestion control 有权
标题翻译：竞争和周到的拥塞控制
公开(公告)号：US20070211633A1
公开(公告)日：2007-09-13
申请号：US11454203
申请日：2006-06-16
申请人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
发明人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
IPC分类号： H04L12/26 , G06F15/16 , H04J3/14
CPC分类号： H04L47/10 , H04L47/18 , H04L47/193 , H04L47/245 , H04L47/25 , H04L47/263 , H04L47/27 , Y02D50/10
摘要： An end-to-end congestion control is provided that emulates a different service differentiation than the common low-normal priority. This protocol is referred to as 4CP (Competitive, Considerate Congestion Control). The target service differentiation enables provisioning of per-flow average bandwidth guarantees to “normal” traffic, but not at the expense of potentially starving the “low” priority traffic (4CP). It thus features incentive compatibility to file-transfer applications that are throughput-greedy but want to be considerate to other traffic. 4CP is implemented and configured as a sender-only adaptation of standard TCP, and requires no special network feedback. Configuration of the bandwidth guarantee is either statically configured or automatically adjusted by 4CP. The automatic mode aims to be TCP-friendly over appropriately large timescale.
摘要翻译：提供端到端拥塞控制，其模拟与普通低正常优先级不同的服务区分。该协议被称为4CP（竞争性，有意思的拥塞控制）。目标服务差异使得能够将每流量平均带宽保证提供给“正常”流量，但不能以牺牲“低”优先流量（4CP）为代价。因此，它具有对吞吐量贪心但想要考虑其他流量的文件传输应用程序的激励兼容性。 4CP被实现和配置为标准TCP的仅发送者适配，并且不需要特殊的网络反馈。带宽保证的配置是静态配置的或由4CP自动调整。自动模式旨在在适当的大时间尺度上对TCP友好。

2. 发明授权

US07649841B2 Competitive and considerate congestion control 有权
标题翻译：竞争和周到的拥塞控制
公开(公告)号：US07649841B2
公开(公告)日：2010-01-19
申请号：US11454203
申请日：2006-06-16
申请人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
发明人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L47/18 , H04L47/193 , H04L47/245 , H04L47/25 , H04L47/263 , H04L47/27 , Y02D50/10
摘要： An end-to-end congestion control is provided that emulates a different service differentiation than the common low-normal priority. This protocol is referred to as 4CP (Competitive, Considerate Congestion Control). The target service differentiation enables provisioning of per-flow average bandwidth guarantees to “normal” traffic, but not at the expense of potentially starving the “low” priority traffic (4CP). It thus features incentive compatibility to file-transfer applications that are throughput-greedy but want to be considerate to other traffic. 4CP is implemented and configured as a sender-only adaptation of standard TCP, and requires no special network feedback. Configuration of the bandwidth guarantee is either statically configured or automatically adjusted by 4CP. The automatic mode aims to be TCP-friendly over appropriately large timescale.
摘要翻译：提供端到端拥塞控制，其模拟与普通低正常优先级不同的服务区分。该协议被称为4CP（竞争性，有意思的拥塞控制）。目标服务差异使得能够将每流量平均带宽保证提供给“正常”流量，但不能以牺牲“低”优先流量（4CP）为代价。因此，它具有对吞吐量贪心但想要考虑其他流量的文件传输应用程序的激励兼容性。 4CP被实现和配置为标准TCP的仅发送者适配，并且不需要特殊的网络反馈。带宽保证的配置是静态配置的或由4CP自动调整。自动模式旨在在适当的大时间尺度上对TCP友好。

3. 发明申请

US20120309358A1 Decentralized Relaying Algorithm for Mobile Devices 有权
标题翻译：移动设备的分散式中继算法
公开(公告)号：US20120309358A1
公开(公告)日：2012-12-06
申请号：US13150535
申请日：2011-06-01
申请人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
发明人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
IPC分类号： H04W4/12
CPC分类号： H04W88/04
摘要： A decentralized relaying algorithm for mobile devices is described. In an embodiment, a mobile device acts as a relay within a network of mobile devices and on contact with a source device downloads messages from the source according to a locally stored relaying probability for each channel of information within the network. These messages are subsequently downloaded to another device which is the end user of the message. Where the relay does not download the message from the source as a result of the decision made based on the relaying probability, a virtual message is downloaded which comprises metadata only and not the payload of the message. The relay updates the stored relaying probabilities for each channel based on locally observable information which includes feedback received from mobile devices to which the relay has downloaded messages. The feedback identifies unique paths for the payload of messages through the network.
摘要翻译：描述了用于移动设备的分散中继算法。在一个实施例中，移动设备充当移动设备的网络内的中继器，并且在与源设备接触的情况下，根据网络内的每个信道信道的本地存储的中继概率来从源下载消息。这些消息随后被下载到消息的最终用户的另一设备。由于作为基于中继概率的决定的结果，中继器不从源地下载消息，所以下载虚拟消息，其仅包含元数据而不是消息的有效载荷。继电器基于本地可观察到的信息更新每个信道的存储的中继概率，该信息包括从中继已下载消息的移动设备接收到的反馈。反馈通过网络识别消息有效载荷的唯一路径。

4. 发明授权

US08886731B2 Decentralized relaying algorithm for mobile devices 有权
标题翻译：移动设备的分散中继算法
公开(公告)号：US08886731B2
公开(公告)日：2014-11-11
申请号：US13150535
申请日：2011-06-01
申请人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
发明人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
IPC分类号： G06F15/16 , H04W88/04
CPC分类号： H04W88/04
摘要： A decentralized relaying algorithm for mobile devices is described. In an embodiment, a mobile device acts as a relay within a network of mobile devices and on contact with a source device downloads messages from the source according to a locally stored relaying probability for each channel of information within the network. These messages are subsequently downloaded to another device which is the end user of the message. Where the relay does not download the message from the source as a result of the decision made based on the relaying probability, a virtual message is downloaded which comprises metadata only and not the payload of the message. The relay updates the stored relaying probabilities for each channel based on locally observable information which includes feedback received from mobile devices to which the relay has downloaded messages. The feedback identifies unique paths for the payload of messages through the network.
摘要翻译：描述了用于移动设备的分散中继算法。在一个实施例中，移动设备充当移动设备的网络内的中继器，并且在与源设备接触的情况下，根据网络内的每个信道信道的本地存储的中继概率来从源下载消息。这些消息随后被下载到消息的最终用户的另一设备。由于作为基于中继概率的决定的结果，中继器不从源地下载消息，所以下载虚拟消息，其仅包含元数据而不是消息的有效载荷。继电器基于本地可观察到的信息更新每个信道的存储的中继概率，该信息包括从中继已下载消息的移动设备接收到的反馈。反馈通过网络识别消息有效载荷的唯一路径。

5. 发明申请

US20080215583A1 Ranking and Suggesting Candidate Objects 有权
标题翻译：排名和建议候选对象
公开(公告)号：US20080215583A1
公开(公告)日：2008-09-04
申请号：US11681031
申请日：2007-03-01
申请人： Dinan Gunawardena , Milan Vojnovic , Richard James Cruise , Peter Marbach
发明人： Dinan Gunawardena , Milan Vojnovic , Richard James Cruise , Peter Marbach
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： A method of ranking and suggesting objects, such as tags, is described in which a group of objects are suggested to a user in relation to a particular information object, such as a web page or file. A user either selects one of the suggestions or enters an alternative object and on receipt of data identifying the particular object selected by the user, the group of suggestions is updated based on whether the object selected by the user was one of the suggestions or not. The updating of the group may also be based on other factors, such as ranking parameters associated with each of the objects.
摘要翻译：描述了对诸如标签的对象进行排名和建议的方法，其中向特定信息对象（例如网页或文件）向用户建议一组对象。用户选择建议之一或输入替代对象，并且在接收到识别由用户选择的特定对象的数据时，基于用户选择的对象是否是建议之一来更新建议组。组的更新也可以基于其他因素，例如与每个对象相关联的排名参数。

6. 发明授权

US08695009B2 Allocating tasks to machines in computing clusters 有权
标题翻译：将任务分配给计算集群中的计算机
公开(公告)号：US08695009B2
公开(公告)日：2014-04-08
申请号：US13089081
申请日：2011-04-18
申请人： Milan Vojnovic , Amin Karbasi
发明人： Milan Vojnovic , Amin Karbasi
IPC分类号： G06F9/46
CPC分类号： G06F9/5033 , G06F9/5038
摘要： Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a lookup table. In an example the index may be include an indication of the preference for the task to be processed on a particular processor, an indication of a waiting time for the task to be processed and an indication of how other tasks being processed in the computing cluster may be penalized by assigning a task to a particular processor. In an embodiment tasks are assigned to a processor by accessing the lookup table, selecting a task for processing using the index and scheduling the selected task for allocation to a processor.
摘要翻译：描述了将任务分配到计算群集中的计算机。在一个实施例中，在调度器处接收与作业相关联的一组任务。在一个实施例中，可以为任务和处理器的每个组合计算索引并存储在查找表中。在一个示例中，索引可以包括对要在特定处理器上处理的任务的偏好的指示，要处理的任务的等待时间的指示以及在计算集群中如何处理其他任务的指示通过将任务分配给特定处理器来处罚。在一个实施例中，通过访问查找表将任务分配给处理器，选择使用索引进行处理的任务并调度所选择的任务以分配给处理器。

7. 发明授权

US08380554B2 Modeling a plurality of contests at a crowdsourcing node 有权
标题翻译：在众包节点建模多个比赛
公开(公告)号：US08380554B2
公开(公告)日：2013-02-19
申请号：US13486161
申请日：2012-06-01
申请人： Milan Vojnovic , Dominic Daniel DiPalantino
发明人： Milan Vojnovic , Dominic Daniel DiPalantino
IPC分类号： G06Q10/00
CPC分类号： G06Q99/00 , G06Q10/06311 , G06Q10/063112 , G06Q10/063118 , G06Q10/06313 , G06Q10/067 , G06Q10/101 , G06Q30/0208 , G06Q50/01
摘要： Crowdsourcing is described, for example, where solutions to tasks such as designing a logo, writing a piece of code or answering a question are solicited by making open calls to large scale communities. In an example, a crowdsourcing node models a plurality of contests as all-pay auctions, each contest having a task and a reward. In examples, the crowdsourcing node is arranged to set rewards for the contests so that the optimal results are received for each contest owner, those owners having provided a budget and using a utility function for each of the contests.
摘要翻译：例如，众包被描述为通过向大规模社区进行公开呼叫来征求对诸如设计标志，编写代码或回答问题的任务的解决方案。在一个示例中，众包节点将多个比赛建模为全薪拍卖，每个比赛具有任务和奖励。在示例中，众包节点被安排为比赛设置奖励，以便为每个比赛所有者，所有者提供预算并且为每个比赛使用效用函数接收最佳结果。

8. 发明申请

US20130246608A1 COUNT TRACKING IN DISTRIBUTED ENVIRONMENTS 审中-公开
标题翻译：在分布式环境中进行追踪
公开(公告)号：US20130246608A1
公开(公告)日：2013-09-19
申请号：US13420612
申请日：2012-03-15
申请人： Zhenming Liu , Bozidar Radunovic , Milan Vojnovic
发明人： Zhenming Liu , Bozidar Radunovic , Milan Vojnovic
IPC分类号： G06F15/173
CPC分类号： H04L43/024 , H04L41/069 , H04L43/026 , H04L43/028
摘要： Count tracking in distributed environments is described, for example, as in data centers where many sites receive data and a coordinator node estimates a sum of the data received across the sites. Count tracking may be used in database applications, search engines, social networking applications and others. In various embodiments sites and a coordinator node work together to implement a process for summing data received at sites, where the sum takes into account both increments and decrements. In examples, a site decides whether to notify the coordinator node of a new data item according to a sampling probability that is related to an estimate of the current global sum of the data input across sites. In some examples a multi-mode algorithm is implemented which increases or decreases communication between the sites and the coordinator node according to behavior of the estimated global sum such that communications costs are optimized.
摘要翻译：在分布式环境中的计数跟踪被描述为例如在许多站点接收数据的数据中心，并且协调器节点估计跨站点接收的数据的总和。计数跟踪可用于数据库应用程序，搜索引擎，社交网络应用程序等。在各种实施例中，站点和协调器节点一起工作以实现用于对在站点处接收的数据进行求和的过程，其中所述总和考虑了增量和减量。在示例中，站点根据与跨站点的数据输入的当前全局和的估计相关联的抽样概率来决定是否向协调器节点通知新数据项。在一些示例中，实现了多模式算法，其根据估计的全局和的行为增加或减少站点和协调器节点之间的通信，使得优化通信成本。

9. 发明授权

US08195498B2 Modeling a plurality of contests at a crowdsourcing node 有权
标题翻译：在众包节点建模多个比赛
公开(公告)号：US08195498B2
公开(公告)日：2012-06-05
申请号：US12467754
申请日：2009-05-18
申请人： Milan Vojnovic , Dominic Daniel DiPalantino
发明人： Milan Vojnovic , Dominic Daniel DiPalantino
IPC分类号： G06Q10/00
CPC分类号： G06Q99/00 , G06Q10/06311 , G06Q10/063112 , G06Q10/063118 , G06Q10/06313 , G06Q10/067 , G06Q10/101 , G06Q30/0208 , G06Q50/01
摘要： Crowdsourcing is described, for example, where solutions to tasks such as designing a logo, writing a piece of code or answering a question are solicited by making open calls to large scale communities. In an example, a crowdsourcing node models a plurality of contests as all-pay auctions, each contest having a task and a reward. In examples, the crowdsourcing node is arranged to set rewards for the contests so that the optimal results are received for each contest owner, those owners having provided a budget and using a utility function for each of the contests. In examples, the crowdsourcing node is arranged to recommend contests to potential participants so that those participants can more easily decide which tasks to take on next.
摘要翻译：例如，众包被描述为通过向大规模社区进行公开呼叫来征求对诸如设计标志，编写代码或回答问题的任务的解决方案。在一个示例中，众包节点将多个比赛建模为全薪拍卖，每个比赛具有任务和奖励。在示例中，众包节点被安排为比赛设置奖励，以便为每个比赛所有者，所有者提供预算并且为每个比赛使用效用函数接收最佳结果。在示例中，众包节点被安排为向潜在参与者推荐比赛，使得参与者可以更容易地决定接下来要执行的任务。

10. 发明申请

US20110213669A1 Allocation of Resources 审中-公开
标题翻译：资源分配
公开(公告)号：US20110213669A1
公开(公告)日：2011-09-01
申请号：US12714238
申请日：2010-02-26
申请人： Milan Vojnovic , Thanh Tien Nguyen
发明人： Milan Vojnovic , Thanh Tien Nguyen
IPC分类号： G06Q30/00 , G06F15/16
CPC分类号： G06Q30/02 , G06Q10/06 , G06Q30/0275 , G06Q30/08
摘要： Allocation of resources is described for example, where the resources are computers, communications network resources or advertisement slots. In an example a weighted proportional resource allocation mechanism is described in which a resource provider seeks to maximize revenue whilst users seek to maximize their satisfaction in terms of the utility of any resource allocation they receive minus any payment they make for the resource allocation. In an example, the provider determines discrimination weights (using information about resource constraints and other factors). For example, the discrimination weights are published to the users; the users submit bids for the resources in the knowledge of the discrimination weights and the provider allocates the resources according to the bids and the discrimination weights. In an example keyword auctions for sponsored search are considered where the resources are advertisement slots and where the constraints include the relative positions of the advertisements.
摘要翻译：描述资源的分配，例如，其中资源是计算机，通信网络资源或广告时隙。在一个示例中，描述了一种加权比例资源分配机制，其中资源提供者寻求最大化收入，而用户寻求使其满足的任何资源分配的效用最大化，减去他们为资源分配所做的任何支付。在一个示例中，提供商确定歧视权重（使用关于资源约束和其他因素的信息）。例如，将歧视权重发布给用户; 用户在辨认权重的知识中提交资源投标，提供者根据投标和歧视权重分配资源。在示例中，关注赞助搜索的关键字拍卖被认为是资源是广告时隙的位置，并且约束包括广告的相对位置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式