Title : 
Optimizing Resource Scheduling in BitTorrent File Distribution Network
         
        
            Author : 
Chen, Zheng ; Yan, Jinyao
         
        
            Author_Institution : 
Comput. & Network Center, Commun. Univ. of China, Beijing, China
         
        
        
        
        
        
            Abstract : 
In recent years, BitTorrent file distribution network has been more and more widely used for media file distribution. Its build-in resource scheduling policies (local rare first, tit-for-tat, etc.) work well in file distribution in single swarm environments. However, the resource scheduling policy is missing in multiple swarms environments and the resource utilization has not been optimized. In this work, our goal is to optimize the resource utilization in multiple swarms environments according to link utilization and peer satisfaction. We propose our optimizing resource policies based on swarm parameters, namely hidden-seed policy and weight-leecher policy. Our evaluation results show that the hidden-seed policy increases the link utilization while the weight-leecher policy improves the peer satisfaction in the system.
         
        
            Keywords : 
optimisation; peer-to-peer computing; resource allocation; BitTorrent file distribution network; build-in resource scheduling policies; hidden-seed policy; link utilization; media file distribution; multiple swarms environments; optimization; peer satisfaction; resource scheduling; resource utilization; weight-leecher policy; Bandwidth; Computer networks; Distributed computing; Internet; Peer to peer computing; Processor scheduling; Protocols; Resource management; Robustness; Statistical distributions;
         
        
        
        
            Conference_Titel : 
Management and Service Science, 2009. MASS '09. International Conference on
         
        
            Conference_Location : 
Wuhan
         
        
            Print_ISBN : 
978-1-4244-4638-4
         
        
            Electronic_ISBN : 
978-1-4244-4639-1
         
        
        
            DOI : 
10.1109/ICMSS.2009.5301288