it can be anticipated that virtualization will be
`in industry,
`an essential part of future networks as il allows leasing and
`sharing the physical (network) infrastructure. In this regard, an
`important challenge is the allocation of substrate resources to
`instantiate multiple virtual networks. In order to do so, three
`main steps can be identified in the so called slice embedding
`problem: resource discovery, virtual network mapping and
`allocation.
`
`We outlined how these three tasks are tightly coupled, and
`howthere exists a wide spectrum of solutions that either solve
`a particular task, or jomtly solve multiple tasks along with
`the interactions between them. We then concluded with a few
`
`interesting research directions in this area.
`
`ACKNOWLEDGMENT
`
`We thank Azer Bestavros, John Byers, Jonathan Appavoo
`and Karim Mattar for their valuable feedback. This work was
`
`supported in part by the National Science Foundation under
`grants CNS-0963974, CCF-0820138, and CNS-0720604.
`
`REFERENCES
`
`[2oS
`
`[3=
`
`[4e
`
`[S=
`
`(1= Jeannie Albrecht, David Oppenheimer, Amin Vahdat, and David A.Pat-
`terson. Design and Implementation Tradc-offs for Wide-Arca Resource
`Discovery. ACM Transaction Internet Technologies, 8(4):1-44, 2008.
`David G. Andersen. Theoretical Approaches to Node Assignment.
`Unpublished Manuscript, December 2002.
`Thomas Anderson, Larry Peterson, Scott Shenker, and Jonathan Turner.
`Overcoming the Internet Impasse through Virtualization. Computer
`Communication ACM, 38(4):34-41, 2005.
`Alvin AuYoung, Phil Buonadonna, Brent N. Chun, Chaki Ng. David C.
`Parkes, Jeff Shneidman, Alex C. Snoeren, and Amin Vahdat. Two
`Auction-Based Resource Allocation Environments: Design and Expe-
`rience. Market Oriented Grid and Utility Computing, Rajmukar Buyya
`and Kris Bubendorfer (eds.), Chapter 23, Wiley, 2009., 2009.
`Alvin Auyoung, Brent N. Chun, Alex C. Snoeren, and Amin Vahdat.
`Resource Allocation in Federated Distributed Computing Infrastructures.
`In Proceedings of the Ist Workshop on Operating System and Architec-
`tural Support for the Ondemand IT InfraStructure, October 2004.
`[6] Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, and Aravind
`Srinivasan. Resilient Multicast Using Overlays. SIGMETRICSPerform.
`Eval. Rev., 31(01):102-113, 2003.
`[7] Andy Bavier, Nick Feamster, Mark Huang, Larry Peterson, and Jennifer
`Rexford.
`In VINT Veritas: Realistic and Controlled Network Ixper-
`imentation, SIGCOMM’06: Proceedings of the 2006 conference on
`Applications,
`technologies, architectures, and protocols for computer
`communications, pages 3-14, 2006.
`Convex Optimization.
`[8] S.
`Boyd
`and
`L. Vandenberghe.
`http://www.stanford edu/people/boyd/cevxbookhtml, 2004.
`[9] Alvin AuYoung Chaki Ng David C. Parkes Jeffrey Shneidman Alex
`C. Snoeren Brent N. Chun, Philip Buonadonna and Amin Vahdat.
`Mirage: A Microeconomic Resource Allocation System for SensorNet
`Testbeds.
`In Proceedings of the 2nd IEEE Workshop on Embedded
`Networked Sensors, 2005.
`[10] John W. Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav
`Rost.
`Informed Content Delivery Across Adaptive Overlay Networks.
`In In Proceedings ofACM SIGCOMM,pages 47-60, 2002.
`[11] Jorge Carapinha and Javier Jimenez. Network Virtualization—a View
`from the Bottom. VISA, ACM SIGCOMM Workshop on Virtualized
`Infastructure Systems and Architectures, 17 August 2009.
`[12] Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, and Amit Kumar.
`Approximation Algorithms for the Unsplittable Flow Problem. APPROX
`’02: Proceedings of the Sth International Workshop on Approximation
`Algorithms for Combinutorial Optimization, pages 51-66, 2002.
`[13] Kyle Chard, Kris Bubendorfer, and Peter Komisarczuk. High Occupancy
`Resource Allocation for Grid and Cloud Systems, a Study with DRTIVT:.
`In Proceedings of the 19th ACM International Symposium on High
`Performance Distributed Computing, HPDC 710, pages 73-84, New
`York, NY, USA, 2010. ACM.
`
`15
`
`[14]
`
`{15}
`
`[16]
`
`[17]
`
`[18]
`
`[19]
`
`[20]
`
`[21]
`
`[22]
`
`[23]
`
`[24]
`
`[25]
`
`[26]
`
`[27]
`
`[28]
`
`129]
`
`[30]
`
`[31]
`[32]
`
`[33]
`
`[34]
`
`[35]
`
`[36]
`[37]
`
`[38]
`
`Introduction to Linear Optimization.
`
`HLL. Chen and T. Roughgarden. Network Design with Weighted Players.
`Theory of Computing Systems, 45(2):302-324, 2009.
`Xiang Cheng, Sen Su, Zhongbao Zhang, Hanchi Wang, Fangchun Yang,
`Yan Luo, and Jie Wang. Virtual Network Embedding Through Topology-
`Aware Node Ranking. SIGCOMM Computer Communication Review,
`41:38-47, April 2011.
`Mosharaf Chowdhury, Fady Samuel, and Raouf Boutaba. PolyViNE:
`Policy-Based Virtual Network Embedding across Multiple Domains. In
`Proceedings of the second ACM SIGCOMM workshop on Virtualized
`infrastructure systems and architectures, VISA ’10, pages 49 56, New
`York, NY, USA, 2010. ACM.
`N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Rahman, and Raouf
`Boutaba. Virtual Network Embedding with Coordinated Node and Link
`Mapping. In INFOCOM,pages 783-791, 2009.
`N.M. Mosharaf Kabir Chowdhury and Raouf Boutaba. A Survey of
`Network Virtualization. Computer Networks, 54:862-876, April 2010.
`B. Chun and A. Vahdat. Workload and Failure Characterization on a
`Large-Scale Federated Testbed. Technical report, IRB-TR-03-040,Intel
`Research Berkeley,, 2003.
`Brent N. Chun. Chaki Ng, Jeannie Albrecht, David C. Parkes, and Amin
`Vahdat. Computational Resource Iixchanges for Distributed Resource
`Allocation. 2004.
`Jeffrey Considine, John W. Bycrs, and Ketan Mcycr-Patcl. A Constraint
`Salisfaction Approach to Testbed Embedding Services.
`SIGCOMM
`Computer Communication Review, 34(1):137 142, 2004.
`Costas Courcoubetis and Richard R. Weber. Ticonomic Issues in Shared
`Infrastructures. VISA ’09: Proceedings of the Ist ACM workshop on
`Virtualized infrastructure systems and architectures, pages 89-96, 2009.
`John Day, Ibrahim Matta, and Karim Mattar. Networking is IPC: A
`Guiding Principle to a Better Internet. In Proceedings of the 2008 ACM
`CoNEXT Conference, CONTEXT ’08, pages 67:1-67:6, New York, NY,
`USA, 2008. ACM.
`D.Bertsimas and JN. Tsitsiklis.
`AhenaScientific, 1997.
`Sven de Vries and Rakesh V. Vohra. Combinatorial Auctions: A survey.
`INFORMS Journal on Computing, (3):284—309, 2003.
`N. G. Duffield, Pawan Goyal, Albert Greenberg, Partho Mishra, K. K.
`Ramakrishnan, and Jacobus E. van der Merwe. Resource management
`with Hoses: Point-to-Cloud Services for Virtual Private Networks.
`IEEE/ACM Transactions of Networking, 10(5):679-692, 2002.
`David Tppstein. Vinding the k Shortest Paths.
`SZAM J. Comput.,
`28(2):652-673, 1999.
`Flavio Esposito and Ibrahim Matta. PreDA: Predicate routing for DIN
`architectures over MANET. In GLOBECOM2009 - 2009 IEEE Global
`Telecommunications Conference, pages 1-6. IEEE, November 2009.
`Jinliang Fan and Mostafa H. Ammar. Dynamic ‘lopology Configuration
`in Service Overlay Networks: A Study of Reconfiguration Policies. In
`Procedings of IEEE INFOCOM,2006.
`Nick Feamster, Lixin Gao, and Jennifer Rexford. How to Lease the
`Internet in Your Spare Time. SIGCOMM Computer Communication
`Review, 37(1):61-64, 2007.
`Global Environment for Network Innovations. http://www.geni-net.
`Christian Frank and Kay Romer. Distributed Facility Location Algo-
`rithms for Flexible Configuration of Wireless Sensor Networks.
`In
`Proceedings of the 3rd IEEE International Conference on Distributed
`Computing in Sensor Systems, DCOSS’07, pages 124-141, Berlin,
`Heidelberg, 2007. Springer-Verlag.
`Yun Fu, Jeffrey Chase, Brent Chun, Stephen Schwab, and Amin Vah-
`dat. SHARP: an Architecture for Secure Resource Peering. SIGOPS
`Operating System Review, 37(5):133-148, 2003.
`GENL End-user opt-in working group http://groups.geni-net/geni/wiki/
`GeniOptIn., 2009.
`Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula,
`Changhoon Kim, Parantap Lahiri, David A. Maltz, Parveen Patel, and
`Sudipta Sengupta. VL2: a Scalable and Flexible Data Center Network.
`In Proceedings of the ACM SIGCOMM 2009 conference on Data
`communication, SIGCOMM ’09, pages 51-62, New York, NY, USA,
`2009. ACM.
`Brian Hayes. Cloud computing. Commun. ACM, 51(7):9-11, 2008.
`Jiayue He, Rui Zhang-shen, Ying Li, Cheng yen Lee, Jennifer Rexford,
`and Mung Chiang. DaVinci: Dynamically Adaptive Virtual Networks
`for a Customized Internet. In Proc. CoNEXT, 2008.
`Mike Hibler, Robert Ricci, Leigh Stoller, Jonathon Duerig, Shashi
`Guruprasad, Tim Stack, Kirk Webb, and Jay I.epreau.
`J.arge-Scale
`Virtualization in the Emulab Network Testbed. ATC’08: USENIX 2008
`Annual Technical Conference on Annual Technical Conference, pages
`113-128, 2008.
`
`Ex. 1073 - Page 334
`Ex. 1073 - Page 334
`
`

