Date Added: Dec 2010
As ISPs begin to cooperate to expose their network locality information as services, e.g., P4P, solutions based on locality information provision for P2P traffic localization will soon approach their capability limits. A natural question is: can the authors do any better provided that no further locality information improvement can be made? This paper shows how the utility of locality information could be limited by conventional P2P data scheduling algorithms. Even sophisticated data scheduling algorithms such as the local rarest first could not take full advantage of the locality information.