Claim Missing Document
Check
Articles

Found 16 Documents
Search

Implementasi Protokol TCP/IP dalam Meningkatkan Efisiensi Transfer Data Satriani Satriani; Dewi Andriany; Rusmawati Rusmawati; Mima Mima; Masnur Masnur; Salwana S; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 3 (2026): MEI 2026
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/v0njge04

Abstract

The Transmission Control Protocol/Internet Protocol (TCP/IP) protocol is a crucial foundation for modern computer network communication interactions, enabling structured and reliable data transfer. This study aims to evaluate the application of TCP/IP to improve data delivery efficiency across a variety of network environments, including local area networks (LANs) and wide area networks (WANs). Through a systematic literature review and comparative analysis, this study investigates how TCP/IP works, the elements that influence transmission efficiency, and optimization methods that can be applied to improve network performance. The study's findings reveal that data delivery efficiency is significantly influenced by TCP window size settings, congestion control algorithms, and network infrastructure conditions. Proper TCP/IP implementation, including adjustments to parameters such as window size, can significantly reduce latency and dramatically increase throughput. The study also demonstrates that the choice between TCP and UDP should consider the nature of the application and data reliability requirements. The study's conclusions provide practical advice for network administrators and system developers on improving data delivery performance through efficient TCP/IP protocol configuration. These findings have a significant impact on the development of more efficient and responsive networks to meet today's data transmission demands
Pengenalan Struktur Data dan Perannya  dalam Pemrograman Satriani Satriani; Dewi Andriany; Rusmawati Rusmawati; Mima Mima; Masnur Masnur; Salwana S; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 3 (2026): MEI 2026
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/x1en1t53

Abstract

Data structures are one of the most important foundations of computer science, defining how information is stored, organized, and manipulated within a computing system. Without a proper understanding of data structures, a software developer will struggle to design efficient, scalable, and reliable systems. This article aims to provide a comprehensive overview of the fundamental concepts of data structures and their crucial role in modern programming practice. It covers various types of data structures—from linear structures such as arrays, linked lists, stacks, and queues to non-linear structures such as trees, graphs, and hash tables—and discusses criteria for selecting an appropriate data structure based on the problem context. The method used is a systematic literature review of relevant scientific publications, technical reports, and official documentation from 2026 onward. The results of the study indicate that selecting an appropriate data structure directly affects the time and space complexity of an algorithm, which ultimately impacts the overall performance of a software system. Furthermore, this article also identifies several gaps in the literature related to the teaching of data structures in academic settings, particularly in Indonesia. It is hoped that this article will serve as a useful academic reference for students, researchers, and practitioners in the fields of information technology and software engineering.
Penting Struktur Data Tree dalam Mengelolah Data Komputer Intan Sahyuni; Aura Chintiya Bella; Muhammad Rijal; Syaira Ramadhani; Eksyel Bongga Upa'; Suci Dian Azzahra; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 4 (2026): JUNI-JULI
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/qp33pp54

Abstract

The rapid development of information technology has increased the need for efficient and structured data management. Large amounts of data require systems that can organize, process, and access information quickly and accurately. One of the most widely used solutions in computer science is the tree data structure. This structure organizes data hierarchically, making searching, inserting, and deleting processes more efficient. This study aims to analyze the importance of tree data structures in managing computer data and compare their performance with other data structures such as arrays and linked lists. The research method used is a quantitative approach with descriptive-experimental methods through simulations of several data structures using different data sizes. The results show that binary search trees provide faster search performance compared to linear data structures, especially for large datasets. In addition, tree structures are highly effective for managing hierarchical data such as file systems and databases. Therefore, tree data structures are considered an important component in improving the efficiency of modern computer data management.
Implementasi Hak Akses User dalam Mencegah Kebocoran Data Jaringan Intan Sahyuni; Aura Chintiya Bella; Muhammad Rijal; Syaira Ramadhani; Eksyel Bongga Upa’; Suci Dian Azzahra; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 4 (2026): JUNI-JULI
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/f98cap10

