作者: Xiangying Yang , G. de Veciana
DOI: 10.1109/INFCOM.2004.1354647
关键词:
摘要: We study the 'service capacity' of peer to (P2P) file sharing applications. begin by considering a transient regime which is key capturing ability such systems handle bursty traffic, e.g., flash crowds. In this context our models, based on age dependent branching processes, exhibit exponential growth in service capacity, and permit sensitivity system policies parameters. Then we consider model for steady state show how average delay seen peers would scale offered load rate at exit system. find that delays well load. particular are upper bounded some constant given any even decrease if slowly. validate many findings analyzing traces obtained from second generation P2P application called BitTorrent.