This work provides several directions for future research. One major piece can be the in-network P2P caching across domains, along with peer selection guide concerning the ISP business relationships. Since our work in this thesis investigates the two parts independently, with respect to the in-network P2P caching in the intra-domain, and peer selections in the inter-domain. The performance evaluation can be based on the analytical frameworks and attribute models in this work, with respect to network efficiency, user efficiency, cache hit rate and cache redundancy, etc.
In addition, the fairness among client peers in different ISPs can be another direction for future research. Currently in this work, we mainly focus on the peer selection scheme for downloading concern that can resolve the tussle between ISP network efficiency and downloading experiences of P2P users, while fairness mainly concerns the download rate and upload rate at a peer’s side. Thus to maintain a fair P2P system, a certain fair scheme at peers’ side needs to be executed. Actually, a fair P2P system can be achieved regardless of its peer selection scheme, e.g., a desirable fairness can still be achieved even with the default random peer selection under BitTorrent [93]. Therefore, a detailed discussion on the fairness among peers in different ASes could be our future work.
In relation to the stochastic model, a possible direction is to extend it by adopting the game theory in the context of peer selection across domains, in order to obtain a win-win or win-no lose solution towards the collaboration of ISPs for optimised peer selection.
Finally, the work on the coordinated in-network P2P caching enables to exchange the information of cached states in the scale of one-hop away neighbours. In the future, the extent of information exchange among CRs to multiple hops away can be examined, and the trade-off between the computation complexity and performance gains can be of great concern under different scales.
Bibliography
Bibliography
[1] “Cisco visual networking index: Forecast and methodology, 2013-2018,” Cisco Systems, San
Jose, CA, White paper, Jun. 2014 [online]. Available:
http://www.cisco.com/c/en/us/solutions/collateral/service-provider/ip-ngn-ip-next-generation- network/white_paper_c11-481360.pdf.
[2] V. Aggarwal, A. Feldmann and C. Scheideler, “Can ISPs and P2P systems co-operate for improved performance?” in Proc. ACM SIGCOMM Computer Communications Review
(CCR), Vol. 37, No. 3, July 2007.
[3] H. Xie et al., “P4P: Provider portal for applications,” in Proc. ACM SIGCOMM, Aug. 2008. [4] D. Choffnes and F. Bustamante, “Taming the torrent: A practical approach to reducing cross-
ISP traffic in P2P systems,” in Proc. ACM SIGCOMM, August 2008.
[5] S. Ren, E. Tan, T. Luo, S. Chen, L. Guo, and X. Z. M. Corporation, “TopBT: A topology- aware and infrastructure-independent BitTorrent client,” in Pro. IEEE INFOCOM, Mar. 2010. [6] J. Seedorf and E. W. Burger, “Application-Layer Traffic Optimization (ALTO) Problem
Statement,” IETF RFC 5693, Oct. 2009. [7] PeerApp UltraBand, http://www.peerapp.com. [8] OverCache P2P, http://www.oversi.com.
[9] M. Hefeeda and O. Saleh, “Traffic Modeling and Proportional Partial Caching for Peer-to- Peer Systems,” in Proc. IEEE/ACM Trans. Netw., Vol. 16, No. 6, 2008.
[10] Frank Lehrieder et al., “The Impact of Caching on BitTorrent-like Peer-toPeer Systems,” in Proc. IEEE International Conference on Peer-to-Peer Computing (P2P), 2010.
[11] György Dán, “Cache-to-Cache: Could ISPs Cooperate to Decrease Peer-to-Peer Content Distribution Costs?” in Proc. IEEE Trans. on Parallel and Distributed Systems (TPDS), Vol. 22, No. 9, Jan. 2011.
[12] Tobias Hoßfeld et al., “An Economic Traffic Management Approach to Enable the TripleWin for Users, ISPs, and Overlay Providers,” FIA Prague Book. Towards the Future Internet — An European Research Perspective: IOS Press Books Online, ISBN 978-1-60750- 007-0, May 2009.
[13] T. Koponen et al., “A Data-Oriented (and beyond) Network Architecture,” in Proc. ACM
SIGCOMM, 2007.
[14] Van Jacobson, etc., “Networking Named Content”, in Proc. the 5th international
conference on Emerging networking experiments and technologies, ACM CoNEXT, 2009.
[15] Z. Dulinski et al., “Optimal Choice of Peers based on BGP Information,” in Proc. IEEE
International Conference on Communications (ICC), 2010.
[16] Z. Dulinski et al., “Cost-driven Peer Rating Algorithm,” in Proc. of IEEE International
Conference on Communications (ICC), 2011.
[17] Peter Racz, Simon Oechsner and Frank Lehrieder, “BGP-Based Locality Promotion for P2P Applications,” in Proc. IEEE 19th International Conference on Computer Communications and Networks (ICCCN), 2010.
[18] R. C. Rumin, N. Laoutaris and X. Yang, “Deep Diving into BitTorrent Locality,” in Proc.
IEEE INFOCOM, 2011.
[19] Caesar, M. and Rexford, J, “BGP Routing Policies in ISP Networks”, In Proc. IEEE
Network, Vol. 19, No. 6, Dec. 2005.
[20] W. B. Norton, “Internet service provider and peering,” white paper, Equinix Inc., 2001. [21] John S. Otto, Mario A. Sanchez, and David R. Choffnes, “On Blind Mice and the
Elephant: Understanding the Network Impact of a Large Distributed System,” in Proc. ACM
SIGCOMM, 2011.
[22] T. Karagiannis, P. Rodriguez, and K. Papagiannaki, “Should Internet service providers fear peer-assisted content distribution?” in Proc. ACM IMC, Oct. 2005.
[23] György Dán et al., “Interaction Patterns between P2P Content Distribution Systems and ISPs,” in Proc. IEEE Communication Magazine, Vol. 49, No. 5, May 2011.
[24] Jessie H. Wang, Dah Ming Chiu and John C. S. Lui, “Modeling the Peering and Routing Tussle between ISPs and P2P Applications,” In Proc. IEEEE IWQoS, 2006.
[25] Michele Garetto et al., “A Modeling Framework to Understand the Tussle between ISPs and P2P File Sharing Users,” in Proc. Performance Evaluation, Elsevier, Vol. 64, No. 9, Oct. 2007.
[26] D. Qiu and R. Srikant. “Modelling and Performance Analysis of BitTorrent-like Peer-to- Peer Networks,” in Proc. ACM SIGCOMM, 2004.
[27] X. Yang and G. de Veciana, “Service Capacity of Peer to Peer Networks,” in Proc. IEEE
Bibliography
[28] M. Piatek, H. V. Madhyastha, J. P. John, A. Krishnamurthy, and T. Anderson, “Pitfalls for ISP-friendly P2P design,” in Proc. ACM HotNets, 2009.
[29] Frank Lehrieder et al., “Mitigating Unfairness in Locality-aware Peer-to-Peer Networks,” in Proc. International Journal of Network Management (IJNM), Special Issue on Economic
Traffic Management, Vol. 21, No. 1, Jan. 2011.
[30] Jie Dai, Bo Li and Fangming Liu et al., “On the Efficiency of Collaborative Caching in ISP-aware P2P Networks,” in Proc. IEEE INFOCOM, 2011.
[31] Eleni Agiatzidou and fGeorge D. Stamoulis, “Collaboration between ISPs for Efficient Overlay Traffic Management,” in Proc. IFIP NETWORKING, 2011.
[32] Marco Papa Manzillo et al., “CLOSER: A Collaborative Locality-aware Overlay Service,” in Proc. IEEE Tran. on Parallecl and Distributed Systems (TPDS), Vol. 23, No. 6, Jun. 2012. [33] Cisco Systems Incorporated. “Network based application recognition
(NBAR).” http://www.cisco.com/c/en/us/products/ios-nx-os-software/network-based- application-recognition-nbar/index.html
[34] F5 White Paper, “Bandwidth management for peer-to-peer
applications,” https://www.f5.com/pdf/white-papers/rateshaping-wp.pdf
[35] Sandvine. Intelligent broadband network management. http://www.sandvine.com.
[36] H. Song et al., “DECoupled Application Data Enroute (DECADE) Problem Statement,”
IETF RFC 6646, 2012.
[37] R. Alimi et al., “A Survey of In-Network Storage Systems,” IETF RFC 6392, 2011. [38] E. J. Rosensweig and J. Kurose, “Breadcrumbs: efficient, best-effort content location in
cache networks,” in Proc. IEEE INFOCOM, 2009.
[39] Ioannis Psaras, Wei Koong Chai and George Pavlou, “Probabilistic In-Network Caching for Information-Centric Networks,” in Proc. ACM SIGCOMM, 2012.
[40] Konstantinos Katsaros, George Xylomenos and George C. Polyzos, “MultiCache: An overlay architecture for information-centric networking,” in Proc. Computer Networks,
Elsevier, vol. 55, no. 4, 2011.
[41] Somaya Arianfar Pekka Nicander and Jӧrg Ott, “On Content -Centric Router Design and Implications,” in Proc. ACM ReArch, 2010.
[42] Shuo Guo, Haiyong Xie and Guanyu Shi, “Collaborative Forwarding and Caching in Content Centric Networks,” In Proc. IFIP Networking, 2012.
[43] Kideok Cho et al., “WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks,” in Proc. IEEE INFOCOM Workshop on Emerging Design
Choices in Name-Oriented Networking, 2012.
[44] Zhongxing Ming, Mingwei Xu and Dan Wang, “Age-based Cooperative Caching in Information-Centric Networks,” in Proc. IEEE INFOCOM Workshop on Emerging Design
Choices in Name-Oriented Networking, 2012.
[45] Lijun Dong et al., “Optimal Caching with Content Broadcast in Cache-and-Forward Networks,” In Proc. IEEE ICC, 2011.
[46] Walter Wong, Marcus Giraldi and et al., “Content Routers: Fetching Data on Network Path,” in Proc. IEEE ICC, 2011.
[47] Walter Wong et al., “Neighborhood Search and Admission Control in Cooperative Caching Networks,” in Proc. IEEE Globecom, 2012.
[48] M. Ain et al., “D2.3-Architecture Definition, Component Descriptions, and Requirements,” PSIRP 7th FP EU-funded project, Deliverable D-2.3, FP7-INFSO-IST-216173, Feb. 2009. http://www.psirp.org/files/Deliverables/FP7-INFSO-ICT-216173-PSIRP- D2.3_ArchitectureDefinition.pdf
[49] B. Ahlgren et al., “Second NetInf Architecture Description,” 4WARD EU FP7 Project, Deliverable D-6.2 v2.0, Apr. 2010, FP7-ICT-2007-1-216041- 4WARD/6.2, http://www.4ward-project.eu/
[50] D. Cheriton and M. Gritter, TRIAD: A New Next-Generation Internet Architecture, Jan 2000.
[51] S. Arianfar and P. Nikander, “Packet-level Caching for Information-centric Networking,” in Proc. ACM SIGCOMM, ReArch Workshop, 2010.
[52] Dario Rossi and Giuseppe Rossini, “A Dive into the Caching Performance of Content Centric Networking,” in Proc. IEEE International Workshop on Computer Aided Modelling
and Design of Communication Links and Networks (CAMAD), 2012.
[53] Haiyong Xie et al., “TECC: Towards Collaborative In-network Caching Guided by Traffic Engineering,” In Proc. IEEE INFOCOM, 2012.
[54] Shu Yamamoto, “In-Network P2P Packet Cache Processing using Scalable P2P Network Test Platform,” in Proc. IEEE P2P, 2011.
Bibliography
[56] Daniel S., et al., “Content Availability and Bundling in Swarming Systems,” in Proc.
IEEE/ACM Tran. on Networking, Vol. 21, No. 2, Apr. 2013.
[57] Bo Tan and Laurent Massoulié, “Optimal Content Placement for Peer-to-Peer Video-on- Demand Systems,” in Proc. IEEE/ACM Tran. on Networking, Vol. 21, No. 2, Apr. 2013. [58] Frank Lehrieder, et al., “Caching for BitTorrent-Like P2P Systems: A Simple Fluid
Model and Its Implications,” IEEE/ACM Tran. on Networking, Vol. 20, No. 4, Aug. 2012. [59] D. Lee, J. Choi, J.-H. Kim and et al., “LRFU: A Spectrum of Policies that Subsumes the
Least Recently Used and Least Frequently Used Policies,” in Proc. IEEE Tran. on Computers, Vol. 50, No. 12, Dec. 2001.
[60] G. Rossini D. Rossi., “Caching performance of content centric networks under multi-path routing (and more)”, Technical report, Telecom Paris- Tech, 2011.
[61] Jason Min Wang, et al.,“Intra-AS Cooperative Caching for Content Centric Networking,” in Proc. ACM SIGCOMM Workshop on ICN, 2013.
[62] R. Bindal, P. Cao, W. Chan, J. Medval, G. Suwala, T. Bates, and A. Zhang, “Improving traffic locality in BitTorrent via biased neighbor selection,” in Proc. 26th IEEE International
Conference on Distributed Computing Systems (ICDCS), 2006.
[63] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically aware overlay construction and server selection,” in Proc. IEEE INFOCOM 2002.
[64] K. Shanahan and M. Freedman, “Locality Prediction for Oblivious Clients,” in Proc.
International Workshop on Peer-to-Peer Systems (IPTPS), 2005.
[65] M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel, and D. Yao, “Optimal Selection of Peers for P2P Downloading and Streaming,” in Proc. IEEE INFOCOM, 2005.
[66] Lehrieder, F., Oechsner, S., Hossfeld, T., “Can P2P-Users Benefit from Locality- Awareness?” in Proc. IEEE Tenth International Conference on Peer-to-Peer Computing
(P2P), 2010.
[67] H. Song et al., “DECoupled Application Data Enroute (DECADE),” IETF RFC 7069, 2013.
[68] Ioannis Psaras et al., “Modelling and Evaluation of CCN-Caching Trees,” In Proc. IFIP,
Networking, 2011.
[69] Oechsner S, Lehrieder F and et al., “Pushing the performance of biased neighbour selection through biased unchoking.” In Proc. IEEE International Conference on Peer-to-
[70] Ryan S. Peterson et. al., “A Content Propagation Metric for Efficient Content Distribution,” in Proc. ACM SIGCOMM, 2011.
[71] S. Ramabhadran and J. Pasquale, “Analysis of long-running replicated systems,” in Proc.
of IEEE INFOCOM, 2006.
[72] Rakesh Kumar, Yong Liu, and Keith Ross, “Stochastic Fluid Theory for P2P Streaming Systems,” in Proc.of IEEE INFOCOM, 2007.
[73] Boudewijn R. Haverkort, “Performance of Computer Communication Systems: A Model- Based Approach,” Wiley, 1998.
[74] Tobias Hoßfeld, David Hock and Simon Oechsner, “Measurement of BitTorrent Swarms and their AS Topologies”, Tech. Rep.464, University of Würzburg, Jan. 2010.
[75] Tobias Hoßfeld, et al., “Characterization of BitTorrent Swarms and Their Distribution in the Internet,” Computer Networks, Elsevier, Vol. 55, No. 5, Apr. 2011.
[76] A. Akella, S. Seshan, and A. Shaikh, “An Empirical Evaluation of Wide-Area Internet Bottlenecks,” in ACM IMC, 2003.
[77] H. J. Kolbe, O. Kettig, and E. Golic, “Monitoring the Impact of P2P Users on a Broadband Operator’s Network,” in Proc. of IFIP/IEEE IM 2009, Jun. 2009.
[78] F. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, No. 1, Feb. 1997.
[79] T. Basar and R. Srikant, “Revenue-Maximizing Pricing and Capacity Expansion in a Many-User Regime,” in Proc. of IEEE INFOCOM, 2002.
[80] A. Farrel, “A Path Computation Element based Architecture”, IETF RFC 4655, August 2006.
[81] Cohen, Bram (October 2002). “BitTorrent Protocol 1.0”.
BitTorrent.org. http://www.bittorrent.org/beps/bep_0003.html [82] IP2Location, http://www.ip2location.com
[83] M. Stiemerling, S. Kiesel et al., “ALTO Deployment Considerations,” Internet-Draft, draft-ietf-alto-deployments-09, Feb 2014.
[84] Z. Silagadze, “Citations and the Zipf-Mandelbrot’s law,” Complex Systems, Vol. 11, No. 487-499, 1997.
[85] Osama Saleh and Mohamed Hefeeda, “Modelling and Caching of Peer-to-Peer Traffic,” in Proc. of IEEE International Conference on Network Protocols, 2006.
Bibliography
[86] Jiahua Wu and Baochun Li, “Keep Cache Replacement Simple in Peer-Assisted VoD Systems,” in Proc. of IEEE INFOCOM, 2009.
[87] Internet2, “Internet2 IP IGP Metrics,” http://noc.net.internet2.edu/i2netowrks/maps-- documentation/maps.html
[88] H. Liu et al, “A Multi-Level DHT Routing Framework with Aggregation”, in Proc. ACM
SIGCOMM ICN’12, Helsinki, Finland, August 2012.
[89] Starobinski, David et al., “Efficient PDA Synchronization,” in Proc. IEEE Transactions on Mobile Computing, Vol. 2, No. 1, Apr. 2003.
[90] I. Papafili, S. Soursos, and G. D. Stamoulis, “Improvement of BitTorrent performance and inter-domain traffic by inserting ISP-owned peers,” in Proc. of 6th International
Workshop on Internet Charging and QoS Technologies (ICQT), May 2009.
[91] Kin-Wah Kwong and Danny H. K. Tsang, “Building Heterogeneous Peer-to-Peer Networks: Protocol and Analysis,” in Proc. IEEE/ACM Transaction on Networking, Vol. 16, No. 2, Apr. 2008.
[92] Wenjie Jiang, Rui Z. Shen, Jennifer Rexford, Mung Chiang, “Cooperative Content Distribution and Traffic Engineering in an ISP Network”, in Proc. ACM SIGMETRICS, 2009. [93] A. Sherman, J. Nieh, and C. Stein, “Fairtorrent: Bringing fairness to peer-to-peer systems,”
in Proc. ACM CONEXT, 2009.
[94] Cohen, B., “Incentives build robustness in BitTorrent,” in Proceedings of the 1st P2P Economics Workshop, Berkeley, CA, USA, 2003.
[95] Sem Borst, et al., “Distributed Caching Algorithms for Content Distribution Networks,”
in Proc. of IEEE INFOCOM, 2010.
[96] John Ardelius, et al., “On the Effects of Caching in Access Aggregation Networks,” In
Proc. ACM International Conference on Information Centric Networking( ICN), 2012.
[97] I. Psaras, W.K. Chai, G. Pavlou, “In-Network Cache Management and Resource Allocation for Information-Centric Networks,” in Proc. IEEE Transactions on Parallel and
Distributed Systems (TPDS), Vol. 25, No. 11, 2014.
[98] “PPLive.” [Online]. Available: http://www.pplive.com
[99] “BitTorrent specification,” 2006 [Online].
Available: http://wiki.theory.org/BitTorrentSpecification
[100] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella- like P2P systems scalable,” in Proc. ACM SIGCOMM, 2003.
[101] W.K. Chai, D. He, I. Psaras, G. Pavlou, “Cache “Less for More” in Inforamtion-Centric Networks,” Computer Communications, special issue on Information-Centric Networking,
Elsevier, Vol. 36, No. 7, April 2013.
[102] K. Pentikousis et al., “Information-Centric Networking: Baseline Scenarios,” IETF RFC 7476, March 2015.
[103] Huichen Dai, et al., “Towards Line-Speed and Accurate On-line Popularity Monitoring on NDN Routers,” in Proc. IEEE International Symposium of Quality of Service (IWQoS), 2014.
[104] Hyunyong Lee et al., “User-assisted In-network Caching in Information-Centric Networking,” in Proc. Computer Networks, Elsevier, Vol. 57, No. 16, 2013