Last update: Fri Jan 5 02:05:58 MST 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Woodruff:1990:CAS,
author = "G. N. Woodruff and R. Kositpaiboon and G. Fitzpatrick
and P. Richards",
title = "Control of {ATM} Statistical Multiplexer Performance",
journal = j-COMP-NET-ISDN,
volume = "20",
number = "1--5",
pages = "351--360",
year = "1990",
CODEN = "CNISE9",
ISSN = "0169-7552 (print), 1879-2324 (electronic)",
ISSN-L = "0169-7552",
bibdate = "Sat Sep 25 15:30:02 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib;
http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
note = "ITC Specialist Seminar, 25--29 September 1989,
Adelaide, Australia.",
abstract = "Traffic controls in an ATM network must be designed to
satisfy the bandwidth and performance requirements of a
wide range of services. The challenge is to design
simple and effective controls while allowing a
reasonable utilization of bandwidth which can be
achieved with statistical multiplexing. Several
high-level design principles for these controls are
introduced, and their implications on traffic suitable
for statistical multiplex",
acknowledgement = ack-nhfb,
date = "00/00/00",
descriptors = "B-ISDN; ATM; statistical multiplexing; bandwidth
allocation; traffic control",
enum = "9029",
journal-URL = "http://www.sciencedirect.com/science/journal/01697552",
language = "English",
references = "0",
revision = "25/04/94",
}
Related entries
- achieved,
18(1)31
- Adelaide,
20(1)3,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435
- allowing,
27(2)289,
30(1)225
- Australia,
20(1)3,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435,
27(3)411,
30(1)225
- bandwidth,
11(2)121,
12(2)99,
13(4)301,
16(3)217,
18(z)243,
20(1)189,
22(4)287,
24(2)119,
24(5)367,
25(2)203,
25(3)295,
25(6)599,
25(10)1065,
25(10)1119,
26(1)43,
26(1)61,
26(3)253,
26(6)799,
26(9)1129,
26(9)1215,
26(11)1375,
28(3)351,
28(3)391,
28(6)855,
28(7)1445,
29(16)1969,
30(16)1707
- challenge,
12(4)235,
17(4)324,
17(4)376,
23(1)15,
23(1)25,
25(9)1019,
25(10)1089,
30(1)757
- designed,
26(3)253
- effective,
20(1)189,
25(10)1065,
30(1)53,
30(1)309
- high-level,
19(z)201,
28(7)1037
- implication,
13(4)269,
28(5)613
- introduced,
20(1)137,
25(10)1107
- ITC,
20(1)3,
20(1)7,
20(1)15,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435
- level, high-,
28(7)1037
- multiplex,
24(4)311
- multiplexer,
25(2)191,
25(12)1267,
26(5)525,
26(9)1169,
28(3)411,
29(3)325,
29(16)1881,
29(17)2153
- multiplexing,
10(2)111,
26(1)119,
26(3)275,
27(7)1175,
29(3)293,
29(16)1969,
30(9)951,
30(14)1341
- principle,
10(3)211,
16(3)217,
17(2)77,
20(1)137,
20(1)435,
24(3)219,
24(4)321,
29(5)583
- requirements,
13(2)119,
13(3)149,
14(2)123,
15(2)109,
16(1)44,
16(1)146,
20(1)3,
21(3)149,
22(3)179,
27(2)193,
27(2)205,
27(8)1231,
28(5)619,
28(7)1445,
28(12)1703,
28(13)1753,
30(1)694
- Seminar,
20(1)3,
20(1)7,
20(1)15,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435
- September,
10(3)185,
20(1)3,
20(1)7,
20(1)15,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435,
23(4)317
- several,
10(3)211,
20(1)425,
24(2)153,
25(12)1279,
28(13)1723,
z(z)207
- simple,
11(5)383,
20(1)189,
20(1)425,
25(4)454,
25(9)969,
26(6)1023,
26(z)z-1,
27(2)273,
27(2)289,
29(14)1661,
30(22)2149
- Specialist,
20(1)3,
20(1)7,
20(1)15,
20(1)171,
20(1)189,
20(1)369,
20(1)425,
20(1)435
- statistical,
10(3)185,
25(2)191,
25(12)1267,
26(1)119,
26(9)1169,
28(7)1445,
29(16)1919,
30(9)951
- suitable,
20(1)15,
27(6)1009
- utilization,
17(2)101
- which,
12(2)81,
18(z)243,
20(1)7,
20(1)369,
25(4)454,
25(6)599,
25(10)1089,
26(3)269,
27(2)135,
27(2)289,
27(6)823,
27(6)1009
- while,
12(3)159,
18(z)243,
20(1)171,
25(10)1119