S. Borst
2010 Proceedings IEEE INFOCOM · 2000–2010
A researcher in the Science corpus: 4 papers; trusts 3 researchers and is trusted by 11 researchers here, as inferred from the citation graph.
Whom S. Borst trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts S. Borst overall
- Ger Koole
- A. Mandelbaum
- Mohammad Ali Maddah-Ali
- Noah Gans
- Ejder Bastug
- Ju Ren
- Urs Niesen
- Ward Whitt
- Shuo Wang
- Andreas E. Kyprianou
Papers from S. Borst's perspective
Ordered by how strongly the researchers S. Borst trusts endorse each paper. Same corpus, a different order for every researcher.
- Is network traffic approximated by stable Levy motion or fractional Brownian motion
- Summary cache: a scalable wide-area web cache sharing protocol
- Object replication strategies in content distribution networks (Computer Communications)
- On inferring autonomous system relationships in the Internet (Global Communications Conference)
- On the placement of Web server replicas (Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213))
- The cache location problem (TNET)
- Replacement policies for a proxy cache (TNET)
- Handbook of Applied Cryptography
- Space/time trade-offs in hash coding with allowable errors
- Youtube traffic characterization: a view from the edge (ACM/SIGCOMM Internet Measurement Conference)
Their papers
- The tax identity in risk theory — a simple proof and an extension (2009) — 52 citations
- Dimensioning Large Call Centers (2000) — 413 citations
- Distributed Caching Algorithms for Content Distribution Networks (2010) — 605 citations
- Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows (2004) — 59 citations