-
Notifications
You must be signed in to change notification settings - Fork 2
/
references.bib
101 lines (95 loc) · 3.81 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
@inproceedings{Schindelhauer:2005:WeightedRendezvousHashing,
author = {Schindelhauer, Christian and Schomaker, Gunnar},
title = {Weighted Distributed Hash Tables},
booktitle = {Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures},
series = {SPAA '05},
year = {2005},
isbn = {1-58113-986-1},
location = {Las Vegas, Nevada, USA},
pages = {218--227},
numpages = {10},
url = {http://doi.acm.org/10.1145/1073970.1074008},
doi = {10.1145/1073970.1074008},
acmid = {1074008},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {adaptive hashing, consistent hashing, non-uniform disks, peer-to-peer networks, storage area networks, web caching},
}
@article{Lamping:2014:Jump,
author = {John Lamping and Eric Veach},
title = {A Fast, Minimal Memory, Consistent Hash Algorithm},
journal = {CoRR},
volume = {abs/1406.2294},
year = {2014},
url = {http://arxiv.org/abs/1406.2294},
archivePrefix = {arXiv},
eprint = {1406.2294},
timestamp = {Wed, 07 Jun 2017 14:41:04 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/LampingV14},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Eisenbud:2016:Maglev,
title = {Maglev: A Fast and Reliable Software Network Load Balancer},
author = {Daniel E. Eisenbud and Cheng Yi and Carlo Contavalli and Cody Smith and Roman Kononov and Eric Mann-Hielscher and Ardas Cilingiroglu and Bin Cheyney and Wentao Shang and Jinnah Dylan Hosein},
year = {2016},
URL = {https://www.usenix.org/conference/nsdi16/technical-sessions/presentation/eisenbud},
booktitle = {13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16)},
pages = {523--535},
address = {Santa Clara, CA}
}
@article{Appleton:2015:MPC,
author = {Ben Appleton and Michael O'Reilly},
title = {Multi-probe consistent hashing},
journal = {CoRR},
volume = {abs/1505.00062},
year = {2015},
url = {http://arxiv.org/abs/1505.00062},
archivePrefix = {arXiv},
eprint = {1505.00062},
timestamp = {Wed, 07 Jun 2017 14:40:38 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/AppletonO15},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Karger:1997:Consistent,
author = {Karger, David and Lehman, Eric and Leighton, Tom and Panigrahy, Rina and Levine, Matthew and Lewin, Daniel},
title = {Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web},
booktitle = {Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing},
series = {STOC '97},
year = {1997},
isbn = {0-89791-888-6},
location = {El Paso, Texas, USA},
pages = {654--663},
numpages = {10},
url = {http://doi.acm.org/10.1145/258533.258660},
doi = {10.1145/258533.258660},
acmid = {258660},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{Thaler:1998:RendezvousHashing,
author = {Thaler, David G. and Ravishankar, Chinya V.},
title = {Using Name-based Mappings to Increase Hit Rates},
journal = {IEEE/ACM Trans. Netw.},
issue_date = {Feb. 1998},
volume = {6},
number = {1},
month = feb,
year = {1998},
issn = {1063-6692},
pages = {1--14},
numpages = {14},
url = {http://dx.doi.org/10.1109/90.663936},
doi = {10.1109/90.663936},
acmid = {276288},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA},
keywords = {World Wide Web, caching, client-server systems, computer networks, distributed agreement, multicast routing, proxies},
}
@inproceedings{Mirrokni:2018:BoundedConsistent,
title={Consistent hashing with bounded loads},
author={Mirrokni, Vahab and Thorup, Mikkel and Zadimoghaddam, Morteza},
booktitle={Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms},
pages={587--604},
year={2018},
organization={SIAM}
}