Decentralized Network Bandwidth Prediction and Node Search

Author

Song, Sukhyun

Author_Institution

Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA

fYear

2011

fDate

16-20 May 2011

Firstpage

2030

Lastpage

2033

Abstract

My PhD research addresses how to exploit network bandwidth information and increase the performance of data-intensive wide-area distributed applications. The goal is to solve four specific problems: i) design a decentralized algorithm for network bandwidth prediction, ii) design a decentralized algorithm to find bandwidth-constrained clusters, iii) design a decentralized algorithm to find bandwidth-constrained centroids, and iv) develop a wide-area MapReduce system with optimized data locality as an application of the three algorithms for bandwidth prediction and node search.

Keywords

bandwidth allocation; distributed algorithms; bandwidth-constrained centroids; bandwidth-constrained clusters; data-intensive wide-area distributed application; decentralized algorithm; decentralized network bandwidth prediction; node search; wide-area MapReduce system; Algorithm design and analysis; Bandwidth; Clustering algorithms; Extraterrestrial measurements; Peer to peer computing; Prediction algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on

Conference_Location

Shanghai

ISSN

1530-2075

Print_ISBN

978-1-61284-425-1

Electronic_ISBN

1530-2075

Type

conf

DOI

10.1109/IPDPS.2011.369

Filename

6009082