Home // SERVICE COMPUTATION 2015, The Seventh International Conferences on Advanced Service Computing // View article

Finding Optimal REST Service Oracle Based on Hierarchical REST Chart

Authors:
Li Li
Wu Chou

Keywords: REST API; Hierarchical REST Chart; REST Oracle; Petri-Net; Shortest Path

Abstract:
Based on the hypertext-driven nature of REST API, this paper presents a structural approach for REST client design and implementation, in which a REST client is decomposed into two reusable functional modules: a client oracle that selects hyperlinks to follow for a given goal, and a client agent that carries out the interaction as instructed by the oracle. This decomposition has several advantages over a monolithic REST client where the two functions are intertwined and inseparable. To automatically find an optimal client oracle from a machine-readable description of a REST API, we introduce the path selection framework and apply Dijkstra’s Shortest Path algorithm to Hierarchical REST Chart, which is an enhancement and extension to the original REST Chart that describes REST API based on Colored Petri-Net. The proposed method has been implemented in Java and tested on two sets of Hierarchical REST Charts. Experimental results indicate that the proposed approach is effective and promising.

Pages: 21 to 26

Copyright: Copyright (c) IARIA, 2015

Publication date: March 22, 2015

Published in: conference

ISSN: 2308-3549

ISBN: 978-1-61208-387-2

Location: Nice, France

Dates: from March 22, 2015 to March 27, 2015