会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Efficient, rate-base multiclass access control
    • 高效,基于速率的多类访问控制
    • US5274644A
    • 1993-12-28
    • US788075
    • 1991-11-05
    • Arthur W. BergerRodolfo A. MilitoWard Whitt
    • Arthur W. BergerRodolfo A. MilitoWard Whitt
    • H04L12/56H04Q11/04H04J3/16
    • H04L12/5602H04Q11/0478H04L2012/5632H04L2012/5635H04L2012/5637H04L2012/5638H04L2012/5651H04L2012/5672
    • A fair and efficient admission scheme enables sharing of a common resource among N traffic classes, such that each class is guaranteed (on a suitable long-term basis) a contracted minimum use of the resource, and each class can go beyond the contract when extra resource capacity becomes temporarily available. The scheme operates in an open loop mode, and thus does not require information describing the current status of the resource. For the purposes of description, one form of the invention is best described in terms of "tokens" and "token banks" with finite sizes. Our scheme uses one token bank per class (bank `i`, i= 1, . . . ,N), plus one spare bank. Class `i` is preassigned a rate, rate(i), i=1, . . . ,N, that represents the "guaranteed throughput" or contracted admission rate for class `i`. Tokens are sent to bank `i` at rate(i). Tokens that find a full bank are sent to the spare bank. When the spare bank is also full, the token is lost. Every admitted arrival consumes a token. A class `i` arrival looks first for a token at bank `i`. If bank `i` is empty, it looks for a token at the spare bank. If the latter is also empty, the arrival is blocked.
    • 公平有效的入学计划能够在N个交通班之间共享一个共同资源,使得每个班级都有合理的最低限度使用资源,保证每个班级(在适当的长期基础上),每个班级可以超出合同额外 资源容量暂时可用。 该方案以开环模式运行,因此不需要描述资源的当前状态的信息。 为了描述的目的,本发明的一种形式最好用具有有限尺寸的“令牌”和“令牌库”来描述。 我们的方案每个类使用一个令牌库(银行i,i = 1,...,N),加上一个备用银行。 类'i'被预先分配一个费率,(i),i = 1。 。 。 ,N表示“i”类的“保证吞吐量”或合同录取率。 令牌以(i)的速率发送到银行i。 找到一个完整银行的令牌被发送到备用银行。 当备用银行也已满时,令牌将丢失。 每一次入场消费都会消耗一个令牌。 班级“我”到达首先在银行“i”上出现一个令牌。 如果银行“我”是空的,它会在备用银行寻找一个令牌。 如果后者也是空的,到达被阻止。
    • 5. 发明授权
    • Systems and methods for sharing of resources
    • 资源共享的系统和方法
    • US5596576A
    • 1997-01-21
    • US552899
    • 1995-11-03
    • Rodolfo A. Milito
    • Rodolfo A. Milito
    • G06F9/46H04J3/24H04L12/56H04M3/00H04Q3/00H04Q3/545H04J3/22H04J3/16
    • H04L47/10H04L47/215H04J3/247H04L2012/5632H04L2012/5636H04L2012/5672
    • A method for allocating access to a shared limited resource among a plurality of users who require access to the resource, the allocation being made such that each user is granted access to the resource at a minimum guaranteed rate associated with each user and such that the resource is available for use by any user exceeding its minimum guaranteed rate only if the resource is available, the method comprising the steps of: assigning tokens to each user at a rate determined by the minimum guaranteed rate associated with each user; storing tokens assigned to each user in a bank associated with each user, each bank having a finite capacity associated with each user; storing tokens assigned to a user whose associated bank has reached its capacity in a bank assigned to another user whose bank is below its capacity; and allowing a user requesting access to the resource to have access to the resource if the user has a predetermined number of tokens in its associated bank and otherwise denying access to the resource.
    • 一种用于在需要访问所述资源的多个用户之间分配对共享有限资源的访问的方法,所述分配被做成使得每个用户被允许以与每个用户相关联的最小保证率访问所述资源,并且所述资源 只有当资源可用时,任何用户才能使用超过其最低保证率的方法,该方法包括以下步骤:以与每个用户相关联的最小保证速率确定的速率向每个用户分配令牌; 存储分配给与每个用户相关联的银行中的每个用户的令牌,每个银行具有与每个用户相关联的有限容量; 存储分配给其相关联银行已经在分配给银行低于其容量的另一用户的银行中的能力的用户的令牌; 并且如果用户在其相关联的银行中具有预定数量的令牌并且否则拒绝对资源的访问,则允许请求访问资源的用户访问资源。