CN107172125B - Cross-layer P2P resource sharing network bandwidth fair allocation algorithm - Google Patents

Cross-layer P2P resource sharing network bandwidth fair allocation algorithm Download PDF

Info

Publication number
CN107172125B
CN107172125B CN201710266019.4A CN201710266019A CN107172125B CN 107172125 B CN107172125 B CN 107172125B CN 201710266019 A CN201710266019 A CN 201710266019A CN 107172125 B CN107172125 B CN 107172125B
Authority
CN
China
Prior art keywords
service
service provider
bandwidth
network
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
CN201710266019.4A
Other languages
Chinese (zh)
Other versions
CN107172125A (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 CN201710266019.4A priority Critical patent/CN107172125B/en
Publication of CN107172125A publication Critical patent/CN107172125A/en
Application granted granted Critical
Publication of CN107172125B publication Critical patent/CN107172125B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities

Abstract

A cross-layer P2P resource sharing network bandwidth fair allocation algorithm, each service requester of P2P network calculates the aggregate bandwidth and the price paid to the whole network according to the bandwidth allocated by each service provider; the service requester obtains an actual price to be paid to the service provider based on the price paid to the network and the price charged by the link in the IP network; the service provider obtains the expected price of the service provider according to the actual price paid to the service provider by the service requester; the service provider adjusts the bandwidth allocated to the service requester at the time t +1 according to the bandwidth allocated to each service requester at the time t, the price paid to the service provider by each service requester and the expected price of the service provider; calculating the aggregate flow on the link by the link in the IP network according to the flow passing through the link, and adjusting the price charged at the t +1 moment; each service provider iterates according to the above steps until an optimal point is reached. The invention has the advantages of fair bandwidth allocation, backbone network flow control and the like.

Description

Cross-layer P2P resource sharing network bandwidth fair allocation algorithm
Technical Field
The invention relates to the technical field of computer networks, in particular to a cross-layer P2P resource sharing network bandwidth fair allocation algorithm based on a price mechanism.
Background
The P2P network is a system for realizing resource sharing by integrating various resources such as storage, computation, files and the like at the edge of the network. Unlike the traditional client/server model, P2P adopts the distributed resource sharing mode of operation, and each node in the network can contribute resources to the whole network, such as providing file sharing and downloading. Therefore, as the number of nodes in the network increases, the service capacity that the network can provide increases, and the increase in the system scale is easy to meet the demand of the user for acquiring resources.
In the P2P resource sharing network, a node requiring resources can be served by a plurality of other nodes, thereby overcoming the limitation of a centralized server, greatly improving the use efficiency of network resources, and improving the service quality of users requiring network resources. At present, mature software realizes P2P network resource sharing and downloading, for example, bt (bittoitent), emuie (verycd), thunderbolt (Thunder) and other software attract huge user groups by providing rich resources such as images, files, book materials and good user experience, thereby realizing resource sharing in a large range.
In the P2P resource sharing network, each node wants to maximize its own download bandwidth when acquiring services provided by other nodes, thereby improving its own user experience and satisfaction. Therefore, it becomes very important how to distribute the upload bandwidth of the nodes providing the resource service fairly among the service requesters. There are also related documents that propose a bandwidth allocation scheme for P2P resource sharing network. For example, chinese patent application No. 201510778746.X, published japanese patent No. 2016.03.30, entitled "bandwidth allocation algorithm in P2P file sharing network based on price mechanism", designs a class of bandwidth allocation algorithms in P2P file sharing network based on price mechanism for implementing fair allocation of upload bandwidth of resource providers among resource demanders. The bandwidth fair allocation algorithm of the P2P file sharing network based on utility optimization is designed in a patent named as 'fair allocation algorithm of P2P file sharing network bandwidth based on utility optimization' of chinese patent application No. 2016100813716, published japanese 2016.06.29, and can realize the optimal point of the utility optimization problem of bandwidth resource allocation of coupled type and uncoupled type.
In academic thesis, "university of southeast university of east (nature science edition)" 2008/S1, "a peer-to-peer network bandwidth allocation scheme based on game theory," to solve the problem of bandwidth allocation of multiple heterogeneous download nodes from multiple source nodes in a peer-to-peer network, a peer-to-peer network bandwidth allocation scheme based on a water flooding algorithm and capable of accommodating selfish nodes is proposed. In "computer application" 2015 6, the "bandwidth allocation policy optimized in peer-to-peer network streaming media network based on network coding" proposes a node bandwidth resource balancing policy based on load transfer for application to a P2P streaming media system adopting a network coding technique, so as to avoid overload of nodes formed by nodes selecting neighbor nodes and requesting for randomness of bandwidth resources as much as possible. "peer-to-peer network resource allocation based on Nash bargaining" in "computer application" 2015 No. 9 proposes a resource allocation scheme based on Nash bargaining that ensures the minimum service quality of nodes, and the cooperative nodes obtain more resources than the non-cooperative nodes, and proves that the larger the relative bargaining power of the nodes in the cooperative game is, the more resources the nodes obtain and the higher the profit is.
The above documents basically design bandwidth allocation algorithms, flow control algorithms, resource management algorithms, etc. from the perspective of the application layer of the peer-to-peer network, and do not consider how these bandwidth allocation algorithms are merged with the existing backbone network, such as an IP network, that is, the bandwidth allocation algorithms of the application layer are not combined with the flow control in the IP network. In fact, P2P applications have become the largest consumer of IP network resources, greatly surpass the data traffic of Web, E-mail, FTP, etc., becoming the main burden of the backbone network, and even causing network congestion, thereby degrading and affecting the performance of other services. The method combines the bandwidth fair distribution of the peer-to-peer network and the bandwidth distribution of the IP network link, realizes the cross-layer bandwidth distribution of the P2P network and the IP network, effectively controls the flow in a backbone network while meeting the requirement of node resource sharing and downloading in the peer-to-peer network, avoids the congestion of the backbone network and improves the network performance.
Disclosure of Invention
The invention aims to provide a cross-layer P2P resource sharing network bandwidth allocation algorithm which has fair and reasonable allocation, effectively shares and downloads node resources and can control the flow of a backbone network.
In order to realize the purpose, the following technical scheme is adopted: the algorithm of the invention mainly comprises a P2P peer-to-peer network, a service requester s, a service provider P and an IP network link l, wherein in the P2P peer-to-peer network, the service requester s needs to obtain the services provided by the service provider P, such as file sharing and downloading, for which the service provider P needs to allocate the uploading bandwidth for the service requester s and complete the data transmission service through the existing IP network. And the service provider p calculates the optimal bandwidth distributed by the service provider p for the service requester s according to the price paid by the service requester s and the price charged by the link l.
The algorithm comprises the following steps:
step 1, in P2P peer-to-peer network, service provider P providing download service initializes bandwidth allocation, initializes allocated bandwidth x for each service requester s at time tps[t]；
Step 2, if the bandwidth allocation x is carried out at this timeps[t]Has already been used forIf the optimal point of the resource allocation model is reached, the algorithm is ended, the service provider p transmits data to the service requester s according to the rate, otherwise, the step 3 is carried out downwards;
step 3, at the time t, each service requester s distributes the bandwidth x to each service provider p according to the service providersps[t]Calculating the resultant aggregate bandwidth ys[t]；
Figure GDA0002489830310000041
Wherein s is a service requestor; p is a service provider; p(s) is a set of service providers that provide download services for service requesters s;
step 4, at the time t, each service requester s obtains the aggregate bandwidth y according to the aggregate bandwidths[t]Calculating the price lambda that it should pay to the whole networks[t]；
Figure GDA0002489830310000042
In the formula, wsIs the cost paid by service requester s; > 0 is a small positive number, thereby avoiding the price λ paid by the service requester ss[t]Too large;
step 5, at time t, link l in IP network initializes its price μl[t]；
Step 6, the link l in the IP network is according to the flow x passing through the linkps[t]Calculating to obtain the aggregation flow z on the linkl[t]；
Figure GDA0002489830310000043
Wherein, s (p) is the set of all service requesters of the service provider p providing the download service; p is the set of all service providers; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s,
Figure GDA0002489830310000044
is a function of 0-1, if the traffic of the service provider p serving the service requester s passes through the link l
Figure GDA0002489830310000045
Is 1, otherwise
Figure GDA0002489830310000046
Is 0;
step 7, the link l is according to the aggregation flow z on the linkl[t]Link bandwidth C with itselflAdjusting the price μ charged at time t +1l[t+1]；
Figure GDA0002489830310000051
Where β > 0 is the iteration step size ClIs the bandwidth of link l;
Figure GDA0002489830310000052
it is meant that,
mu.s ofl[t]If greater than 0, then
Figure GDA0002489830310000053
Mu.s ofl[t]When the value is equal to 0, then
Figure GDA0002489830310000054
Step 8, the service requester s pays the price lambda of the network according to its[t]And price mu charged by link l in IP networkl[t]Calculating the actual price gamma to be paid to the service provider pps[t]；
Figure GDA0002489830310000055
Where L (p, s) is the path from service provider p to service requestor s, which is a non-empty subset of link set L, and the price γps[t]Is the service requester sPrice to be paid to networks[t]Price charged to transmission path from service provider p to service requester s
Figure GDA0002489830310000056
The difference between the two;
step 9, the service provider p allocates a bandwidth x to each service requester sps[t]And a price gamma paid by each service requester s to service provider pps[t]The expected price ξ of the service provider p is calculatedp[t]；
Figure GDA0002489830310000057
Wherein, s (p) is the set of all service requesters of the service provider p providing the download service; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s; gamma rayps[t]Is the actual price paid by the service requester s to the service provider p; cpIs the upload bandwidth of service provider p;
step 10, the service provider p allocates a bandwidth x to each service requester sps[t]And a price gamma paid by each service requester s to service provider pps[t]And expected price ξ of service provider pp[t]Adjusting the bandwidth x allocated to the service requester s at time t +1ps[t+1]
Figure GDA0002489830310000061
Figure GDA0002489830310000062
Where α > 0 is the iteration step size, xps[t]Is the bandwidth allocated by the service provider p for the service requestor s;
Figure GDA0002489830310000063
is to allocate x bandwidth to time tps[t]An estimate of (2);
Figure GDA0002489830310000064
is the bandwidth x allocated to the service provider p for the service requestor sps[t+1]An estimate of (2); theta is a low-pass filtering factor, and theta is more than 0 and less than 1, so that the problem of algorithm fluctuation caused by non-unique optimal points can be effectively solved;
Figure GDA0002489830310000065
means that
If xps[t]If greater than 0, then
Figure GDA0002489830310000066
If xps[t]When the value is equal to 0, then
Figure GDA0002489830310000067
Step 11, each service provider p iterates according to the steps 3 to 10 until an optimal point is reached, namely the service provider uploads the optimal allocation of bandwidth among the service requesters;
and step 12, if a new service provider or a service requester is added in the network or the original service provider or the original service requester is quitted, repeating the steps 1 to 10 of the iterative process until a new optimal point is reached.
Compared with the prior art, the invention has the following advantages:
1. the algorithm can effectively converge to the optimal point of the uploading bandwidth allocation of the service provider in the P2P resource sharing network, and realizes the fair allocation of the uploading bandwidth of the service provider among the service requesters.
2. The fusion of the P2P network and the IP backbone network is considered, the optimal bandwidth allocation based on the cross-layer optimization idea is realized, the flow in the backbone network is effectively controlled while the node resource sharing and downloading in the peer-to-peer network are met, the congestion of the backbone network is avoided, and the network performance is improved.
Drawings
Fig. 1 is a P2P client flow diagram of the algorithm of the present invention.
Fig. 2 is an IP link end flow diagram of the algorithm of the present invention.
Figure 3 is a 6-user network topology structure diagram of the algorithm of the present invention.
Fig. 4 is a diagram of the optimal bandwidth allocation obtained by the service requester s1 in fig. 2.
Fig. 5 is a diagram of the optimal bandwidth allocation obtained by service requester s2 in fig. 2.
Fig. 6 is a diagram of the optimal bandwidth allocation obtained by the service requester s3 in fig. 2.
Fig. 7 is a diagram of the optimal bandwidth allocation obtained by the service requester s4 in fig. 2.
Fig. 8 is a network aggregation effectiveness graph at different network sizes.
Detailed Description
The invention is further described below with reference to the accompanying drawings:
the algorithm of the invention mainly comprises a P2P peer-to-peer network, a service requester s, a service provider P and an IP network link l, wherein in the P2P peer-to-peer network, the service requester s needs to obtain the services provided by the service provider P, such as file sharing and downloading, for which the service provider P needs to allocate the uploading bandwidth for the service requester s and complete the data transmission service through the existing IP network. And the service provider p calculates the optimal bandwidth distributed by the service provider p for the service requester s according to the price paid by the service requester s and the price charged by the link l.
The algorithm comprises the following steps:
step 1, in P2P peer-to-peer network, service provider P providing download service initializes bandwidth allocation, initializes allocated bandwidth x for each service requester s at time tps[t]；
Step 2, if the bandwidth allocation x is carried out at this timeps[t]If the optimal point of the resource allocation model is reached, the algorithm is ended, the service provider p transmits data to the service requester s according to the rate, otherwise, the step 3 is carried out downwards;
step 3, at the time t, each service requester s distributes the bandwidth x to each service provider p according to the service providersps[t]Calculating the resultant aggregate bandwidth ys[t]；
Figure GDA0002489830310000081
Wherein s is a service requestor; p is a service provider; p(s) is a set of service providers that provide download services for service requesters s;
step 4, at the time t, each service requester s obtains the aggregate bandwidth y according to the aggregate bandwidths[t]Calculating the price lambda that it should pay to the whole networks[t]；
Figure GDA0002489830310000082
In the formula, wsIs the cost paid by service requester s; > 0 is a small positive number, thereby avoiding the price λ paid by the service requester ss[t]Too large;
step 5, at time t, link l in IP network initializes its price μl[t]；
Step 6, the link l in the IP network is according to the flow x passing through the linkps[t]Calculating to obtain the aggregation flow z on the linkl[t]；
Figure GDA0002489830310000083
Wherein, s (p) is the set of all service requesters of the service provider p providing the download service; p is the set of all service providers; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s,
Figure GDA0002489830310000084
is a function of 0-1, if the traffic of the service provider p serving the service requester s passes through the link l
Figure GDA0002489830310000091
Is 1, otherwise
Figure GDA0002489830310000092
Is 0;
step 7, the link l is according to the aggregation flow z on the linkl[t]Link bandwidth C with itselflAdjusting the price μ charged at time t +1l[t+1]；
Figure GDA0002489830310000093
Where β > 0 is the iteration step size ClIs the bandwidth of link l;
Figure GDA0002489830310000094
it is meant that,
mu.s ofl[t]If greater than 0, then
Figure GDA0002489830310000095
Mu.s ofl[t]When the value is equal to 0, then
Figure GDA0002489830310000096
Step 8, the service requester s pays the price lambda of the network according to its[t]And price mu charged by link l in IP networkl[t]Calculating the actual price gamma to be paid to the service provider pps[t]；
Where L (p, s) is the path from service provider p to service requestor s, which is a non-empty subset of link set L, and the price γps[t]Is the price lambda paid by the service requester s to the networks[t]Price charged to transmission path from service provider p to service requester s
Figure GDA0002489830310000098
The difference between the two;
step 9, the service provider p assigns s to each service requesterAllocated bandwidth xps[t]And a price gamma paid by each service requester s to service provider pps[t]The expected price ξ of the service provider p is calculatedp[t]；
Figure GDA0002489830310000099
Wherein, s (p) is the set of all service requesters of the service provider p providing the download service; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s; gamma rayps[t]Is the actual price paid by the service requester s to the service provider p; cpIs the upload bandwidth of service provider p;
step 10, the service provider p allocates a bandwidth x to each service requester sps[t]And a price gamma paid by each service requester s to service provider pps[t]And expected price ξ of service provider pp[t]Adjusting the bandwidth x allocated to the service requester s at time t +1ps[t+1]
Figure GDA0002489830310000101
Figure GDA0002489830310000102
Where α > 0 is the iteration step size, xps[t]Is the bandwidth allocated by the service provider p for the service requestor s;
Figure GDA0002489830310000103
is to allocate x bandwidth to time tps[t]An estimate of (2);
Figure GDA0002489830310000104
is the bandwidth x allocated to the service provider p for the service requestor sps[t+1]An estimate of (2); theta is a low-pass filtering factor, and theta is more than 0 and less than 1, so that the problem of algorithm fluctuation caused by non-unique optimal points can be effectively solved;
Figure GDA0002489830310000105
means that
If xps[t]If greater than 0, then
Figure GDA0002489830310000106
If xps[t]When the value is equal to 0, then
Figure GDA0002489830310000107
Step 11, each service provider p iterates according to the steps 3 to 10 until an optimal point is reached, namely the service provider uploads the optimal allocation of bandwidth among the service requesters;
and step 12, if a new service provider or a service requester is added in the network or the original service provider or the original service requester is quitted, repeating the steps 1 to 10 of the iterative process until a new optimal point is reached.
The present invention combines the bandwidth allocation algorithm of the application layer with the flow control in the IP network. In fact, P2P applications have become the largest consumer of IP network resources, greatly surpass the data traffic of Web, E-mail, FTP, etc., becoming the main burden of the backbone network, and even causing network congestion, thereby degrading and affecting the performance of other services. The method combines the bandwidth fair distribution of the peer-to-peer network and the bandwidth distribution of the IP network link, realizes a network bandwidth fair distribution scheme based on cross-layer optimization, effectively controls the flow in a backbone network while meeting the requirement of node resource sharing and downloading in the peer-to-peer network, avoids the congestion of the backbone network, and improves the network performance.
The cross-layer P2P resource allocation model is actually a cross-layer optimization problem, and two problems of flow control of an application layer and congestion control of a transmission layer are studied at the same time. Three different entities are involved here, a service requester (i.e. client), a service provider (i.e. server) and a service bearer (i.e. link).
The cross-layer P2P resource allocation model is as follows:
Figure GDA0002489830310000111
where S is the service requester (i.e., client), P is the service provider (i.e., server), l is the service bearer (i.e., link) in the network, S is the set of service requesters, P is the set of service providers, L is the set of links in the network, P (S) is the set of service providers that provide download services for service requester S, S (P) is the set of all service requesters that service provider P provides download services, xpsIs the bandwidth that service requestor s gets from service provider p, the total bandwidth that service requestor s gets is ysMeanwhile, the sum of the bandwidths provided by the service provider p for all the service requesters does not exceed the uploading bandwidth C of the service provider pp(ii) a And ClIs the bandwidth of the link/and,
Figure GDA0002489830310000112
is a function of 0-1, if the traffic of the service provider p serving the service requester s passes through the link l
Figure GDA0002489830310000121
Is 1, otherwise
Figure GDA0002489830310000122
Is 0; u shapes(ys) Is a utility function of the service requester s, obtains the download bandwidth y on behalf of the service requester ssTo achieve a fair distribution of the upload bandwidth of the service provider among the service requesters, U is here chosens(ys)＝wslog ysWherein w isrDescribing the fee that the service requester s is willing to pay, the utility function achieves proportional fairness of the service provider's upload bandwidth allocation among the service requesters.
In the multi-source downloading P2P service, a service requester can download the same file from multiple service providers, thereby forming multiple data streams destined for the same service requester, each data stream having its own transmissionTo this end, a path is defined from service provider p to service requestor s as L (p, s), which is a non-empty subset of link set L, if link/is on path L (p, s)
Figure GDA0002489830310000123
l ∈L (p, s), otherwise
Figure GDA0002489830310000124
Here, maximizing the aggregate utility of all service requesters is a goal for the entire P2P network, and this problem is subject to constraints on the service provider's upload bandwidth and the transmission bandwidth of the network links, for the utility function U described aboves(ys)＝wslog ysThen the resource allocation problem is for variable ysIs a strict convex optimization problem, and each service requester s has a globally optimal aggregated bandwidth value
Figure GDA0002489830310000125
For variable xpsThen instead of being strictly convex optimized, there will be multiple different optimal bandwidth allocations for each service requester s
Figure GDA0002489830310000126
The lagrange function of the above resource allocation problem is
Figure GDA0002489830310000127
In the formula, λs、νpAnd mulAre all lagrange factors, npAnd mlIs the relaxation variable. Here, the Lagrangian factor may be interpreted as the price per bandwidth in the network, then λsIs the price per bandwidth, v, paid by the service requester spIs the price per unit bandwidth, μ, charged by the service provider plIs the price per bandwidth charged by link l.
Three subproblems can be obtained for the above lagrange function decomposition:
CLIENT(s)
max Us(ys)-λsys
over ys≥0,s∈S
SERVER(p)
Figure GDA0002489830310000131
Figure GDA0002489830310000132
over xps≥0,s∈S,p∈P
LINK(l)
max μl(Cl-ml)
over μl≥0,l∈L
the practical meaning of the three above sub-problems can be given from an economic point of view:
the sub-problem C L IENT(s) because each service requester in the P2P network is selfish and wants to maximize its utility, which depends on the aggregate bandwidth y it obtainss. Meanwhile, the service requester pays for its use of the bandwidth when obtaining the corresponding bandwidth. Due to lambdasIt can be understood that the user is paid a fee per unit of bandwidth, Us(ys)-λsysIs the revenue obtained by the service requester s, i.e. the difference between the utility obtained by the user and the cost paid.
Sub-problem SERVER (p): lambda [ alpha ]sxpsIs that the service requester s obtains the bandwidth x provided by the service provider ppsFees paid from time to time ∑l:l∈L(p,s)μlIs the price, x, charged by the path L (p, s) from the service provider p to the service requestor sps∑l:l∈L(p,s)μlIs the fee that the path charges for the service requester s to carry the transport service. The practical meaning of the sub-problem is that under the premise that the uploading bandwidth of the sub-problem is certain, the file is provided for the service requester to the maximum extentThe revenue obtained by the service.
Sub-problem L INK (l) relaxation factor mlIs the remaining bandwidth of link l, then Cl-mlThat is, the bandwidth that has been allocated to each service requester s for use in transmitting data. Due to the fact thatlIs the price per unit bandwidth charged by the link l, hence μl(Cl-ml) Is the benefit of link i.
Convergence analysis
The present invention first considers the case of 2 service providers p1, p2, 4 service requesters s1, s2, s3, s4, as shown in fig. 3, the upload bandwidths of the service providers p1, p2 are 20Mbps, 25Mbps, the link bandwidth in the IP backbone network is 1000Mbps, the payment fees of the service requesters s1, s2, s3, s4 are 5, 10, 15, 20, the algorithm step length α is β is 0.05, the filter factor θ is 0.2, and the parameter is 0.01.
The invention analyzes the fair distribution of the uploading bandwidth of the service provider among the service requesters, and each simulation result is shown in fig. 4, 5, 6 and 7, for example, in fig. 7, when the iteration number is only 50, the algorithm has converged to the optimal point, at this time, the optimal bandwidth distributed by the service provider p1 for the service requester s4 is 8.1704Mbps, the optimal bandwidth distributed by the service provider p2 for the service requester s4 is 9.8296Mbps, and the optimal total bandwidth obtained by the service requester s4 is 18 Mbps. Therefore, the algorithm can effectively converge to the optimal point of the resource allocation model within a limited number of iterations.
Next, the performance of the algorithm when the number of nodes in the network increases is analyzed, at this time, the upload bandwidth of the service provider is 20Mbps, the payment fee provided by the service requester is 10, and the simulation result is shown in fig. 8. It can be seen that as the size of the network (the number of service requesters and service providers in the network) increases, the algorithm can still converge efficiently to the optimum point of the resource allocation model.
The above-mentioned embodiments are merely illustrative of the preferred embodiments of the present invention, and do not limit the scope of the present invention, and various modifications and improvements of the technical solution of the present invention by those skilled in the art should fall within the protection scope defined by the claims of the present invention without departing from the spirit of the present invention.

Claims (1)

1. A cross-layer P2P resource sharing network bandwidth fair allocation algorithm mainly comprises a P2P peer-to-peer network, a service requester s, a service provider P and an IP network link l, and is characterized in that in the P2P peer-to-peer network, the service requester s needs to obtain the service provided by the service provider P, the service provider P needs to allocate the uploading bandwidth for the service requester s, and the data transmission service is completed through the existing IP network; the service provider p calculates the optimal bandwidth distributed by the service provider p for the service requester s according to the price paid by the service requester s and the price charged by the link l;
the algorithm comprises the following steps:
step 1, in P2P peer-to-peer network, service provider P providing download service initializes bandwidth allocation, initializes allocated bandwidth x for each service requester s at time tps[t]；
Step 2, if the bandwidth allocation x is carried out at this timeps[t]If the optimal point of the resource allocation model is reached, the algorithm is ended, the service provider p transmits data to the service requester s according to the rate, otherwise, the step 3 is carried out downwards;
step 3, at the time t, each service requester s distributes the bandwidth x to each service provider p according to the service providersps[t]Calculating the resultant aggregate bandwidth ys[t]；
Figure FDA0002489830300000011
Wherein s is a service requestor; p is a service provider; p(s) is a set of service providers that provide download services for service requesters s;
step 4, at the time t, each service requester s obtains the aggregate bandwidth y according to the aggregate bandwidths[t]Calculating the price lambda that it should pay to the whole networks[t]；
Figure FDA0002489830300000012
In the formula, wsIs the cost paid by service requester s; > 0 is a small positive number, thereby avoiding the price λ paid by the service requester ss[t]Too large;
step 5, at time t, link l in IP network initializes its price μl[t]；
Step 6, the link l in the IP network is according to the flow x passing through the linkps[t]Calculating to obtain the aggregation flow z on the linkl[t]；
Figure FDA0002489830300000021
Wherein, s (p) is the set of all service requesters of the service provider p providing the download service; p is the set of all service providers; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s,
Figure FDA0002489830300000022
is a function of 0-1, if the traffic of the service provider p serving the service requester s passes through the link l
Figure FDA0002489830300000023
Is 1, otherwise
Figure FDA0002489830300000024
Is 0;
step 7, the link l is according to the aggregation flow z on the linkl[t]Link bandwidth C with itselflAdjusting the price μ charged at time t +1l[t+1]；
Figure FDA0002489830300000025
Where β > 0 is the iteration step size ClIs of link lA bandwidth;
Figure FDA0002489830300000026
it is meant that,
mu.s ofl[t]If greater than 0, then
Figure FDA0002489830300000027
Mu.s ofl[t]When the value is equal to 0, then
Figure FDA0002489830300000028
Step 8, the service requester s pays the price lambda of the network according to its[t]And price mu charged by link l in IP networkl[t]Calculating the actual price gamma to be paid to the service provider pps[t]；
Figure FDA0002489830300000029
Where L (p, s) is the path from service provider p to service requestor s, which is a non-empty subset of link set L, and the price γps[t]Is the price lambda paid by the service requester s to the networks[t]Price charged to transmission path from service provider p to service requester s
Figure FDA0002489830300000031
The difference between the two;
step 9, the service provider p allocates a bandwidth x to each service requester sps[t]And a price gamma paid by each service requester s to service provider pps[t]The expected price ξ of the service provider p is calculatedp[t]；
Figure FDA0002489830300000032
Wherein S (p) is all service requests of the service provider p for providing download servicesA set of requesters; x is the number ofps[t]Is the bandwidth allocated by the service provider p for the service requestor s; gamma rayps[t]Is the actual price paid by the service requester s to the service provider p; cpIs the upload bandwidth of service provider p;
step 10, the service provider p allocates a bandwidth x to each service requester sps[t]And a price gamma paid by each service requester s to service provider pps[t]And expected price ξ of service provider pp[t]Adjusting the bandwidth x allocated to the service requester s at time t +1ps[t+1]
Figure FDA0002489830300000033
Figure FDA0002489830300000034
Where α > 0 is the iteration step size, xps[t]Is the bandwidth allocated by the service provider p for the service requestor s;
Figure FDA0002489830300000035
is to allocate x bandwidth to time tps[t]An estimate of (2);
Figure FDA0002489830300000036
is the bandwidth x allocated to the service provider p for the service requestor sps[t+1]An estimate of (2); theta is a low-pass filtering factor, and theta is more than 0 and less than 1, so that the problem of algorithm fluctuation caused by non-unique optimal points can be effectively solved;
Figure FDA0002489830300000037
means that
If xps[t]If greater than 0, then
Figure FDA0002489830300000041
If xps[t]＝0，Then
Figure FDA0002489830300000042
Step 11, each service provider p iterates according to the steps 3 to 10 until an optimal point is reached, namely the service provider uploads the optimal allocation of bandwidth among the service requesters;
and step 12, if a new service provider or a service requester is added in the network or the original service provider or the original service requester is quitted, repeating the steps 1 to 10 of the iterative process until a new optimal point is reached.
CN201710266019.4A 2017-04-21 2017-04-21 Cross-layer P2P resource sharing network bandwidth fair allocation algorithm Active CN107172125B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710266019.4A CN107172125B (en) 2017-04-21 2017-04-21 Cross-layer P2P resource sharing network bandwidth fair allocation algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710266019.4A CN107172125B (en) 2017-04-21 2017-04-21 Cross-layer P2P resource sharing network bandwidth fair allocation algorithm

Publications (2)

Publication Number Publication Date
CN107172125A CN107172125A (en) 2017-09-15
CN107172125B true CN107172125B (en) 2020-07-28

Family

ID=59813876

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710266019.4A Active CN107172125B (en) 2017-04-21 2017-04-21 Cross-layer P2P resource sharing network bandwidth fair allocation algorithm

Country Status (1)

Country Link
CN (1) CN107172125B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108966252A (en) * 2018-07-19 2018-12-07 华北电力大学 The alliance pricing and bandwidth allocation scheme of media stream in a kind of SDN
CN110096337B (en) * 2019-05-06 2021-01-05 燕山大学 Cloud data center resource allocation method and system for enterprise application cloud deployment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577671A (en) * 2008-05-07 2009-11-11 北京启明星辰信息技术股份有限公司 Method and system for automatically controlling flow of peer-to-peer networking service
CN102026276A (en) * 2010-12-21 2011-04-20 江苏省邮电规划设计院有限责任公司 Method for guaranteeing mobile peer-to-peer network stream media service experience quality
CN105450738A (en) * 2015-11-13 2016-03-30 燕山大学 Price mechanism-based bandwidth allocation algorithm in P2P file sharing network
CN105471997A (en) * 2015-12-04 2016-04-06 燕山大学 Method for controlling flow in P2P file sharing network based on price mechanism
CN105721573A (en) * 2016-02-04 2016-06-29 燕山大学 P2P file sharing network bandwidth fairness allocation algorithm based on utility optimization

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7796611B2 (en) * 2004-06-07 2010-09-14 Alcatel Method for providing efficient multipoint network services

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577671A (en) * 2008-05-07 2009-11-11 北京启明星辰信息技术股份有限公司 Method and system for automatically controlling flow of peer-to-peer networking service
CN102026276A (en) * 2010-12-21 2011-04-20 江苏省邮电规划设计院有限责任公司 Method for guaranteeing mobile peer-to-peer network stream media service experience quality
CN105450738A (en) * 2015-11-13 2016-03-30 燕山大学 Price mechanism-based bandwidth allocation algorithm in P2P file sharing network
CN105471997A (en) * 2015-12-04 2016-04-06 燕山大学 Method for controlling flow in P2P file sharing network based on price mechanism
CN105721573A (en) * 2016-02-04 2016-06-29 燕山大学 P2P file sharing network bandwidth fairness allocation algorithm based on utility optimization

Also Published As

Publication number Publication date
CN107172125A (en) 2017-09-15

Similar Documents

Publication Publication Date Title
Balazinska et al. Contract-Based Load Management in Federated Distributed Systems.
Wang et al. Pricing network resources for adaptive applications in a differentiated services network
EP2515478B1 (en) Method, apparatus and system for joint optimizations
CN107172125B (en) Cross-layer P2P resource sharing network bandwidth fair allocation algorithm
Yolken et al. Game based capacity allocation for utility computing environments
Misra et al. Dynamic big-data broadcast in fat-tree data center networks with mobile IoT devices
Hu et al. QoE-based multi-stream scalable video adaptation over wireless networks with proxy
CN105471997A (en) Method for controlling flow in P2P file sharing network based on price mechanism
CN110971707B (en) Distributed service caching method in mobile edge network
He et al. Pricing internet services with multiple providers
Eger et al. Resource pricing in peer-to-peer networks
Shen et al. Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems
O'Donnell et al. Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy
Li et al. A novel bandwidth allocation scheme for elastic and inelastic services in peer-to-peer networks
Khan et al. Towards incentive-compatible pricing for bandwidth reservation in community network clouds
Lee et al. On the interaction and competition among Internet service providers
CN111082978A (en) SDN-oriented utility bandwidth allocation method
Meshkova et al. On utility-based network management
Quttoum et al. ARMM: An autonomic resource management mechanism for virtual private networks
Li et al. Media cloud service scheduling optimization for resource-intensive mobile application
Liu et al. Pricing and fee sharing for point to multipoint and quality guaranteed multicast services
Miao et al. Bandwidth management for mixed unicast and multicast multimedia flows with perception based QoS differentiation
Habak et al. Oscar: A deployable adaptive mobile bandwidth sharing and aggregation system
Breker et al. A simulation study of usage-based pricing strategies for packet-switched networks
Li et al. LoCoCa: Location-Context-Capacity Aware Cost Economizing in Edge-Cloud Systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for 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: 20220525

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

TR01 Transfer of patent right