Dynamic multicast information dissemination in hybrid satellite-wireless networks
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
Proceedings of the 11th international conference on World Wide Web
Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Hierarchical Proxy Architecture for Internet-Scale Event Services
WETICE '99 Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
A scalable distributed information management system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Transparent information dissemination
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Grid Resource Scheduling with Gossiping Protocols
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Future Generation Computer Systems
Adaptive dissemination protocols for hybrid grid resource scheduling
Adaptive dissemination protocols for hybrid grid resource scheduling
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Job-resource matchmaking on Grid through two-level benchmarking
Future Generation Computer Systems
FRDT: Footprint Resource Discovery Tree for grids
Future Generation Computer Systems
Future Generation Computer Systems
A Grid resource brokering strategy based on resource and network performance in Grid
Future Generation Computer Systems
Optimal Resource Usage in Multi-Cloud Computing Environment
International Journal of Cloud Applications and Computing
| Hi-index | 0.00 |
Recent advances in information technology make remote collaboration and resource sharing easier for next generation distributed systems, such as grids and clouds. One common model of study is the convergence of these systems, along with interclouds to a unified global computing resource. Despite similarities between grids and clouds, there are a number of fundamental differences that make this convergence process harder. For example, clouds have inherent administrative boundaries, something which the grid computing paradigm avoided from the early stages of research. Such administrative boundaries primarily affect capabilities of clouds to be interoperable. Moreover, they also negatively affect the possibility of a seamless intercloud federation on the path to convergence. Resource sharing in general and related communication methodologies, such as information dissemination and matchmaking are also integral elements in this convergence process. To help improve the success of distributed cloud resource schedulers, we propose proxies that disseminate information as agents of dissemination sources. Such proxies can then make information about resource states available at 'distant' clouds, where there may be no direct, or even no indirect control. Moreover, they can make this resource state available more efficiently than where no proxies are used. In particular, with proxies, dissemination overhead is reduced by up to 65% under different scenarios, where existing solutions may not even produce efficient protocols. In addition, proxies help reduce dissemination overhead by 19% on average. Our results also show that randomly selecting proxy nodes perform comparably to other strategies that may select proxies based on particular criteria.