`

`16
`
`[63]
`
`[64]
`
`[65]
`
`[66]
`[67]
`
`[68]
`
`[69]
`
`[70]
`
`[71]
`[72]
`
`[73]
`
`[74]
`[75]
`
`[76]
`
`[77]
`
`[78]
`
`[79]
`
`[80]
`
`[81]
`
`[82]
`
`Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd.
`The PageRank Citation Ranking: Bringing Order to the Web. Technical
`Report 1999-66, Stanford InfoLab, November 1999.
`D.P. Palomar and Mung Chiang. A Tutorial on Decomposilion Methods
`for Network Utility Maximization. Selected Areas in Communications,
`IEEE Journal on, 24(8):1439 —1451, aug. 2006.
`Larry Peterson, Tom Anderson, David Culler, and Timothy Roscoe.
`A Blueprint for Introducing Disruptive ‘Technology into the Internet.
`SIGCOMM Computer Communincation Review, 33(1):59-64, 2003.
`BGP/MPLS RFC2547. http://tools.ietf.org/html/rfc2547.
`Robert Ricci, Chris Alfeld, and Jay Lepreau. A Solver for the Network
`Testbed Mapping Problem.
`SiGCOMM Computer Communication
`Review, 33(2):65-81, 2003.
`Robert Ricci, David Oppenheimer, Jay Lepreau, and Amin Vahdat.
`Lessons from Resource Allocators for Large-Scale Multiuser Testbeds.
`ACM SIGOPS Operating Systems Review, 40(1), January 2006.
`Thomas Ristenpart, Eran Tromer, Hovav Shacham, and Stefan Savage.
`Hey. you, Get Off of My Cloud: Exploring Information Leakage
`in Third-party Compute Clouds.
`In Proceedings of the 16th ACM
`conference on Computer and communications security, CCS ’09, pages
`199-212, New York, NY, USA, 2009. ACM.
`Jeffrey Shneidman, Chaki Ng, David C. Parkes, Alvin AuYoung, Alex C.
`Snocren, Amin Vahdat, and Brent Chun. Why Markcts Would (But
`Dow’t Currently) Solve Resource Allocation Problems in Systems.
`In
`Proceedings of the 10th conference on Hot Topics in Operating Systems -
`Volume 10, pages 7-7, Berkeley, CA, USA, 2005. USIINIX Association.
`Steven S. Skiena. Set Packing. The Algorithm Design Manual. 1997.
`David Spence and Tim Harris. XcnoScarch: Distributed Resource
`Discovery in the XenoServer Open Platform. Internationul Symposium
`on High-Performance Distributed Computing (HPDC), page 216, 2003.
`Eric Liu Mike Kester Tlenning Schulzrinne Volker TTilt Srini Seethara-
`man Suman Srinivasan, Jae Woo Lee and Ashiq Khan. NetServ:
`Dynamically Deploying In-network Services. In Proceedings of ReArch
`’09 (CoNEXT workshop), 2009.
`SWORD.Source code http://sword.cs.williams.edu/, 2005.
`Jonathan Turner and David Taylor. Diversifying the Internet. GLOBE-
`COM IEEE Global Communication conference, 2005.
`J Vygen. Approximation Algorithms for Facility Location Problems.
`Technical report, 05950-OR, Res. Ins. for Disc. Math., University of
`Bonn, 2005.
`Brian White, Jay T.epreau, Leigh Stoller, Robert Ricci, Shashi Gu-
`ruprasad, Mac Newbold, Mike Hibler, Chad Barb, and Abhijeet Joglekar.
`An Integrated Experimental Environment for Distributed Systems and
`Networks. SIGOPS Oper. Syst. Rev., 36(SD:255—270, 2002.
`Jon Whiteaker, Fabian Schneider, and Renata Teixeira. Explaining
`packet delays under virtualization. ACM SIGCOMM CCR, 41(1):38—
`44, January 2011.
`Minlan Yu, Yung Yi, Jennifer Rexford, and Mung Chiang. Rethinking
`Virtual Network Embedding: Substrate Support for Path Splitting and
`Migration. SIGCOMM Compututer Communication Review, 38(2):17—
`29, 2008.
`Tao Yu and Kwei-Jay Lin. A Broker-Based Framework for QoS-Aware
`Web Service Composition. In IEEE ’05: Proceedings of the 2005 IEEE
`International Conference on e-Technology, e-Commerce and e-Service
`(EEE’05) on e-Technology, e-Commerce and e-Service, pages 22-29,
`Washington, DC, USA, 2005. IEEE Computer Society.
`Ammar M. Zhu, Y. Algorithms for Assigning Substrate Network
`Resources to Virtual Network Components. INFOCOM 2006. 25th IEEE
`International Conference on Computer Communications. Proceedings,
`pages 1 —12, April 2006.
`Qian Zhu and Gagan Agrawal. Resource Provisioning with Budget
`Constraints for Adaplive Applications in Cloud Environments.
`In
`Proceedings of the 19th ACM International Symposium on High Perfor-
`mance Distributed Computing, HPDC ’10, pages 304-307, New York,
`NY, USA, 2010. ACM.
`
`[39]
`
`[40]
`
`[41]
`
`[42]
`
`143]
`
`[44]
`
`[45]
`
`[46]
`
`[47]
`
`[48]
`
`[49]
`
`[50]
`
`[51]
`
`[52]
`
`[53]
`
`[54]
`
`[56]
`
`[57]
`
`[58]
`
`159]
`
`[60]
`
`{61}
`[62]
`
`Urs Hoelzle and Luiz Andre Barroso. The Datacenter as a Computer:
`An Introduction to the Design of Warehouse-Scale Machines. Morgan
`and Claypool Publishers, 2009.
`I. Houidi, W. Louali, and D. Zeghlache. A Distributed Virtual Net-
`work Mapping Algorithm.
`In Communications, 2008. ICC ’08. IEEE
`International Conference on, pages 5634 —5640, May 2008.
`An-Cheng Huang and Peter Steenkiste. Network-Sensitive Service
`Discovery. USITS: USENIX Symposium on Internet lechnologies and
`Systems, 2003.
`Vatche Ishakian, Raymond Sweha, Jorge Londofio, and Azer Bestavros.
`Colocation as a Service: Strategic and Operational Services for Cloud
`Colocation. In NCA, pages 76-83, 2010.
`Azer Bestavros Jorge Londofio and Shanghua ‘leng. Collocation Games
`And Their Application Lo Distributed Resource Management.
`In Pro-
`ceedings of USENIX HotCloud’09: Workshop on Hot Topics in Cloud
`Computing, San Diego, CA,, June 2009.
`O. Kariv and S. Hakimi. An Algorithmic Approach to Network Location
`Problems, Part II: P-Mcdians. SIAM Journal on Applied Mathematics,
`37:539-560, 1979.
`Morgan Kaufmann. The Grid. Blueprint for a New Computing Infras-
`tructure. Vilsevier Series in Grid Computing, 2 edition, December.
`Stavros G. Kolliopoulos and Clifford Stein.
`Improved Approximation
`Algorithms for Unsplittable Flow Problems. fz Proceedings of the 38th
`Annual Symposium on Foundations of Computer Science, pages 426-
`435, 1997.
`James Tl’. Kurose and Keith W. Ross. Computer Networking: A Top-Down
`Approach. Addison Wesley, 2009.
`C. Sansone L. P. Cordclla, P. Foggia and M. Vento. An Improved
`Algorithm for Matching Large Graphs. 3rd IAPR-TC15 Workshop on
`Graph-based Representations in Pattern Recognition, pages 149 159,
`2001.
`Kevin Lai, Lars Rasmusson, Eytan Adar, Li Zhang, and Bernardo A.
`Huberman. Tycoon: An Implementation of a Distributed, Market-Based
`Resource Allocation System. Multiagent Grid Syst., 1(3): 169-182, 2005.
`N. Laoutaris, G. Smaragdakis, K. Oikonomou,
`I. Stavrakakis, and
`A. Bestavros. Distributed Placement of Service Macilities in Large-Scale
`Networks. In INFOCOM, Anchorage, AK, May 2007.
`Harold C. Lim, Shivnath Babu, Jeffrey S. Chase, and Sujay S$. Parckh.
`Automated Control in Cloud Computing: Challenges and Opportunities.
`In Proceedings of the Ist Workshop on Automated Control for Datacen-
`ters and Clouds, ACTYC ’09, pages 13-18, New York, NY, USA, 2009.
`ACM.
`Jens Lischka and Holger Karl. A Virtual Network Mapping Algorithm
`based on Subgraph Isomorphism Detection. VISA, ACM SIGCOMM
`Workshop on Virtualized Infastructure Systems and Architectures, pages
`81-88, 2009.
`Michael Litzkow, Miron Livny, and Matthew Mutka. Condor - A Hunter
`of Idle Workstations. Proceedings of the 8th International Conference
`of Distributed Computing Systems, June 1988.
`Jorge Londono and Azer Bestavros. NETEMBED: A Network Resource
`Mapping Service for Distributed Applications. Symposium on Parallel
`and Distributed Processing, 2008. IPDPS 2008. IEEE International,
`pages 1 -8, April 2008.
`Jing Lu and Jonathan Turner. Efficient Mapping of Virtual Networks
`onto a Shared Substrate. Technical report, Washington University in St.
`Louis, 2006.
`R.A. Calderbank M. Chiang, $.H. Low and J.C. Doyle. Layering
`as Optimization Decomposition: A Mathematical Theory of Network
`Architectures. Proc. of [EEE, 95(1):255-312, Jan 2007.
`Harsha V. Madhyastha, Ethan Katz-bassett, Thomas Anderson, Arvind
`Krishnamurthy, and Arun Venkataramani.
`iplane nano: Vath prediction
`for peer-lo-peer applications. Proceedings of NSDI, 2009.
`The
`Matthew L. Massie, Brent N. Chun, and David E. Culler.
`Ganglia Distributed Monitoring System: Design, Implementation and
`Experience. Parallel Computing, 30:2004, 2003.
`Ibrahim Matta and Azer Bestavros. A Load Profiling Approach to
`Routing Guaranteed Bandwidth Flows.
`INFOCOM '98. Seventeenth
`Annual Joint Conference of the IEEE Computer and Communications
`Societies. Proceedings. IEEE, 3:1014 —1021 vol.3, mar-2 apr 1998.
`Elena Meshkova,Janne Riihijarvi, Marina Petrova, and Petri Mahénen.
`A Survey on Resource Discovery Mechanisms, Pecr-to-Peer and Service
`Discovery Frameworks. Computer Networks, 52(11):2097-2128, 2008.
`P. Mirchandani and R. Francis. Discrete Location Theory. Wiley, 1990.
`Albrecht J. Patterson D. Vahdat A. Oppenheimer, D. Design and
`Implementation Tradeoffs for Wide-Area Resource Discovery. High
`Performance Distributed Computing, 2005. HPDC-14. Proceedings.
`14th IEEE International Symposium on, pages 113 — 124, July 2005.
`
`Ex. 1073 - Page 335
`Ex. 1073 - Page 335
`
`

`

`(12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY(PCT)
`
`(19) World Intellectual Property
`Organization
`International Bureau
`
`(43) International Publication Date
`4 November 2004 (04.11.2004)
`
`
`
`(51) International Patent Classification’:
`
`GO0IM 11/00
`
`(21) International Application Number:
`PCT/IB2004/05049 1
`
`(22) International Filing Date:
`
`22 April 2004 (22.04.2004)
`
`(25) Filing Language:
`
`(26) Publication Language:
`
`(30) Priority Data:
`03101131.5
`
`English
`
`English
`
`24 April 2003 (24.04.2003)
`
`EP
`
`(71) Applicant (for all designated States except US): KONIN-
`KLIJKE PHILIPS ELECTRONICS N.V.
`[NL/NL];
`Groenewoudseweg 1, NL-5621 BA Eindhoven (NL).
`
`(72) Inventors; and
`(75) Inventors/Applicants (for US only): FONTIJN, Wil-
`helmus, F., J. [NL/NL]; c/o Prof. Iolstlaan 6, NL-5656
`AA Eindhoven (NL). LAMBERT,Nicolaas [NL/NL]; c/o
`Prof. Holstlaan 6, NL-5656 AA Lindhoven (NL).
`
`(74) Agent: GROENENDAAL, Antonius, W., M.; Prof. Hol-
`stlaan 6, NL-5656 AA Lindhoven (NL).
`
`(81) Designated States (unless otherwise indicated, for every
`kind of national protection available): AR, AG, AT, AM,
`
`(54) Title: PEER ‘TO PEER ‘TRANSFER OF CONTENT
`
`(10) International Publication Number
`WO 2004/094980 A2
`
`AT, AU, AZ, BA, BB, BG, BR, BW, BY, BZ, CA, CH, CN,
`CO, CR, CU, CZ, DE, DK, DM, DZ, EC, EE, EG, ES, FI,
`GB, GD, GL, GH, GM, HR, HU,ID,IL, IN, IS, JP, KE,
`KG,KP, KR, KZ, LC, LK, LR, LS, LT, LU, LV, MA, MD,
`MG, MK, MN, MW, MX, MZ, NA, NI, NO, NZ, OM, PG,
`PH, PL, PL, RO, RU, SC, SD, SE, SG, SK, SL, SY, ‘TJ, TM,
`TN,TR, TT, TZ, UA, UG, US, UZ, VC, VN, YU, 7A, ZM,
`ZW.
`
`(84) Designated States (unless otherwise indicated, for every
`kind of regional protection available): ARIPO (BW,GIL,
`GM,KE, LS, MW, MZ, SD, SL, SZ, TZ, UG, ZM, ZW),
`Eurasian (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM), Euro-
`pean (AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR,
`GB, GR,ITU,IE, IT, LU, MC, NL, PL, PT, RO, SE, SI, SK,
`TR), OAPI (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW,
`ML, MR, NE, SN, TD, TG).
`
`Declaration under Rule 4.17:
`as to applicant’s entitlement to apply for and be granted
`a patent (Rule 4.17(ii)) for the following designations AE,
`AG, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BW, BY, BZ,
`CA, CH, CN, CO, CR, CU, CZ, DE, DK, DM, DZ, EC, EE,
`EG, FS, Fl, GB, GD, GR, GH, GM, HR, HU, ID, IL, IN, IS,
`JP, KE, KG, KP, KR, KZ, LC, LK, LR, LS, LT, LU, LV, MA,
`MD, MG, MK, MN, MW. MX, MZ, NA, NI, NO, NZ, OM,
`
`[Continued on next page]
`
`We
`
`
`
`
`
`
`
`
`
`
`
`(57) Abstract: This invention relates to a method, a device, a server and a system of / for peer to peer transfer of content. Said
`method includes the steps of receiving and transmitting, from a first device (11), a first request with a first selection criterion for a
`first content to a server (18) or to a second device (12); transferring the first content satisfying said first selection criterion to said
`first device from the server, when said server previously has acknowledgedsaid first device as a legal recipient of said first content
`and in case said first content is available only on said server, and noting that said first device subsequently has the requestedfirst
`content available for other devices (14, 15 , 16, 17); or re-directing said first request to a third device (13) on whichthe server knows
`that the requested first content is still available and transferring said first content satisfying said first selection criterion to said first
`device from the third device; or transferring the first content satisfying said first selection criterion to said first device from the second
`device, whensaid first content is available on said second device, and informing the serverthat said first content has been transferred
`to said first device from said second device; and rewarding the one of said second orthird device from whichsaid first content was
`transferred to said first device, when content was transferred from one of these; and charging said first device for reception of said
`first content. This enables for download, upload and sharing of legally protected paid-for content.
`
`Ex. 1073 - Page 336
`Ex. 1073 - Page 336
`
`
`
`A< =o
`
`e
`nN
`wr
`
`N—
`
`)—
`
`>——
`
`)
`AN
`
`

`

