Fair guaranteeing nominal utilization by trunk reservation policy using cooperative game theory

To cope with traffic congestion problems, fair trunk reservation policy in CAC is presented which aims to achieve maximum network utilization and fair bandwidth allocation. Fairness can be achieved by employing the concept of cooperative game theory. Searching fairness trunk reservation parameter algorithm is considered in three cases - Nash, Raiffa, and modified Thomson arbitration solutions. To protect the non-overload traffic against overload traffic, the FGNU scheme is introduced based on modified starting point. We suggest the nominal load indicator to act herein the threshold of identifying the overload traffic type. Based on this indicator, the system situation is divided into four cases. Investigating all four system situations, all numerical results depict that all traffic types will receive utilizations not less than their nominal utilization guarantee. Moreover, to relax the operating point, we adopt the control starting point parameter to adjust the modified starting point. Thus, the overall utilizations are improved.