Optimization process and system for non-multiplexed peer-to-peer architecture

• US 7,817,623 B2
• Filed: 05/31/2007
• Issued: 10/19/2010
• Est. Priority Date: 05/31/2007
• Status: Expired due to Fees

• Current Assignee: LinkedIn Corporation (Microsoft Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: Finn, Peter G., Dawson, Christopher J., Hamilton, Rick A. II, Li, Jenny S.
• Primary Examiner(s): Kumar; Pankaj
• Assistant Examiner(s): Mais; Mark A
• Application Number:
  US11/755,802
• Publication Number:
  US 20080300932A1
• Time in Patent Office: 1,237 Days
• Field of Search: 370/229, 370/230, 370/230.1, 370/233, 370/234, 370/238, 370/254, 370/255, 370/310, 3703101-3102, 370/328, 370/329, 370/331, 370/332, 370/351, 370/352, 370355-358, 370/389, 370/391, 370/396, 370/398, 370/395.21, 3703954-39543, 370/395.5, 370/400, 370/401, 370/433, 370/437, 370464-469, 370/477, 3704351-4353, 370/436, 370/450, 370/454, 3704521-4522
• US Class Current: 370/352
• CPC Class Codes: G06Q 10/06315 Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/0635 Risk analysis of enterprise or organisation activities
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change
• CPC Class Codes: G06Q 10/0639 Performance analysis of employees; Performance analysis of enterprise or organisation operations
• CPC Class Codes: G06Q 30/0205 Location or geographical consideration
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/1021 based on client or server locations
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments

Abstract

Process and system for optimizing one of uploading and downloading of at least one file through at least one lender in a peer-to-peer architecture. The process includes identifying available lenders within a vicinity of a borrower, selecting a number of lenders based upon at least one requester optimization criterion, dividing the at least one file to be one of uploaded or downloaded into parts corresponding to the number of selected lenders, assigning a part of the at least one file to each selected lender, and performing one of an upload or a download of the parts through the selected lenders.

Claims

1. A method, comprising:

identifying available lenders within a vicinity of a borrower;

selecting a number of lenders based upon at least one optimization criterion;

dividing at least one file to be one of uploaded and downloaded into parts corresponding to the number of selected lenders;

assigning a part of the at least one file to each selected lender; and

performing one of an upload and a download of the parts through the selected lenders,

wherein the identifying, the selecting, the dividing, the assigning, and the performing are performed in a peer-to-peer architecture as part of an ad hoc mobile network in which the parts are communicated between the borrower and the selected lenders via local wireless communication protocol and the parts are communicated between the selected lenders and one or more remote locations via wireless telephony packet protocol.

2. The method of claim 1, wherein the available lenders have available bandwidth to lend to the borrower.

3. The method of claim 1, wherein the at least one optimization criterion comprises at least one of minimizing cost, minimizing time, maximizing throughput, minimizing risk of drop-offs, maximizing reliability, and maximizing lender capabilities.

4. The method of claim 1, further comprising calculating a cost for performing one of an upload and a download of the at least one file for each available lender of the available lenders.

5. The method of claim 4, further comprising ranking the available lenders in order based upon the calculated cost.

6. The method of claim 5, wherein the at least one file is divided into equal sized parts.

7. The method of claim 5, wherein the parts of the divided at least one file are of unequal size.

8. The method of claim 7, wherein a largest part of the unequal sized parts is assigned to a least expensive lender.

9. The method of claim 1, further comprising ranking the available lenders in order based upon bandwidth connection speed.

10. The method of claim 9, wherein the at least one file is divided into equal sized parts.

11. The method of claim 9, wherein the parts of the divided at least one file are of unequal size.

12. The method of claim 11, wherein a largest parts of the unequal sized parts is assigned to the lender with a fastest bandwidth connection speed.

13. The method of claim 9, wherein the parts of the at least one file are sized so that, when each part is assigned to a selected lender, one of an uploading and a downloading of the parts is completed at a same time.

14. The method of claim 1, further comprising ranking lenders based upon reliability.

15. The method of claim 1, further comprising ranking lenders based upon fewest occurrences of drop-offs as lender.

16. The method of claim 1, further comprising grouping lenders based upon capabilities.

17. The method of claim 1, further comprising ranking lenders based upon borrower satisfaction.

18. The method of claim 1, further comprising storing information about lenders in a centralized database.

19. The method of claim 18, wherein the stored information about lenders includes cost structure, bandwidth connection speed, lender capabilities, and reliability data.

20. The method of claim 19, wherein the cost structure comprises at least one of price per unit time and price per Mb downloaded or uploaded.

21. The method of claim 1, further comprising reassembling the parts of the at least one file after the one of an upload and a download.

22. The method of claim 1, wherein the steps of claim 1 are provided by a service provider on a fee and/or subscription basis.

23. The method of claim 1, wherein a service provider at least one of creates, deploys, maintains, supports an infrastructure that implements the steps of claim 1.

43. The method of claim 1, wherein the borrower utilizes bandwidth of the selected lenders in parallel to create a virtual fat pipe for transmission of data over a cellular network.

44. The method of claim 43, further comprising:

the borrower performing one of;

(i) splitting the at least one file into the parts and transmitting the parts in parallel to the selected lenders, and (ii) receiving the file parts in parallel from the selected lenders and joining the file parts to re-create the file;

calculating a cost for performing one of an upload and a download of the at least one file for each available lender of the available lenders; and

storing information about lenders in a centralized database,

wherein the at least one optimization criterion comprises at least one of minimizing cost, minimizing time, maximizing throughput, minimizing risk of drop-offs, maximizing reliability, and maximizing lender capabilities.

24. A system for optimizing selection of bandwidth in a peer-to-peer architecture, comprising:

a device which identifies available bandwidth lenders within a vicinity of a requester;

a selector unit to select a number of lenders based upon at least one requester optimization criterion;

a divider structured and arranged to divide a task into a number of discrete pieces that correspond to the number of selected lenders; and

an assignor unit to assign each discrete piece of the task to different selected lenders,

wherein the identifying, the selecting, the dividing, and the assigning, are performed in the peer-to-peer architecture as part of an ad hoc mobile network in which the discrete pieces are communicated between the requester and the selected lenders via local wireless communication protocol and the discrete pieces are communicated between the selected lenders and one or more remote locations via wireless telephony packet protocol.

25. The system in accordance with claim 24, wherein the at least one requester optimization criterion comprises at least one of minimizing cost, minimizing time, maximizing throughput, minimizing risk of drop-offs, maximizing reliability, and maximizing lender capabilities.

26. The system in accordance with claim 24, further comprising a calculating unit to determine a cost for each available bandwidth lender to perform the task.

27. The system in accordance with claim 24, further comprising a listing device to rank available bandwidth lenders in order based upon at least one of a calculated cost for completing the task and bandwidth connection speed.

28. The system in accordance with claim 27, wherein the divider is structured and arranged to divide the task into equal sized pieces.

29. The system in accordance with claim 27, wherein divider is structured and arranged to divide the task into pieces not of equal size.

30. The system in accordance with claim 29, wherein the assignor unit assigns a largest piece of the pieces of not equal size to a lowest cost lender.

31. The system in accordance with claim 29, wherein the assignor unit assigns a largest piece of the pieces of not equal size to a fastest connection speed lender.

32. The system in accordance with claim 24, wherein the divider unit divides the task so that each piece of the task is completed at a same time.

33. The system in accordance with claim 24, further comprising a centralized database to store lender information composed of at least one of cost structure, bandwidth connection speed, lender capabilities, and reliability data.

34. The system in accordance with claim 33, wherein the cost structure comprises at least one of price per unit time and price per Mb downloaded or uploaded.

35. The system in accordance with claim 24, further comprising a reassembling unit structured and arranged to reassemble each discrete piece of the task.

36. A system comprising:

a server having a database containing data associated with one or more instructions for implementing a peer-to-peer ad-hoc network; and

at least one of a hardware and software component for optimizing selection of lenders of bandwidth and allocation of one of files and pieces of files to the selected lenders of bandwidth and for establishing the peer-to-peer ad-hoc network between a borrower and the selected lenders of bandwidth,

wherein the selection and the allocation are performed in a peer-to-peer architecture as part of the peer-to-peer ad hoc network in which the one of files and pieces of files are communicated between the borrower and the selected lenders via local wireless communication protocol and the one of files and pieces of files are communicated between the selected lenders and one or more remote locations via wireless telephony packet protocol.

37. The system in accordance with claim 36, wherein borrower preferences for optimizing the selection of lender of bandwidth and allocating the files and pieces of files are predefined and input to the at least one of hardware and software component for optimizing.

38. The system in accordance with claim 36, wherein the borrower is prompted to input data for optimizing the selection of lender of bandwidth and allocating the files and pieces of files to the at least one of hardware and software component for optimizing.

39. A method for optimizing selection of bandwidth in a peer-to-peer architecture, comprising:

a computer infrastructure operable to;

select a number that corresponds to a number of lenders of bandwidth from which to borrow bandwidth and to a number of discrete pieces to divide a task;

select a number of lenders of bandwidth from a listing of available lenders; and

assign each piece of the divided task to a different selected lender of bandwidth,

wherein the selecting the number of lenders and the assigning are performed in the peer-to-peer architecture as part of a peer-to-peer ad hoc mobile network in which the pieces of the divided task are communicated between a borrower and the selected lenders via local wireless communication protocol and the pieces of the divided task are communicated between the selected lenders and one or more remote locations via wireless telephony packet protocol.

40. A computer program product comprising a non-transitory computer usable storage medium having readable program code embodied in the non-transitory medium and including at least one component to:

identify available bandwidth lenders within a vicinity of a requester;

select a number of lenders based upon at least one optimization criterion;

divide a task into discrete pieces that correspond in number to the selected lenders; and

assign each discrete piece to a different selected lender, wherein the identifying, the selecting, the dividing, and the assigning are performed in a peer-to-peer architecture as part of a peer-to-peer ad hoc mobile network in which the pieces of the divided task are communicated between the requester and the selected lenders via local wireless communication protocol and the pieces of the divided task are communicated between the selected lenders and one or more remote locations via wireless telephony packet protocol.

41. The computer program product in accordance with claim 40, wherein the at least one requester optimization criterion comprises minimizing cost, minimizing time, maximizing throughput, minimizing risk of drop-offs, maximizing reliability, maximizing lender capabilities.

42. The computer program product in accordance with claim 40, further including at least one component to rank the available bandwidth lenders by at least one of a calculated cost for completing the task and bandwidth connection speed.