Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/7770' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/7770' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Efficient Social-aware Content Placement for Opportunistic Networks | IIT - CNR - Istituto di Informatica e Telematica
IIT Home Page CNR Home Page

Efficient Social-aware Content Placement for Opportunistic Networks

As content provisioning becomes the driving application of today’s (opportunistic) networking environments and the User Generated Content explodes, the problem of devising scalable approaches to placing it optimally within a networking structure becomes more important and challenging. Since the wellknown k-median optimization problem that is typically formulated to address it requires global topology and demand information, different approaches are sought for. The latter is the focus of this paper that aims at exploiting social structures, present in emerging networking environments, in order to devise a scalable approach to the optimal or near-optimal content placement.
A new metric that captures the node’s social significance or potential for helping establish paths between nodes is introduced and serves as the basis for creating a small scale network sub-graph over which the small-scale content placement problem is solved sequentially until the optimal or near-optimal location is identified. The trade-off between the sub-graph’s size and the degree of convergence to the optimal solution is studied through simulations on E-R and B-A random graphs and the effectiveness of the proposed approach is demonstrated.


WONS 2010, Kranjska Gora, Slovenia, 2010

Autori esterni: Panagiotis Pantazopoulos (Department of Informatics and Telecommunications National & Kapodistrian University of Athens), Ioannis I. Stavrakakis, (Department of Informatics and Telecommunications National & Kapodistrian University of Athens)
Autori IIT:

Tipo: Articolo in Atti di convegno internazionale
Area di disciplina: Information Technology and Communication Systems

Attività: Opportunistic Networking and Computing