Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Polygon: Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam JITCoS : Journal of Information Technology and Computer System
Nur Bainatun Nisa
Unknown Affiliation
Computer Science & IT Control & Systems Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
A Discrete-Event and Monte Carlo-Based Simulation Model for Multi-Server Call Center Queueing Systems Nur Bainatun Nisa; Dafa Ikhwanu Shafa; Muhammad Yusuf Azmi; Parinduri, Armayanti Akhiriyah
JITCoS : Journal of Information Technology and Computer System Vol. 1 No. 2 (2025): Volume 1 Number 2, December 2025
Publisher : CV. Multimedia Teknologi Kreatif

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.65230/jitcos.v1i2.35

Abstract

This study presents the implementation and performance evaluation of a multi-server queueing system model for call center operations using discrete-event simulation combined with Monte Carlo analysis. The objective is to analyze system performance under varying numbers of service agents to identify the optimal configuration that balances service efficiency and customer satisfaction. The model assumes that customer arrivals follow a Poisson distribution, while service times are exponentially distributed to represent realistic call handling behavior. Simulation experiments were conducted over eight-hour operational periods with server counts ranging from one to eight, each replicated 500 times for statistical robustness. Performance indicators such as average waiting time, server utilization, and Service Level Agreement (SLA) compliance were analyzed to measure system efficiency. Results show that increasing the number of servers significantly reduces average waiting time and enhances service level compliance. Configurations with five or more servers achieved average waiting times close to zero and over 99% compliance with the SLA, while maintaining moderate server utilization levels between 70% and 80%. These findings demonstrate that integrating discrete-event simulation with Monte Carlo methods provides an effective and reliable framework for evaluating service system performance, optimizing resource allocation, and supporting decision-making in call center management.
Perbandingan Waktu Pemecahan Password Menggunakan Algoritma Hash MD5, SHA-256, dan SHA-512 pada Serangan Brute Force Nur Bainatun Nisa; Noni Fauzia Rahmadani; Aulia Kartika Dewi; Luftia Rahma Nasution; Dzilhulaifa Siregara; Rifdah Syahputri; Ibnu Rusydi
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v4i1.926

Abstract

Password security is a critical component in protecting information systems, as passwords are often the primary target of various attacks, particularly brute force attacks. A brute force attack works by systematically attempting all possible character combinations until the correct password corresponding to a stored hash value is found. Therefore, the choice of an appropriate hash algorithm plays a significant role in determining a system’s resistance to such attacks. This study aims to analyze and compare the password cracking time of MD5, SHA-256, and SHA-512 hash algorithms under brute force attack scenarios. The research methodology involves generating hash values from a set of test passwords using each hash algorithm, followed by conducting brute force attacks to recover the original passwords based on the generated hash values. The collected data are analyzed by measuring the time required to crack passwords for each algorithm. The results indicate that MD5 has the fastest cracking time compared to SHA-256 and SHA-512, indicating a lower level of resistance to brute force attacks. SHA-256 demonstrates better security than MD5 but remains less resistant when compared to SHA-512. The SHA-512 algorithm requires the longest cracking time, reflecting the highest level of resistance to brute force attacks among the tested algorithms. In conclusion, hash algorithms with larger bit lengths provide stronger protection against brute force attacks and are more suitable for secure password storage in information systems.
Co-Authors Aulia Kartika Dewi Dafa Ikhwanu Shafa Dzilhulaifa Siregara Ibnu Rusydi Luftia Rahma Nasution Muhammad Yusuf Azmi Noni Fauzia Rahmadani Parinduri, Armayanti Akhiriyah Rifdah Syahputri