Optimal information dispersal for probabilistic latency targets

Document Type

Article

Publication Date

1-1-2001

Abstract

The goal of this work is to provide a framework for applications to probabilistically meet latency targets using redundancy and multipath routing. It investigates the amount of redundancy necessary to maximize the probability of constructing a copy of a file F no later than a given delay bound Δ without any reservations. Redundancy is obtained from the information dispersal algorithm (IDA) of Rabin. Specifically, F is broken into b pieces, each of size s, and each piece is sent on one of the several (disjoint) paths from source to destination. Each piece contains some redundant information in such a way that any m ≡ |F|/s pieces are enough to reconstruct the file. This work presents both analytical and computational results to determine the optimal values of b and s to maximize the success probability. It also examines the impact of various parameters such as the file size, delay bound, loss rate, distance from the destination, on the probabilistic quality of service (QoS) guarantee. This is a novel approach to QoS routing since it does not require any reservations or extra overhead at intermediate nodes and effectively shifts the burden from nodes to links. © 2001 Elsevier Science B.V.

Identifier

0035426323 (Scopus)

Publication Title

Computer Networks

External Full Text Location

https://doi.org/10.1016/S1389-1286(01)00184-0

ISSN

13891286

First Page

695

Last Page

707

Issue

5-6

Volume

36

Grant

DMI-9624469

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS