Abstract:
File
sharing is one of the most important applications in P2P
networks. In this talk, we propose a stochastic framework
to analyze the file sharing systems under different settings.
We first extend the results in another paper by providing
a tighter performance bound. Then we generalize the system
by considering peers with limited upload and download capacity.
We illustrate the last piece problem and show the effectiveness
of using forward error-correction (FEC) code and/or multiple
requests to improve the performance. Lastly, we propose
a framework to analyze an incentive-based file sharing system.
The stochastic analysis can serve as a basis for analyzing
and designing more advanced features of file sharing systems.
Biography:
Minghong
Lin received his B.S. degree in Computer Science from the
University of Science and Technology of China in 2006. Currently,
he is an M.Phil. student in the Department of Computer Science
and Engineering at the Chinese University of Hong Kong.
His current interests lie in modeling and analysis of computer
networks.