CN105721573B - P2P file sharing network fair bandwidth sharing method based on optimization utility - Google Patents

P2P file sharing network fair bandwidth sharing method based on optimization utility Download PDF

Info

Publication number
CN105721573B
CN105721573B CN201610081371.6A CN201610081371A CN105721573B CN 105721573 B CN105721573 B CN 105721573B CN 201610081371 A CN201610081371 A CN 201610081371A CN 105721573 B CN105721573 B CN 105721573B
Authority
CN
China
Prior art keywords
file
requestor
provider
link
price
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610081371.6A
Other languages
Chinese (zh)
Other versions
CN105721573A (en
Inventor
李世勇
孙微
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhairenqiao Nanjing Network Technology Co ltd
Original Assignee
Yanshan University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Yanshan University filed Critical Yanshan University
Priority to CN201610081371.6A priority Critical patent/CN105721573B/en
Publication of CN105721573A publication Critical patent/CN105721573A/en
Application granted granted Critical
Publication of CN105721573B publication Critical patent/CN105721573B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/104Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H04L67/1074Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks for supporting resource transmission mechanisms
    • H04L67/1078Resource delivery mechanisms
    • H04L67/1085Resource delivery mechanisms involving dynamic management of active down- or uploading connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/76Reallocation of resources, renegotiation of resources, e.g. in-call

Abstract

A kind of P2P file sharing network fair bandwidth sharing algorithm based on optimization utility, file provider are that each of which file requestor initializes downloading rate, and the download link of file requestor and the upload link of file provider respectively initialize the price collected;File requestor obtains regulatory factor according to the bandwidth calculation that all suppliers for providing file download service for it distribute;Downloading rate that file provider obtains according to file requestor at current time, the price that download link is collected, the price collected of upload link of file provider, adjustment subsequent time its be the downloading rate of file requestor's distribution;The download link of file requestor updates the price that its subsequent time is collected, and the upload link of file provider updates the price that its subsequent time is collected;The optimum point of former optimization problem is constantly approached by the optimum point that iteration obtains near-optimal problem.The present invention has many advantages, such as fair and reasonable bandwidth allocation, algorithm accurate and effective, simple and convenient.

Description

P2P file sharing network fair bandwidth sharing method based on optimization utility
Technical field
The present invention relates to technical field of the computer network more particularly to a kind of P2P file-sharing nets based on optimization utility Network fair bandwidth sharing method.
Background technique
In recent years, P2P file-sharing, which was applied, becomes one of most extensive and most successful application of P2P technology, occupies Most of flow of Internet network.In traditional shared file system based on C/S model, user needs sharing File first uploads to central server, and other users for needing to obtain file and central server foundation are contacted to download this article Part.This simple mode to realize file-sharing between Internet user, but file resource is centrally stored and frequent Upload downloading waste a large amount of server resource (bandwidth resources, computing resource and storage resource), and under cover single-point A possibility that failure, central server one go wrong, and entire shared file system will be unusable.And it is being based on P2P technology File sharing network in, user is not necessarily to file being uploaded to central server, and file is stored in positioned at diverse geographic location In different user computer, and the user can directly share with other users, from the user computer for providing file-sharing Required file resource downloading is directly obtained, has not only saved the bandwidth resources of server in this way, but also improve file-sharing system Reliability, robustness, the scalability of system.
Multiple concurrently connections usually can be all established in P2P shared file system, between user while downloading or uploading phase identical text The different fragments of part.This mode improves the file transmission efficiency of shared file system, also improves net to a certain extent The utilization rate of network bandwidth, but challenge also is brought to traditional congestion control mechanism and fair resource distribution simultaneously.Traditional gathers around The target of plug control is only to make each TCP connection friendly, it is believed that if bottleneck link is shared in N number of session simultaneously, each Session should get the 1/N of link transmission ability.And in P2P shared file system, it is certain selfishness users (client) in order to Accelerate file downloading speed, seizes a large amount of bandwidth resources by establishing multiple TCP connections to increase connection number, cause The serious unjustness that network bandwidth resources are distributed between users also leads to the performance and service of other conventional internet applications Quality decline, while also substantially increasing the burden of bottom transmission network.
Therefore, it is necessary to solve the contradiction between shared file system and conventional internet application and network operator, protect Card reaches two-win as far as possible under the premise of not damaging common interest, realizes fair and reasonable point of network bandwidth resources between users Match, this is also the important foundation for guaranteeing network rapid and healthy.The present invention is then from the angle analysis of optimization utility P2P file The optimum allocation of shared Internet resources, while ensureing that the user of demand file download service obtains certain satisfaction, it is ensured that band Wide resource fair effectively distribution between users, to guarantee the file that needed for providing for user while there is certain mass to guarantee Download service.
Summary of the invention
It is an object of that present invention to provide one kind using optimize user satisfaction as target, bandwidth allocation is fair and reasonable, method Simple and effective P2P file sharing network bandwidth allocation methods.
To achieve the above object, following technical scheme is used:
The method of the present invention mainly includes P2P file sharing network, file requestor s and file provider p.
It in P2P file sharing network, fixes a price to the access link of each user, according to the traffic conditions of chain road Dynamic adjustment link price, and file provider p is when providing file download service for file requestor s, according to file request The price that person s current downloading rate and access link is collected, dynamic adjust the uploading bandwidth of file provider p in file request Fair allocat between person, the final optimum allocation for realizing All Files supplier bandwidth;
The step of fair bandwidth sharing method, is as follows:
Step 1, in P2P file sharing network, in t moment, file provider p is each file requestor s initialization Downloading rate xps(t), the download link of file requestor s initializes the price λ collecteds(t), the upload chain of file provider p Road initializes the price μ collectedp(t);
Step 2, if x at this timepsIt (t) has been the optimum point of P2P file sharing network bandwidth allocation problems PP to get arriving The optimal bandwidth allocation of file requestor s, then method stops;Otherwise it is downwardly into step 3;P2P file sharing network bandwidth point With problem PP are as follows:
over xps≥0,p∈P,s∈S
WhereinVector xs=(x1s,x2s,...,xps), xps It is the downloading rate that file provider p provides for file requestor s, Us() is the utility function of file requestor s, ε ∈ [0, It 1] is coupling factor,It is the download link bandwidth of file requestor s,It is the upload link bandwidth of file provider p, S is File requestor's set, P are file provider's set, and P (s) is that the file for providing download service for file requestor s ∈ S provides Person's set;S (p) is that file provider p ∈ P provides the All Files requestor set of download service.
Step 3, the bandwidth meter that file requestor s is distributed according to all supplier P (s) for providing file download service for it Calculation obtains regulatory factor ξps(t), ξpsIt (t) is to make P2P file sharing network bandwidth allocation Approximation Problem AP approach P2P file to be total to Enjoy the regulatory factor of network bandwidth allocation problem PP;P2P file sharing network bandwidth allocation Approximation Problem AP are as follows:
over xps≥0,p∈P,s∈S
WhereinVector xs=(x1s,x2s,...,xps), xpsIt is the downloading rate that file provider p provides for file requestor s, Us() is the utility function of file requestor s, ε ∈ [0,1] is coupling factor, ξpsIt is regulatory factor,It is the download link bandwidth of file requestor s,It is file provider p Upload link bandwidth, S be file requestor set, P be file provider set, P (s) is provided for file requestor s ∈ S The file provider of download service gathers;S (p) is that file provider p ∈ P provides the All Files requestor collection of download service It closes.
Regulatory factor ξps(t) calculating formula is as follows:
In formula, p is file provider;S is file requestor;P (s) is that the All Files of file download service are provided for s Supplier's set;xps(t) be file provider p be file requestor s distribution downloading rate.
Step 4, the downloading rate x that file provider p is obtained according to file requestor s in t momentps(t), file requestor The price λ that the download link of s is collecteds(t), the price μ that the upload link of file provider p is collectedp(t), the adjustment t+1 moment is The downloading rate x of file requestor s distributionps(t+1);xps(t+1) calculating formula is as follows;
In formula, xps(t) be t moment file provider p be file requestor s distribution downloading rate;λsIt (t) is that file is asked The price that the download link of the person of asking s is collected;μp(t) be file provider p the price collected of upload link;wsIt is file request Person s is ready the expense of payment;ξpsIt (t) is that P2P file sharing network bandwidth allocation Approximation Problem AP is made to approach P2P file-sharing net The regulatory factor of network bandwidth allocation problems PP;ε is the coefficient of coup of optimization utility model;κ is method iteration step length, and κ > 0;Ginseng Number α > 0 is fairness index, as α=1, realizes the proportional fairness of resource allocation between user, as α=2, realizes user Between the harmonic average fairness of resource allocation then realize the max-min fairness of resource allocation between user as α → ∞;
It is meant that
If xps(t) > 0, then
If xps(t)=0, then
Step 5, the price λ that the download link update t+1 moment of file requestor s collectss(t+1);File provider p's It uploads link and updates the price μ that the t+1 moment collectsp(t+1);
λs(t+1) it is updated using following calculating formula:
In formula, p is file provider;S is file requestor;P (s) is that the All Files of file download service are provided for s Supplier's set;xps(t) be t moment file provider p be file requestor s distribution downloading rate;λsIt (t) is file request The price that the download link of person s is collected in t moment;ys(t) it is total downloading rate that file requestor s is obtained in t moment; It is the download link bandwidth of file requestor s;γ is method iteration step length, and γ > 0;
It is meant that
If λs(t) > 0, then
If λs(t)=0, then
μp(t+1) it is updated using following calculating formula;
In formula, p is file provider;S is file requestor;S (p) is to receive file provider p to provide file download clothes The file requestor of business gathers;μp(t) be t moment file provider p the price collected of upload link;xpsIt (t) is t moment text Part supplier p is the downloading rate of file requestor s distribution;zp(t) be file provider p upload link be file requestor Total uploading rate of distribution;It is the upload link bandwidth of file provider p;γ is method iteration step length, and γ > 0;
It is meant that
If μp(t) > 0, then
If μp(t)=0, then
Step 6, if the downloading rate x at t+1 moment at this timepsIt (t+1) is not that P2P file sharing network bandwidth allocation approximation is asked The optimum point for inscribing AP, then enter step 4 and recalculate;If the downloading rate x at t+1 moment at this timepsIt (t+1) is P2P file-sharing The optimum point of network bandwidth allocation Approximation Problem AP then enters step 2, and iteration is until obtain P2P file sharing network bandwidth point Optimum point with problem PP;
Step 7, when having, new file provider or file requestor are added or original file provider or file are asked The person of asking exits, then to reach new P2P file sharing network bandwidth allocation problems PP optimum point, i.e., step 1 to step 6 re-starts File provider is the optimum bandwidth of file requestor's distribution in new P2P file sharing network.
Compared with existing the relevant technologies, the present invention has the advantage that the bandwidth allocation in P2P file sharing network is asked Topic is attributed to network utility optimization problem, and the bandwidth of different supplier's distribution whether is distinguished for file requestor, considers Two different form of optimization utility model, is combined two kinds of forms using coupling factor, and be converted into equivalence Near-optimal problem, the distributed bandwidth allocation method of proposition can effectively converge to the optimum point of bandwidth allocation problems, Therefore while file requestor's satisfaction, conjunction of the network bandwidth between file requestor is effectively realized in Logistics networks Manage fair allocat.
Detailed description of the invention
Fig. 1 is the step flow chart of the method for the present invention.
Fig. 2 is 5 user network topology diagrams of the method for the present invention.
Fig. 3 is the relational graph of method the number of iterations and interior cycle-index in total in Fig. 2.
Fig. 4 is the optimal bandwidth allocation figure that file requestor s1 is obtained in Fig. 2.
Fig. 5 is the optimal bandwidth allocation figure that file requestor s2 is obtained in Fig. 2.
Fig. 6 is the optimal bandwidth allocation figure that file requestor s3 is obtained in Fig. 2.
Fig. 7 is the value of utility of each file requestor and network polymerization value of utility in Fig. 2.
Drawing reference numeral: it be file provider 2, s1 be file requestor 1, s2 is file request that p1, which is file provider 1, p2, Person 2, s3 are file requestors 3.
Specific embodiment
The satisfaction when present invention obtains file download service according to user in peer-to-peer network chooses utility function, for text Whether part requestor distinguishes the bandwidth from different file providers, considers the optimization utility model of two kinds of forms respectively, and Two kinds of models couplings are got up by coupling factor.The present invention devises a kind of distributed bandwidth allocation method, and this method can Effectively converge to the optimum point of optimization utility model, the i.e. optimal bandwidth allocation of the network user.
Bandwidth allocation problems description:
In P2P file sharing network, each user is connected to internet by access link, downloads altogether from other users Enjoy file.The diaphyseal portion of internet uses the communication technologys such as optical fiber at present, and transmission speed is very fast, is not easy under normal circumstances Extensive congestion phenomenon occurs, the access link of user terminal also just becomes net just at the bottleneck for influencing user satisfaction at this time The key point of network resource allocation and management.Currently, what is taken when many user Internet access is to upload link and downloading chain The situation that road mutually separates, such as ADSL (Asymmetrical Digital Subscriber Loop, abbreviation ADSL), and a user is when providing file download service for other users, and the uploading bandwidth of the user is to other network users For be exactly resource, how much the bandwidth of acquisition will directly influence the satisfaction of downloading user.
In P2P file sharing network, in order to distinguish file provider and requestor, introduce file provider's set P with File requestor's set S.As soon as long as user p provides file download service, then the user belongs to P;As long as a user s Demand file download service, then the user just belongs to S.It is assumed to be file requestor s ∈ S and the file offer of download service is provided Person's collection is combined into P (s);Meanwhile the All Files requestor collection of file provider p ∈ P offer download service is combined into S (p).It notices P ∈ P (s) is and if only if s ∈ S (p).
If file provider p is that the downloading rate that file requestor s is provided is xps, then since the user s can be from multiple Same file is downloaded at file provider, therefore total downloading rate that file requestor s is obtained is ys=∑p:p∈P(s)xps, and The download link bandwidth of the user is not to be exceededI.e.Meanwhile a file provider p can also be more simultaneously A requestor provides file download service, therefore the uploading rate of this document supplier p is zp=∑s:s∈S(p)xps, and do not answer More than the upload link bandwidth of the userI.e.
User utility function:
For file requestor s when obtaining file download service, the bandwidth allocation of satisfaction and acquisition has substantial connection, obtains Its bigger satisfaction of bandwidth obtained is also higher.Satisfaction of the user when obtaining network service can be retouched with utility function It states, selects following utility functions thus,
Wherein, wsIt is the expense that file requestor s is ready payment,It is the bandwidth that file requestor s is obtained, and parameter alpha >=0 describes fairness index.
If fairness parameter oc=0, the target of Internet resources assignment problem is exactly
The target is exactly maximization network handling capacity.
If fairness parameter oc=1, the target of Internet resources assignment problem is exactly
The target is exactly to realize the proportional fairness of resource allocation between user.
If fairness parameter oc=2, the target of Internet resources assignment problem is exactly
Or
The target is exactly to realize the harmonic average fairness of resource allocation between user, it is also assumed that being to minimize network File propagation delay time.
If the target of fairness parameter oc → ∞, Internet resources assignment problem is exactly
The target is exactly to realize the max-min fairness of resource allocation between user, wherein msIt is that file requestor s is needed The minimum amount of bandwidth of satisfaction.
Bandwidth allocation model:
There are two types of forms for the bandwidth allocation model of P2P file sharing network, the difference is that in both forms, file Whether requestor distinguishes the bandwidth from different suppliers, i.e., it is every that the satisfaction that file requestor obtains can respectively depend on it The bandwidth value of a file provider's distribution, also may rely on the sum of the bandwidth that it is obtained from all suppliers.
Model I: the satisfaction of file requestor depends on the bandwidth of each of which file provider distribution, at this time bandwidth allocation Model is
over xps≥0,p∈P,s∈S
The model is also referred to as the non-coupled optimization utility model of bandwidth allocation.
Model II: the satisfaction of file requestor only relies upon the sum of the bandwidth of its acquisition, and bandwidth allocation model is at this time
over xps≥0,p∈P,s∈S
The model is also referred to as the coupling optimization utility model of bandwidth allocation.
Consider following general utility function
Wherein vector xs=(x1s,x2s,...,xps).Here, parameter ε ∈ [0,1] is known as coupling factor, will be above two Formal model connects, if ε is bigger than normal, more focuses on coupling optimization utility model, conversely, then more focusing on non-coupled optimization utility Model.
At this point, P2P file sharing network bandwidth allocation model can be attributed to following optimization problem, referred to as P2P file is total Enjoy network bandwidth allocation problem PP
over xps≥0,p∈P,s∈S
Available using Nonlinear Programming Theory, which is convex optimization problem.As 0≤ε < 1, this is asked Objective function U (the x of topics) to variable xpsIt is stringent concave function, there are globally optimal solutionsAlso It is to say, the optimal bandwidth allocation that each file requestor obtains is unique.
Establish the Lagrangian of above-mentioned optimization problem
Wherein λs>=0 is the price of unit bandwidth collected of download link of file requestor s, μp>=0 is file provider The price for the unit bandwidth that the upload link of p is collected.
In order to be decoupled to resource allocation problem, so that distributed resource allocation method is designed, first with Jensen Inequality introduces the following conclusions.
Lemma is for any vector ξs=(ξ1s2s,...,ξps), wherein ξps> 0 andFollowing inequality at It is vertical
Wherein equation is and if only if ξps=xps/∑p:p∈P(s)xpsShi Chengli.
By the lemma, to general utility function U (xs) approximation processing is carried out, it obtains
At this point, P2P file sharing network bandwidth allocation problems PP can be approximated to be following optimization problem, referred to as P2P file Shared network bandwidth allocation Approximation Problem AP
over xps≥0,p∈P,s∈S
The Lagrangian of the problem is
Lagrangian at this time is to variable xpsIt is separation, it is available to be directed to variable xpsSub- gradient be
Therefore P2P file sharing network bandwidth allocation Approximation Problem AP can be solved using sub- gradient method.In fact, by In with parameter ξs, thereforeContain U (xs) multiple approximate functions.As a given initial value ξsWhen, P2P text Part shares a solution actually son of P2P file sharing network bandwidth allocation problems PP of network bandwidth allocation Approximation Problem AP Optimization solution.It can be proved by method of convex programming, the continuous iteration ξ of the method proposed through the inventions, P2P file sharing network The solution of bandwidth allocation Approximation Problem AP is by the optimal solution of Step wise approximation P2P file sharing network bandwidth allocation problems PP.
The method of the present invention mainly includes P2P file sharing network, file requestor s and file provider's p, P2P file There is the objective function of coupling in shared network bandwidth allocation problem, consider that P2P file sharing network bandwidth allocation is close to decouple Like problem, P2P file sharing network bandwidth allocation Approximation Problem is obtained most using the bandwidth allocation methods based on price mechanism Excellent bandwidth allocation simultaneously calculates regulatory factor, then by regulatory factor Step wise approximation P2P file sharing network bandwidth allocation problems, and The optimal bandwidth allocation of P2P file sharing network bandwidth allocation problems is obtained, i.e. file provider p is file requestor s distribution Optimum bandwidth.
The step of bandwidth allocation methods, is as follows:
Step 1, in P2P file sharing network, in t moment, file provider p is that each of which file requestor s is initial Change downloading rate xps(t), the download link of file requestor s initializes the price λ collecteds(t), the upload of file provider p The price μ that link initialization is collectedp(t);
Step 2, if x at this timeps(t) be P2P file sharing network bandwidth allocation problems PP optimum point, then To the optimal bandwidth allocation of file requestor s, then method stops, and is otherwise downwardly into step 3;
Step 3, the bandwidth meter that file requestor s is distributed according to all supplier P (s) for providing file download service for it Calculation obtains ξps(t);
In formula, p is file provider;S is file requestor;P (s) is that the All Files of file download service are provided for s Supplier's set;xps(t) be file provider p be file requestor s distribution downloading rate;ξpsIt (t) is then to make P2P file Shared network bandwidth allocation Approximation Problem AP approaches the regulatory factor of P2P file sharing network bandwidth allocation problems PP.
Step 4, the downloading rate x that file provider p is obtained according to file requestor s in t momentps(t), file requestor The price λ that the download link of s is collecteds(t), the price μ that the upload link of file provider p is collectedp(t), adjustment the t+1 moment its For the downloading rate x of file requestor s distributionps(t+1);
In formula, xps(t) be t moment supplier p be file requestor s distribution downloading rate;λsIt (t) is file requestor The price that the download link of s is collected;μp(t) be file provider p the price collected of upload link;wsIt is that file requestor s is willing to The expense of meaning payment;ξpsIt (t) is that P2P file sharing network bandwidth allocation Approximation Problem AP is made to approach P2P file sharing network band The regulatory factor of wide assignment problem PP;ε is the coefficient of coup of optimization utility model;κ is method iteration step length, and κ > 0;Parameter alpha > 0 is fairness index, if α=1, then realizes the proportional fairness of resource allocation between user, if α=2, realize user it Between the harmonic average fairness of resource allocation realize the max-min fairness of resource allocation between user if α → ∞.
It is meant that
If xps(t) > 0, then
If xps(t)=0, then
Step 5, the download link of file requestor s updates the price λ that its t+1 moment collects using following methodss(t+1)
In formula, p is file provider;S is file requestor;P (s) is that the All Files of file download service are provided for s Supplier's set;xps(t) be t moment file provider p be file requestor s distribution downloading rate;λsIt (t) is file request The price that the download link of person s is collected in t moment;ys(t) it is total downloading rate that file requestor s is obtained in t moment;It is The download link bandwidth of file requestor s;γ is method iteration step length, and γ > 0;
It is meant that
If λs(t) > 0, then
If λs(t)=0, then
The upload link utilization following methods of file provider p update the price μ collected at its t+1 momentp(t+1);
In formula, p is file provider;S is file requestor;S (p) is to receive file provider p to provide file download clothes The file requestor of business gathers;μp(t) be t moment file provider p the price collected of upload link;xpsIt (t) is t moment text Part supplier p is the downloading rate of file requestor s distribution;zp(t) be file provider p upload link be file requestor Total uploading rate of distribution;It is the upload link bandwidth of file provider p;γ is method iteration step length, and γ > 0;
It is meant that
If μp(t) > 0, then
If μp(t)=0, then
Step 6, if x at this timeps(t+1) be not P2P file sharing network bandwidth allocation Approximation Problem AP optimum point, then into Enter step 4;Otherwise, 2 are entered step, iteration is until obtain the optimum point of P2P file sharing network bandwidth allocation problems PP;
Step 7, when having, new file provider or file requestor are added or original file provider or file are asked The person of asking exits, then to reach new P2P file sharing network bandwidth allocation problems PP optimum point, i.e., step 1 to step 6 re-starts File provider is the optimum bandwidth of file requestor's distribution in new P2P file sharing network.
Convergence:
Convergence is the important indicator of balancing method performance.The present invention considers 2 file service suppliers, 3 files The situation of service requester, as shown in Figure 2.Wherein, the upload link bandwidth of file provider isThe download link bandwidth of file requestor is 10)Mbps.The present invention analyze the uploading bandwidth of file provider between file requestor ratio fair allocat (i.e. α= 1), each simulation result is as shown in Fig. 3,4,5,6,7.This method is actually made of two layers of iterative process, and method as shown in Figure 3 is received Relationship between the total the number of iterations held back and interior loop iteration number, it can be found that the number of iterations and interior cycle-index are basic in total On be in a linear relationship.Under half coupling scenario (i.e. ε=0.5), the optimal bandwidth allocation that file requestor obtains such as Fig. 4,5,6 Shown, the optimal bandwidth allocation that wherein file requestor 1 obtains from file provider isAs shown in Figure 4.Effectiveness such as Fig. 7 institute that each file requestor obtains at this time Show.Therefore, method can effectively converge to the optimum point of optimization utility model in limited the number of iterations, realize Netowrk tape Reasonable distribution of the width between each user.
Embodiment described above only describe the preferred embodiments of the invention, not to model of the invention It encloses and is defined, without departing from the spirit of the design of the present invention, those of ordinary skill in the art are to technical side of the invention The various changes and improvements that case is made should all be fallen into the protection scope that claims of the present invention determines.

