TY - GEN
T1 - Minimizing resource blocking rate in GoOBS
AU - Saha, Shivashis
AU - Deogun, Jitender S.
AU - Xu, Lisong
PY - 2011
Y1 - 2011
N2 - The state of the resources at a destination in Grid computing over OBS architecture (GoOBS) may change between a task's selection of a destination and its arrival at the destination. These changes in the availability of the resources requested at the destination may lead to blocking of tasks, and thus increase the resource blocking rate. In this paper, we investigate the resource scheduling problem in GoOBS. Our objective is to minimize the resource blocking rate by containing the impact of the changes in the availability of the resources at a destination. We propose a non-selfish destination selection paradigm to minimize the resource blocking rate. The selection of a destination by a request is called non-selfish, if the selected destination has sufficient resources available to simultaneously process one or more additional requests. Extensive simulations were performed to validate the effectiveness of the heuristics based on the non-selfish destination selection paradigm. Among the proposed heuristics, the NFFD heuristic is most effective in minimizing the resource blocking rate. Compared to the best existing approach, the NFFD heuristic reduces the resource blocking rate by 21% to 73% in our experiments.
AB - The state of the resources at a destination in Grid computing over OBS architecture (GoOBS) may change between a task's selection of a destination and its arrival at the destination. These changes in the availability of the resources requested at the destination may lead to blocking of tasks, and thus increase the resource blocking rate. In this paper, we investigate the resource scheduling problem in GoOBS. Our objective is to minimize the resource blocking rate by containing the impact of the changes in the availability of the resources at a destination. We propose a non-selfish destination selection paradigm to minimize the resource blocking rate. The selection of a destination by a request is called non-selfish, if the selected destination has sufficient resources available to simultaneously process one or more additional requests. Extensive simulations were performed to validate the effectiveness of the heuristics based on the non-selfish destination selection paradigm. Among the proposed heuristics, the NFFD heuristic is most effective in minimizing the resource blocking rate. Compared to the best existing approach, the NFFD heuristic reduces the resource blocking rate by 21% to 73% in our experiments.
UR - http://www.scopus.com/inward/record.url?scp=84863170594&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863170594&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6133621
DO - 10.1109/GLOCOM.2011.6133621
M3 - Conference contribution
AN - SCOPUS:84863170594
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -