DTN routing as a resource allocation problem

Abstract

Many DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, so these approaches have only an <i>incidental</i> effect on such routing metrics as… (More)
DOI: 10.1145/1282380.1282422

Topics

Statistics

050100150'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

998 Citations

Semantic Scholar estimates that this publication has 998 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Balasubramanian2007DTNRA, title={DTN routing as a resource allocation problem}, author={Aruna Balasubramanian and Brian Neil Levine and Arun Venkataramani}, booktitle={SIGCOMM}, year={2007} }