2009 International Conference on Complex, Intelligent and Software Intensive Systems 2009
DOI: 10.1109/cisis.2009.53
|View full text |Cite
|
Sign up to set email alerts
|

Integration of Shareable Containers with Distributed Hash Tables for Storage of Structured and Dynamic Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…DHT provides a simple method for content-based routing of operations to distributed system nodes. In a nutshell DHT-based tuple-space implementations [11] [12] [14]use one or more fields of a tuple and template as input to a hash function that produces a key. In turn this key is used to obtain an identifier for the node where the a tuple or template is sent to be processed.…”
Section: Scalability Of Indirect Communication Middlewarementioning
confidence: 99%
“…DHT provides a simple method for content-based routing of operations to distributed system nodes. In a nutshell DHT-based tuple-space implementations [11] [12] [14]use one or more fields of a tuple and template as input to a hash function that produces a key. In turn this key is used to obtain an identifier for the node where the a tuple or template is sent to be processed.…”
Section: Scalability Of Indirect Communication Middlewarementioning
confidence: 99%