Blocking probability estimation for general traffic under incomplete information

A simple, robust, explicit upper bound is derived on the blocking probability for general multirate traffic, dropping a number of traditional assumptions, such as Poisson arrivals, while still maintaining optimally tight exponent of the estimation. The new approach also makes it possible to the estimate blocking probability under incomplete information. Furthermore, it remains valid in situations when the individual call bandwidth demands aggregate in complex, nonlinear ways, e.g., in case of compressible flows, priority classes or processing constraints. We show that the bound is easily applicable for fast, robust link dimensioning. Moreover, it is very well fitted for embedding into more sophisticated network optimization problems, due to its convexity properties.

[1]  Alan Weiss,et al.  An Introduction to Large Deviations for Communication Networks , 1995, IEEE J. Sel. Areas Commun..

[2]  I. Chlamtac,et al.  An optimal CDMA channel access protocol , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  Imrich Chlamtac,et al.  Virtual path network topology optimization using random graphs , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  András Faragó,et al.  Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks , 2001, MobiCom '01.

[5]  Tamas Henk,et al.  Towards precision tools for ATM network design, dimensioning and management , 1995 .

[6]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[7]  Erik Jonsson.  Blocking Probability Estimation for General Traffic Under Incomplete Information , 2000 .

[8]  József Bíró,et al.  A Linear Programming Neural Circuit Model , 1998 .

[9]  Imrich Chlamtac,et al.  An Optimal Channel Access Protocol with Multiple Reception Capacity , 1994, IEEE Trans. Computers.

[10]  A. Farago,et al.  Algorithm to find the global optimum of left-to-right hidden Markov model parameters , 1989 .

[11]  Gábor Lugosi,et al.  A parameter estimation algorithm for speech recognition to maximize 'state optimized joint likelihood' , 1990 .

[12]  I. Chlamtac,et al.  Optimizing bandwidth allocation in cellular networks with multirate traffic , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[13]  András Faragó.  On the complexity of finding sparsest and densest parts in wireless networks , 1995, Wirel. Networks.

[14]  T. Tron,et al.  Neural networks for logical partitioning of ATM networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[15]  I. Chlamtac,et al.  Nearly optimum scheduling in mobile CDMA packet radio networks , 1992, MILCOM 92 Conference Record.

[16]  Paramvir Bahl,et al.  Resource assignment for integrated services in wireless ATM networks , 1998, Int. J. Commun. Syst..

[17]  Andrea Fumagalli,et al.  The First Telecommunications Engineering Program in the United States , 2001 .

[18]  I. Chlamtac,et al.  Route selection in mobile multimedia ad hoc networks , 1999, 1999 IEEE International Workshop on Mobile Multimedia Communications (MoMuC'99) (Cat. No.99EX384).

[19]  Imrich Chlamtac,et al.  Optimizing the system of virtual paths , 1994, TNET.

[20]  Christopher M. Bishop,et al.  Proceedings International Conference on Artificial Neural Networks ICANN'95 , 1995 .

[21]  A. A. Nilsson,et al.  On multi-rate Erlang-B computations , 1999 .

[22]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[23]  Tibor Cinkler.  Heuristic algorithms for configuration of the ATM-layer over optical networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[24]  I. Chlamtac,et al.  How to establish and utilize virtual paths in ATM networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[25]  S. Boucheron,et al.  A sharp concentration inequality with applications , 1999, Random Struct. Algorithms.

[26]  Andrea Fumagalli,et al.  A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks , 1998, TNET.

[27]  Paramvir Bahl,et al.  Optimizing resource utilization in wireless multimedia networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[28]  I. Chlamtac,et al.  Performance analysis of time-spread multiple access (TSMA) protocol in multihop wireless networks , 1998, 1998 IEEE International Performance, Computing and Communications Conference. Proceedings (Cat. No.98CH36191).

[29]  Tamás Henk,et al.  Enhancing ATM Network Performance by Optimizing the Virtual Network Configuration , 1995, Data Communications and their Performance.

[30]  Imrich Chlamtac,et al.  A topology transparent link activation protocol for mobile CDMA radio networks , 1994, IEEE J. Sel. Areas Commun..

[31]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[32]  András Faragó,et al.  Fast Nearest-Neighbor Search in Dissimilarity Spaces , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Imrich Chlamtac,et al.  Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks , 1997, TNET.

[34]  I. Chlamtac,et al.  Efficient load balancing for UBR traffic in ATM networks , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[35]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[36]  András Faragó,et al.  A new approach to MAC protocol optimization , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[37]  Tamás Henk,et al.  Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks , 1997, Simul..

[38]  Imrich Chlamtac,et al.  A fundamental relationship between fairness and optimum throughput in TDMA protocols , 1996, Proceedings of ICUPC - 5th International Conference on Universal Personal Communications.

[39]  G. Lugosi,et al.  Strong Universal Consistency of Neural Network Classifiers , 1993, Proceedings. IEEE International Symposium on Information Theory.

[40]  Tamás Henk,et al.  Analog Neural Optimization for ATM Resource Management , 1997, IEEE J. Sel. Areas Commun..

[41]  Tao Zhang,et al.  Efficient routing of lightpaths , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[42]  Tamás Henk,et al.  A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration , 1995, IEEE J. Sel. Areas Commun..

[43]  András Faragó,et al.  Nearest neighbor search and classification in O(1) time , 1991 .