Abstract

Network security has become an important issue in the digital era due to the increasing use of data-based systems in various sectors. Many organizations store important information within computer networks, causing the risk of data leakage to increase significantly. One of the main causes of data leakage is poor user access management. This study aims to analyze the implementation of user access rights in preventing network data leakage through the application of Role-Based Access Control (RBAC) and Network Access Control (NAC). The research method used is a quantitative approach with descriptive-analytical methods and network system simulations. Research data were obtained through user access testing and network activity analysis. The results show that the implementation of RBAC can limit user access according to their duties and responsibilities, thereby reducing the risk of data misuse. In addition, the use of NAC helps the system validate devices that are allowed to access the network. The combination of these two methods has proven effective in improving network security and reducing the risk of data leakage significantly.
Studi Komparatif Efisiensi Memori antara Struktur Data Array dan Linked List Ummi Rufaidah Hamka; Nurul Syafirah; Muh. Aprian Naufal; Asipa Febriana; Nurjannah Nurjannah; Nurpadila Nurpadila; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 4 (2026): JUNI-JULI
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/wbzdgx50

Abstract

The selection of linear data structures directly impacts memory efficiency and software performance. This study conducts a profound comparative analysis between arrays and linked lists using a quantitative experimental approach. Benchmarking was performed across sequential access, random access, insertion, and deletion scenarios using C++ and Python with dataset sizes from 103 to 107 elements. Memory consumption was tracked via Valgrind Massif and the tracemalloc library. In C++, arrays consistently outperform linked lists in sequential access with a 3.2× speedup on 106 elements due to optimal CPU cache locality. Conversely, for middle insertions, linked lists show a dramatic advantage with a constant time of ~50ns, compared to 2.3ms for arrays (46,000× slower). Regarding memory for primitive data, singly linked lists incur a 200% pointer overhead and doubly linked lists 400% on 64-bit systems. This research concludes that arrays serve as the best default for intensive computation, while linked lists are recommended for dynamic data manipulation.
Analisis Efektivitas Protokol Autentikasi Jaringan Nirkabel Berdasarkan Parameter (QoS) Ummi Rufaidah Hamka; Nurul Syafirah; Muh. Aprian Naufal; Asipa Febriana; Nurpadila Nurpadila; Nurjannah Nurjannah; Ketrin Rinayanti Manullang
Jejak digital: Jurnal Ilmiah Multidisiplin Vol. 2 No. 4 (2026): JUNI-JULI
Publisher : INDO PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63822/1wymms59

Abstract

The need for wireless networks (Wi-Fi) in academic environments such as the University of West Sulawesi continues to increase along with the increasing number of users. However, the surge of connected devices without access control burdens the Access Point, resulting in a decrease in service quality such as unstable connections and high data delivery failures. This study aims to analyze the effectiveness of implementing a wireless network authentication protocol based on Quality of Service (QoS) parameters using the Telecommunications and Internet Protocol Harmonization Over Network (TIPHON) standard. The method used is Action Research by monitoring and processing Wi-Fi network traffic data using Wireshark software in two different locations, namely Building A (without an authentication system) and the Library (with an authentication system). The QoS parameters tested include throughput, packet loss, delay, and jitter. The results show that both locations have an average QoS index of 2.25 (Moderate Category). Building A boasts superior throughput of 466 Kbps, but its delay (157.1 ms) and jitter (42.06 ms) performance are less stable, with packet loss reaching 85.17% due to the density of freely connected external devices. In contrast, the Library, which implemented an authentication system, had significantly superior network stability, with a highly responsive delay of 9.54 ms (Excellent) and jitter of 4.51 ms (Good), despite its lower throughput capacity of 144 Kbps. This study concludes that implementing an authentication system is a fundamental requirement for limiting the number of unauthorized users, preventing traffic congestion, and maintaining stable network service quality on campus.