Autonomic cloud resource sharing for intercloud federations

被引:24
作者
Erdil, D. Cenk [1 ]
机构
[1] Istanbul Bilgi Univ, Dept Comp Engn, TR-34060 Istanbul, Turkey
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2013年 / 29卷 / 07期
关键词
Cloud and grid federation; Interoperability; Intercloud federation; Resource scheduling; Resource sharing; Cloud connectivity;
D O I
10.1016/j.future.2012.03.025
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1700 / 1708
页数:9
相关论文
共 28 条
  • [1] [Anonymous], P INT C PAR DISTR PR
  • [2] [Anonymous], 2001, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, DOI DOI 10.1007/3-540-45518-3_18
  • [3] Bektas T., 2006, 1 IEEE MULT COMM WOR
  • [4] Carzaniga Antonio, 1998, CUCS86398
  • [5] A Grid resource brokering strategy based on resource and network performance in Grid
    Chinnaiah, Valliyammai
    Somasundaram, Thamarai Selvi
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2012, 28 (03): : 491 - 499
  • [6] Job-resource matchmaking on Grid through two-level benchmarking
    Clematis, A.
    Corana, A.
    D'Agostino, D.
    Galizia, A.
    Quarati, A.
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2010, 26 (08): : 1165 - 1179
  • [7] Deolasee P., 2001, 10 INT WORLD WID WEB
  • [8] Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions
    Elmroth, Erik
    Tordsson, Johan
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2008, 24 (06): : 585 - 593
  • [9] Erdil D. Cenk, 2007, THESIS BINGHAMTON U
  • [10] Erdil D. Cenk, 2010, J PEER TO PEER NETWO, V2, P298