RESOLVING THE RESOURCE ALLOCATION CONFLICT IN CIRCUIT SWITCHING USING MAXIMUM MATCHING

Manthan.D.Sanghavi, Shantan Sawa

Abstract: In circuit switching during the set-up phase a case might arise where multiple systems (switch/source) might request for the same system which leads to conflict as the resources of a particular system can only be allotted to one system at a time. The whole purpose of our proposed algorithm is to resolve the conflict and achieve optimal solution such that almost all systems are being allotted to a suitable system and there is a dedicated path from the source to the desired destination. The proposed algorithm intends to use graph theory concepts like bipartite graphs and maximum matching to resolve the conflict. The algorithm also provides a solution to optimize the use of buffer and thus facilitating the establishment of a dedicated path from the source to the destination.

Keywords: Circuit Switching, Bipartite Graph, Maximum Matching

DOI: https://doi.org/10.15623/ijret.2016.0504055