`WO 2004/094980 A2
`
`__IMMITINNTNINTIIITTITIM TIMARU TAINA I
`
`PG, PH, PL, PT, RO, RU, SC, SD, SE, SG, SK, SL, SY, TJ,|Published:
`TM, TN, TR, TT, TZ, UA, UG, UZ, VC, WN, YU, ZA, ZM,==——without international search report and to be republished
`ZW, ARIPO patent (BW, GH, GM, KE, LS, MW, MZ, SD,
`upon receipt of that report
`SL, SZ, TZ, UG, 7M, ZW), Eurasian patent (AM, AZ, BY,
`KG, KZ, MD, RU, TJ, TM), European patent (AT, BE, BG,
`CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HU, IE, IT,
`LU, MC, NL, PL, PT, RO, SE, SI, SK, TR), OAPIpatent (BF,_For two-letter codes and other abbreviations, refer to the "Guid-
`BJ, CF, CG, CL, CM, GA, GN, GQ, GW, ML, MR, NE, SN,—ance Notes on Codes and Abbreviations" appearing at the begin-
`TD, TG)
`ning ofeach regularissue ofthe PCT Gazette.
`
`Ex. 1073 - Page 337
`Ex. 1073 - Page 337
`
`

`

`WO 2004/094980
`
`PCT/1B2004/050491
`
`Peerto peer transfer of content
`
`This invention relates to a method ofpeer to peer transfer of content.
`
`The present invention also relates to a computer system for performing the
`
`method.
`
`The present invention further relates to a computer program product for
`performing the method.
`
`10
`
`15
`
`20
`
`25
`
`This invention further relates to a device on which parts of said methodis
`
`executed.
`
`This invention further relates to a server on which remaining parts (not run on
`the device) of said method is executed.
`
`This invention further relates to a system on which said method is executed.
`
`EP 1229443 discloses a system and a method for providing advertisements in
`
`a peer to peer networking environment. Each of the advertisements is defined as a structured,
`
`language neutral metadata structure. This is used to name, describe and publish an existence
`
`of a peer to peer platform resource, such as the peer itself, a pipe or a service. The
`
`advertisements are subsequently available to other peers in the networking environment.
`
`From theart it is known that Peer-to-peer is a communications model in which
`
`each party (i.e. each peer) has the same capabilities and either party can initiate a
`
`communication session. Other models with which the pure Peer-to-peer communications
`
`model might be contrasted include the client / server model and the master/slave model, both
`
`also knownin the art. In some cases, peer-to-peer communications is implemented by giving
`
`each communication node both server and client capabilities. In recent usage, peer-to-peer
`
`has come to describe applications in which users can use the Internet to download or upload
`multimedia content or simpler content in form of files with and to each other directly or
`through a mediating server.
`
`Ex. 1073 - Page 338
`Ex. 1073 - Page 338
`
`

`

