Tody Ariefianto Wibowo
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
Research Subjects
Research Interests
Tody Ariefianto Wibowo has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Leanna Vidya Yovita
School of Electrical Engineering, Telkom University, Bandung 40257, Indonesia
7 shared publications Nana Rachmana Syambas
School of Electrical Engineering and Informatics, Bandung Institute of Technology,Bandung,Indonesia
4 shared publicationsFandi Setio Kurniawan
Electrical Engineering Faculty, Telkom University
2 shared publicationsIstikmal
Electrical Engineering Faculty, Telkom University, Bandung, Indonesia
2 shared publicationsLeanna Vidya Yovita
Electrical Engineering Faculty, Telkom University
2 shared publications- Ade Aditya Ramadha
Universitas Telkom
1 shared publication
Latest Publications
- Open Access
- 14 May 2025
- Published by Badan Penelitian dan Pengembangan Sumber Daya Manusia Kementerian Komunikasi dan Informatika in Buletin Pos dan Telekomunikasi
- Vol. 23 (1) , 44-56
Fundamentals, Service and Architecture of Programming Protocol-Independent Packet Processors : A Literature Survey
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.
- 14 May 2025
- Published by Badan Penelitian dan Pengembangan Sumber Daya Manusia Kementerian Komunikasi dan Informatika in Buletin Pos dan Telekomunikasi
- Vol. 23 (1) , 44-56
Open AccessFundamentals, Service and Architecture of Programming Protocol-Independent Packet Processors : A Literature Survey
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
- 6 November 2023
- Published by Badan Penelitian dan Pengembangan Sumber Daya Manusia Kementerian Komunikasi dan Informatika in Buletin Pos dan Telekomunikasi
- Vol. 21 (1) , 32-50
Adaptive Forwarding and Routing of Named Data Networking A Survey
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
- 6 November 2023
- Published by Badan Penelitian dan Pengembangan Sumber Daya Manusia Kementerian Komunikasi dan Informatika in Buletin Pos dan Telekomunikasi
- Vol. 21 (1) , 32-50
Open AccessAdaptive Forwarding and Routing of Named Data Networking A Survey
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
- 4 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
The Routing Protocol Efficiency of Named Data Network
An efficient routing protocol is needed in transmitting data on the network, especially on Named Data Network. This means that the routing mechanism must be made in such a way that the data transmission rate is close to the transmission link rate. This study investigates the effect of a geographic-based routing protocol compared to the link state from an efficiency point of view. The system model is built to see the effect of link bitrate, path stretch, packet header, and packet size on the efficiency of the routing protocol in sending data. From the mathematical model, Link State routing is outperformed geographic routing protocol for 24% on average.
- 4 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
The Routing Protocol Efficiency of Named Data Network
An efficient routing protocol is needed in transmitting data on the network, especially on Named Data Network. This means that the routing mechanism must be made in such a way that the data transmission rate is close to the transmission link rate. This study investigates the effect of a geographic-based routing protocol compared to the link state from an efficiency point of view. The system model is built to see the effect of link bitrate, path stretch, packet header, and packet size on the efficiency of the routing protocol in sending data. From the mathematical model, Link State routing is outperformed geographic routing protocol for 24% on average.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 112-118
Named Data Network (NDN) Scalability Problem
Named Data Network (NDN) is one of the research branches that focuses on developing the internet network for the future. NDN as part of the Information-Centric Network, the IETF initiative Research Group, has a paradigm that shifts from conventional internet networks and provides fundamental changes in the implementation of data communication on the internet. Scalability is the ability in the network to overcome problems that arise as more and more entities on the internet. The high intensity of network load with a large number of nodes and content induces a tremendous burden on the internet mechanism. To cope with these NDN mechanisms should be efficient so that with the rapid growth of the network, NDN network performance should not be sacrificed. This paper gives elaboration for NDN research to overcome the scalability issues of the NDN network and brief some challenges for future research.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 112-118
Named Data Network (NDN) Scalability Problem
Named Data Network (NDN) is one of the research branches that focuses on developing the internet network for the future. NDN as part of the Information-Centric Network, the IETF initiative Research Group, has a paradigm that shifts from conventional internet networks and provides fundamental changes in the implementation of data communication on the internet. Scalability is the ability in the network to overcome problems that arise as more and more entities on the internet. The high intensity of network load with a large number of nodes and content induces a tremendous burden on the internet mechanism. To cope with these NDN mechanisms should be efficient so that with the rapid growth of the network, NDN network performance should not be sacrificed. This paper gives elaboration for NDN research to overcome the scalability issues of the NDN network and brief some challenges for future research.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-125
Modified-LRU Algorithm for Caching in Named Data Network on Mobile Network
It is estimated that the annual internet network traffic will exceed the threshold of 3.3 zettabytes by 2021. However, internet architecture is currently inefficient to support the distribution of information-sharing content. Thus, a new internet architecture is designed, namely Named Data Network. Named Data Network (NDN) can store data that has been accessed by consumers in the content store so that when the data is requested by other consumers, it will be fast in distributing data. Nonetheless, it is not possible to store all the content in the content store. Optimization should be made, the existing optimization technique based on the replacement algorithm is Least Recent Used (LRU). However, LRU has a weakness, which only uses the latest reference time and cannot distinguish between frequent or rare objects that are being accessed. Previous research has been conducted on modified-LRU but only on fixed networks, while currently the majority of users use mobile networks, and the condition of mobile networks is very different from the condition of fixed networks. In this research, scenario 5 testing was carried out relating to packet ratio, delay, and packet drop on mobile networks. Modified-LRU show great improvement by the performance of the Hit ratio, 3.6% greater than the LRU, reducing delay by 19.67%, and packet drop by 94% better than LRU.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-125
Modified-LRU Algorithm for Caching in Named Data Network on Mobile Network
It is estimated that the annual internet network traffic will exceed the threshold of 3.3 zettabytes by 2021. However, internet architecture is currently inefficient to support the distribution of information-sharing content. Thus, a new internet architecture is designed, namely Named Data Network. Named Data Network (NDN) can store data that has been accessed by consumers in the content store so that when the data is requested by other consumers, it will be fast in distributing data. Nonetheless, it is not possible to store all the content in the content store. Optimization should be made, the existing optimization technique based on the replacement algorithm is Least Recent Used (LRU). However, LRU has a weakness, which only uses the latest reference time and cannot distinguish between frequent or rare objects that are being accessed. Previous research has been conducted on modified-LRU but only on fixed networks, while currently the majority of users use mobile networks, and the condition of mobile networks is very different from the condition of fixed networks. In this research, scenario 5 testing was carried out relating to packet ratio, delay, and packet drop on mobile networks. Modified-LRU show great improvement by the performance of the Hit ratio, 3.6% greater than the LRU, reducing delay by 19.67%, and packet drop by 94% better than LRU.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 438-443
Modified-LRU Algorithm for Caching on Named Data Network
It is estimated that the annual network traffic of the internet will go beyond the threshold. Named Data Network will enter a new era in the world of networks because NDN nodes can store the data that has been requested by consumers in the content store so that one day when the data is requested by another consumer, it will be fast in the distribution of data. There are several optimization techniques based on replacement algorithms, one example is Least Recently Used (LRU), which is more focused on content that is rarely accessed and stores popular content in the content store. But the LRU has a weakness, which is only using the latest reference time and cannot distinguish between frequently or rarely the object being accessed. LRU modification is made to combine frequency and recently files in the decision stage to replace files so that the Modified-LRU can improve performance more optimally. In this paper, it is proposed the Modified-LRU algorithm. Modified-LRU takes an idea of SF-LRU but it is more simple in the process of deleting files. So, it can reduce the processing load. In this paper, the performance of LRU and Modified-LRU are compared. The simulation results show that the Modified-LRU is feasible to improve the LRU performance. The hit ratio is 8.7% greater compared to LRU, reducing delay by 60% and packet drop by 95%.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 438-443
Modified-LRU Algorithm for Caching on Named Data Network
It is estimated that the annual network traffic of the internet will go beyond the threshold. Named Data Network will enter a new era in the world of networks because NDN nodes can store the data that has been requested by consumers in the content store so that one day when the data is requested by another consumer, it will be fast in the distribution of data. There are several optimization techniques based on replacement algorithms, one example is Least Recently Used (LRU), which is more focused on content that is rarely accessed and stores popular content in the content store. But the LRU has a weakness, which is only using the latest reference time and cannot distinguish between frequently or rarely the object being accessed. LRU modification is made to combine frequency and recently files in the decision stage to replace files so that the Modified-LRU can improve performance more optimally. In this paper, it is proposed the Modified-LRU algorithm. Modified-LRU takes an idea of SF-LRU but it is more simple in the process of deleting files. So, it can reduce the processing load. In this paper, the performance of LRU and Modified-LRU are compared. The simulation results show that the Modified-LRU is feasible to improve the LRU performance. The hit ratio is 8.7% greater compared to LRU, reducing delay by 60% and packet drop by 95%.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Analysis Operation NLSR With Ubuntu as NDN Router
Named Data Networking (NDN) need routing to build NDN systems. Similar IP protocol, NDN has routing protocols intra-domain and inter-domain routing protocol. Named-data Link State Routing (NLSR) is one of the NDN intra-domain routing protocols in NDN. Deployment NLSR on actual hardware and operating systems give more performance feedback which might not be obtained in a simulation. This paper explain how a NLSR work and performance use Ubuntu installed as NDN router.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Analysis Operation NLSR With Ubuntu as NDN Router
Named Data Networking (NDN) need routing to build NDN systems. Similar IP protocol, NDN has routing protocols intra-domain and inter-domain routing protocol. Named-data Link State Routing (NLSR) is one of the NDN intra-domain routing protocols in NDN. Deployment NLSR on actual hardware and operating systems give more performance feedback which might not be obtained in a simulation. This paper explain how a NLSR work and performance use Ubuntu installed as NDN router.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Experiment OLSR Routing in Named Data Network for MANET
Nowadays, legacy IP network architecture has many limitations. Moreover, there is many researchers research for new future technology for network architecture called Named Data Network (NDN). Named Data Network (NDN) is a new design architecture for the network that uses directly name prefix of the content object instead of IP address, the most beneficial of using named based on content can do multi-hop forwarding and significantly reduced of the congestion happened. In this paper, the author tries to use the Named Data Network (NDN) architecture to create MANET network topology using the OLSR routing protocol, the reason using this topology is because MANET network is the most common.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Experiment OLSR Routing in Named Data Network for MANET
Nowadays, legacy IP network architecture has many limitations. Moreover, there is many researchers research for new future technology for network architecture called Named Data Network (NDN). Named Data Network (NDN) is a new design architecture for the network that uses directly name prefix of the content object instead of IP address, the most beneficial of using named based on content can do multi-hop forwarding and significantly reduced of the congestion happened. In this paper, the author tries to use the Named Data Network (NDN) architecture to create MANET network topology using the OLSR routing protocol, the reason using this topology is because MANET network is the most common.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Overhead of Named Data Networking Routing Protocol
Named Data Networking (NDN) as the future internet, shall have a good design routing for handling massive node connection with various behavior. Otherwise, the routing protocol will be burdened with an inefficient process that can degrade connection performance. One of inefficiency parameter is routing overhead, which usually a broadcast message. In this paper will be depicted and analyzed how routing overhead could significantly increase due to a number of node and behavior of the network. Routing protocol link state (LS) have a good efficiency for handle intense traffic network. However, LS shows more inefficient due to the network dynamism and a huge amount of NDN node, than geographic based routing (GR). This result will be fundamental for future research for routing efficiency.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Overhead of Named Data Networking Routing Protocol
Named Data Networking (NDN) as the future internet, shall have a good design routing for handling massive node connection with various behavior. Otherwise, the routing protocol will be burdened with an inefficient process that can degrade connection performance. One of inefficiency parameter is routing overhead, which usually a broadcast message. In this paper will be depicted and analyzed how routing overhead could significantly increase due to a number of node and behavior of the network. Routing protocol link state (LS) have a good efficiency for handle intense traffic network. However, LS shows more inefficient due to the network dynamism and a huge amount of NDN node, than geographic based routing (GR). This result will be fundamental for future research for routing efficiency.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Routing in NDN network: A survey and future perspectives
Evolving of the internet infrastructure nowadays, have been worried will brought the network in to collapse, due to misconduct of internet implementation since the beginning. NDN bring second wind to implementation of data communication for an internet. Routing as one of the important factor is explored and classified in this paper. This paper critically discusses the classification of NDN routing plane researches by surveying the current literature and presenting its research objective. Major challenges and opportunities are also highlighted, serving as guidelines for the state of the art of NDN routing future research.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Routing in NDN network: A survey and future perspectives
Evolving of the internet infrastructure nowadays, have been worried will brought the network in to collapse, due to misconduct of internet implementation since the beginning. NDN bring second wind to implementation of data communication for an internet. Routing as one of the important factor is explored and classified in this paper. This paper critically discusses the classification of NDN routing plane researches by surveying the current literature and presenting its research objective. Major challenges and opportunities are also highlighted, serving as guidelines for the state of the art of NDN routing future research.