On Coding for Cooperative Data Exchange

Parastoo Sadeghi (Australian National University)

DATE: 2009-11-26
TIME: 11:00:00 - 12:00:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU

ABSTRACT:
We consider the problem of data exchange by a group of clients. In this problem each client holds a set of packets and needs to obtain all the packets held by the other clients. Each of the clients can broadcast the packets in its possession (or a combination thereof) via a noiseless broadcast channel of capacity one packet per transmission. The goal is to minimize the total number of transmissions needed to satisfy the demands of all the clients, assuming that they can cooperate with each other and are fully aware of the packet sets available to other clients. This problem arises in many practical settings, such as peer-to-peer systems and wireless data broadcast. In this talk, we establish a number of upper and lower bounds on the optimal number of transmissions and present an efficient algorithm with provable performance guarantees. The effectiveness of our algorithms is established through numerical simulations. We discuss directions for future research.

BIO:
Parastoo Sadeghi received the BE and ME degrees in electrical engineering from Sharif University of Technology, Tehran, Iran, in 1995 and 1997, respectively, and the PhD degree in electrical engineering from The University of New South Wales, Sydney, Australia, in 2006. Prior to her PhD studies, she worked for the R&D sector for more than four years. She joined ANU in 2005.

	Skip Navigation CECS Home \| ANU Home \| Search ANU \| HORUS \| Staff Home
	Seminars @ CECS ANU College of Engineering and Computer Science