In software definition networks, we allow transmission paths to be selected based on real-time data traffic monitoring to avoid congested channels. Correspondingly, this motivates us to study the existence of fractional factors in different settings. In this paper, we present several extend sufficient conditions for a graph admits ID-Hamiltonian fractional (g, f )factor. These results improve the conclusions originally published in the study by Gong et al. .