Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Service selection in service oriented architecture using probabilistic approach and asynchronous queues with interceptor validation

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 10 No. 1 (2020)

DOI
10.11591/ijece.v10i1.pp396-406
ISSN
2088-8708, 2088-8708
Terbit
2020-02-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

In service Oriented Architecture, many services are offered with similar functionality but with different service quality parameters. Thus the service selection using a deterministic approach causes conflicts and inefficient results. We use asynchronous queue to model the service inventory architecture avoiding unnecessary locking of resources and thus allowing a provision to consumers to get their required services without intervening and with temporally decoupled fashion. Actually this kind of service selection strategy is considered in regards with game theory to eliminate fluctuations of queue length. It offers a discrete random service which is equal to some request requested by consumers, it means service can be provided based on probability mass function as a substitute of deterministic decisions for selecting a proper service provider as of the consumers. Once the request is taken out from the queue, it is delivered to the interceptor that has validation and sanitization module. It thus reduces the peak queue length and reduces periodic fluctuations in the queue length.

Jaringan kolaborasi para penulis

5 penulis · 6 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • SRM Institute of Science and Technology
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
M. S. Antony VigilSRM Institute of Science and Technology1
M. S. Bennet PrabaSRM Institute of Science and Technology1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Service selection in service oriented architecture using probabilistic approach and asynchronous queues with interceptor validation</dc:title><dc:creator>Chelliah, Balika J.</dc:creator><dc:creator>Sathish, K.</dc:creator><dc:creator>Kumar, S. Arun</dc:creator><dc:description>&lt;jats:p&gt;In service Oriented Architecture, many services are offered with similar functionality but with different service quality parameters. Thus the service selection using a deterministic approach causes conflicts and inefficient results. We use asynchronous queue to model the service inventory architecture avoiding unnecessary locking of resources and thus allowing a provision to consumers to get their required services without intervening and with temporally decoupled fashion. Actually this kind of service selection strategy is considered in regards with game theory to eliminate fluctuations of queue length. It offers a discrete random service which is equal to some request requested by consumers, it means service can be provided based on probability mass function as a substitute of deterministic decisions for selecting a proper service provider as of the consumers. Once the request is taken out from the queue, it is delivered to the interceptor that has validation and sanitization module. It thus reduces the peak queue length and reduces periodic fluctuations in the queue length.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2020-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v10i1.pp396-406</dc:identifier><dc:identifier>10.11591/ijece.v10i1.pp396-406</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 10 No 1 (2020); 396</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/18305/13454</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>