A Scenario Based Approach for Service Identification

2010 IEEE 34th Annual Computer Software and Applications Conference Workshops ◽

10.1109/compsacw.2010.48 ◽

2010 ◽

Cited By ~ 3

Author(s):

Suntae Kim ◽

Minseong Kim ◽

Vijayan Sugumaran ◽

Sooyong Park

Keyword(s):

Service Identification

Download Full-text

Study on the Delay Guaranteed Scheduling Mechanism of the Central Stage Buffered Multiple-Plane and Multiple-Stage Packet Switching Fabric Based on Service Identification

Chinese Journal of Computers ◽

10.3724/sp.j.1016.2013.00201 ◽

2014 ◽

Vol 36 (1) ◽

pp. 201-208

Author(s):

Xiang-Jie MA ◽

Xiao-Zhong LI ◽

Xing-Long FAN ◽

Hong-Yan CHEN

Keyword(s):

Packet Switching ◽

Switching Fabric ◽

Service Identification ◽

Multiple Plane

Download Full-text

A model driven and clustering method for service identification directed by metrics

Software Practice and Experience ◽

10.1002/spe.2913 ◽

2020 ◽

Vol 51 (2) ◽

pp. 449-484

Author(s):

Mohammad Daghaghzadeh ◽

Seyed Morteza Babamir

Keyword(s):

Clustering Method ◽

Model Driven ◽

Service Identification

Download Full-text

Web Service Candidate Identification Using the Firefly Algorithm

International Journal of Web Services Research ◽

10.4018/ijwsr.2018100103 ◽

2018 ◽

Vol 15 (4) ◽

pp. 45-60

Author(s):

Negar Abbasi ◽

Ali Moeini ◽

Taghi Javdani Gandomani

Keyword(s):

Web Service ◽

Firefly Algorithm ◽

Service Oriented Architecture ◽

High Reliability ◽

Legacy Software ◽

Service Identification ◽

Service Oriented ◽

Automatic Methods ◽

Reservation System ◽

Candidate Identification

Identification of web service candidates in legacy software is a crucial process in the reengineering of legacy systems to service oriented architecture. Researchers have proposed various automatic and semi-automatic methods for this purpose, some of which have proved to be quite efficient, but there are still certain gaps which need to be addressed. This article discovers the strengths and weaknesses of previous methods and develops a method with improved service candidate identification performance. In this article, service identification is considered as a search and optimization problem and a firefly algorithm is developed accordingly to give high-quality solutions in reasonably short times. A filtering method is also developed to remove excess modules (false positives) from the algorithm outputs. A case study on a legacy flight reservation system demonstrates the high reliability of the outputs given by the proposed method.

Download Full-text