초록 ▼

Method and system for optimizing selection of a network. The method includes identifying available lenders and existing networks within a vicinity of a borrower, selecting an optimization technique for completing a task of the borrower, calculating, for a plurality of network options, a value for co

Method and system for optimizing selection of a network. The method includes identifying available lenders and existing networks within a vicinity of a borrower, selecting an optimization technique for completing a task of the borrower, calculating, for a plurality of network options, a value for completing the borrower's task according to the optimization technique, and selecting an optimum network option to complete the borrower's task. The plurality of network options includes forming a heterogeneous network composed of both a peer-to-peer network and a multiplexed network.

대표청구항 ▼

1. A system for finding an optimum network for a requester of bandwidth, comprising: a computing device that operates to: identify available bandwidth lenders and existing networks within a vicinity of the requester;select an optimization technique for completing a task of the requester;calculate va

1. A system for finding an optimum network for a requester of bandwidth, comprising: a computing device that operates to: identify available bandwidth lenders and existing networks within a vicinity of the requester;select an optimization technique for completing a task of the requester;calculate values comprising a respective calculated value for each of a plurality of network options for completing the requester's task according to the optimization technique; andselect the optimum network from the calculated values,wherein the plurality of network options include a heterogeneous ad hoc network composed of a peer-to-peer ad hoc network and a multiplexed ad hoc network in which the requester communicates directly with the bandwidth lenders via a local wireless communication protocol; andwherein the optimization technique comprises fastest time for completion of task determined according to one of:TeMUXAHN=WeMUX+TeMUX+TeMUXnlenders;TnMUXAHN=TnMUX+TnMUXnlenders;TeP2PAHN=WeP2Pnlenders+TeP2Pnlenders;TnP2PAHN=TnP2Pnlenders; andTHetAHN=(TnMUX+TnMUXklenders)=TnP2P(n−k)lenders. 2. The system in accordance with claim 1, wherein the optimization technique comprises at least one of fastest time for completion of task, least expensive completion of task, minimizing risk of drop-offs, and maximizing lender capabilities. 3. The system of claim 1, wherein the plurality of network options further includes joining an existing multiplexed network, joining an existing peer-to-peer network, forming a new multiplexed network, and forming a new peer-to-peer network. 4. The system in accordance with claim 1, wherein the computing device further operates to determine whether the requester is currently in an existing network. 5. The system of claim 1, wherein the requester's task comprises one of an upload and a download of at least one file. 6. The system of claim 5, wherein the optimum network is the heterogeneous ad hoc network, and the computing device further operates to divide the at least one file into parts and to distribute the parts among at least one of the bandwidth lenders and the peer-to-peer ad hoc network and the multiplexed ad hoc network for the one of the upload and the download. 7. The system of claim 6, wherein the computing device further operates to reassemble the parts of the at least one file after the one of the upload and the download. 8. The system of claim 1, wherein the calculated values for each of the plurality of network options are compared to each other to identify the optimum network. 9. The system of claim 1, wherein the computing device further operates to monitor performance of the selected optimum network. 10. The system of claim 9, wherein the computing device further operates to determine whether a diminution in performance related to the optimization technique has occurred in the requester's selection of the optimum network. 11. The system of claim 10, wherein the computing device includes a threshold composed of a predefined percentage value related to an acceptable diminution in performance of the selected optimum network from that expected when the optimum network was selected. 12. The system of claim 11, further comprising: the computing device further operates to monitor how much of the task remains to be completed,wherein, when the diminution in performance exceeds the threshold, the computing device determines how much of the task remains, determines for the plurality of network options values for completing the remaining task according to the optimization technique, and selects a new optimum network to complete the remaining task. 13. The system of claim 1, wherein: the computing device comprises a server having a database containing data associated with one or more instructions for implementing peer-to-peer, multiplexed, and heterogeneous ad-hoc networks; andthe optimum network is a network in which multiple disparate wireless connections in conjunction with multiple devices are used to create a virtual fat pipe for data transmission to perform a file upload or download for the requester. 14. The system of claim 1, wherein the optimization technique comprises least expensive completion of task determined according to one of: CeMUXAHN=(TeMUX+TeMUXnlenders)(ΣCj);CnMUXAHN=(TnMUX+TnMUXnlenders)(ΣCj);CP2PAHN=TP2P(ΣCj); andCHetAHN=THetAHN(ΣCj). 15. A method for optimizing selection of a network in an ad hoc network architecture, comprising: providing a computer infrastructure operable to:select an optimization technique for completing a task of a bandwidth borrower;calculate, for a plurality of network options, a value for completing the task according to the optimization technique, wherein the plurality of network options includes forming a heterogeneous network composed of both a peer-to-peer network and a multiplexed network;select an optimum network to complete the task; andjoin or form the optimum network,wherein the optimum network is an ad hoc network that is configured such that the bandwidth borrower and at least one bandwidth lender are in communication with a central location via wireless telephony communication protocol, the at least one bandwidth lender is in communication with the bandwidth borrower via local wireless communication protocol, and the at least one bandwidth lender selectively lends bandwidth to the bandwidth borrower for downloading data from or uploading data to the central location; andwherein the optimization technique comprises least expensive completion of task determined according to one of:CeMUXAHN=(TeMUX+TeMUXnlenders)(ΣCj);CnMUXAHN=(TnMUX+TnMUXnlenders)(ΣCj);CP2PAHN=TP2P(ΣCj); andCHetAHN=THetAHN(ΣCj). 16. The method of claim 15, wherein the computer infrastructure is further operable to monitor performance of a current network. 17. A computer program product comprising a non-transitory computer usable medium having readable program code embodied in the medium, the program code including at least one component to: identify available lenders and existing networks within a vicinity of a borrower, wherein the borrower is a bandwidth borrower and the lenders are bandwidth lenders;select an optimization technique for completing a task of the borrower;calculate, for a plurality of network options, a value for completing the borrower's task according to the optimization technique; andselect an optimum network option to complete the borrower's task,wherein the plurality of network options includes forming a heterogeneous ad hoc network composed of both a peer-to-peer ad hoc network and a multiplexed ad hoc network in which the borrower communicates with the lenders via local wireless communication protocol and the lenders communicate with a remote location on behalf of the borrower to create a virtual fat pipe for the borrower, andwherein the optimization technique comprises one of: (a) fastest time for completion of task determined according to one of: TeMUXAHN=WeMUX+TeMUX+TeMUXnlenders;TnMUXAHN=TnMUX+TnMUXnlenders;TeP2PAHN=WeP2Pnlenders+TeP2Pnlenders;TnP2PAHN=TnP2Pnlenders; andTHetAHN=(TnMUX+TnMUXklenders)=TnP2P(n−k)lenders;and(b) least expensive completion of task determined according to one of: CeMUXAHN=(TeMUX+TeMUXnlenders)(ΣCj);CnMUXAHN=(TnMUX+TnMUXnlenders)(ΣCj);CP2PAHN=TP2P(ΣCj); andCHetAHN=THetAHN(ΣCj). 18. The computer program product of claim 17, wherein the optimization technique comprises at least one of fastest time for completion of task, least expensive completion of task, minimizing risk of drop-offs, and maximizing lender capabilities. 19. The computer program product of claim 17, wherein the plurality of network options further includes joining an existing multiplexed network, joining an existing peer-to-peer network, forming a new multiplexed network, and forming a new peer-to-peer network.