The paper deals with a single-server model with constant re-trial rate. If an arrival meets the server busy, it joins the infinite-capacityorbit and then tries to occupy the server again after generally distributedtime interval. Unlike the classical retrial policy, the intensity of orbit cus-tomers does not depend on its number. To derive the stability conditionfor such a model, we construct less complicated for analysis dominatingsystem and illustrate its stability condition, basing on Markov chain ap-proach. Then, relying on heuristic method and using some results fromrenewal theory, we make a basic assumption about stability condition ofthe model under consideration. Simulation results for Pareto and Weibulldistribution of retrial time confirm, that assumed stability condition givesa good approximation of theoretical stability region