Constrained mirror placement on the Internet

By Eric Cronin, Sugih Jamin, Cheng Jin, A. Kurc, Danny Raz, Yuval Shavitt. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001

399 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/aa8fd09fc6afd58e5121b820b396d5bc306d6e32

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Yuval Shavitt
2. Kang G. Shin
3. Paul Francis
4. Raj Jain
5. Sugih Jamin
6. Mohammed Samaka
7. Lixia Zhang
8. Cheng Jin

Citations in the corpus

• Hop-count filtering: an effective defense against spoofed DDoS traffic (2003, methodology): “To estimate the average size of a chained list, we hash the client IP addresses from [11] into the 4096-bucket hash table to find that, on average, there are 11 entries on a chain, with the maximum being 25.”
• A survey on service function chaining (2016, methodology): “A set of heuristics is presented in [61] to present a constrained mirror placement approach in Content Distribution Networks (CDNs) to minimize the latencies.”
• IDMaps: a global internet host distance estimation service (2001, methodology): “In [29], we also present results of applying the graph theoretic placement algorithms on distance maps computed from the Transit-AS heuristics.”