Claims (2)

1. a kind of P2P file sharing network fair bandwidth sharing method based on optimization utility mainly includes P2P file-sharing net Network, file requestor s and file provider p, it is characterised in that: in P2P file sharing network, at file requestor s Carry link bandwidth capacityWith the upload link bandwidth capacity of file provider pUnder certain constraint, P2P file-sharing net Network bandwidth allocation problems PP is exactly the maximization for realizing file sharing network effectiveness, and P2P file sharing network bandwidth allocation is close It is exactly to realize that the approximate of file sharing network effectiveness maximizes like problem AP;The download link and file of file requestor s are mentioned The upload link of donor p is fixed a price, and adjusts link price according to the traffic conditions of chain road dynamic, and file provider p exists When providing file download service for file requestor s, the valence collected according to file requestor s current downloading rate and link Lattice, dynamic adjust fair allocat of the upload link bandwidth of file provider p between file requestor, finally realize all texts The optimum allocation of part supplier's bandwidth;The step of fair bandwidth sharing method, is as follows:
Step 1, in P2P file sharing network, in t moment, file provider p is each file requestor s initialization downloading Rate xps(t), the download link of file requestor s initializes the price λ collecteds(t), at the beginning of the upload link of file provider p The price μ that beginningization is collectedp(t);
Step 2, if x at this timeps(t) be P2P file sharing network bandwidth allocation problems PP optimum point, then obtaining text The optimal bandwidth allocation of part requestor s, then algorithm stops;Otherwise it is downwardly into step 3;
Step 3, file requestor s is obtained according to the bandwidth calculation that all supplier P (s) for providing file download service for it are distributed To regulatory factor ξps(t), ξpsIt (t) is that P2P file sharing network bandwidth allocation Approximation Problem AP is made to approach P2P file-sharing net The regulatory factor of network bandwidth allocation problems PP;Regulatory factor ξps(t) calculating formula is as follows:
In formula, p is file provider;S is file requestor;P (s) is to provide the All Files of file download service for s to provide Person's set;xps(t) be file provider p be file requestor s distribution downloading rate;
Step 4, the downloading rate x that file provider p is obtained according to file requestor s in t momentps(t), file requestor s The price λ that download link is collecteds(t), the price μ that the upload link of file provider p is collectedp(t), the adjustment t+1 moment is file The downloading rate x of requestor s distributionps(t+1);
In formula, xps(t) be t moment file provider p be file requestor s distribution downloading rate;λsIt (t) is file requestor The price that the download link of s is collected;μp(t) be file provider p the price collected of upload link;wsIt is that file requestor s is willing to The expense of meaning payment;ξpsIt (t) is that P2P file sharing network bandwidth allocation Approximation Problem AP is made to approach P2P file sharing network band The regulatory factor of wide assignment problem PP;ε is the coefficient of coup of optimization utility target;K is algorithm iteration step-length, and k > 0;Parameter alpha > 0 is fairness index, as α=1, realizes the proportional fairness of resource allocation between user, as α=2, is realized between user The harmonic average fairness of resource allocation then realizes the max-min fairness of resource allocation between user as α → ∞;
It is meant that If xps(t) > 0, then xps(t+1)=xps(t)+kxps(t)(ws(ε(ξps(t))α+(1-ε))(xps(t))s(t)-μp(t)); If xps(t)=0, then
xps(t+1)=max { 0, xps(t)+kxps(t)(ws(ε(ξps(t))α+(1-ε))(xps(t))s(t)-μp(t))};
Step 5, the price λ that the download link update t+1 moment of file requestor s collectss(t+1);The upload of file provider p Link updates the price μ collected at the t+1 momentp(t+1);
In formula, p is file provider;S is file requestor;P (s) is to provide the All Files of file download service for s to provide Person's set;xps(t) be t moment file provider p be file requestor s distribution downloading rate;λsIt (t) is file requestor s The price collected in t moment of download link;ys(t) it is total downloading rate that file requestor s is obtained in t moment;It is text The download link bandwidth of part requestor s;γ is algorithm iteration step-length, and γ > 0;
It is meant that
If λs(t) > 0, then
If λs(t)=0, then
In formula, p is file provider;S is file requestor;S (p) receives file provider p and provides file download service File requestor's set;μp(t) be t moment file provider p the price collected of upload link;xpsIt (t) is that t moment file mentions Donor p is the downloading rate of file requestor s distribution;zpIt (t) is that the upload link of file provider p distributes for file requestor Total uploading rate;It is the upload link bandwidth of file provider p;γ is algorithm iteration step-length, and γ > 0;
It is meant that
If μp(t) > 0, then
If μp(t)=0, then
Step 6, if the downloading rate x at t+1 moment at this timepsIt (t+1) is not P2P file sharing network bandwidth allocation Approximation Problem AP Optimum point, then enter step 4 and recalculate;If the downloading rate x at t+1 moment at this timepsIt (t+1) is P2P file sharing network The optimum point of bandwidth allocation Approximation Problem AP then enters step 2, and iteration is asked until obtaining P2P file sharing network bandwidth allocation Inscribe the optimum point of PP;
Step 7, when thering is new file provider or file requestor to be added or original file provider or file requestor It exits, then to reach the optimum point of new P2P file sharing network bandwidth allocation problems PP, i.e., newly step 1 to step 6 re-starts File provider is the optimum bandwidth of file requestor's distribution in P2P file sharing network.
2. the P2P file sharing network fair bandwidth sharing method according to claim 1 based on optimization utility, feature Be: algorithm is made of two layers of iteration, and in the interior circulation that step 4 and 5 are constituted, the optimum point that algorithm iteration reaches is exactly P2P The optimum point of file sharing network bandwidth allocation Approximation Problem AP;And in the outer circulation that step 2 to 6 is constituted, P2P file-sharing The optimum point of network bandwidth allocation Approximation Problem AP constantly approaches the global optimum of P2P file sharing network bandwidth allocation problems PP Point, i.e., file provider is the optimum bandwidth of file requestor's distribution in P2P file sharing network.
CN201610081371.6A 2016-02-04 2016-02-04 P2P file sharing network fair bandwidth sharing method based on optimization utility Active CN105721573B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610081371.6A CN105721573B (en) 2016-02-04 2016-02-04 P2P file sharing network fair bandwidth sharing method based on optimization utility

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610081371.6A CN105721573B (en) 2016-02-04 2016-02-04 P2P file sharing network fair bandwidth sharing method based on optimization utility

