Name
Abstract | ||
|---|---|---|
Many systems possess the flexibility to serve requests in more than one way, such as distributed storage systems that store multiple copies of the data. In such systems, the latency of serving the requests may potentially be reduced by sending redundant requests: a request may be sent to more servers than needed and deemed served when the requisite number of servers complete service. Such a mechan... |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TCOMM.2015.2506161 | IEEE Transactions on Communications |
Keywords | DocType | Volume |
Servers,Redundancy,Distributed databases,Optimal scheduling,Approximation methods,Program processors,Steady-state | Conference | 64 |
Issue | ISSN | Citations |
2 | 0090-6778 | 52 |
PageRank | References | Authors |
2.22 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nihar B. Shah | 1 | 1202 | 77.17 |
| Kangwook Lee | 2 | 117 | 15.76 |
| Kannan Ramchandran | 3 | 9401 | 1029.57 |