`WO 2004/094980
`
`PCT/1B2004/050491
`
`2
`
`On the Internet, peer-to-peer (referred to as P2P) is a type of transient Internet
`
`network that allows a group of computer users (peers) with the same networking program to
`
`connect with each other and directly access files from one another's hard drives. Napster and
`
`Gnutella are examplesof this kind of peer-to-peer software.
`
`Whenthe Internet P2P is applied, it is known in the art that the user must first
`
`download and execute a peer-to-peer networking program, e.g. Gnutella-net is currently one
`
`of the most popular of these decentralized P2P programs becauseit allows users to exchange
`
`all types offiles.
`
`10
`right, such as music, a movie, etc, and/or the files may have a poor quality and/or said files
`
`Asdiscussedlater, it is a problem that the files may represent a stolen property
`
`may contain virus.
`
`15
`
`20
`
`After launching the program,the user enters the IP address of another
`
`computer belonging to the network, typically, the Web page where the user obtained the
`
`download will list several IP addresses as places to begin. Once the computer finds another
`
`network member on-line, it will connect to that user's connection, which has obtained their IP
`
`address from a connection of another user, and so on.
`
`It is however, a problem especially for un-experienced, unaware users that
`
`downloadable content typically available in a peer-to-peer network may belegally protected
`
`and thusit is illegal do downloadit and useit, i.e. play back or view said content. In other
`
`words, many users — except for the few who knowtheyare deliberately infringing rights of
`
`the owner of copy protected content when downloaded — prefer to apply a method and device
`
`where they are secure that downloaded content is legal so that they subsequently can play
`
`back or view being sure that no rightful proprietor (of said content) is being infringed.
`
`It is a further problem for users that downloadable available ‘for-free’ (in fact
`
`25
`
`stolen from a legal point of view) content can contain virus, i.e. when said content is
`
`subsequently played back or viewed on the user’s device, the virus may also getlife,i.e. it
`
`may be executed simultaneous with the playing back or viewing of content on the user’s
`
`device. Said virus can then consequently harm the file or operating system of the device of
`
`the user thus making the user device malfunction or lose previously downloaded content as
`
`30
`
`well.
`
`It is a further problem for users that downloadable available ‘for-free’ content
`
`may be in a poor quality, since the content is illegal recorded during a concert, in a cinema or
`recorded from the original content by means of poor quality recording equipment, thus
`
`content in this case is in fact illegal obtained and in a poor quality.
`
`Ex. 1073 - Page 339
`Ex. 1073 - Page 339
`
`

