Last update: Thu Jun 20 02:01:00 MDT 2019
Top |
Symbols |
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{Wong:2007:NMA,
author = "Eric W. M. Wong and Andrew Zalesky and Zvi Rosberg and
Moshe Zukerman",
title = "A new method for approximating blocking probability in
overflow loss networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "11",
pages = "2958--2975",
day = "8",
month = aug,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:19 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
Related entries
- blocking,
42(4)537,
43(2)163,
45(3)281,
49(6)727
- loss,
34(2)241,
41(2)161,
45(3)363,
46(4)519,
49(6)766,
50(9)1193,
50(11)1799,
50(15)2787,
51(3)559,
51(4)1133,
51(10)2467,
52(2)461,
52(9)1703,
53(2)202,
53(7)1137,
53(9)1303,
53(12)2091
- method,
34(1)129,
37(1)55,
38(1)99,
40(1)45,
44(2)177,
44(4)529,
48(1)21,
48(2)155,
50(10)1448,
50(17)3334,
50(17)3485,
51(1)309,
51(6)1705,
51(8)2198,
52(1)275,
52(11)2159,
53(3)279,
53(18)3076
- new,
32(5)515,
34(3)467,
35(1)57,
35(2)287,
35(4)391,
35(6)709,
35(6)721,
36(4)381,
38(2)121,
38(3)311,
39(4)437,
40(1)1,
40(2)257,
41(4)475,
41(6)761,
43(3)369,
45(4)399,
46(2)181,
46(2)253,
47(1)105,
48(2)155,
49(2)201,
50(8)1176,
50(10)1599,
50(17)3416,
50(18)3743,
51(3)767,
51(6)1530,
51(10)2833,
51(17)4797,
51(18)4897,
52(12)2260,
52(18)3421
- overflow,
46(4)541,
51(8)1942
- probability,
40(3)459,
41(4)527,
42(4)537,
43(2)163,
45(3)281,
49(6)727,
51(13)3727,
53(12)2091
- Rosberg, Zvi,
53(16)2810
- Zukerman, Moshe,
40(3)377,
53(7)1099