An efficient multipath routing schema in multi-homing scenario based on protocol-oblivious forwarding

With the advent of 5G,multi-homing will be an increasingly common scenario,which is expected to increase transmission rates,improve transmission reliability,and reduce costs for users.However,the current routing methods are unable to fully utilize the resources of networks to achieve high-performance data transmission for multi-homed devices.In the current routing mechanism,there is only one destination address in the packet forwarded to the multi-homed host.Thus,the packet is difficult to adjust its path on the fly according to the status of the network to achieve better performance.In this paper,we present an efficient routing schema in multi-homing scenario based on protocol-oblivious forwarding(POF).In the proposed schema,the packet forwarded to the multi-homed host carries multiple destination addresses to obtain the ability of switching the transmission path;meanwhile,the router dynamically adjusts the path of the packet through the perception of the network status.Experimental results show that our schema could utilize the alternative paths properly and significantly improve the transmission efficiency.

HSDBA: a hierarchical and scalable dynamic bandwidth allocation for programmable data planes

Dynamic bandwidth allocation(DBA)is a fundamental challenge in the realm of networking.The rapid,accurate,and fair allocation of bandwidth is crucial for network service providers to fulfill service-level agreements,alleviate link congestion,and devise strategies to counter network attacks.However,existing bandwidth allocation algorithms operate mainly on the control plane of the software-defined networking paradigm,which can lead to considerable probing overhead and convergence latency.Moreover,contemporary network architectures necessitate a hierarchical bandwidth allocation system that addresses latency requirements.We introduce a finegrained,hierarchical,and scalable DBA algorithm,i.e.,the HSDBA algorithm,implemented on the programmable data plane.This algorithm reduces network overhead and latency between the data plane and the controller,and it is proficient in dynamically adding and removing network configurations.We investigate the practicality of HSDBA using protocol-oblivious forwarding switches.Experimental results show that HSDBA achieves fair bandwidth allocation and isolation guarantee within approximately 25 packets.It boasts a convergence speed 0.5times higher than that of the most recent algorithm,namely,approximate hierarchical allocation of bandwidth(AHAB);meanwhile,it maintains a bandwidth enforcement accuracy of 98.1%.