ABSTRACT
The Vector Packet Processing (VPP) is a framework which provides high-speed packet processing in user space. In VPP, policer algorithms use classical token bucket algorithm which checks the availability of tokens. If any time huge numbers of packets are received for processing and enough tokens are not available, many packets may be dropped. This paper proposes enhanced algorithm called Hierarchical Token Bucket (HTB). In the proposed methodology, VPP is used for fast packet processing and DPDK (Data Plane Development Kit) as a driver. The HTB is basically a tree structure in which various bandwidths are assigned to tree nodes and ranked according to levels of importance. While processing the packets, these nodes are traversed in order to check for the availability of tokens. It helps in efficient and dynamic shaping of traffic among the hierarchy of assigned bandwidths.
