Опубликован: 20.04.2011 | Доступ: свободный | Студентов: 1011 / 172 | Оценка: 4.36 / 4.36 | Длительность: 22:21:00
  • 1.
    Abate, J. & Whitt, W. (1997)
    Limits and approximations for the M/G/1LIFO waiting time distribution.
  • 2.
    Andersen, B. & Hansen, N.H. & og Iversen, V.B. (1971):
    Use of minicomputer for telephone traffic measurements.
  • 3.
    Ash, G.R. (1998):
    Dynamic routing in telecommunications networks
  • 4.
    Baskett, F. & Chandy, F.G. (1975):, K.M. & Muntz, R.R. & Palacios
    Open, closed and mixed networks of queues with different classes of customers
  • 5.
    Bear, D. (1988):
    Principles of telecommunication traffic engineering.
  • 6.
    Bech, N.I. (1954):
    A method of computing the loss in alternative trunking and grading systems.
  • 7.
    Bolotin, V.A. (1994):
    Telephone circuit holding time distributions.
  • 8.
    Bretschneider, G. (1956):
    Bie Berechnung von Leitungsgruppen fur uberflie enden Verkehr.
  • 9.
    Bretschneider, G. (1973):
    Extension of the equivalent random method to smooth traffics ITC{7, Seventh International Teletra с Congress, Stockholm, June 1973.
  • 10.
    Brockmeyer, E. (1954):
    The simple overflow problem in the theory of telephone traffic.
  • 11.
    Arne (1948):, Brockmeyer, E. & Hailstorm, H.L. & Jensen
    The life and works of A.K.Erlang.
  • 12.
    Burke, P.J. (1956):
    The output of a queuing system.
  • 13.
    Christensen, P.V. (1914):
    The number of selectors in automatic telephone systems.
  • 14.
    A. (1954):, Cobham
    Priority assignment in waiting line problems.
  • 15.
    A.E. & Georganas, Conway, N.D. (1989):
    Queuing networks { exact computational algorithms: A unified theory based on decomposition and aggregation.
  • 16.
    Cooper, R.B. (1972):
    Introduction to queuing theory.
  • 17.
    Cox, D.R. (1955):
    A use of complex probabilities in the theory of stochastic processes. Proc.
  • 18.
    Cox, D.R. & Miller, H.D. (1965):
    The theory of stochastic processes.
  • 19.
    Cox, D.R.& Isham, V (1980):
    Point processes.
  • 20.
    CD. (1932):, Crommelin
    Delay probability formulae when the holding times are constant.
  • 21.
    CD. (1934):, Crommelin
    Delay probability formulae.
  • 22.
    Delbrouck, L.E.N. (1983):
    On the steady{state distribution in a service facility carrying mixtures of traffic with different peaked ness factor and capacity requirements.
  • 23.
    A. & Larsen, Dickmeiss, M. (1993):
    Spaerringsberegninger i telenet (Blocking calculations in telecommunication networks, in Danish).
  • 24.
    Eilon, S. (1969):
    A simpler proof of L = XW.
  • 25.
    A., and G. Lind (1964):, Elldin
    Elementary telephone traffic theory.
  • 26.
    Engset, Т.О. (1918):
    Die Wahrscheinlichkeitsrechnung zur Bestimmung der Wahlerzahl in automatischen Fernsprechamtern.
  • 27.
    Feller, W. (1950):
    An introduction to probability theory and its applications.
  • 28.
    Ch. (1964):, Fortet, R. & Grandjean
    Congestion in a loss system when some calls want several devices simultaneously.
  • 29.
    A.A. (1980):, Fredericks
    Congestion in blocking systems { a simple approximation technique.
  • 30.
    Fry, T.C. (1928):
    Probability and its engineering uses.
  • 31.
    and & Newell, G.F. (1967):, Gordon, W.J.
    Closed queuing systems with exponential servers.
  • 32.
    D. & Skoog, Grillo, K.K. (1998):, R.A. & Chia, S. & Leung
    Teletraffic engineering for mobile personal communications in ITU{T work: the need to match theory to practice IEEE Personal Communications,
  • 33.
    Hayward, W.S. Jr. (1952):
    The reliability of telephone traffic load measurements by switch counts.
  • 34.
    ITU-T (1993):
    Traffic intensity unit. ITU{T Recommendation B.
  • 35.
    Iversen, VB. (1973):
    Analysis of real teletraffic processes based on computerized measurements.
  • 36.
    Iversen, VB. (1976):
    On the accuracy in measurements of time intervals and traffic intensities with application to teletraffic and simulation.
  • 37.
    Iversen, VB. (1976):
    On general point processes in teletra с theory with applications to measurements and simulation.
  • 38.
    Iversen, VB. (1980):
    The A{formula. Teleteknik (English ed.),
  • 39.
    Iversen, VB. (1982):
    Exact calculation of waiting time distributions in queuing systems with constant holding times.
  • 40.
    Iversen, VB. (1987):
    The exact evaluation of multi{service loss system with access control. Teleteknik, English ed.
  • 41.
    B.F. (1985):, Iversen, V.B. & Nielsen
    Some properties of Coxian distributions with applications.
  • 42.
    Iversen, S.N. (1997):, V.B. & Stepanov
    The usage of convolution algorithm with truncation for estimation of individual blocking probabilities in circuit-switched telecommunication networks.
  • 43.
    B. (2001):, Iversen, V.B. & Sanders
    Engset formul with continuous parameters - theory and applications. AEU,
  • 44.
    Iversen, V.B. (2005):
    Algorithm for evaluating multi-rate loss systems.
  • 45.
    Jackson, R.R.P. (1954):
    Queueing systems with phase type service.
  • 46.
    Arne (1950):, Jensen
    Moe's Principle { An econometric investigation intended as an aid in dimensioning and managing telephone plant.
  • 47.
    A.L. & Wang, J.L. & Erramilli A. (1999):, J.L. & Neidhardt, Jerkins
    Operations measurement for engineering support of high-speed networks with self-similar traffic.
  • 48.
    J. & Rasmussen, Johansen, K. & Johansen, С (1991):
    The broadband multiplexer, \TransMux 1001".
  • 49.
    Joys, L.A.:
    Variations of the Erlang, Engset and Jacobeus formula.
  • 50.
    Joys, L.A. (1968):
    Engsets formler for sannsynlighetstetthet og dens rekursionsformler. (Engset's formul for probability and its recursive formula, in Norwegian).
  • 51.
    Joys, L.A. (1971):
    Comments on the Engset and Erlang formulae for telephone trafficlosses. Thesis.
  • 52.
    Karlsson, S.A. (1937):
    Tekniska anordninger for samtalsdebitering enligt tid (Technical arrangement for charging calls according to time, In Swedish).
  • 53.
    J.S. (1981):, Kaufman
    Blocking in a shared resource environment.
  • 54.
    J. (1966):, Keilson
    The ergodic queue length distribution for queuing systems with finite capacity.
  • 55.
    F.P. (1979):, Kelly
    Reversibility and stochastic networks.
  • 56.
    D.G. (1951):, Kendall
    Some problems in the theory of queues.
  • 57.
    D.G. (1953):, Kendall
    Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain.
  • 58.
    AY. (1955):, Khintchine
    Mathematical methods in the theory of queuing.
  • 59.
    J.F.C. (1969):, Kingman
    Markov population processes
  • 60.
    Kleinrock, L. (1964):
    Communication nets: Stochastic message flow and delay.
  • 61.
    Kleinrock, L. (1975):
    Queuing systems.
  • 62.
    Kleinrock, L. (1976):
    Queuing systems.
  • 63.
    Kosten, L. (1937):
    Uber Sperrungswahrscheinlichkeitenbei Staffelschaltungen.
  • 64.
    J. (1937):, Kruithof
    Telefoonverkehrsrekening.
  • 65.
    A. (1973):, Kuczura
    The interrupted Poisson process as an overflow process.
  • 66.
    A. (1977):, Kuczura
    A method of moments for the analysis of a switched communication network's performance.
  • 67.
    Lavenberg, M. (1980):, S.S. & Reiser
    Meanfvalue analysis of closed multichain queuing networks.
  • 68.
    G. (1976):, Lind
    Studies on the probability of a called subscriber being busy.
  • 69.
    H. & Iversen V.B. (1989):, Listov-Saabye
    ATMOS: a PC-based tool for evaluating multi{service telephone systems. IMSOR,
  • 70.
    J.D.C. (1961):, Little
    A proof for the queueing formula L = _W.
  • 71.
    G. (1995):, Maral
    VSAT networks.
  • 72.
    Marchal, W.G. (1976):
    An approximate formula for waiting time in single server queues AIIE Transactions,
  • 73.
    Palm, С (1941):
    Mattnoggrannhet vid bestamning af traffikmangd enligt genomsokningsforfarandet (Accuracy of measurements in determining traffic volumes by the scanning method).
  • 74.
    C. (1943):, Palm
    Intensitatsschwankungen im Fernsprechverkehr.
  • 75.
    Palm, С (1947):
    The assignment of workers in servicing automatic machines.
  • 76.
    Palm, С (1947):
    Table of the Erlang loss formula.
  • 77.
    Palm, С (1957):
    Some propositions regarding flat and steep distribution functions, pp.
  • 78.
    J. & Aguilar{Igartua, M. & Garcia{Haro, M. (2001):, Postigo-Boix
    (Inverse Multiplexing of ATM) IMA {technical foundations, application and performance analysis.
  • 79.
    B.P. (1995):, Press, S.A. & Vetterling, W.H. & Teukolsky, W.T. & Flannery
    Numerical recipes in C, the art of scienti с computing.
  • 80.
    F.W. (1949):, Rabe
    Variations of telephone tra с Electrical Communications,
  • 81.
    Rapp, Y. (1965):
    Planning of junction network in a multi{ exchange area.
  • 82.
    J. (1956):, Riordan
    Derivation of moments of overflow traffic.
  • 83.
    J.W. (1981):, Roberts
    A service system with heterogeneous user requirements { applications to multi-service telecommunication systems.
  • 84.
    J.W. (2001):, Roberts
    Traffic theory and the Internet.
  • 85.
    D. (1990):, K.W. & Tsang, Ross
    Teletraffic engineering for product{form circuit-switched networks.
  • 86.
    D. (1990):, K.W. & Tsang, Ross
    Algorithms to determine exact blocking probabilities for multirate tree networks.
  • 87.
    N. (1958):, Ronnblom
    Traffic loss of a circuit group consisting of both{way circuits which is accessible for the internal and external tra с of a subscriber group.
  • 88.
    B. & Haemers, R. (1983):, Sanders, W.H. & Wilcke
    Simple approximate techniques for congestion functions for smooth and peaked traffic.
  • 89.
    S.S. (1989):, Stepanov
    Optimization of numerical estimation of characteristics of multiflow models with repeated calls.
  • 90.
    D.J. (1980):, Sutton
    The application of reversible Markov population processes to teletraffic.
  • 91.
    Techguide (2001):
  • 92.
    E. & Chaveau, J. (1949):, Vaulot
    Extension de la formule d'Erlang au cas ou le traffic est fonction du nombre d'abonnes occupes.
  • 93.
    B. (2002):, Veiro
    Proposed Grade of Service chapter for handbook.
  • 94.
    M. (2002):, Villen
    Overview of ITU Recommendations on traffic engineering.
  • 95.
    B. (1964):, Wallstrom
    A distribution model for telephone traffic with varying callintensity, including overflow traffic.
  • 96.
    B. (1966):, Wallstrom
    Congestion studies in telephone systems with overflow facilities.
  • 97.
    R.I. (1956):, Wilkinson
    Theories for toll traffic engineering in the U.S.A.
  • 98.
    Башарин Т.П.
    Лекции по математической теории телетрафика
  • 99.
    Берлин А.Н.
    Терминалы и основные технологии обмена информацией.: Учебное пособие/М.:
  • 100.
    Берлин А.Н.
    Телекоммуникационные сети и устройства.:
  • 101.
    Берлин А.Н.
    Сотовые системы связи.: Учебное пособие/М.:
  • 102.
    Проектирование и техническая эксплуатация сетей передачи дискретных сообщений.
  • 103.
    Клейнрок Л.
    Теория массового обслуживания.
  • 104.
    Лифшиц Б.С., Фидлин Я.В., Харкевич А.Д.
    Теория телефонных и телеграфных сообщений.
  • 105.
    Лившиц Б. С. и др.
    Теория телетрафика
  • 106.
    Степанов С.Н.
    Основы телетрафика мультисервисных сетей.
  • 107.
    Иверсен В.Б., Степанов С.Н.
    Способы уменьшения объема вычислений при расчете моделей систем связи с потерями, основанные на игнорировании маловероятных состояний.
  • 108.
    Хинчин В.Я.
    Работы по математической теории массового обслуживания.
Нияз Сабиров
Нияз Сабиров

Здравствуйте. А уточните, пожалуйста, по какой причине стоимость изменилась? Была стоимость в 1 рубль, стала в 9900 рублей.

Елена Сапегова
Елена Сапегова

для получения диплома нужно ли кроме теоретической части еще и практическую делать? написание самого диплома требуется?