A Novel Network Bandwidth Optimal Allocation Mechanism
Pan Wang
Abstract
Pan Wang
Abstract
The network bandwidth optimal allocation mechanism in new generation network is investigated in this paper.The fairness aware flow utility function is constructed by using the social welfare function and the elastic flow's priority,the Nash Equilibrium of the network bandwidth optimal allocation model is proved,and the bandwidth optimal allocation mechanism on flow's priority is poprosed.Simulation result shows the proposed mechanism not only can achieve differentiated services according to the priority,but ensures the relative fairness of the bandwidth allocation as well,thus guarantees the QoS of different service flow.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The network bandwidth optimal allocation mechanism in new generation network is investigated in this paper.The fairness aware flow utility function is constructed by using the social welfare function and the elastic flow's priority,the Nash Equilibrium of the network bandwidth optimal allocation model is proved,and the bandwidth optimal allocation mechanism on flow's priority is poprosed.Simulation result shows the proposed mechanism not only can achieve differentiated services according to the priority,but ensures the relative fairness of the bandwidth allocation as well,thus guarantees the QoS of different service flow.
Key concepts: Dynamic bandwidth allocation, Bandwidth allocation, Computer science, Bandwidth (computing), Quality of service, Max-min fairness, Nash equilibrium, Computer network