Document Type

Article

Publication Date

March 2008

Publication Title

Journal of Communication and Networks

Volume

10

Issue Number

1

First Page

79

Last Page

88

DOI

10.1109/JCN.2008.6388331

Abstract

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

Comments

This is the Author's Accepted Manuscript of an article originally published in Journal of Communications and Networks Vol. 10, Iss. 1 by IEEE on March 2008, DOI: 10.1109/JCN.2008.6388331. The Version of Record can be found online at this link.

Download
COinS