Optimal content delivery in DSA networks: A path auction based framework

Swastik Brahma, Pramod K. Varshney, Mainak Chatterjee, Kevin Kwiat

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we address the problem of Optimal Content Delivery (OCD) in Dynamic Spectrum Access (DSA) networks, where the source of a flow sends data traffic to the destination in exchange for some monetary benefit, such as a subscription fee. Also, each intermediate secondary node incurs a cost for routing traffic. We propose a path auction based content delivery mechanism in which each secondary node announces its cost (considered as private information) to the auction mechanism. Based on the announced costs, the optimal flow rate between the end nodes is determined, a multi-path route is chosen and payments are made to the nodes that route traffic, such that the profit of the source node is maximized in sending data to the destination. Furthermore, the auction mechanism is strategy-proof, i.e., it can induce the intermediate nodes to truthfully declare their costs. We provide polynomial time algorithms for implementing our auction based content delivery mechanism in DSA networks.

Original languageEnglish (US)
Title of host publication2012 IEEE International Conference on Communications, ICC 2012
Pages1843-1847
Number of pages5
DOIs
StatePublished - Dec 1 2012
Event2012 IEEE International Conference on Communications, ICC 2012 - Ottawa, ON, Canada
Duration: Jun 10 2012Jun 15 2012

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Other

Other2012 IEEE International Conference on Communications, ICC 2012
CountryCanada
CityOttawa, ON
Period6/10/126/15/12

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Optimal content delivery in DSA networks: A path auction based framework'. Together they form a unique fingerprint.

Cite this