`

`WO 2004/094980
`
`PCT/1B2004/050491
`
`3
`
`In other words,it is a problem that user are uncomfortable with ‘for-free’
`
`content since it may contain virus and / or makethe usera thief, if the unaware user
`
`downloadssuch content.
`
`Additionally, it is a problem that users are reluctant in sharing(i.e.
`
`transmitting to others) copy protected content since they risk being caughtin infringement of
`the rightful proprietor, if sharing, especially when using Web-pages (to download content)
`nottelling that eventually provided material (content) from a legal point of view is in fact a
`
`violation of copyright laws.
`
`It is a further problem that currently the real cost of a downloaded item of
`
`10
`
`content is not transparent to the user.
`
`The present invention enables users to download legally protected content
`
`when applying the method according to the invention and / or when using the device
`
`according to the invention which communicates with the server in the peer-to-peer network.
`Subsequently, it is legal to play it back, view it and share it with others. This is possible,
`since the method (and the device and server applying the method) handles the property rights
`and the payments in a lega! manner, which both the users and content providers are
`
`comfortable with, i.e. the user is assured that he does not makea thief out of himself, and the
`
`content providers (artist, singer, movie manufacturer, etc) are assured that their content is not
`
`being stolen, but paid for.
`
`Further, it is assured that the downloaded content is virus-free and in an
`
`15
`
`20
`
`approved quality.
`
`Additionally, users can - when applying the method by meansoftheir device -
`
`easily and legally share (i.e. transmit to others) copy protected content since somesteps of
`
`the methods ensure that the proprietor of content gets paid for his content, since users are
`
`25
`
`charged for downloads. Further, users (of said devices), themselves can obtain a reward for
`
`sharing, this further expands sharing.
`
`Further, it is an advantage of the invention that the real cost of a downloaded
`
`item of content is transparent to the user.
`
`Said device and server, in combination and the systern provide the same
`
`30
`
`advantages and solve the same problem(s) for the same reasons as described previously in
`relation to the method.
`
`Ex. 1073 - Page 340
`Ex. 1073 - Page 340
`
`

`

