Page 148 - ITU Kaleidoscope 2016

2016 ITU Kaleidoscope Academic Conference

on Computer Communications. IEEE, 2014, pp. 181– [47] M. Won and R. Stoleru, “A low-stretch-guaranteed and
189. lightweight geographic routing protocol for large-scale
wireless sensor networks,” ACM Transactions on Sensor
[34] S. Arianfar, P. Nikander, and J. Ott, “Packet-level Networks (TOSN), vol. 11, no. 1, p. 18, 2014.
caching for information-centric networking,” in ACM
SIGCOMM, ReArch Workshop, 2010. [48] D. Rossi and G. Rossini, “Caching performance of
Content Centric Networks under multi-path routing
[35] G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, “Di- (and more),” Relatorio tecnico, Telecom ParisTech,
rected hypergraphs and applications,” Discrete applied 2011. [Online]. Available: http://netlab.pkusz.edu.cn/
mathematics, vol. 42, no. 2, pp. 177–201, 1993. wordpress/wp-content/uploads/2011/10/

[36] V. I. Voloshin, Introduction to graph and hypergraph [49] J. Seedorf, M. Arumaithurai, A. Tagami, K. Ramakr-
theory. Nova Science Publ., 2009. ishnan, and N. Blefari-Melazzi, “Using ICN in disaster
scenarios,” Internet-Draft-work in progress 02, IETF,
[37] A. Bretto, “Hypergraph theory,” An introduction. Math- Tech. Rep., 2014.
ematical Engineering. Cham: Springer, 2013.
[50] K. Pentikousis, B. Ohlman, D. Corujo, G. Boggia,
[38] M. Xiao, “Finding minimum 3-way cuts in hypergraphs,” G. Tyson, E. Davies, A. Molinaro, and S. Eum,
Information Processing Letters, vol. 110, no. 14, pp. “Information-Centric Networking: Baseline scenarios,”
554–558, 2010. Tech. Rep., 2015. [Online]. Available: http://www.
rfc-editor.org/info/rfc7476
[39] I. Abdullahi, S. Arif, and S. Hassan, “Cache-less redun-
[51] Cisco, “Cisco visual networking index: forecast
dancy using hypergraph in information-centric network,”
Advanced Science Letters, vol. 21, no. 11, pp. 3546– and methodology: 2013-2018,” Tech. Rep. [Online].
Available: http://www.intel.com/content/www/us/en/
3549, 2015.
communications/internet-minute-infographic.html
[40] J. Leskovec and A. Krevl, “SNAP Datasets: Stanford
[52] ITU-T. ITU-T Y.3033 Recommendation, ITUT Frame-
large network dataset collection,” Jun. 2014. [Online].
work of data aware networking for future networks.
Available: http://snap.stanford.edu/data
[Online]. Available: https://www.itu.int/rec/T-REC-Y.
3033-201401-I/en
[41] J. Leskovec and J. J. Mcauley, “Learning to discover
social circles in ego networks,” in Advances in neural
information processing systems, 2012, pp. 539–547.
[Online]. Available: http://cs.stanford.edu/people/jure/
pubs/circles-nips12.pdf

[42] Stanford Network Analysis Project (SNAP).
[Online]. Available: http://snap.stanford.edu/data/
egonets-Facebook.html

[43] C. Bernardini. SocialCCNSimm. [Online]. Available:
https://github.com/mesarpe/socialccnsim

[44] I. Ud, Din, S. Hassan, and A. Habbal, “SocialCCNSim:
A simulator for caching strategies in Information Centric
Networking,” Advanced Science Letters, vol. 21, no. 11,
pp. 3507–3511, 2015.

[45] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker,
“Web caching and zipf-like distributions: Evidence and
implications,” in INFOCOM’99. Eighteenth Annual
Joint Conference of the IEEE Computer and Communi-
cations Societies. Proceedings. IEEE, vol. 1. IEEE,
1999, pp. 126–134.

[46] M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian,
and C. Tanguy, “Performance evaluation of the random
replacement policy for networks of caches,” in ACM
SIGMETRICS Performance Evaluation Review, vol. 40,
no. 1. ACM, 2012, pp. 395–396.

– 130 –