Web service selection algorithm using Vickrey auction

Atsushi Watanabe, Fuyuki Ishikawa, Yoshiaki Fukazawa, Shinichi Honiden

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)

    Abstract

    The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit.

    Original languageEnglish
    Title of host publicationProceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012
    Pages336-342
    Number of pages7
    DOIs
    Publication statusPublished - 2012
    Event2012 IEEE 19th International Conference on Web Services, ICWS 2012 - Honolulu, HI
    Duration: 2012 Jun 242012 Jun 29

    Other

    Other2012 IEEE 19th International Conference on Web Services, ICWS 2012
    CityHonolulu, HI
    Period12/6/2412/6/29

    Fingerprint

    Web services
    Quality of service
    Composite materials
    Concretes
    Profitability
    Chemical analysis

    Keywords

    • Service Composition
    • Service Selection
    • Vickrey Auction
    • Web Services

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Watanabe, A., Ishikawa, F., Fukazawa, Y., & Honiden, S. (2012). Web service selection algorithm using Vickrey auction. In Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012 (pp. 336-342). [6257825] https://doi.org/10.1109/ICWS.2012.83

    Web service selection algorithm using Vickrey auction. / Watanabe, Atsushi; Ishikawa, Fuyuki; Fukazawa, Yoshiaki; Honiden, Shinichi.

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012. 2012. p. 336-342 6257825.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Watanabe, A, Ishikawa, F, Fukazawa, Y & Honiden, S 2012, Web service selection algorithm using Vickrey auction. in Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012., 6257825, pp. 336-342, 2012 IEEE 19th International Conference on Web Services, ICWS 2012, Honolulu, HI, 12/6/24. https://doi.org/10.1109/ICWS.2012.83
    Watanabe A, Ishikawa F, Fukazawa Y, Honiden S. Web service selection algorithm using Vickrey auction. In Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012. 2012. p. 336-342. 6257825 https://doi.org/10.1109/ICWS.2012.83
    Watanabe, Atsushi ; Ishikawa, Fuyuki ; Fukazawa, Yoshiaki ; Honiden, Shinichi. / Web service selection algorithm using Vickrey auction. Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012. 2012. pp. 336-342
    @inproceedings{05ec388f885542d0a22c93980ffa51e3,
    title = "Web service selection algorithm using Vickrey auction",
    abstract = "The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit.",
    keywords = "Service Composition, Service Selection, Vickrey Auction, Web Services",
    author = "Atsushi Watanabe and Fuyuki Ishikawa and Yoshiaki Fukazawa and Shinichi Honiden",
    year = "2012",
    doi = "10.1109/ICWS.2012.83",
    language = "English",
    isbn = "9780769547527",
    pages = "336--342",
    booktitle = "Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012",

    }

    TY - GEN

    T1 - Web service selection algorithm using Vickrey auction

    AU - Watanabe, Atsushi

    AU - Ishikawa, Fuyuki

    AU - Fukazawa, Yoshiaki

    AU - Honiden, Shinichi

    PY - 2012

    Y1 - 2012

    N2 - The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit.

    AB - The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit.

    KW - Service Composition

    KW - Service Selection

    KW - Vickrey Auction

    KW - Web Services

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

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

    U2 - 10.1109/ICWS.2012.83

    DO - 10.1109/ICWS.2012.83

    M3 - Conference contribution

    AN - SCOPUS:84866378974

    SN - 9780769547527

    SP - 336

    EP - 342

    BT - Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012

    ER -