The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks: Proceedings of the 14th International Teletraffic Congress, ITC 14, Antibes Juan-les-Pins, France, 6-10 June 1994, Volume 1, Part 1Jacques Labetoulle, James W. Roberts The International Teletraffic Congress (ITC) is a recognized international organization taking part in the work of the International Telecommunications Union. The congress traditionally deals with the development of teletraffic theory and its applications to the design, planning and operation of telecommunication systems, networks and services. The contents of ITC 14 illustrate the important role of teletraffic in the current period of rapid evolution of telecommunication networks. A large number of papers address the teletraffic issues behind developments in broadband communications and ATM technology. The extension of possiblities for user mobility and personal communications together with the generalization of common channnel signalling and the provision of new intelligent network services are further extremely significant developments whose teletraffic implications are explored in a number of contributions. ITC 14 also addresses traditional teletraffic subjects, proposing enhancements to traffic engineering practices for existing circuit and packet switched telecommunications networks and making valuable original contributions to the fundamental mathematical tools on which teletraffic theory is based. The contents of these Proceedings accurately reflect the extremely wide scope of the ITC, extending from basic mathematical theory to day-to-day traffic engineering practices, and constitute the state of the art in 1994 of one of the fundamental telecommunications sciences. |
From inside the book
Results 1-3 of 73
Page 323
... estimate of the asymptotic slope between -1 and 0 suggest self - similarity , and an estimate for the degree of self - similarity is given by Ĥ = 1 – B / 2 . The absence of any limit law results for the statistics corresponding to the R ...
... estimate of the asymptotic slope between -1 and 0 suggest self - similarity , and an estimate for the degree of self - similarity is given by Ĥ = 1 – B / 2 . The absence of any limit law results for the statistics corresponding to the R ...
Page 325
... Estimates of H and 95 % CI 0.5 0.6 0.7 0.8 0.9 1.0 Point Estimate of H and 95 % CI 0.5 0.7 0.9 500 1000 Aggregation Level m ( a ) 2000 500 1000 2000 Aggregation Level m ( b ) Figure 3. Periodogram - based MLE estimate Ĥ ( m ) of H ...
... Estimates of H and 95 % CI 0.5 0.6 0.7 0.8 0.9 1.0 Point Estimate of H and 95 % CI 0.5 0.7 0.9 500 1000 Aggregation Level m ( a ) 2000 500 1000 2000 Aggregation Level m ( b ) Figure 3. Periodogram - based MLE estimate Ĥ ( m ) of H ...
Page 772
... estimate for the estimation of the probability y of the set of rare states ( 2 ) Suppose that 7 is a standard Monte - Carlo estimate of y obtained after N replications . Then it is easy to see that for small y 1 N E ( 7-7 ) 2 ~ ~~ ( 17 ) ...
... estimate for the estimation of the probability y of the set of rare states ( 2 ) Suppose that 7 is a standard Monte - Carlo estimate of y obtained after N replications . Then it is easy to see that for small y 1 N E ( 7-7 ) 2 ~ ~~ ( 17 ) ...
Contents
The Performance of Single Resource Loss Systems in Multiservice Networks | 13 |
Performance and Roles of Bandwidth and Buffer Reservation Schemes | 23 |
Session D43 Multirate Traffic Performance | 32 |
Copyright | |
67 other sections not shown
Other editions - View all
Common terms and phrases
1994 Elsevier Science algorithm allocation analysis approximation arrival process arrival rate assume asymptotic ATM networks average bandwidth behavior bit rate blocking probability buffer burst bursty busy period capacity cell loss probability channel Computer congestion control consider cost customers defined delay denote density departure process distribution dynamic routing effective bandwidth Elsevier Science B.V. equations Erlang estimate example exponential exponentially distributed Figure formula fractal function given grade of service idle period IEEE INFOCOM interarrival interval ISDN ITU-T J.W. Roberts Editors Labetoulle and J.W. Markov chain mean measurements messages method mobile node obtained offered load output overload control packet paper parameters performance Poisson Poisson process priority queueing model queueing system queueing theory random variable reattempts scheme self-similar server signalling simulation slot statistical multiplexing stochastic switch telecommunication Teletraffic throughput transit trunk values variable waiting