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{Oie:1989:TAB,
author = "Y. Oie and S. Nishio and T. Hasegawa",
title = "Throughput Analysis of Blocked Access Tree Algorithms
with Mini-slots",
journal = j-COMP-NET-ISDN,
volume = "17",
number = "3",
pages = "201--221",
year = "1989",
CODEN = "CNISE9",
ISSN = "0169-7552 (print), 1879-2324 (electronic)",
ISSN-L = "0169-7552",
bibdate = "Sat Sep 25 15:30:01 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1989.bib;
http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
acknowledgement = ack-nhfb,
annote = "This paper analyzes the maximum stable throughput of
two Q-ary blocked access tree algorithms with
minislots: one (TA/M-BF) assumes that something/nothing
binary feedback information is available in a
mini-slot, and the other (TA/M-TF) assumes ternary
feedback.",
country = "NL",
date = "17/10/90",
descriptors = "Random access; stability; collision resolution;
throughput analysis",
enum = "4165",
journal-URL = "http://www.sciencedirect.com/science/journal/01697552",
language = "English",
location = "RWTH-AC-DFV: Bibl.",
references = "18",
revision = "21/04/91",
}
Related entries
- algorithm,
9(2)109,
9(4)257,
9(4)297,
10(5)245,
11(1)1,
11(1)43,
12(1)27,
12(2)81,
12(2)89,
12(2)99,
12(3)139,
12(3)147,
12(5)311,
13(4)269,
13(4)301,
14(2)389,
15(1)1,
15(5)329,
16(3)179,
16(5)367,
16(5)383,
17(1)1,
17(1)29,
17(2)127,
18(5)355,
18(z)243,
22(4)235,
22(4)265,
24(1)81,
25(10)1107,
26(2)227,
26(6)695,
26(9)1215,
26(11)1385,
27(2)255,
28(7)1037,
29(2)237,
29(3)343,
29(14)1587,
29(14)1661,
29(14)1705,
29(14)1737,
29(17)2053,
30(1)317,
30(11)1029,
30(20)1833,
30(22)2203,
30(24)2309
- analysis,
9(2)131,
9(3)191,
9(5)345,
10(2)111,
10(3)211,
11(3)203,
11(3)219,
11(5)367,
12(2)89,
12(5)277,
12(5)291,
14(2)199,
14(2)231,
14(2)237,
14(2)365,
15(2)87,
16(3)197,
16(5)347,
17(1)1,
17(1)15,
24(4)335,
24(5)367,
24(5)421,
25(2)169,
25(2)191,
25(3)295,
25(4)329,
25(12)1321,
26(1)79,
26(2)185,
26(3)379,
26(11)1385,
26(11)1437,
26(12)1559,
27(1)45,
27(2)135,
27(2)193,
27(5)627,
27(6)973,
27(6)985,
27(7)1175,
28(1)109,
28(3)283,
28(3)391,
28(3)411,
28(5)653,
28(6)743,
28(13)1809,
29(2)209,
29(2)249,
29(6)701,
29(7)781,
29(8)1167,
29(17)2021,
29(17)2139,
29(17)2165,
30(8)821,
30(8)835,
30(11)1013,
30(20)1887,
30(20)1907,
30(22)2105,
30(24)2337
- analyze,
20(1)171,
27(5)653
- assume,
20(1)171
- available,
12(2)99,
12(3)159,
13(2)65,
16(1)138,
25(4)454,
27(6)1089,
28(5)635,
30(24)2293
- binary,
15(3)217,
30(20)1941
- feedback,
10(1)7,
14(2)147,
28(3)345,
30(1)621
- maximum,
10(3)211,
13(1)3,
30(20)2003
- one,
18(z)243,
21(2)109,
25(6)599,
25(10)1089,
26(z)z-1,
30(1)225
- other,
23(1)51,
23(1)139,
25(4)454,
25(6)599,
25(10)1089,
26(3)269,
26(z)z,
26(z)z-1,
27(2)193,
27(2)273,
27(2)289,
27(3)353,
27(6)729,
27(6)823,
27(6)831,
27(6)919,
28(7)1063,
28(13)1723
- paper,
10(3)211,
11(z)277,
12(2)81,
12(2)89,
12(3)159,
13(2)65,
13(2)75,
13(2)91,
14(3)3,
16(1)64,
16(4)311,
18(1)31,
18(13)1845,
20(1)15,
20(1)137,
20(1)171,
20(1)369,
20(1)435,
24(3)199,
24(4)311,
25(6)599,
25(9)1019,
25(10)1089,
25(10)1107,
25(10)1119,
25(10)1127,
25(11)1177,
25(11)1205,
26(3)253,
26(3)269,
26(z)z-1,
27(2)135,
27(2)193,
27(2)205,
27(2)273,
27(2)289,
28(13)1845,
30(19)1735,
30(24)2293
- stable,
21(2)109,
22(3)213
- throughput,
10(1)19,
10(3)211,
12(2)99,
16(5)347,
18(1)31,
24(1)33,
24(2)153,
25(4)351,
25(10)1127,
26(5)541,
26(6)757,
28(6)743,
28(6)773,
29(2)165
- tree,
13(4)323,
17(2)89,
17(2)101,
17(z)89,
25(12)1335,
26(2)227,
26(6)895,
26(6)965,
27(11)1499,
30(20)1941
- two,
12(1)1,
21(3)149,
23(4)267,
25(10)1089,
25(11)1205,
25(12)1279,
26(6)1023,
27(2)205,
27(11)1545,
28(13)1723,
29(7)759,
29(14)1661