An Efficient Approach for QoS-Aware Service Selection Based on a Tree-Based Algorithm

Service oriented architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development cost and time. SOA also promises loosely coupled, interoperable, and composable services. In order to maximize these benefits, many researchers...

Full description

Saved in:
Bibliographic Details
Published in7th IEEE/ACIS International Conference on Computer and Information Science] : (IEEE/ACIS ICIS 2008), in conjunction with 2nd IEEE/ACIS International Workshop on e-Activity : (IEEE/ACIS IWEA 2008) : proceedings, 14-16 May 2008, Portland, Oregon pp. 605 - 610
Main Authors Minhyuk Oh, Jongmoon Baik, Sungwon Kang, Ho-jin Choi
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2008
Subjects
Online AccessGet full text
ISBN9780769531311
0769531318
DOI10.1109/ICIS.2008.8

Cover

Abstract Service oriented architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development cost and time. SOA also promises loosely coupled, interoperable, and composable services. In order to maximize these benefits, many researchers have focused on service composition techniques, especially in terms of providing quality of services (QoS) to consumers in a dynamic environment. In current literature, many approaches, such as the genetic algorithm, integer programming, and the Pinsinger algorithm approaches, have been proposed for service compositions to provide quality of services to consumers. However, these approaches are inefficient when any problem occurs during service executions since the problem causes the current execution stop, and service rebinding is required for the unexecuted path. In addition, even if a better service is discovered, it cannot be easily replaced in these approaches because replacing a single service causes a problem on global QoS constraints. In this paper, we focus on these problems by proposing a tree-based algorithm in order to provide optimal services to consumers consistently and efficiently even when the status of selected services have changed. As a result, consumers can always use the optimal services of high qualities.
AbstractList Service oriented architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development cost and time. SOA also promises loosely coupled, interoperable, and composable services. In order to maximize these benefits, many researchers have focused on service composition techniques, especially in terms of providing quality of services (QoS) to consumers in a dynamic environment. In current literature, many approaches, such as the genetic algorithm, integer programming, and the Pinsinger algorithm approaches, have been proposed for service compositions to provide quality of services to consumers. However, these approaches are inefficient when any problem occurs during service executions since the problem causes the current execution stop, and service rebinding is required for the unexecuted path. In addition, even if a better service is discovered, it cannot be easily replaced in these approaches because replacing a single service causes a problem on global QoS constraints. In this paper, we focus on these problems by proposing a tree-based algorithm in order to provide optimal services to consumers consistently and efficiently even when the status of selected services have changed. As a result, consumers can always use the optimal services of high qualities.
Author Ho-jin Choi
Jongmoon Baik
Sungwon Kang
Minhyuk Oh
Author_xml – sequence: 1
  surname: Minhyuk Oh
  fullname: Minhyuk Oh
  organization: Sch. of Eng., Inf. & Commun. Univ., Daejeon
– sequence: 2
  surname: Jongmoon Baik
  fullname: Jongmoon Baik
  organization: Sch. of Eng., Inf. & Commun. Univ., Daejeon
– sequence: 3
  surname: Sungwon Kang
  fullname: Sungwon Kang
  organization: Sch. of Eng., Inf. & Commun. Univ., Daejeon
– sequence: 4
  surname: Ho-jin Choi
  fullname: Ho-jin Choi
  organization: Sch. of Eng., Inf. & Commun. Univ., Daejeon
BookMark eNotj0FLw0AUhBe0oK05efSyfyB1N5vkvT3GUmuhINL2XF6zb-1Km5RNUPz3ptS5fDMMDMxY3DZtw0I8ajXVWtnn5Wy5nmZK4RRvRGIBFZS2MNpoPRLjoQCbmxKyO5F03ZcaZGyuMLsX26qRc-9DHbjpZXU-x5bqg_RtlB_tOq1-KLJcc_wO9YVHrvvQNvKFOnZyMCQ3kTm95ur42cbQH04PYuTp2HHyz4nYvs43s7d09b5YzqpVGjQUfcqqAI9OEYA3ebHXWblHJOuwRFTOOdA5GQAia5FKX2qowblcF47M5d5EPF13AzPvzjGcKP7u8iKziMb8AZ82ULc
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICIS.2008.8
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore (NTUSG)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore (NTUSG)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 610
ExternalDocumentID 4529883
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-e057f8d0a77f345b126b88a9d86880ddd714a377aa998a6f617c7dd415da35313
IEDL.DBID RIE
ISBN 9780769531311
0769531318
IngestDate Wed Aug 27 02:12:47 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2007943672
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-e057f8d0a77f345b126b88a9d86880ddd714a377aa998a6f617c7dd415da35313
PageCount 6
ParticipantIDs ieee_primary_4529883
PublicationCentury 2000
PublicationDate 2008-May
PublicationDateYYYYMMDD 2008-05-01
PublicationDate_xml – month: 05
  year: 2008
  text: 2008-May
