HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.
DOI: 10.1109/hpdc.2005.1520964
|View full text |Cite
|
Sign up to set email alerts
|

GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
12
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…In the case, further consumption requests will be denied even though the granted bandwidth is not depleted globally. Karmon et al [18] utilize a tree structure to distribute and enforce quotas in grids. Consumption requests will only be served when there is enough quota remaining in the node locally.…”
Section: Related Workmentioning
confidence: 99%
“…In the case, further consumption requests will be denied even though the granted bandwidth is not depleted globally. Karmon et al [18] utilize a tree structure to distribute and enforce quotas in grids. Consumption requests will only be served when there is enough quota remaining in the node locally.…”
Section: Related Workmentioning
confidence: 99%
“…GWiQ-P [15] constructs trees to balance the distribution of resource coins among a cluster of machines that share a global quota. It allows cluster administrators to tune the behavior of the protocol in response to failures between a reliable, heavyweight transaction protocol and an eventually consistent, lightweight coin recovery procedure.…”
Section: Related Workmentioning
confidence: 99%
“…Karmon et al [12] proposed a quota-enforcement protocol for grid environments that relies on a decentralized mechanism to collect information about free resource quotas as soon as an application issues a demand. In contrast, our protocol proactively balances such information over all machines serving a customer, which allows granting most demands for free quota instantly.…”
mentioning
confidence: 99%
“…In contrast, our protocol proactively balances such information over all machines serving a customer, which allows granting most demands for free quota instantly. Furthermore, this paper goes beyond [12] in extending fault tolerance and in discussing how to integrate with cloud computing. Raghavan et al [13] proposed an approach targeting distributed rate limiting using a gossip inspired algorithm in cloudcomputing environments.…”
mentioning
confidence: 99%