Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Leanna Vidya Yovita has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fundamentals, Service and Architecture of Programming Protocol-Independent Packet Processors : A Literature Survey

    by Malldi Saesar Ariffudin, Leanna Vidya Yovita, Tody Ariefianto Wibowo

    The rapid development of network technology necessitates a system capable of adapting to these advancements. Technologies such as 5G, IoT, and Cloud Computing demand flexible and easily configurable network systems. However, the interface differences among providers often hinder this process. Previously, standard connecting protocols were primarily complex and slow to support new protocols. As a solution, P4 emerges as a programming language that allows for the configuration of packet processing and header design according to needs directly in the data plane. This paper discusses the fundamentals of P4 and the services it can run. To clarify its functions, this manuscript explores implementation cases within SDN/IP networks and Named Data Networking (NDN) architecture, including Load Balancing, Caching, Security, Congestion Control, In-band Network Telemetry, Forwarding, and Routing. We also map existing research on each component of SDN and NDN technologies. The manuscript concludes by reviewing challenges and research opportunities for P4 as guidance for further studies.

  • Open Access

    EFFEC: The Efficient Edge-Caching System for Multimedia Communication

    by Jofantus Ferdi Malaioni, Moch. Aril Bachtiar, Muhammad Raihan Baswara, Leanna Vidya Yovita, Tody Ariefianto Wibowo, Sofia Naning Hertiana

    The widespread use of social media with multimedia content and the development of sophisticated and interactive websites affect internet traffic growth. User requests for the same multimedia content cause an increase in the core network load. For this reason, an elegant solution is needed. Instead of supplying additional network capacity, we automatically put content closer to the user. Commonly, a proxy server is used only to monitor the data sent or for load-balancing purposes. However, in our research, proxy servers are exploited to keep the copies of content users request. So that, we not only take advantage of the monitoring and security functions on the proxy server but also take advantage of its ability to store data. We name our proposed system as EFFEC, the efficient edge-caching system that can be used for multimedia communication. This system allows the request for content not to be forwarded to the original server located further away from the user. This strategy provides an efficient communication system. We have successfully built the edge cache system for multimedia communication. The evaluation result shows that using edge caching methods by utilizing a proxy server offers significant improvements in increasing speed, reducing load on the server, and delays.

  • Open Access

    Adaptive Forwarding and Routing of Named Data Networking A Survey

    by Ade Aditya Ramadha, Leanna Vidya Yovita, Tody Ariefianto Wibowo, Ilmi Aulia Assyifatunisa

    Buletin Pos dan Telekomunikasi a.k.a Bulletin of Posts and Telecommunications is a scientific communication media currently managed and published by Ministry of Communications and Informatics


  • Open Access

    A Content Poisoning Attack Detection and Prevention System in Vehicular Named Data Networking

    by Arif Hussain Magsi, Leanna Vidya Yovita, Ali Ghulam, Ghulam Muhammad, Zulfiqar Ali

    Named data networking (NDN) is gaining momentum in vehicular ad hoc networks (VANETs) thanks to its robust network architecture. However, vehicular NDN (VNDN) faces numerous challenges, including security, privacy, routing, and caching. Specifically, the attackers can jeopardize vehicles’ cache memory with a Content Poisoning Attack (CPA). The CPA is the most difficult to identify because the attacker disseminates malicious content with a valid name. In addition, NDN employs request–response-based content dissemination, which is inefficient in supporting push-based content forwarding in VANET. Meanwhile, VNDN lacks a secure reputation management system. To this end, our contribution is three-fold. We initially propose a threshold-based content caching mechanism for CPA detection and prevention. This mechanism allows or rejects host vehicles to serve content based on their reputation. Secondly, we incorporate a blockchain system that ensures the privacy of every vehicle at roadside units (RSUs). Finally, we extend the scope of NDN from pull-based content retrieval to push-based content dissemination. The experimental evaluation results reveal that our proposed CPA detection mechanism achieves a 100% accuracy in identifying and preventing attackers. The attacker vehicles achieved a 0% cache hit ratio in our proposed mechanism. On the other hand, our blockchain results identified tempered blocks with 100% accuracy and prevented them from storing in the blockchain network. Thus, our proposed solution can identify and prevent CPA with 100% accuracy and effectively filters out tempered blocks. Our proposed research contribution enables the vehicles to store and serve trusted content in VNDN.


  • Open Access

    Performance Analysis of Cache Replacement Algorithm using Virtual Named Data Network Nodes

    by Leanna Vidya Yovita, Tody Ariefianto Wibowo, Ade Aditya Ramadha, Gregorius Pradana Satriawan, Sevierda Raniprima

    As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated the NDN performance using a simulator. In this research, we modeled the system using virtual NDN nodes, making the model more relevant to the real NDN. As an essential component in every NDN router, the content store (CS) has a function to keep the data. We use First In First Out (FIFO) and Least Recetly Used (LRU) in our nodes as cache replacement algorithms. The in-depth exploration is done using various scenarios. The result shows that the cache hit ratio (CHR) increases if the size of the CS, the number of interests, and the number of consumers increases. CHR decreases as the number of producers and the number of prefixes increase. As CHR increases, round trip time (RTT) decreases. LRU provides better performance for all cases: higher CHR of 5-15% and lower RTT of 1-10% than FIFO.


  • Open Access

    Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network

    by Leanna Vidya Yovita, Nana Rachmana Syambas, Ian Joseph Matheus Edward

    Today, the internet requires many additional mechanisms or protocols to support various ever-growing applications. As a future internet architecture candidate, the Named Data Network (NDN) offers a solution that naturally fulfills this need. One of the critical components in NDN is cache. Caching in NDN solves bandwidth usage, server load, and service time. Some research about caching has been conducted, but improvements can be made. In this research, we derived the utility function of multiclass content to obtain the relationship between the class’s weight and cache hit ratio. Then, we formulated it into the Weighted-CAPIC caching algorithm. Our research shows that Weighted-CAPIC provides a higher cache hit ratio for the priority class and the whole system. This performance is supported while the algorithm still provides the same path-stretch value as Dynamic-CAPIC. The Weighted-CAPIC is suitable to used in mobile nodes due to its ability to work individually without having to coordinate with other nodes.


  • Open Access

    Performance Analysis of Cache Based on Popularity and Class in Named Data Network

    by Leanna Vidya Yovita, Nana Rachmana Syambas, Ian Joseph Matheus Edward, Noriaki Kamiyama

    The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router’s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers’ request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.


  • The Effect of Consumer Dispersed in Spatially Dispersed Caching Strategy for Information-Centric Networking

    by Sarah Chairul Annisa, Leanna Vidya Yovita, Nana Rachmana Syambas

    Nowadays, there has been a lot of research on Information-Centric Networking (ICN) that is looking for the most efficient way to the content stored on the network. And, the goal is for network user easily to access various content effectively and efficiently. Currently, Spatial Dispersed Caching (SDC) is one of the newest cache strategies on the ICN. Therefore, in this paper, it will further deepen the concept of the SDC strategy, namely by analyzing the path stretch value generated when the consumer condition dispersed and non-dispersed. The results of this study indicate that if consumers are non-dispersed the path stretch value is 2.03. In addition, if consumers are dispersed the path stretch value is 1.13. Thus, average the path stretch value if consumers are dispersed will be smaller than the non-dispersed, this indicates that consumers are more easily get the requested content from the nearest router.


  • CAPIC: Cache based on Popularity and Class in Named Data Network

    by Leanna Vidya Yovita, Nana Rachmana Syambas, Ian Yosef Matheus Edward

    In the IP network, if there are many consumers who want the same data, the request and response process for data will be repeated and will increase the overall network load. Modifications have been made to IP networks, namely by Content Distribution Network which places a duplicate server in a place closer to the consumer. CDN managed to reduce network load but cannot accommodate changes in dynamic consumer requests. A new network paradigm was proposed. The network paradigm that was originally host-centric turned into content-centric. This scheme is known as the Named Data Network (NDN). NDN causes data communication to be carried out efficiently and minimizes network load. Content store as an important component of NDN routers is a limited resource. For this reason, certain mechanisms are needed to optimize content store usage. As far as the author's knowledge there are no papers that discuss caching mechanisms that pay attention to popularity and at the same time also differentiate service classes. In fact, there is a variation of traffic related to the traffic requirement. That's why it is necessary to differentiate service class treatment in NDN content store and also consider the content popularity. This paper proposed a caching algorithm namely CAPIC (CAche based on PopularIty and Class). From the simulation, concludes that CAPIC gives the greater hit rate compared to another scheme that only considers popularity and the better path stretch and appropriates with the cache proportion based on class.


  • Open Access

    Caching on Named Data Network: a Survey and Future Research

    by Leanna Vidya Yovita, Nana Rachmana Syambas

    The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.