PublicationDecade 2000
PublicationTitle 7th IEEE/ACIS International Conference on Computer and Information Science] : (IEEE/ACIS ICIS 2008), in conjunction with 2nd IEEE/ACIS International Workshop on e-Activity : (IEEE/ACIS IWEA 2008) : proceedings, 14-16 May 2008, Portland, Oregon
PublicationTitleAbbrev ICIS
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000394082
Score 1.443052
Snippet Service oriented architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development...
SourceID ieee
SourceType Publisher
StartPage 605
SubjectTerms Binary Search Tree (BST)
Binary search trees
Costs
Genetic algorithms
Information science
Investments
Linear programming
Quality of service
Quality of Service (QoS)
Service Composition
Service oriented architecture
Service Oriented Architecture (SOA)
Service Selection
Software agents
Software algorithms
Title An Efficient Approach for QoS-Aware Service Selection Based on a Tree-Based Algorithm
URI https://ieeexplore.ieee.org/document/4529883
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NT8IwFG-AkydUMH6nB48W9t3uOAkETDAaIOFGXj-mRNzMMmLiX2-7FYzGg6e1OyzNa7v3e-3v_R5CN46gkApwiAxDnwQ-AwLKcQgNeBqnIEBwkzs8fYjGi-B-GS4b6HafC6OUqshnqmea1V2-zMXWHJX1zSUhY34TNSmL6lyt_XmKY0p8MxuZx3pl6cVqBXZ2fdfm57lO3J8MJrOaScl-1FWp3Mqojaa7AdVsktfetuQ98flLq_G_Iz5E3e8EPvy4d01HqKGyY9TeVXDAdkN30CLJ8LASkdCfwYnVF8cayOKnfEaSDygUtr8T_dxUvK0M32nXJ7FuAJ4XSpG6n2ye82Jdvrx10WI0nA_GxBZaIGuNHkqiNGhLmXSA0tQPQu56EWcMYskivb2llNQNwKcUQAdnEKUa9Qgqpfb9Enxj2hPUyvJMnSLs-SKIUl_G1MRekccpV7EHPIiVRgLMPUMdY6XVe62lsbIGOv_79QU6qPkZhmB4iVplsVVXGgSU_Lqa_S-1k61X
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFG4QD3pCBeNve_BoYWPd2h0ngYAC0QAJN9JfUyJuZhkx8a-33QpG48HT2h2W5uV173vt970HwI0jCIsFc5D0fQ9hjzLElOMggnkcxkwwwY12eDQO-jN8P_fnFXC71cIopQrymWqaYXGXL1OxNkdlLXNJSKm3A3Z9jLFfqrW2JyqOafJNbW4eat_S7mpL7GzmrlXouU7YGnQGk5JLSX90VikCS68GRpsllXyS1-Y6503x-ata43_XfAAa3xI--LgNToegopIjUNv0cIB2S9fBLEpgtygjoT8DI1thHGooC5_SCYo-WKag_aHo56pgbiXwTgc_CfWAwWmmFCrn0eo5zZb5y1sDzHrdaaePbKsFtNT4IUdKw7aYSocREnvY52474JSyUNJAb3ApJXEx8whhTKdnLIg17hFESh39JfOMaY9BNUkTdQJg2xM4iD0ZEpN9BW1OuArbjONQaSxA3VNQN1ZavJfVNBbWQGd_v74Ge_3paLgYDsYP52C_ZGsYuuEFqObZWl1qSJDzq8ITvgD_EbCk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=7th+IEEE%2FACIS+International+Conference+on+Computer+and+Information+Science%5D+%3A+%28IEEE%2FACIS+ICIS+2008%29%2C+in+conjunction+with+2nd+IEEE%2FACIS+International+Workshop+on+e-Activity+%3A+%28IEEE%2FACIS+IWEA+2008%29+%3A+proceedings%2C+14-16+May+2008%2C+Portland%2C+Oregon&rft.atitle=An+Efficient+Approach+for+QoS-Aware+Service+Selection+Based+on+a+Tree-Based+Algorithm&rft.au=Minhyuk+Oh&rft.au=Jongmoon+Baik&rft.au=Sungwon+Kang&rft.au=Ho-jin+Choi&rft.date=2008-05-01&rft.pub=IEEE&rft.isbn=9780769531311&rft.spage=605&rft.epage=610&rft_id=info:doi/10.1109%2FICIS.2008.8&rft.externalDocID=4529883
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769531311/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769531311/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769531311/sc.gif&client=summon&freeimage=true