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{Cetinkaya:2007:IEM,
author = "Coskun Cetinkaya",
title = "Improving the efficiency of multipath traffic via
opportunistic traffic scheduling",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "8",
pages = "2181--2197",
day = "6",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 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
- efficiency,
43(2)227,
48(6)941,
50(12)1974,
51(17)4727,
52(2)384
- improving,
34(3)419,
34(4)597,
35(2)185,
35(6)667,
36(5)617,
40(1)19,
44(1)63,
44(4)499,
44(5)599,
46(2)181,
46(5)635,
46(6)817,
47(2)219,
47(4)503,
48(2)113,
48(2)175,
49(6)816,
50(3)289,
50(11)1675,
50(13)2204,
51(3)632,
51(10)2753,
51(12)3323,
51(13)3799,
51(18)4997,
52(8)1583,
52(16)3062,
53(15)2663,
53(16)2767
- multipath,
40(6)695,
43(4)481,
51(8)2163,
51(10)2854,
52(7)1506
- opportunistic,
41(4)451,
46(4)505,
53(7)883
- scheduling,
32(3)325,
35(2)203,
35(2)287,
38(2)207,
38(2)225,
38(6)765,
39(4)363,
40(4)577,
41(4)451,
41(5)601,
41(6)727,
44(6)773,
45(2)155,
45(6)819,
46(2)169,
46(4)505,
48(2)137,
48(6)891,
48(6)910,
49(2)201,
50(3)350,
50(5)667,
50(13)2183,
50(13)2295,
50(15)2839,
51(3)621,
51(9)2368,
51(12)3427,
51(15)4270,
52(1)96,
52(3)514,
52(3)610,
52(5)971,
52(5)1105,
52(6)1252,
52(11)2148,
52(11)2189,
52(13)2473,
52(13)2543,
52(15)2819,
52(15)2988,
52(16)3169,
53(2)202,
53(4)456,
53(9)1395,
53(9)1546,
53(11)1859,
53(12)2120,
53(14)2458,
53(17)2888,
53(18)2997