Файл: Шнепс, М. А. Численные методы теории телетрафика.pdf

357.

Ще р б и н а

Л. П.

Определение потерь в сетях

методом

вероятностных

158.

графов. — В

кн.: Электросвязь и передача данных. Киев, 1969,

с. 248—254.

Э лл дин

А.,

Л и н д

Г. Основы, теории те.петрафика. Пер. с англ, под ред.

159.

А. Д. Харкевича. М., «Связь», 1972.

и

математиче­

Я к о в л е в

С.

И.

Машинное

моделирование. — «Экономика

160.

ские методы», т. 4, № 2, 1968,

с. 265—277.

with a finite number of

A d i r i I.,

Av i - I t z h a k В.

A time-sharing queue

161.

customers. — «J. of ACM», ,1069, v. 16, Nr. 2, 315—3i2l3.

В

formula.—

A k i m a r u

Hr, N i s h i m u r a T. The derivatives of

Erlang's

162.

«Rev. of Eletr. Comm. Lab.», 4963, v. Ill, Nr. 9—110, p. 428—/446.

in an alter­

A n d e r b e r g

M. and

We s t er b e r g

S. Covariation of traffic

native routing

network.

6th ITC. Munich.

1970.

164.

B e n e s

V.

E.

Programming

and

control

problems

arising

from

optimal

165.

routing

in

telephone

networks. — ,«BSTJ»,

1966,

v. 45,

Nr. 9,

p.

137|3—4438.

B e n e s

V. E. Combinatorial

solutions to the problem of optimal

routing in

166.

progressive gradings. — «BSTJ», 4967, v. 46, Nr. 5.

B e n e s

V. E. A telephone traffic model based on

randomly closing crosspoints,

J67.

and its relationships to other models. — «BSTJ», 19711, v. 50, Nr. 3, p. 4094—1097.

B l o m q v i s t

N.

Estimation

of waiting-time

parameters

in

the

Ol'/G/1

queueing system. —

«Scand.

aktuarietidskr.», 11968,

Nr. 3—4,

I,

178—1197; II,

p. 425— 136.

168.

B r e t s c h n e i d e r

G. The calculation of groups for overflowing traffic in

169.

ATS. — «NTZ», 1956, B. 9, H. 14, ,p. 533—540.

B r e t s c h n e i d e r

G. Die exacte Bestimmung der Verkehrsleitung kleiner

170.

unvollkommener Femsprechbundel. — «NTZ», 4963,

B. 16, p. /199—205.

B r e t s c h n e i d e r

G. Die Hauptverkehrsstunde im Femsprechverkehr.—

171.

«NTZ»,

12 i(1959),

p.

205—209.

loss

calculations

of

gradings.

Preprint book

B r e t s c h n e i d e r

G.

Exact

172.

of 5th ITC, New York, 4967.

B r e t s c h n e i d e r

G. Repeated calls with limited repetition probability. 6th

173.

ITC (preprint),

Munich,

1970.

(cit. by [270]).

CCITT.Red

Book,

v. II

bis, New Delhi, 1960, p. 18—19

175.

CCITT. White Book, v. VI,

4972. Recommendation Q 87. Number of circuits

to be provided in automatic and semiautomatic operations.

17i6.

C a r l s s o n

S. G., E l l d i n

A. Solving equitions of state in telephone traffic

theory with digital computer. — «Ericsson Techn.», 1958, v. 14, Nr. 2.

117(7. C l a r k

С. E. Importance sampling in Monte Carlo analyses. — «Oper. Res.»,

178.

4961, v. 9, p. 603—680.

telephone traffic theory and the

influence of

C o h e n

J. W. Basic problem of

179.

repeated call. — «Philips Telecomm. Rev.», 1957, v. 18, Nr. 2.

C o n s t a n t i n e

H., Hi l l s

M. T. The design оГ a telecommunication-oriented

programming language

(TPL-4). Conf. Switch. Techn. Telecomm. Networks,

London. — «1БЕ», 4969, p. 207—0111.

180.

C o n s t a n t i n e

H., H i l l s

M. T. Telecommunication-oriented programming

181.

language. — «Proc. Inst. El. Eng.», v. 419, 1972, p. 409—4)16.

proces­

С о x D. R. A use of complex probabilities in

the theory of stochastic

182.

ses. — «Proc. of Cambr. Phil. Soc.», 4955, v. 5ll,

part 2, p. 313—3I19‘.

D a l e y

D. J. Monte Carlo estimation of the mean queue size in ,a stationary

383.

