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{Sarolahti:2007:DAS,
author = "Pasi Sarolahti and Mark Allman and Sally Floyd",
title = "Determining an appropriate sending rate over an
underutilized network path",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "7",
pages = "1815--1832",
day = "16",
month = may,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:17 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
- Allman, Mark,
42(2)261,
46(3)343
- determining,
46(4)437
- path,
32(1)99,
32(5)653,
33(1)377,
36(2)251,
38(3)373,
38(5)663,
39(2)165,
40(1)149,
40(3)399,
43(5)557,
44(1)79,
46(2)197,
47(3)307,
48(6)960,
50(3)398,
50(10)1474,
50(12)1887,
50(13)2349,
51(3)835,
51(10)2467,
51(10)2738,
51(11)3278,
51(12)3574,
51(14)4189,
52(6)1166,
52(12)2360,
52(12)2411,
52(15)2975,
53(7)1014,
53(9)1341,
53(9)1467,
53(9)1530,
53(10)1697
- rate,
32(1)17,
34(1)23,
34(1)211,
35(2)237,
35(2)263,
37(3)331,
37(3)363,
39(6)769,
40(1)89,
40(4)499,
40(6)683,
41(4)489,
42(6)779,
43(3)307,
44(1)17,
44(2)135,
45(3)363,
45(6)801,
48(6)829,
49(3)325,
50(1)15,
50(15)2614,
51(1)239,
51(3)606,
51(6)1403,
51(6)1601,
51(6)1616,
51(8)1981,
52(3)739,
52(6)1238,
53(5)583,
53(9)1303,
53(9)1395,
53(11)1798,
53(16)2810
- sending,
50(3)422