<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-20T03:58:25Z</responseDate><request verb="GetRecord" identifier="oai:ianstudios.peervie.com:article/01a1ddab-120b-71a9-8ad5-9626d3a3ec8c" metadataPrefix="oai_dc">https://ianstudios.peervie.com/oai</request><GetRecord><record><header><identifier>oai:ianstudios.peervie.com:article/01a1ddab-120b-71a9-8ad5-9626d3a3ec8c</identifier><datestamp>2026-11-15T06:22:55Z</datestamp><setSpec>jit</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:title xml:lang="id">Ambang Konsolidasi Tenant pada Arsitektur SaaS Multi-Tenant: Model Antrean M/M/c untuk Menyeimbangkan Latensi p95 dan Biaya Infrastruktur</dc:title><dc:title xml:lang="en">Tenant Consolidation Thresholds in Multi-Tenant SaaS Architectures: An M/M/c Queueing Model for Balancing p95 Latency and Infrastructure Cost</dc:title><dc:creator>Wasian, Abdullah</dc:creator><dc:subject xml:lang="id">SaaS multi-tenant</dc:subject><dc:subject xml:lang="id">teori antrean</dc:subject><dc:subject xml:lang="id">Erlang C</dc:subject><dc:subject xml:lang="id">latensi ekor</dc:subject><dc:subject xml:lang="id">perencanaan kapasitas</dc:subject><dc:subject xml:lang="id">biaya cloud</dc:subject><dc:description xml:lang="id">Konsolidasi banyak tenant pada satu node adalah sumber utama efisiensi biaya aplikasi Software as a Service (SaaS) multi-tenant, tetapi menaikkan antrean dan memperpanjang ekor latensi. Penelitian ini menurunkan ambang konsolidasi, yaitu jumlah tenant terbanyak per node yang masih memenuhi target tingkat layanan (SLO) latensi persentil ke-95 (p95), memakai model antrean M/M/c dengan rumus Erlang C dan distribusi waktu tinggal eksak. Model divalidasi dengan simulasi kejadian diskrit (10 replikasi × 110.000 permintaan per skenario). Pada konfigurasi dasar (8 worker, waktu layanan rata-rata 40 ms, 2 permintaan/detik per tenant), 60 tenant per node menghasilkan utilisasi 60,0%, peluang menunggu 14,0%, latensi rata-rata 41,7 ms, dan latensi p95 122,3 ms. Ambang konsolidasi untuk SLO p95 200 ms adalah 90 tenant per node, dengan biaya Rp48.667 per tenant per bulan, 91,1% lebih rendah daripada isolasi penuh. Galat p95 model terhadap simulasi kurang dari 0,3% pada seluruh skenario. Hasil juga menunjukkan bahwa latensi rata-rata menyembunyikan lonjakan ekor: setelah utilisasi sekitar 80%, p95 naik jauh lebih cepat daripada rata-rata, dan bila waktu layanan 80 ms, SLO tidak dapat dicapai berapa pun jumlah worker-nya. Model, data, dan kode dibuka untuk diuji ulang pembaca melalui Lab Simulasi.</dc:description><dc:description xml:lang="en">Consolidating many tenants on one node is the main source of cost efficiency in multi-tenant Software as a Service (SaaS) applications, but it lengthens queues and the latency tail. This study derives the consolidation threshold, the largest number of tenants per node that still meets a 95th-percentile (p95) latency service level objective (SLO), using an M/M/c queueing model with the Erlang C formula and the exact sojourn-time distribution. The model is validated against discrete-event simulation (10 replications of 110,000 requests per scenario). In the base configuration (8 workers, 40 ms mean service time, 2 requests/s per tenant), 60 tenants per node yield 60.0% utilisation, a 14.0% waiting probability, 41.7 ms mean latency, and 122.3 ms p95 latency. The threshold for a 200 ms p95 SLO is 90 tenants per node, at Rp48,667 per tenant per month, 91.1% cheaper than full isolation. The p95 error against simulation is below 0.3% in all scenarios. Mean latency hides the tail surge beyond about 80% utilisation, and with an 80 ms service time the SLO cannot be met regardless of the number of workers. The model, data, and code are open for readers to re-run in the Simulation Lab.</dc:description><dc:publisher>Ianstudios Institute</dc:publisher><dc:date>2026-11-15</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:type>info:eu-repo/semantics/publishedVersion</dc:type><dc:type>Peer-reviewed Article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://ianstudios.peervie.com/j/jit/article/01a1ddab-120b-71a9-8ad5-9626d3a3ec8c</dc:identifier><dc:identifier>https://doi.org/10.5555/jit.v1i1.d3a3ec8c</dc:identifier><dc:source>Journal Of Information &amp; Technology; Vol. 1 No. 1 (2026); 9</dc:source><dc:language>ind</dc:language><dc:relation>https://ianstudios.peervie.com/j/jit/article/01a1ddab-120b-71a9-8ad5-9626d3a3ec8c/pdf</dc:relation><dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>