-
公开(公告)号：US09955012B2
公开(公告)日：2018-04-24
申请号：US12710544
申请日：2010-02-23
申请人： Aleksandr Stolyar , Martin Ira Reiman , Nikolay Korolev , Vladimir Mezhibovsky , Herbert Ristock
发明人： Aleksandr Stolyar , Martin Ira Reiman , Nikolay Korolev , Vladimir Mezhibovsky , Herbert Ristock
CPC分类号： H04M3/523 , H04M3/42042 , H04M3/42365 , H04M2201/14
摘要： A method for mapping ready agents to incoming transactions has steps for (a) placing incoming transactions in a first queue managed by software executing from a machine-readable medium on a computerized appliance; (b) issuing a determined number of invitations in a period of time to agents known to be available to consider an invitation to interact with an incoming transaction; (c) placing identification of ready agents, who have accepted an invitation to interact, in a second queue managed by the software; (d) mapping transactions from the first queue to agents from the second queue; (e) monitoring changes in state of both the first and the second queues in the time period; and (f) adjusting determined number of invitations in step (b) in a manner to drive a chosen system performance metric toward a desired target value.
-
公开(公告)号：US20100266116A1
公开(公告)日：2010-10-21
申请号：US12710544
申请日：2010-02-23
申请人： Aleksandr Stolyar , Martin Ira Reiman , Nikolay Korolev , Vladimir Mezhibovsky , Herbert Ristock
发明人： Aleksandr Stolyar , Martin Ira Reiman , Nikolay Korolev , Vladimir Mezhibovsky , Herbert Ristock
IPC分类号： H04M5/00
CPC分类号： H04M3/523 , H04M3/42042 , H04M3/42365 , H04M2201/14
摘要： A method for mapping ready agents to incoming transactions has steps for (a) placing incoming transactions in a first queue managed by software executing from a machine-readable medium on a computerized appliance; (b) issuing a determined number of invitations in a period of time to agents known to be available to consider an invitation to interact with an incoming transaction; (c) placing identification of ready agents, who have accepted an invitation to interact, in a second queue managed by the software; (d) mapping transactions from the first queue to agents from the second queue; (e) monitoring changes in state of both the first and the second queues in the time period; and (f) adjusting determined number of invitations in step (b) in a manner to drive a chosen system performance metric toward a desired target value.
摘要翻译： 用于将就绪代理映射到传入事务的方法具有以下步骤：（a）将传入事务放置在由计算机化设备上的机器可读介质执行的软件管理的第一队列中; （b）在一段时间内发出确定数量的邀请，以便知道可以考虑邀请与进入交易进行交互的代理人; （c）在由软件管理的第二个队列中放置接受邀请进行交互的准备代理的识别; （d）将来自第一队列的事务从第二队列映射到代理; （e）在该时间段内监视第一和第二队列的状态变化; 以及（f）以使得所选择的系统性能指标朝向期望目标值的方式调整步骤（b）中确定的邀请数量。
-
公开(公告)号：US07174180B2
公开(公告)日：2007-02-06
申请号：US10895743
申请日：2004-07-21
CPC分类号： H04W72/1247 , H04L45/00 , H04W72/1236
摘要： Systems and techniques for scheduling of data transmission to remote mobile units so as to provide at least an acceptably low level of delay. A scheduler computes an urgency value for each data stream serving a mobile unit and sets the urgency value equal to the highest urgency value of a data stream serving the mobile unit. The scheduler computes a scheduling priority for each mobile unit based on a computation that takes into account the urgency value of the mobile unit and schedules the highest priority mobile unit for service, selecting the highest priority data stream serving the mobile unit scheduled for transmission. The urgency value for a data stream depends on the sensitivity of the data stream to delay and the delay experienced by the data stream. Computation of the urgency value may take into account a delay limit associated with the data stream.
摘要翻译： 用于调度到远程移动单元的数据传输的系统和技术，以便提供至少可接受的低水平的延迟。 调度器为服务于移动单元的每个数据流计算紧急度值，并将紧急度值设置为服务移动单元的数据流的最高紧急度值。 调度器基于考虑了移动单元的紧急度并计划用于服务的最高优先级移动单元的计算来计算每个移动单元的调度优先级，选择服务于被调度传输的移动单元的最高优先级数据流。 数据流的紧急度取决于数据流对延迟的敏感性和数据流所经历的延迟。 紧急度值的计算可以考虑与数据流相关联的延迟限制。
-
公开(公告)号：US20060203768A1
公开(公告)日：2006-09-14
申请号：US11073513
申请日：2005-03-07
申请人： Aleksandr Stolyar
发明人： Aleksandr Stolyar
IPC分类号： H04Q7/00
CPC分类号： H04L47/10 , H04L47/11 , H04L47/122 , H04L47/26 , H04L47/30 , H04W28/14 , H04W28/22 , H04W84/047
摘要： Systems and techniques to set a new service rate for one or more queues of a router and a new power consumption level for a router is disclosed. The queues are configured to store data packets awaiting transmission from the router. The setting of the new service rate or rates and new power level is based on a service rate of the one or more queues and a power consumption level of the router. The techniques disclosed further include resetting a new service rate for the one or more queues of the router and a new power consumption level of the router. The resetting of the new service rate or rates and new power level is based on a service rate of the one or more queues and a power consumption level of the router. The setting and resetting steps are based differently on the power consumption level of the router.
-
公开(公告)号：US08411624B2
公开(公告)日：2013-04-02
申请号：US12459435
申请日：2009-07-01
CPC分类号： H04W72/085 , H04W16/10 , H04W52/244
摘要： A method of dynamic resource allocations in wireless network is disclosed. The method provides that a base station in the network allocates resources to users independently of other base stations and without resource planning. Resource allocations are done based at least in part on a local optimization objective and a channel quality indicator from one or more users, and result in efficient resource reuse.
摘要翻译： 公开了一种无线网络中动态资源分配的方法。 该方法规定，网络中的基站将独立于其他基站的资源分配给用户，而无需资源规划。 至少部分地基于来自一个或多个用户的本地优化目标和信道质量指示符来完成资源分配，并且导致有效的资源重用。
-
公开(公告)号：US20100034157A1
公开(公告)日：2010-02-11
申请号：US12459435
申请日：2009-07-01
IPC分类号： H04W72/04
CPC分类号： H04W72/085 , H04W16/10 , H04W52/244
摘要： A method of dynamic resource allocations in wireless network is disclosed. The method provides that a base station in the network allocates resources to users independently of other base stations and without resource planning. Resource allocations are done based at least in part on a local optimization objective and a channel quality indicator from one or more users, and result in efficient resource reuse.
摘要翻译： 公开了一种无线网络中动态资源分配的方法。 该方法规定，网络中的基站将独立于其他基站的资源分配给用户，而无需资源规划。 至少部分地基于来自一个或多个用户的本地优化目标和信道质量指示符来完成资源分配，并且导致有效的资源重用。
-
7.发明授权Method for scheduling wireless downlink transmissions subject to rate constraints 失效用于按照速率约束调度无线下行链路传输的方法公开(公告)号：US07298719B2
公开(公告)日：2007-11-20
申请号：US10122660
申请日：2002-04-15
IPC分类号： H04Q7/00
CPC分类号： H04W72/1257 , H04L47/14 , H04L47/50 , H04L47/527 , H04L47/623 , H04W72/1226
摘要： A new approach is described for scheduling uplink or downlink transmissions in a network having remote terminals communicating with a central hub. The scheduler keeps track of a token count. The token count for a given remote terminal is incremented by a target amount in each pertinent timeslot, but is also decremented each time that the remote terminal is served. The amount of the decrement for one timeslot is the amount of data served, i.e., transmitted to or from the remote terminal, in that timeslot. In exemplary embodiments of the invention, the target amount by which T is incremented depends on the current value of T. Whenever the token count is non-negative (i.e., whenever it has a positive or zero value), the target amount is a desired floor, or lower limit, on an average amount of data delivered to or from the given remote terminal in one timeslot. Whenever the token count is negative, the target amount is a desired ceiling, or upper limit, on the same average amount of data delivered. In each timeslot, each remote terminal is assigned a weight proportional to a product of at least two factors: a function relating the individual remote terminal to overall network performance, and at least one increasing function of the token count. Each time a scheduling decision is made, the scheduler selects for service that remote terminal having the highest weight.
摘要翻译： 描述了一种用于在具有与中央集线器通信的远程终端的网络中调度上行链路或下行链路传输的新方法。 调度器跟踪令牌计数。 给定的远程终端的令牌计数在每个相关时隙中增加一个目标量，但是每当远程终端被服务时也会递减。 一个时隙的减量量是在该时隙中所服务的数据量，即向远程终端发送的数据量。 在本发明的示例性实施例中，T递增的目标量取决于T的当前值。每当令牌计数为非负值（即，每当其具有正或零值）时，目标量是期望的 在一个时隙内传送给或来自给定远程终端的平均数据量的楼层或下限。 每当令牌计数为负数时，目标数量是相同平均数据量所需的上限或上限。 在每个时隙中，每个远程终端被分配与至少两个因素的乘积成比例的权重：将各个远程终端与整体网络性能相关联的功能以及令牌计数的至少一个增加功能。 每当进行调度决定时，调度器选择具有最高权重的远程终端的服务。
-
8.发明申请公开(公告)号：US20070076631A1
公开(公告)日：2007-04-05
申请号：US11241684
申请日：2005-09-30
申请人： Piyush Gupta , Aleksandr Stolyar
发明人： Piyush Gupta , Aleksandr Stolyar
IPC分类号： H04L12/28 , H04L12/413
摘要： There is provided a method and apparatus for managing a random access communication system. More specifically, there is provided calculating a first value representative of a transmission success rate between first and second wireless nodes, wherein the transmissions from the first node create interference at a third node, calculating a second value representative of a transmission success rate for transmissions between one or more other nodes and the third node, and setting an access attempt percentage for the first node based on the first value and the second value.
摘要翻译： 提供了一种用于管理随机接入通信系统的方法和装置。 更具体地，提供了计算表示第一和第二无线节点之间的传输成功率的第一值，其中来自第一节点的传输在第三节点处产生干扰，计算代表传输成功率的第二值， 一个或多个其他节点和第三节点，并且基于第一值和第二值来设置第一节点的访问尝试百分比。
-
9.发明申请公开(公告)号：US20050286477A1
公开(公告)日：2005-12-29
申请号：US10876808
申请日：2004-06-25
CPC分类号： H04W74/0875
摘要： An apparatus includes a first node configured to transmit both data frames and requests for channel reservations to a local contention neighborhood of a network. The first node is configured to compete with other nodes of the neighborhood for reservations to the channel. The first node is configured to dynamically update a stored value of an access priority for the first node and to transmit said requests with a rate that depends on the stored value.
摘要翻译： 一种装置包括：第一节点，被配置为将数据帧和信道预留请求发送到网络的本地争用邻域。 第一个节点被配置为与邻域的其他节点竞争以预留该信道。 第一节点被配置为动态地更新第一节点的访问优先级的存储值并且以取决于存储的值的速率发送所述请求。
-
公开(公告)号：US20130311662A1
公开(公告)日：2013-11-21
申请号：US13474773
申请日：2012-05-18
申请人： Aleksandr Stolyar
发明人： Aleksandr Stolyar
IPC分类号： G06F15/173 , G06F9/455
CPC分类号： G06F9/5061 , G06F9/45558 , G06F9/5027 , G06F9/5077 , G06F2009/45562 , G06F2009/4557
摘要： Assigning virtual machines to host machines in a cloud computing arrangement includes at least one of several techniques that facilitate reducing or minimizing the number of host machines serving virtual machines. One technique includes using place holders in place of a virtual machine that vacates a host machine. The place holders indicate the type of vacated virtual machine and are replaced with a new virtual machine request of a corresponding type. Another technique includes a greedy assignment algorithm for identifying a host machine for a new virtual machine request that will yield an optimized increment to a value of a function that corresponds to a current cloud resource allocation. One technique includes using a modified version of a derivative of the function used in the greedy assignment algorithm, with the modification depending on a number of virtual machines in the cloud system at the time of the new request.
摘要翻译： 以云计算方案为虚拟机分配虚拟机包括有助于减少或最小化服务于虚拟机的主机的数量的几种技术中的至少一种。 一种技术包括使用占位符代替腾出主机的虚拟机。 占位符表示已腾出虚拟机的类型，并替换为相应类型的新虚拟机请求。 另一种技术包括一种用于识别用于新的虚拟机请求的主机的贪心分配算法，该虚拟机请求将产生对应于当前云资源分配的功能的值的优化增量。 一种技术包括使用在贪心分配算法中使用的函数的导数的修改版本，其中修改取决于在新请求时云系统中的多个虚拟机。
-
-
-
-
-
-
-
-
-
搜索结果
28 条记录 (耗时 0.016 秒)