Show simple item record

dc.contributor.authorLeist, A.
dc.contributor.authorHawick, K.A.
dc.date.accessioned2013-05-22T02:19:54Z
dc.date.available2013-05-22T02:19:54Z
dc.date.issued2010
dc.identifier.citationLeist, A., Hawick, K.A. (2010), Small-world networks, distributed hash tables and the e-resource discovery problem, Research Letters in the Information and Mathematical Sciences, 14, 1-16en
dc.identifier.issn1175-2777
dc.identifier.urihttp://hdl.handle.net/10179/4509
dc.description.abstractResource discovery is one of the most important underpinning problems behind producing a scalable, robust and efficient global infrastructure for e-Science. A number of approaches to the resource discovery and management problem have been made in various computational grid environments and prototypes over the last decade. Computational resources and services in modern grid and cloud environments can be modelled as an overlay network superposed on the physical network structure of the Internet and World Wide Web. We discuss some of the main approaches to resource discovery in the context of the general properties of such an overlay network. We present some performance data and predicted properties based on algorithmic approaches such as distributed hash table resource discovery and management. We describe a prototype system and use its model to explore some of the known key graph aspects of the global resource overlay network - including small-world and scale-free properties.en
dc.language.isoenen
dc.publisherMassey Universityen
dc.subjectResource discoveryen
dc.subjectSemantic metadataen
dc.subjectMetadataen
dc.subjectSemantic weben
dc.subjectCloud computingen
dc.subjectDistributed hash tablesen
dc.titleSmall-world networks, distributed hash tables and the e-resource discovery problemen
dc.typeArticleen


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record