Publications (2)

Publication Number Publication Date
CN105721573A CN105721573A (en) 2016-06-29
CN105721573B true CN105721573B (en) 2019-06-25

Family

ID=56156563

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610081371.6A Active CN105721573B (en) 2016-02-04 2016-02-04 P2P file sharing network fair bandwidth sharing method based on optimization utility

Country Status (1)

Country Link
CN (1) CN105721573B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107172125B (en) * 2017-04-21 2020-07-28 燕山大学 Cross-layer P2P resource sharing network bandwidth fair allocation algorithm
CN108924881B (en) * 2018-08-20 2021-09-17 中国联合网络通信集团有限公司 Vehicle-mounted flow distribution method and system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577670A (en) * 2008-05-07 2009-11-11 华为技术有限公司 Method, device and system for bandwidth allocation
CN101895580A (en) * 2010-07-15 2010-11-24 上海大学 Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction
CN102202344A (en) * 2011-05-25 2011-09-28 重庆邮电大学 Cross-layer congestion control method based on game theory in wireless Mesh network
WO2012149748A1 (en) * 2011-09-19 2012-11-08 华为技术有限公司 Network optimization traffic control method, device and system
CN105471997A (en) * 2015-12-04 2016-04-06 燕山大学 Flow control method for P2P file sharing network based on price mechanism

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8108248B2 (en) * 2009-03-06 2012-01-31 Microsoft Corporation Market design for a resource exchange system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577670A (en) * 2008-05-07 2009-11-11 华为技术有限公司 Method, device and system for bandwidth allocation
CN101895580A (en) * 2010-07-15 2010-11-24 上海大学 Bandwidth allocation method for scalable video streaming in multi-overlay network based on auction
CN102202344A (en) * 2011-05-25 2011-09-28 重庆邮电大学 Cross-layer congestion control method based on game theory in wireless Mesh network
WO2012149748A1 (en) * 2011-09-19 2012-11-08 华为技术有限公司 Network optimization traffic control method, device and system
CN105471997A (en) * 2015-12-04 2016-04-06 燕山大学 Flow control method for P2P file sharing network based on price mechanism

