Accessibility algorithm based on site availability to enhance replica selection in a data grid environment

Ayman Jaradat, Ahmed Patel, M. N. Zakaria, Muhamad A H Amina

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    A data grid functions as a scalable base for grid services to manage data files and their scattered replicas around the world. The principal objective of grid services is to support various data grid applications (jobs) as well as projects. Replica selection is an essential high-level service that selects a Grid location which verifies the shortest response time for the users' jobs among numerous different locations. In the grid environment, estimating response time precisely is not a simple task. Existing replica selection algorithms consume high response time to retrieve replicas because of miss-estimating replicas transfer times. This paper proposes a novel replica selection algorithm that considers site availability in addition to data transfer time. Site availability has not been addressed in previous efforts in the same context this paper does. Site availability is a new factor that can be utilized to estimate response time more accurately. Selecting an unavailable site or selecting a site with insufficient time will likely lead to disconnection. This in turn will require shifting to another site to resume the download or to start the download from scratch depending on the fault tolerance mechanism. Simulation results demonstrate that the performance of the new algorithm is proved to be better than the existing algorithms mentioned in literature.

    Original languageEnglish
    Pages (from-to)105-132
    Number of pages28
    JournalComputer Science and Information Systems
    Volume10
    Issue number1
    DOIs
    Publication statusPublished - Jan 2013

    Fingerprint

    Availability
    Data transfer
    Fault tolerance

    Keywords

    • Data grid architecture
    • Grid component failure
    • Grid computing
    • OptorSim
    • Virtual organization

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Accessibility algorithm based on site availability to enhance replica selection in a data grid environment. / Jaradat, Ayman; Patel, Ahmed; Zakaria, M. N.; Amina, Muhamad A H.

    In: Computer Science and Information Systems, Vol. 10, No. 1, 01.2013, p. 105-132.

    Research output: Contribution to journalArticle

    Jaradat, Ayman ; Patel, Ahmed ; Zakaria, M. N. ; Amina, Muhamad A H. / Accessibility algorithm based on site availability to enhance replica selection in a data grid environment. In: Computer Science and Information Systems. 2013 ; Vol. 10, No. 1. pp. 105-132.
    @article{6a1aa35a59174bf6ad0fb751ca92962d,
    title = "Accessibility algorithm based on site availability to enhance replica selection in a data grid environment",
    abstract = "A data grid functions as a scalable base for grid services to manage data files and their scattered replicas around the world. The principal objective of grid services is to support various data grid applications (jobs) as well as projects. Replica selection is an essential high-level service that selects a Grid location which verifies the shortest response time for the users' jobs among numerous different locations. In the grid environment, estimating response time precisely is not a simple task. Existing replica selection algorithms consume high response time to retrieve replicas because of miss-estimating replicas transfer times. This paper proposes a novel replica selection algorithm that considers site availability in addition to data transfer time. Site availability has not been addressed in previous efforts in the same context this paper does. Site availability is a new factor that can be utilized to estimate response time more accurately. Selecting an unavailable site or selecting a site with insufficient time will likely lead to disconnection. This in turn will require shifting to another site to resume the download or to start the download from scratch depending on the fault tolerance mechanism. Simulation results demonstrate that the performance of the new algorithm is proved to be better than the existing algorithms mentioned in literature.",
    keywords = "Data grid architecture, Grid component failure, Grid computing, OptorSim, Virtual organization",
    author = "Ayman Jaradat and Ahmed Patel and Zakaria, {M. N.} and Amina, {Muhamad A H}",
    year = "2013",
    month = "1",
    doi = "10.2298-CSIS12010204IJ",
    language = "English",
    volume = "10",
    pages = "105--132",
    journal = "Computer Science and Information Systems",
    issn = "1820-0214",
    publisher = "ComSIS Consortium",
    number = "1",

    }

    TY - JOUR

    T1 - Accessibility algorithm based on site availability to enhance replica selection in a data grid environment

    AU - Jaradat, Ayman

    AU - Patel, Ahmed

    AU - Zakaria, M. N.

    AU - Amina, Muhamad A H

    PY - 2013/1

    Y1 - 2013/1

    N2 - A data grid functions as a scalable base for grid services to manage data files and their scattered replicas around the world. The principal objective of grid services is to support various data grid applications (jobs) as well as projects. Replica selection is an essential high-level service that selects a Grid location which verifies the shortest response time for the users' jobs among numerous different locations. In the grid environment, estimating response time precisely is not a simple task. Existing replica selection algorithms consume high response time to retrieve replicas because of miss-estimating replicas transfer times. This paper proposes a novel replica selection algorithm that considers site availability in addition to data transfer time. Site availability has not been addressed in previous efforts in the same context this paper does. Site availability is a new factor that can be utilized to estimate response time more accurately. Selecting an unavailable site or selecting a site with insufficient time will likely lead to disconnection. This in turn will require shifting to another site to resume the download or to start the download from scratch depending on the fault tolerance mechanism. Simulation results demonstrate that the performance of the new algorithm is proved to be better than the existing algorithms mentioned in literature.

    AB - A data grid functions as a scalable base for grid services to manage data files and their scattered replicas around the world. The principal objective of grid services is to support various data grid applications (jobs) as well as projects. Replica selection is an essential high-level service that selects a Grid location which verifies the shortest response time for the users' jobs among numerous different locations. In the grid environment, estimating response time precisely is not a simple task. Existing replica selection algorithms consume high response time to retrieve replicas because of miss-estimating replicas transfer times. This paper proposes a novel replica selection algorithm that considers site availability in addition to data transfer time. Site availability has not been addressed in previous efforts in the same context this paper does. Site availability is a new factor that can be utilized to estimate response time more accurately. Selecting an unavailable site or selecting a site with insufficient time will likely lead to disconnection. This in turn will require shifting to another site to resume the download or to start the download from scratch depending on the fault tolerance mechanism. Simulation results demonstrate that the performance of the new algorithm is proved to be better than the existing algorithms mentioned in literature.

    KW - Data grid architecture

    KW - Grid component failure

    KW - Grid computing

    KW - OptorSim

    KW - Virtual organization

    UR - http://www.scopus.com/inward/record.url?scp=84874582357&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84874582357&partnerID=8YFLogxK

    U2 - 10.2298-CSIS12010204IJ

    DO - 10.2298-CSIS12010204IJ

    M3 - Article

    VL - 10

    SP - 105

    EP - 132

    JO - Computer Science and Information Systems

    JF - Computer Science and Information Systems

    SN - 1820-0214

    IS - 1

    ER -