Download now Free registration required
The authors consider the problem of latency-optimizing file splitting for transmission over a large multi-hop network. They utilize recent results from random matrix theory to analytically express the latency distribution as a function of the relevant network parameters and the file size. The resulting minimax problem can be solved using standard nonlinear programming techniques for a variety of latency metrics. They illustrate the reduction in latency obtained using the technique, relative to some commonly-used heuristics, in the large-file-large-multi-hop network setting and highlight the role of random matrix theory in realizing the resulting performance gains.
- Format: PDF
- Size: 425.9 KB