Also Published As

Publication number Publication date
CN105721573A (en) 2016-06-29

Similar Documents

Publication Publication Date Title
Huang et al. A services routing based caching scheme for cloud assisted CRNs
Jiang et al. Orchestrating massively distributed CDNs
CN103475719B (en) The content distribution method that in a kind of CDN-P2P UNE, cross-domain flow rate minimizes
US9003029B2 (en) Method, apparatus and system for joint optimization
Courcoubetis et al. Incentives for large peer-to-peer systems
CN105721573B (en) P2P file sharing network fair bandwidth sharing method based on optimization utility
CN109729507B (en) D2D cooperative caching method based on incentive mechanism
CN105471997B (en) Flow control methods in a kind of P2P file sharing network based on price mechanism
Chen et al. Learn-and-adapt stochastic dual gradients for network resource allocation
Tuncer et al. Scalable cache management for ISP-operated content delivery services
Eghbali et al. Bandwidth allocation and pricing for SDN-enabled home networks
CN110365568A (en) A kind of mapping method of virtual network based on deeply study
CN108199881B (en) Ultra-low loss optical fiber replacement scheduling method and system in backbone network
Liu et al. Resource allocation for video transcoding and delivery based on mobile edge computing and blockchain
CN110972227B (en) Seed node selection method for offloading cellular traffic through opportunistic mobile networks
Liu et al. A multi-tier cost model for effective user scheduling in fog computing networks
Liu et al. Minimizing age-of-information with throughput requirements in multi-path network communication
CN111447266A (en) Mobile edge calculation model based on chain and service request and scheduling method thereof
Sina et al. CaR-PLive: Cloud-assisted reinforcement learning based P2P live video streaming: a hybrid approach
CN103581329B (en) The construction method of peer-to-peer network flow medium live system topological structure based on sub-clustering
US20120259920A1 (en) Peer-to-peer communication according to transmission capacity
Li et al. Receiving-capacity-constrained rapid and fair disaster backup for multiple datacenters in SDN
Bruni et al. Network decomposition and multi‐path routing optimal control
CN110769023B (en) Point-to-point content distribution network system based on intelligent home gateway
Qadeer et al. Flow-level dynamic bandwidth allocation in SDN-enabled edge cloud using heuristic reinforcement learning

Legal Events

Date Code Title Description
PB01 Publication
C06 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20220531

Address after: No. 9, Jiqing Road, Dingshan street, Jiangbei new district, Nanjing, Jiangsu 210000

Patentee after: Zhairenqiao (Nanjing) Network Technology Co.,Ltd.

Address before: 066004 No. 438 west section of Hebei Avenue, seaport District, Hebei, Qinhuangdao

Patentee before: Yanshan University