`WO 2004/094980
`
`PCT/1B2004/050491
`
`4
`
`The invention will be explained more fully below in connection with preferred
`embodiments and with reference to the drawings, in which:
`
`fig. 1 shows a network of devices and a server; and
`
`fig. 2 shows a methodofpeer to peer transfer of content.
`
`Throughout the drawings, the same reference numerals indicate similar or
`
`corresponding features, functions,etc.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`Figure 1 shows a networkof devices and a server. Said network of devices
`with the server are illustrated by means of reference numeral 10. As will be explained more
`detailed in the next figure, a first device, reference numeral 11, orits useris looking for
`certain content (a video film as an example), the user will then try to find out from where the
`video film can be obtained, i.e. downloaded. He will use a specific selection criterion for the
`video film content. In technical terms, his device (first device) will receive the selection
`criterion e.g. movie name, genre, etc, which it then will send to another device (a second
`device. reference numeral 12,)) and to a server, reference numeral 18, since his own device
`
`(said first device) cannot know whether the server or another peer to peer device, has the
`requested content available.If the server has the content satisfying the selection criterion,it
`will provide it to the requesting device, i.e. to said first device. However, in order to offload
`and distribute network usage moreefficient — if the server knowsthat another peer (device)
`has the requested content available, the server will redirect the transfer of content to this
`
`device which then will provide the content satisfying the selection criterion, i.e. transfer it to
`the requesting device equalling said first device. In the last case, the serveris informed — by
`the actual device transferring content that content has been transferredto said first device,
`which then can be accordingly chargedfor receiving the requested content. Hereby, the first
`device (and its user) is comfortable with content charged for, since it is virus free and has
`
`been legally bought, i.e. the user is sure that he did not make a thief out of himself; further
`
`the user can rely on that the content has an approved quality level, since it comes form the
`
`legal owneror an administrator of network, he cantrust.
`
`In thefirst case, i.e. the server supplied directly the requested content, the
`
`server typically previously acknowledged that said first device is in fact a subscribing or
`paying (or one wholater will pay) rightful recipient ofthe content, i.c. said video film. The
`content, in general, can be uploaded to or downloaded from moredevices, e.g. reference
`
`numerals 13 and 14. In the networkfurther devices may be present, e.g. reference numerals
`
`Ex. 1073 - Page 341
`Ex. 1073 - Page 341
`
`

`

`WO 2004/094980
`
`PCT/1B2004/050491
`
`5
`
`15, 16 and 17. Generally, the server has to be accessible to and in the network of devices, i.e.
`
`to all devices, either for transfer of contentthe first time, and/ or subsequently for charging
`and rewarding,thisis illustrated by means of the arrows connecting the server to the devices.
`
`A requester needs not register or be registered to the server. There may be a
`third party that certifies the requester to the server. The server trusts the certifier and assumes
`
`the requester is allowed to receive. Or the requester pays ‘on-the-spot’ using virtual tokens or
`
`a mediation service (Pay-Pal).
`
`The network is shown for illustrative purposes, any other dynamic or static
`
`topology or arrangement of peers or devices and one or more additionally servers may also
`be applied in the present invention.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`Anyof said devices may be a video cassette recorder (VC