Work

DTN routing as a resource allocation problem

Year: 2007

Type: conference-paper

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 incidental effect on such routing metrics as maximum or average delivery latency. In this paper, we present RAPID, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system.

Source: ACM SIGCOMM Conference (SIGCOMM)

DOI: 10.1145/1282380.1282422

Authors: Aruna Balasubramanian, Brian Levine, Arun Venkataramani

Institution: University of Massachusetts Amherst

Language: English

Topic: Opportunistic and Delay-Tolerant Networks

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W1966518282

FWCI: 46.32

Cites: 45

Cited by: 953

Related to: 10