Gl/M/1 queue. — «Oper. Res.», 4968, v. 46, Nr. 5, ,p. 4002—110.05.

D a l e y

D.

J., M o r a n

P.

A. Two-sided inequalities for waiting time and

queue size

distributions

in G4/G/4. — «Теория

вероятностей и ее применение»,

184.

4968, т. (13, Nr. 12, с. 356—359.

finite and infinite-source systems. Me

Graw-

D e s c l o u x

A. Delay tables

for

Hill, N.-Y, 4968.

185.

D e s c l o u x

A.

On the

accuracy

of loss estimates. — «BSTJ»,

1965,

v. 44,

Nr. 4.

186.

D e s c l o u x

A.

On

the

variability of the proportion of unsuccessful attempts

187.

in loss systems.

4 1TC,

London,

1964 i(eit. by [298]).

188.

Press, 1969.

W a g n e r

H. Traffic simulation and its application

in telep­

D i e t r i c h G.,

189.

hony. — «Electr. Comm. (ITT)»,

1963, v. 38, Nr. 4, p. 524—5i33.

D u m j o h n

F.

P.,

M a r t i n

N. H. Experimental determination of traffic

190.

preselectors. — «POEEJ», i1922, v. 15, p. 133—il46.

behavior.

D u t t o n

J. M.,

S t a r b u c k

W. H. Computer simulation of human

Wiley, 1970.

S t a r b u c k

W. H. Computer simulation models

of human

JLQll. D u t t o n

J. M„

192.

Man, and Cybern.», 4974, SMC-1, Nr. 2, p. 128—il7il.

E i n a r s s o n

K. A.

et

al.

Un

type simplifie de gradings avec multiplages.

193.

sautants. •— «Tele», 1061, Nr. ,2.

S. The efficiency of statistical simulation pro­

E h r e n f e l d

S., B e n - T u v i a

194.

cedures. — .«Technometrics», 49.G2, v. 4, p. 257—276.

E l l d i n

A.

On

the extent of routine measurements in telephone plant. 6lh

ITC (preprint), Munich,

119:70.

19(7. E l l d i n

A. Dimensioning for the dynamic properties of telephone traffic.—

198.

«Ericsson Teohn.», 1967, Nr. 3, p. 316—344.

1967.

E l l d i n

A.,

L i n d

G. Elementary telephone traffic theory. Stockholm,

199.

E 11 i m a n E. A.,

F r a s e r

R. W. Eine Maschine zur 'Nachahmung

des

Ver-

200.

1928—29,

p. 131—1138.

E. Comparison between measure

and calculated values

F a k h r

El

Di n

M.

201.

in a

link system with overflow facility. 6th ITC (preprint), Munich,

1970.

F a r b e r

N. A model for estimating the real-time capacity of certain classes-

202.

of central

processors. 6th ITC (.preprint), Munich,

1970.

F i s h m a n

G. S. The allocation of computer times in comparing simulation

203.

experiments. — «Oper. Res.»,

1968, v. ,16, Nr. 2, p. 280—295.

of

variance

F r a n c k i

M.

The

problem

of

confidence

and

three

methods

reduction

in the simulation the queueing. — «Aust. Road Res. Bd. Proc.»,.

204.

1968, v. 4, Nr. il, p. 567—580.

Eingang. — «Elec­

F r a n k e n

P. Erlangsche Formeln Гиг semimarkowschen

205.

tron. Informationsverarb. und

Kybem.», 19,68,

B. 4, Nr. 3, p. 197—204.

com­

G a f a r i a n

A. V.,

A n c k e r

C. J. Mean value estimation

from digital

206.

puter simulation. — «Oper. Res.»,

1966, v. 14, Nr. 1, p. 25—44.

leur

applications

G a l l

1e

P.

Les

methodes

de

simulations

aleatoires

et

207.

G a l l

1e

P. Sur l’influence des repetitions d’appels dans Teconlement du

208.

telephoniques. —

G a l l

1e

P.

Sur

une theorie des repetitions des appel

209.

«Annales des telecomm.», 1969, t. 24, Nr. 7—8.

of

service.

4th ITC,

London,

L e

G a l l

P. Variations in

traffic

and quality

210.

1964.

D.

P.,

J r. A

probability

problem

arising

in

reliability

and traffic

G a v e r

studies. — «Oper.

Res.»,

1964, v. 12, Nr. 4, p. 534—642.

213.

rech.», 1972, Nr. 67, p. 2—45.

purpose computer simula­

G r a n t g e s

R. S., Sinowitz. NEASIM. A general

214.

networks. — «BSTJ», 1964, v. 43, p. 965—4004.

at various times and.

G r e e n b e r g

I. The behavior of a single queue

215.

H a k a n s s o n

L. A. GPSS-simulation for

the study ot a SPS

exchange

com­

216.

puter. 6th ITG(preprint), Munich, 1970.

D. C. Monte

Carlo

methods. London,

H a m m e r s l e y

J. M.,

H a n d s c o m b

217.

1964.

l ey

J. M.,

M o r t o n

K.

W.

A

new

Monte

Carlo

technique:

H a m m e r s

218.

H a n g l b e r g e r P. Simulation of

the data

flow

in common control

switching

systems. 6th 1TC(preprint), Munich, il970.

219.

H a s t i n g s

W. K. Monte Carlo sampling

methods

using Markov chains and

220.

their applications. — «Biometrika», .1070, v. 57, 14r. 1, p. 97—d.09.

H a y w a r d

W.

S.,

W i l k i n s o n

R. I.

Human

factors

in

telephone systems

and their

influence

on

traffic theory, especially

with

regard

to future facili­

221.

ties. 6th ITC(preprint), Munich, 1970.

H e l m s

R.,

K u n t z e

W, Erhohung der Leistungsfahigheit Unvollkommener

Biindel

durch

Homogene

Mislumgen. — «Mitteilung

aus

dem

Posl-und

222.

Fernmeldewes.»,

1960,

Nr. 2.

H e r z o g

223.

laufverkehr hinter Mischungen. Monographic des

IND, Stuttgart,

1964.

H e r z o g

1970,

224.

Nr. 3,

p. 143—il50.

A.

The

RDA

method. —

«NTZ-CJ»,

4968, Nr.

2/3.

H e r z o g

U.,

L o t z e

225.

47—51.

U„

L o t z e

A.,

S c h e h r e r

R.

Calculation

of

trunk

groups Гог

H e r z o g

226.

simplified gradings. — «NTZ», 1969, Nr. 12, p. 684—689.

Hon Zhen Tin. — «Scientia Sinioa», 1963, v. 12, Nr. 8.

227.

Hu b e r

M.,

W a g n e r

W. Simulation

von Nachrichtenvermittlungssystemen.

228.

Aus «Nicht-numerische

Informationsverarbeitung», Springer,

N.-Y.,

1968.

I v e r s e n V.

B.,

N y g a a r d

J.

Investigations

of

traffic

arrival

processes,

229.

based upon extensive traffic measurements. 6th

ITC, Munich, 4970.

J a c o b a e u s

C. A study on congestion

in link systems. •— «Ericsson Techn.»,

230.

1950,

v. 48.

does

ITC expect from CCITT. 6 ITC, Munich, 1970.

J e n s e n

A. What

231.

J o y s

L. A. Comments

on the Engset and Erlang Formulae for telephone

232.

traffic losses. Norvegian Telecomm. Administr., 4971.

K a b a k

233.

v. 16, Nr. 2, p. 431—436.

equation

by iteration proces­

K a l e

B.

R. On the solution of the likelihood

ses. — «Biometrika», 1961, p. 452—456.

234.

K a r l i n

S.,

M c G r e g о r J. L. The differential

equations of birth and death

processes

1957, v. 85. Nr. 2, p. 489—546.

235.

K a r l s s o n

S. A. The

dimensioning of telephone traffic routes for measured

236.

integrated peak traffic. 5th ITC, New York, 1967.

regular

diffusion

and

birth

K e i l s o n

I.

A

review

of

trasient behavior

in

and death processes. — «J. of Applied Probabality», >19*54, v.

1,

247—266;

1965, v. 2, p. 405—428.

237.

K h a m i s

238.

Darmstadt,

4965.

S m i t h

В.

B.

Second

paper on

random

sampling

num­

K e n d a l l

M.

G.,

239.

bers.— «J. Roy. Stat. Soc.»,

19,39, v. 6, suppl. Nr. 1, p. 51—61.

K i r c h h o f f

Ober

die

Auflosung von Gleichungen, auf welche man bei der

«Ann. der Physik», 1847, 72.

240.

К n u t h

D. E.,

M e

N e 1 a у J, L. SOL.

A

symbolic language

for general

241.

purpose systems simulation. — «IEEE Trans, on Eleotr. Comp.»,

1964, Nr. 4.

Кб n ig

D.,

M a t t h e s

K-, N a w r o t z k i

K.

Verallgemeinerungen

der

242.

Erlangschen und Engsetschen Formeln. Akademie VerLag, Berlin,

1967.

K o s t e n

L. On the influence of repeated

oalls

in the theory of probabilities

of blocking. — «Electrotechnie»,

1947, v. 44,

p. 123—4'31.

24'3. К os te n L. On the

measurements

of congestion quantities by means of ficti­

244.

tious traffic. — «Het P. С. C. Bedrijf», 1948—9, Nr. 2.

Munich,

4970.

K o s t e n

L.

Simulation

in

traffic

theory.

6th ITC(preprint),

245.

K o s t e n

L., M a n n i n g

J. R.,

G a r w o o d

F. On

the accuracy of

measure­

ments of probabilities of loss in telephone

systems. — «J. of Roy. Stat. Soc.»,.

246.

ser. B, 1949, v. 11,

Nr. b, p. 54—67.

M. On the accuracy of measurements of

K o s t e n

L.,

t e n

В т о с к е

A.

waiting

times

in

the single server system with arbitrary distribution of

247.

holding times. Preprints book of 5th ITC, N.-Y. 1967, p. 435—441.

1959v

K r a m e r

H. P. Symmetrizable Markov

matrices. —

«Ann. Math. Stat.»,

248.

v. 30,

Nr.

1.

F. Rotary traffic

mashine. —

«Electr. Comm.»,

1046, v. 23,

Nr. 2.

K r u i t h o f

249.

K r u s k a l

J.

B.

Work-scheduling

algorithms:

a

nonprobabilistic

queueing-

250.

study (with possible application to

No. 1 ESS). — «BSTJ»,

1969, v. 48, Nr. 9.

Ku h n

P.

Parallel

waiting

queues

in

real-time

computer

system. — «NTZ»,,

254.

4970, H. 41, p. 576—682.

Vorschlag

zur

Bereohnung

der

Vertrauensinterballs-

K i i mm e r l e

K.

Ein

252.

bei Verkehrstests. — «А. E. О», 1969, B. 23, H. 10.

systems.

6th

ITC(preprint),

K i i mm e r l e

K-

Point

to

point

loss

in

link

253.

Munich,

1970.

S h e d l e r

G. S. A

cyclic-queue model

of system

overhead

L e w i s

P. A. W.,

in multiprogrammed computer systems. — «J. of ACM»,

1971,

v.

18, Nr. 2,.

254.

p. 199—200.

of traffic measurements

in

a Poisson

traffic

process. —

L i n d

G. Accuracy

255.

«Ericsson Techn.», 4969, Nr. 4, p. 211—246.

—

«Post

Office

Electr. J.»,.

L о n g 1e у

H.

A.

The

efficiency

of

gradings.

256.

1948,

v.

41.

grade-of-service problems. 6

ITC,

Munich,

1970.

L o n g l e y

H. A. Some

257.

L o t z e

A.

History

and

development

of

grading

theory.

5th

ITC(preprint

book), N.-Y., 1967,

p. 148—161.

258.

L o t z e

A. Uber die statistische

Sicherheit

von Verkehrsmessungen. — «NTZ»,.

259.

11

(1958),

5—7.

W.

Table

of

the

modified Palm-Jacobaeus-Loss—

L o t z e

A.,

W a g n e r

Formula. TH

Stuttgart, 1962.

260.

L o t z e

A. Tables

for overflow variance coefficient and loss of gradings and-

261.

full available groups. Univ. Stuttgart,

1964.

L o t z e

A. Tables

for variance coefficient D and overflow traffic R on one

stage

gradings

with

limited

acsess.

Calculation

of

secondary routes

in

case

262.

of

offered

overflow

traffic (R, D). Univ. Stuttgart, 1965.

M e t r o p o l i s

N..

U l a m

S. The

Monte Carlo method. — «J. Amer. Stat.

263.

Assoc.», 1949, v. 44, Nr. 247, p. 335—341.

walks, with genetic

applica­

M o r a n

P. A. Some general

results

on random

tions. — «J. Australian Math. Soc.»,

1963, v. 3, pt 4.

264. M oy

W. A. Monte Carlo techiques: pnaotical. In [487], p. 263—288.

«Ericsson

265.

N e o v i u s

G.

Artificial

traffic

trials

using

digital

computer.

—

Techn.»,

1955, v. 2.

267.

N i e l s e n

N. R. The simulation of time-sharing systems. — «Comm. ACM»,.

268.

O b e r t o

P. About determining offered traffic from carried traffic measure­

269.

О e h m e F.

270.

О eh me

F.

271.

O e t t l K.

Herausgraten iibertragungstechich gfinstiger Ferbindungskonibina-

272.

О 11 s о n

К.

273.

01 I s o n

К.

ITC (preprint