INDEPENDENT INTER-DEPARTURE TIMES IN M/G/1/N QUEUES.DALEY DJ; SHANBHAG DN.1975; J. R. STATIST. SOC., B; G.B.; DA. 1975; VOL. 37; NO 2; PP. 259-263; BIBL. 8 REF.Article

THE G/M/M QUEUE WITH FINITE WAITING ROOM.HOKSTAD P.1975; J. APPL. PROBABIL.; G.B.; DA. 1975; VOL. 12; NO 4; PP. 779-792; BIBL. 8 REF.Article

A QUEUEING MODEL WITH FINITE WAITING ROOM AND BLOCKING.KONHEIM IG; REISER M.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 2; PP. 328-341; BIBL. 3 REF.Article

DIE GEMISCHTE WARTEORDNUNG IN BEDIENUNGSSYSTEMEN MIT BESCHRAENKTEM WARTERAUM. = ORDRES D'ATTENTE COMPOSES DANS LES SYSTEMES DE SERVICE A FILE D'ATTENTE LIMITEEZITEK F.1974; APL. MAT.; CESKOSL.; DA. 1974; VOL. 19; NO 2; PP. 90-100; ABS. TCHEQUE; BIBL. 7 REF.Article

QUEUING NETWORKS WITH DEGENERATE EXPONENTIAL SERVERS. = LES RESEAUX DE FILE D'ATTENTE AVEC DISTRIBUTION EXPONENTIELLE DEGENEREE DES DEMANDESWALKE B.1975; WISSENSCH. BER. A.E.G.-TELEFUNKEN; DTSCH.; DA. 1975; VOL. 48; NO 4; PP. 153-157; BIBL. 12 REF.Article

BUSY CYCLE ON THE GI/M1 QUEUE WITH FINITE WAITING ROOM.ROSENLUND SI.1974; STUD. SCI. MATH. HUNGAR.; HONGR.; DA. 1974; VOL. 9; NO 3-4; PP. 347-354; BIBL. 4 REF.Article

QUEUING NETWORK MODELS OF PACKET SWITCHING NETWORKS. I: OPEN NETWORKSWONG JW; LAM SS.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 1; PP. 9-21; BIBL. 24 REF.Article

COMPARING MULTI-SERVER QUEUES WITH FINITE WAITING ROOMS. I: SOME NUMBER OF SERVERSSONDERMAN D.1979; ADV. APPL. PROBAB.; GBR; DA. 1979; VOL. 11; NO 2; PP. 439-447; BIBL. 17 REF.Conference Paper

A QUEUEING SYSTEM WITH RANDOM ADDITIONAL SERVICE FACILITYBIDHI SINGH K.1978; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1978; VOL. 12; NO 3; PP. 311-318; BIBL. 4 REF.Article

NETWORK COMPUTER MODELINGBOWDON EK.1972; IN: ASSOC. COMPUT. MACH. ANN. CONF. PROC. BOSTON, 1972; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1972; VOL. 1; PP. 254-264; BIBL. 1 P. 1/2Conference Proceedings

QUEUEING NETWORK MODELS OF PACKET SWITCHING NETWORKS. II: NETWORKS WITH POPULATION SIZE CONSTRAINTSLAM SS; WONG JW.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 3; PP. 161-180; BIBL. 47 REF.Article

AN EXTENSION OF NORTON'S THEOREM FOR QUEUEING NETWORKSBALSAMO S; IAZEOLLA G.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 4; PP. 298-305; BIBL. 6 REF.Article

LIMITED SPACE HETEROGENEOUS QUEUEING PROBLEM WITH AN ADDITIONAL SPECIAL FEEDING SOURCE.GOEL LR.1977; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DTSCH.; DA. 1977; VOL. 8; NO 1; PP. 119-125; ABS. ALLEM. FR.; BIBL. 8 REF.Article

ON THE RELATIONSHIP BETWEEN THE DISTRIBUTION OF MAXIMAL QUEUE LENGTH IN THE M/G/1 QUEUE AND THE MEAN BUSY PERIOD IN THE M/G/1/N QUEUE.COOPER RB; TILT B.1976; J. APPL. PROBABIL.; G.B.; DA. 1976; VOL. 13; NO 1; PP. 195-199; BIBL. 8 REF.Article

BUSY PERIODS IN TIME-DEPENDENT M/G/1 QUEUES.ROSENLUND SI.1976; ADV. APPL. PROBAB.; G.B.; DA. 1976; VOL. 8; NO 1; PP. 195-208; BIBL. 9 REF.Article

IMBEDDED MARKOV CHAINS IN QUEUEING SYSTEMS M/G/1 AND GI/M/1 WITH LIMITED WAITING ROOM.BHAT UN.1975; METRIKA; DTSCH.; DA. 1975; VOL. 22; NO 3; PP. 153-160; BIBL. 10 REF.Article

ANALYSIS OF QUEUING NETWORKS IN WHICH PROCESSES EXHIBIT LOCALITY-TRANSITION BEHAVIOUR.TSUR S.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 1; PP. 20-23; BIBL. 9 REF.Article

RECURRENT EMPTINESS IN A FINITE QUEUE WITH INCREASING ARRIVAL RATE.ROSENLUND SI.1976; J. APPL. PROBABIL.; G.B.; DA. 1976; VOL. 13; NO 2; PP. 423-426; BIBL. 2 REF.Article

ALTERNATING PRIORITY QUEUES WITH NON-ZERO SWITCH RULE.NAIR SS.1976; COMPUTERS OPER. RES.; G.B.; DA. 1976; VOL. 3; NO 4; PP. 337-346; BIBL. 9 REF.Article

SIMULATION FOR PASSAGE TIMES IN CLOSED, MULTICLASS NETWORKS OF QUEUES WITH UNRESTRICTED PRIORITIESSHEDLER GS; SOUTHARD J.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 4; PP. 257-267; BIBL. 11 REF.Article

MODELES DE RESEAUX DE FILES D'ATTENTE AVEC PANNES = MODELS OF QUEUEING NETWORKS SUBJECT TO BREAKDOWNSMIKOU NOUFISSA.1981; ; FRA; DA. 1981; 159 P.; 30 CM; BIBL. DISSEM.; TH.: SCI./PARIS 11/1981/2530Thesis

EQUIVALENCE ET DECOMPOSITION DANS LES MODELES A FILES D'ATTENTE ET LEUR APPLICATION A L'EVALUATION DES PERFORMANCES DE SYSTEMES D'EXPLOITATION.BRANDWAJN A.1975; AO-CNRS-10936; FR.; DA. 1975; PP. (291P.); H.T. 4; BIBL. 27 P.; (THESE DOCT. SCI., SPEC. MATH., MENTION INF.; PARIS VI)Thesis

AN APPROXIMATION METHOD FOR OPEN RESTRICTED QUEUEING NETWORKSTAKAHASHI Y; MIYAHARA H; HASEGAWA T et al.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 594-602; BIBL. 10 REF.Article

COMPARING MULTI-SERVER QUEUES WITH FINITE WAITING ROOMS. II: DIFFERENT MEMBERS OF SERVERSSONDERMAN D.1979; ADV. APPL. PROBAB.; GBR; DA. 1979; VOL. 11; NO 2; PP. 448-455; BIBL. 14 REF.Conference Paper

A GENERATING FUNCTION APPROACH TO QUEUEING NETWORK ANALYSIS OF MULTIPROGRAMMED COMPUTERS.WILLIAMS AC; BHANDIWAD RA.1976; NETWORKS; U.S.A.; DA. 1976; VOL. 6; NO 1; PP. 1-22; BIBL. 9 REF.Article