Before revision: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.
After revision: When decomposing the total orbit into N sub-orbits (or simply orbits) related to each of N servers and through comparing the numbers of customers in these orbits, we introduce a retrial supermarket model of N identical servers, where two probing-server choice numbers are respectively designed for dynamically allocating each primary arrival and each retrial arrival into these orbits when the chosen servers are all busy. Note that the designed purpose of the two choice numbers can effectively improve performance measures of this retrial supermarket model. This paper analyzes a simple and basic retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.