-
1
-
-
84861660771
-
Cache "less for more" in information-centric networks
-
Berlin, Heidelberg, Springer-Verlag
-
W. K. Chai, D. He, I. Psaras, and G. Pavlou. Cache "less for more" in information-centric networks. IFIP'12, pages 27-40, Berlin, Heidelberg, 2012. Springer-Verlag.
-
(2012)
IFIP'12
, pp. 27-40
-
-
Chai, W.K.1
He, D.2
Psaras, I.3
Pavlou, G.4
-
2
-
-
84883310765
-
Less pain, most of the gain: Incrementally deployable icn
-
New York, NY, USA, ACM
-
S. K. Fayazbakhsh, Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen, B. Maggs, K. Ng, V. Sekar, and S. Shenker. Less pain, most of the gain: Incrementally deployable icn. SIGCOMM '13, pages 147-158, New York, NY, USA, 2013. ACM.
-
(2013)
SIGCOMM '13
, pp. 147-158
-
-
Fayazbakhsh, S.K.1
Lin, Y.2
Tootoonchian, A.3
Ghodsi, A.4
Koponen, T.5
Maggs, B.6
Ng, K.7
Sekar, V.8
Shenker, S.9
-
3
-
-
84888442677
-
Information-centric networking: Seeing the forest for the trees
-
New York, NY, USA, ACM
-
A. Ghodsi, S. Shenker, T. Koponen, A. Singla, B. Raghavan, and J. Wilcox. Information-centric networking: Seeing the forest for the trees. HotNets-X, pages 1:1-1:6, New York, NY, USA, 2011. ACM.
-
(2011)
HotNets-X
, pp. 11-16
-
-
Ghodsi, A.1
Shenker, S.2
Koponen, T.3
Singla, A.4
Raghavan, B.5
Wilcox, J.6
-
4
-
-
76749083002
-
Networking named content
-
New York, NY, USA, ACM
-
V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking named content. CoNEXT '09, pages 1-12, New York, NY, USA, 2009. ACM.
-
(2009)
CoNEXT '09
, pp. 1-12
-
-
Jacobson, V.1
Smetters, D.K.2
Thornton, J.D.3
Plass, M.F.4
Briggs, N.H.5
Braynard, R.L.6
-
5
-
-
0033704133
-
Popularity-aware greedy dual-size web proxy caching algorithms
-
Washington, DC, USA, IEEE Computer Society
-
S. Jin and A. Bestavros. Popularity-aware greedy dual-size web proxy caching algorithms. ICDCS '00, pages 254-, Washington, DC, USA, 2000. IEEE Computer Society.
-
(2000)
ICDCS '00
, pp. 254
-
-
Jin, S.1
Bestavros, A.2
-
6
-
-
0141762468
-
Inferring link weights using end-to-end measurements
-
New York, NY, USA, ACM
-
R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights using end-to-end measurements. IMW '02, pages 231-236, New York, NY, USA, 2002. ACM.
-
(2002)
IMW '02
, pp. 231-236
-
-
Mahajan, R.1
Spring, N.2
Wetherall, D.3
Anderson, T.4
-
7
-
-
84862067796
-
Age-based cooperative caching in information-centric networks
-
March
-
Z. Ming, M. Xu, and D. Wang. Age-based cooperative caching in information-centric networks. In Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on, pages 268-273, March 2012.
-
(2012)
Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on
, pp. 268-273
-
-
Ming, Z.1
Xu, M.2
Wang, D.3
-
8
-
-
80053046785
-
Bandwidth and storage sharing performance in information centric networking
-
New York, NY, USA, ACM
-
L. Muscariello, G. Carofiglio, and M. Gallo. Bandwidth and storage sharing performance in information centric networking. ICN '11, pages 26-31, New York, NY, USA, 2011. ACM.
-
(2011)
ICN '11
, pp. 26-31
-
-
Muscariello, L.1
Carofiglio, G.2
Gallo, M.3
-
9
-
-
84866631717
-
Probabilistic in-network caching for information-centric networks
-
New York, NY, USA, ACM
-
I. Psaras, W. K. Chai, and G. Pavlou. Probabilistic in-network caching for information-centric networks. ICN '12, pages 55-60, New York, NY, USA, 2012. ACM.
-
(2012)
ICN '12
, pp. 55-60
-
-
Psaras, I.1
Chai, W.K.2
Pavlou, G.3
-
10
-
-
70349659322
-
Breadcrumbs: Efficient, best-effort content location in cache networks
-
IEEE
-
E. J. Rosensweig and J. Kurose. Breadcrumbs: Efficient, best-effort content location in cache networks. In INFOCOM, pages 2631-2635. IEEE, 2009.
-
(2009)
INFOCOM
, pp. 2631-2635
-
-
Rosensweig, E.J.1
Kurose, J.2
-
12
-
-
84883704979
-
Hash-routing schemes for information centric networking
-
New York, NY, USA, ACM
-
L. Saino, I. Psaras, and G. Pavlou. Hash-routing schemes for information centric networking. ICN '13, pages 27-32, New York, NY, USA, 2013. ACM.
-
(2013)
ICN '13
, pp. 27-32
-
-
Saino, L.1
Psaras, I.2
Pavlou, G.3
-
13
-
-
0001159775
-
A case for delay-conscious caching of web documents
-
Sept
-
P. Scheuermann, J. Shim, and R. Vingralek. A case for delay-conscious caching of web documents. Comput. Netw. ISDN Syst., 29(8-13):997-1005, Sept. 1997.
-
(1997)
Comput. Netw. ISDN Syst.
, vol.29
, Issue.8-13
, pp. 997-1005
-
-
Scheuermann, P.1
Shim, J.2
Vingralek, R.3
-
14
-
-
84891610139
-
An improved hop-by-hop interest shaper for congestion control in named data networking
-
Y. Wang, N. Rozhnova, A. Narayanan, D. Oran, and I. Rhee. An improved hop-by-hop interest shaper for congestion control in named data networking. Computer Communication Review, 43(4):55-60, 2013.
-
(2013)
Computer Communication Review
, vol.43
, Issue.4
, pp. 55-60
-
-
Wang, Y.1
Rozhnova, N.2
Narayanan, A.3
Oran, D.4
Rhee, I.5
-
15
-
-
0001613996
-
Proxy caching that estimates page load delays
-
Sept
-
R. P. Wooster and M. Abrams. Proxy caching that estimates page load delays. Comput. Netw. ISDN Syst., 29(8-13):977-986, Sept. 1997.
-
(1997)
Comput. Netw. ISDN Syst.
, vol.29
, Issue.8-13
, pp. 977-986
-
-
Wooster, R.P.1
Abrams, M.2
|