Nonstationary analysis of circuit-switched communication networks

Circuit-switched communication networks have been analyzed extensively in the stationary case, i.e. where the arrival and/or service rates are independent of time. In this paper, we study a circuit-switched network where the rates of external arrivals at the network are time-dependent functions. The circuit-switched network is modelled as a nonstationary queueing network with population constraints, which is analyzed approximately in order to obtain the blocking probability functions. Using this method we model two circuit-switched networks, namely, a traffic-groomed tandem optical network and a single-orbit LEO satellite network.

[1]  Ward Whitt,et al.  Networks of infinite-server queues with nonstationary Poisson input , 1993, Queueing Syst. Theory Appl..

[2]  Richard J. Boucherie,et al.  Blocking Probabilities in Mobile Communications Networks with Time-Varying Rates and Redialing Subscribers , 2002, Ann. Oper. Res..

[3]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[4]  Eugene Pinsky,et al.  Efficient decomposition methods for the analysis of multi-facility blocking models , 1994, JACM.

[5]  George N. Rouskas,et al.  Computing call-blocking probabilities in LEO satellite networks: the single-orbit case , 2002, IEEE Trans. Veh. Technol..

[6]  P. Kolesar,et al.  The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals , 1991 .

[7]  Peter Kolesar,et al.  The Lagged PSA for Estimating Peak Congestion in Multiserver Markovian Queues with Periodic Arrival Rates , 1997 .

[8]  Harry G. Perros,et al.  Call blocking probabilities in a traffic-groomed tandem optical network , 2004, Comput. Networks.

[9]  Harry G. Perros,et al.  The Nonstationary Loss Queue: A Survey , 2006 .

[10]  Ward Whitt.  Decomposition approximations for time-dependent Markovian queueing networks , 1999, Oper. Res. Lett..

[11]  Chun-Yin Li,et al.  The decomposition of a blocking model for connection-oriented networks , 2004, IEEE/ACM Transactions on Networking.

[12]  George N. Rouskas,et al.  Computing call-blocking probabilities in LEO satellite constellations , 2003, IEEE Trans. Veh. Technol..

[13]  W. A. Massey,et al.  An Analysis of the Modified Offered-Load Approximation for the Nonstationary Erlang Loss Model , 1994 .

[14]  D. L. Jagerman,et al.  Nonstationary blocking in telephone traffic , 1975, The Bell System Technical Journal.

[15]  William A. Massey,et al.  A modified offered load approximation for nonstationary circuit switched networks , 1997, Telecommun. Syst..

[16]  W. Whitt.  The pointwise stationary approximation for M 1 / M 1 / s , 1991 .