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{Gojmerac:2008:TLC,
author = "Ivan Gojmerac and Peter Reichl and Lasse Jansen",
title = "Towards low-complexity {Internet} traffic engineering:
{The} {Adaptive Multi-Path} algorithm",
journal = j-COMP-NET-AMSTERDAM,
volume = "52",
number = "15",
pages = "2894--2907",
day = "23",
month = oct,
year = "2008",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:28 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
- adaptive,
33(1)431,
34(4)605,
35(2)97,
35(2)263,
36(2)343,
36(5)709,
37(3)363,
38(2)207,
38(2)225,
38(4)477,
38(5)631,
40(6)695,
43(1)3,
43(2)113,
43(2)163,
43(6)713,
44(2)135,
44(4)415,
44(6)773,
47(2)167,
48(2)215,
48(4)489,
48(4)683,
49(1)84,
49(3)404,
49(6)787,
50(8)1040,
50(9)1261,
50(13)2204,
50(15)2762,
51(1)224,
51(3)823,
51(4)1031,
51(5)1334,
51(6)1574,
51(6)1616,
51(8)1981,
51(12)3427,
51(13)3773,
52(1)180,
52(6)1238,
52(8)1583,
52(13)2461,
52(13)2473,
52(13)2532,
53(5)668,
53(9)1409,
53(14)2566,
53(18)3011
- algorithm,
33(1)449,
34(2)279,
34(3)341,
34(3)481,
35(2)287,
36(2)251,
37(3)331,
37(5)631,
38(3)311,
38(4)447,
38(6)765,
39(4)363,
39(4)457,
39(5)681,
39(6)729,
41(1)41,
41(2)227,
41(4)363,
41(6)727,
42(4)503,
42(6)697,
43(3)247,
43(5)669,
44(1)17,
44(1)43,
45(2)155,
45(6)731,
46(4)505,
47(1)87,
47(4)525,
47(6)785,
48(2)155,
48(2)215,
48(6)972,
49(2)201,
49(2)243,
49(4)476,
49(4)593,
50(2)207,
50(3)422,
50(8)1086,
50(8)1176,
50(9)1384,
50(11)1710,
50(11)1816,
50(13)2239,
50(13)2286,
50(15)2713,
50(15)2805,
50(16)2981,
50(17)3225,
50(17)3375,
51(1)69,
51(4)1031,
51(6)1499,
51(6)1705,
51(8)1998,
51(8)2104,
51(9)2223,
51(11)3110,
51(11)3172,
51(11)3252,
51(13)3919,
51(14)3989,
51(15)4270,
51(16)4669,
52(3)531,
52(3)542,
52(5)1093,
52(6)1238,
52(7)1492,
52(9)1675,
52(10)1905,
52(13)2473,
52(13)2543,
52(15)2819,
52(16)3130,
52(17)3229,
53(1)25,
53(1)110,
53(3)247,
53(7)926,
53(7)945,
53(9)1480,
53(13)2275,
53(14)2458,
53(14)2537,
53(18)2997
- engineering,
35(5)565,
35(6)647,
40(1)111,
40(1)131,
40(1)149,
40(3)317,
40(6)695,
44(3)319,
47(2)257,
48(4)605,
51(1)207,
51(14)4092,
52(11)2237,
52(12)2360,
53(15)2688
- Internet,
32(2)185,
32(3)365,
32(5)515,
32(6)701,
33(1)231,
33(1)337,
33(1)567,
33(1)609,
33(1)789,
33(1)803,
34(2)263,
34(3)467,
34(6)931,
35(1)39,
35(5)503,
35(5)551,
36(2)117,
36(5)493,
36(5)557,
37(5)601,
37(5)645,
37(6)747,
38(6)809,
39(2)207,
39(5)681,
40(1)1,
40(1)5,
40(1)57,
40(1)111,
40(6)711,
41(3)303,
43(1)3,
43(2)75,
44(4)441,
44(6)737,
45(1)1,
45(1)5,
45(1)35,
45(3)333,
45(4)505,
45(5)605,
45(6)731,
46(1)1,
46(1)87,
47(4)503,
47(5)599,
47(5)603,
47(5)651,
48(1)1,
48(3)315,
48(3)377,
48(3)401,
48(3)423,
49(1)4,
50(1)46,
50(1)128,
50(5)648,
50(8)1130,
50(15)2787,
50(16)2919,
50(16)3183,
50(16)3197,
50(17)3334,
50(18)3608,
50(18)3763,
51(1)309,
51(2)382,
51(8)2067,
51(10)2701,
51(11)2938,
51(13)3902,
51(14)4092,
51(14)4153,
51(14)4174,
51(15)4284,
51(16)4617,
51(17)4780,
51(18)4919,
51(18)5036,
52(1)180,
52(1)275,
52(2)303,
52(5)935,
52(14)2645,
53(3)365,
53(11)1784
- low-complexity,
50(11)1872,
52(13)2594
- Reichl, Peter,
43(1)3,
46(1)1
- towards,
34(1)157,
34(4)659,
36(2)153,
40(1)1,
41(1)29,
44(6)737,
50(17)3485,
51(1)94,
51(2)359,
51(8)2144,
51(17)4711,
52(3)493,
52(4)879,
53(7)1027