# Information Exchange rather than Topology Awareness: Cooperation between P2P Overlay and Traffic Engineering

Authors: Jia Zhao; Jianfeng Guan; Changqiao Xu; Wei Su; Hongke Zhang
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

Solutions to the routing strategic conflict between noncooperative P2P overlay and ISP underlay go separate ways: hyperselfishness and cooperation. Unpredictable (possibly adverse) impact of the hyperselfish topology awareness, which is adopted in both overlay routing and traffic engineering, has not been sufficiently studied in the literature. Topology-related information exchange in a cooperatively efficient way should be highlighted to alleviate the cross-layer conflict. In this paper, we first illustrate the hyperselfish weakness with two dynamic noncooperative game models in which hyperselfish overlay or underlay has to accept a suboptimal profit. Then we build a synergistic cost-saving (SC) game model to reduce the negative effects of noncooperation. In the SC model, through information exchange, that is, the classified path-delay metrics for P2P overlay and peer locations for underlay, P2P overlay selects proximity as well as saving traffic transit cost for underlay, and ISP underlay adjusts routing to optimize network cost as well as indicating short delay paths for P2P. Simulations based on the real and generated topologies validate cost improvement by SC model and find a proper remote threshold value to limit P2P traffic from remote area, cross-AS, or cross-ISP.


---

## Body

## 1. Introduction

P2P overlay systems impose tremendous traffic load on the Internet. Traffic engineering (TE) has been employed by Internet service providers (ISPs) to improve traffic transit cost on physical networks. Although P2P system and TE independently decide their own routing in different layers, they impact on each other, because routing strategic conflict exists between them. As shown in Figure1, P2P overlay generates traffic with a profit objective to minimize all end-to-end delays, while underlay TE adjusts its routing strategy to minimize network cost. Both peers j and k in overlay have the content that peer i wants. Selfishly, peer i chooses k. Unfortunately, underlay uses physical path C
E
F
A to transit traffic t
k
i and cost (hops) two times more than path B
A from j to i. Even if i chose j, considering the background traffic in link B
A, too much traffic volume from j to a greedy peer i would be a congestion risk for underlay network. Such cross-layer conflict has been analyzed in the literature [1–6].Figure 1
Overlay and underlay routing.Negative impacts on both overlay and underlay, resulted from noncooperation, can be summarized in three aspects. (i) Different profit objectives lead to selfish routing and may increase cost of each other, for example, increasing delay for P2P and maximum link utilization (MLU) for ISP. (ii) Underlay always has slow reaction to overlay traffic change, while overlay is prone to inaccurate proximity discovery. (iii) Every time when routing changes in overlay/underlay, it takes the two-layer system a period of time to readjust and converge to a new stable equilibrium, before which the system performs unstable oscillation.Solutions for the noncooperative interaction above go separate ways as below.(i)
Hyperselfishness: more selfish than the noncooperation, self-improvement of underlay/overlay by detecting and benefiting from topology-related information of overlay/underlay without support of each other and regardless of possible profit damage to each other.
(ii)
Cooperation: topology information exchange between cooperative overlay and underlay.On the involvement of hyperselfishness, P2P overlays deploy network-aware function to make proximity selection [7–9], while ISPs upgrade traffic monitors and evolve multiprotocol label switching- (MPLS-) based TE or IP-based TE like equal-cost multipath (ECMP) [10–13]. On the involvement of cooperation, topology-related information services, such as Oracle and P4P, have been proposed and implemented [14–17]. Comparing the two ways, an inevitable problem for hyperselfish topology-awareness is the unpredictable (possibly adverse) impact on the topology-transparent one (i.e., underlay/overlay whose topology-related information is detected and known to overlay/underlay). Network-aware overlay may disarrange underlying global traffic optimization and peer-location-aware underlay may intercept and restrain overlying content-sharing flexibility. Accordingly, we have two goals in this paper: (i) to illustrate weakness of hyperselfish behaviors ans (ii) to utilize cooperation control to improve the three negative results from noncooperation.ISPs and P2P content providers (CPs) always try self-improvement unilaterally. In many practical scenarios, CP and ISP regard each other as opponent and rely much on their own technology to obtain opponent information (topology) for their selfish profit optimization. This hyperselfishness may intensify the “arm race” between CP and ISP [18]. Additionally, negative impact and inefficiency of hyperselfish topology-awareness has not been sufficiently studied in the literature. Hence, avoiding hyperselfish weakness will help CP and ISP to converge to cooperation of their own accord.P2P overlays desire end-to-end path information to find proximity and minimize delay. ISPs pursue peer locations in P2P to adjust routing and save traffic transit cost. Therefore, it is reasonable for a P2P system and an ISP to cooperate to exchange information and embody a common goal in their respective profit functions. In contrast to selfish profit loss, the common goal to reciprocate each other is a way to a win-win situation [18].In this paper, our main contributions include the following. (1) We illustrate hyperselfish weakness with two dynamic noncooperative game models. In the dynamic games, overlay/underlay initiates hyperselfish topology-awareness, and then topology-transparent underlay/overlay uses a reacting strategy as self-protection or punishment to the hyperselfish one. We explain why hyperselfish initiator, though having opponent information may not benefit more and have to bow to a suboptimal profit. (2) We build a synergistic cost-saving (SC) game model based on topology-related information exchange between underlay and overlay. On one hand, ISPs indicate a classified path metric (e.g., delay, distance, or other link cost metrics) for P2P to select proximity and generate traffic demand rationally. A remote threshold (RT) is also used to limit P2P traffic from remote area, cross-AS, or cross-ISP. On the other hand, underlay obtains peer-location information from CPs and chooses physical paths to split traffic for optimal network cost, for example, minimum MLU. Due to the cooperation above, the overlay chooses proximity as well as saving transit cost for the underlay, while the underlay decides routing to optimize network cost as well as indicating short delay path for the overlay. Simulation results validate the cost improvement by SC model and the importance of proper RT selection.The remainder of the paper is organized as follows. Section2 introduces related work. In Section 3, we use two dynamic game models to illustrate hyperselfish weakness. In Section 4, we propose the SC model and detail the mechanisms of path classes and RT selection. Simulations are shown in Section 5. Section 6 concludes the paper.


## 2. Related Work

Cross-layer conflict and negative results from noncooperation have been researched in the literature. Liu et al. first model the interaction between overlay routing and TE with a noncooperative game [1]. They consider delay as cost for both the layers and show that selfish overlay routing may cause huge cost and oscillations to the two-layer system. In the paper [3], the authors model the dynamic games in which the leader layer has preemptive strategy to restrain routing readjustment of the follower layer so as to overcome negative impact of the performance oscillations. Wang et al. study the noncooperation between P2P overlay and TE and propose that the interaction impacts the two layers and causes a nonoptimal performance of both layers [4].Solutions to the conflict are also proposed in related work. DiPalantino and Johari use the congestion signal, matched to TE objective, to obtain efficient equilibrium in the game between TE and content distribution [2]. With regard to cooperation in papers [14, 15], physical path distances are provided for P2P overlay to select closer peers and save network cost. Jiang et al. propose a game with sharing control to save costs for cooperative CPs and ISPs [16]. For P2P traffic management, bilateral cooperation between network operator and peers of P2P systems is proposed in [17]. In the paper [18], authors analyze the cross-layer interaction pattern and give an overview of information that can be exchanged between cooperative P2P systems and ISPs.One main difference between our work and the related work above lies in that we use two dynamic game models to analyze the hyperselfish behaviors of overlay/underlay who unilaterally tries topology-awareness to profit from topology information of the other one, regardless of possible damage to each other. With emergence of more and more unilateral improvement such as evolving TE or network-aware P2P systems, it is necessary to prompt ISPs and P2P systems to avoid such possibly adverse topology-awareness and use cooperation to solve cross-layer conflict. Our work also differs from [2, 16] in that the cooperation way we use is the exchanged information including peer-locations and path-delay metrics. Additionally, differing from [14, 15, 17], our paper proposes path classes and remote threshold with which ISPs and P2P systems can achieve cost improvement with a common goal to limit traffic from remote areas.


## 3. Weakness of Hyperselfishness

Diversity of topology-aware mechanisms has been used as solution to the cross-layer conflict between P2P overlay routing and ISP’s traffic engineering. These mechanisms are hyperselfish because either overlay or underlay only consider its own optimal routing and accordingly cannot deal with the possible adverse effect which causes damages to both layers. In this section, we build two dynamic game models to demonstrate the weakness of hyperselfish topology-awareness, and we use these models to explain the limitation of self-improvement from either layer.


### 3.1. Negative Impacts of Noncooperation

Both P2P overlay and ISP underlay have their own routing strategies and utility objectives. Peers in a P2P system demand contents from closer peers to obtain QoS, for example, fast file-download and fluent video playback [19, 20]. The utility of P2P overlay is to minimize total end-to-end delays. Underlay use TE and selects paths to transit traffic. The utility of the underlay is to optimize the overall network cost.Overlay and underlay independently decide their strategy, but the strategy they choose will influence the utility of each other. Accordingly, a noncooperative game model can be built for interaction between overlay and underlay [21]. In a network G
=
(
V
,
E
) and its overlay node set N and given the notations and descriptions in Notations, we model the noncooperative game as follows.Underlay chooses the routing strategyR
=
{
r
i
j
k
(
e
)
·
f
i
j
k
} by solving the problem as follows:
(1)
min
⁡
⁡
G
(
R
,
M
T
)
=
∑
e
∈
E
∑
i
,
j
∈
N
∑
k
∈
S
i
j
g
e
(
t
i
j
,
r
i
j
k
(
e
)
·
f
i
j
k
)
subject to ∑
k
‍
f
i
j
k
=
1, for all e
∈
E, S
i
j
=
{
1
,
…
,
|
p
i
j
|
}, p
i
j
=
{
p
i
j
k
}, t
e
b
+
∑
k
‍
∑
i
,
j
‍
t
i
j
·
r
i
j
k
(
e
)
·
f
i
j
k
≤
c
e.Overlay decides the overlay traffic matrixM
T
=
{
t
i
j
} by solving the problem as follows:
(2)
min
⁡
⁡
H
(
M
T
,
R
)
=
∑
e
∈
E
‍
∑
i
,
j
∈
N
‍
h
i
j
(
t
i
j
,
P
(
p
i
j
)
)
subject to t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
‍
t
i
j
·
r
i
j
k
(
e
)
·
f
i
j
k
≤
c
e, ∑
i
∈
N
‍
t
i
j
=
T
j.Functiong
e
(
·
) represents the transit cost function of link e, G
(
R
,
M
T
) is underlay’s total cost function whose value is decided by R and M
T, function h
i
j
(
·
) represents the delay from overlay node i to j, H
(
M
T
,
R
) is overlay’s total cost function whose value is decided by R and M
T, |
p
i
j
| denotes number of elements in physical path set p
i
j for i
j, and P
(
p
i
j
) denotes the underlay routing policy for logical link i
j.From this basic model, we draw three negative results from the cross-layer conflict.


#### 3.1.1. Selfish Routing Conflict

Different utilities may lead to conflicting routing strategies. P2P system select closer peers to minimize delay. When the physical path under the logical link between two peers is overloaded, this shortest-delay choice of overlay may be a congestion risk to underlay links. On the other side, because underlay uses TE to optimize global traffic transit regardless of QoS of P2P overlay, TE routing adjustment may map overlay logical link between geographically nearby peers into a long-delay physical path.


#### 3.1.2. Inefficiently Detecting Each Other

ISPs always deploy infrastructures to monitor traffic and update a traffic matrix periodically, so as to make optimal routing selection. Yet, overlay is always active and the traffic changes frequently. So, underlay routing is not instantly adjusted and subject to time lag. Besides, inefficient network-aware machinery of P2P overlay may cause inaccurate proximity selection.


#### 3.1.3. Slow Convergence and Oscillation

Although it can be proved that strategy equilibrium exists in the game, the actual converging process will experience several rounds of adjustments from both overlay and underlay. During these rounds, selfish and rational overlay/underlay will react to the other by changing routing to obtain optimal utility again and again. Frequent readjustment (oscillation) and longtime of equilibrium convergence will bring systematic instability.


### 3.2. Hyperselfish Weakness of Overlay

We regard overlay and underlay as two players in the dynamic game. Unlike simultaneous strategy decision of noncooperative game in Section3.1, one player in the dynamic game decides his strategy before the other one decides his, and the later player has the information of the first’s choice [22]. Hyperselfish overlay as the later player tries to use network-awareness to obtain underlay routing information and make selfish profit optimization regardless of possible profit damage to underlay. As the first player, underlay has the advantage of knowing overlay’s strategic rule which underlay can use to decide an optimal reacting strategy to restrain overlay profit to be suboptimal. To analyze weakness of overlay hyperselfish behavior, we model the dynamic game as follows.According to the detected underlay strategyR, overlay chooses optimal traffic matrix as follows:
(3)
M
T
*
(
R
)
=
arg
min
⁡
⁡
H
(
M
T
,
R
)
.
Underlay punishes the hyperselfish behavior M
T
*
(
R
) with an optimal reacting routing strategy as follows:
(4)
R
*
=
arg
min
⁡
⁡
G
(
M
T
*
(
R
)
,
R
)
subject to ∑
k
‍
f
i
j
k
*
=
1, S
i
j
*
=
{
1
,
…
,
|
p
i
j
*
|
}, p
i
j
*
=
{
p
i
j
k
*
}, for all e
∈
E, t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
*
‍
t
i
j
*
·
r
i
j
k
*
(
e
)
·
f
i
j
k
*
≤
c
e, ∑
i
∈
N
‍
t
i
j
*
=
T
j, i
,
j
∈
N.In this game, hyperselfish overlay obeys the strategic ruleM
T
*
(
R
) to generate as much as possible traffic M
T
* via the detected short-delay paths from network-awareness result R. This behavior is a congestion risk and disarranges underlying global traffic optimization. To restrain this hyperselfishness, underlay can use (4) to first choose action R
* as self-protection before overlay’s possible adverse action M
T
*
(
R
).Proposition 1.
A subgame perfect information Nash Equilibrium solution exists in the dynamic game about overlay hyperselfish behavior, if link cost functiong
e and overly delay cost function h
i
j are all continuous.Proof.
On any linke, overlay traffic is subject to t
over
e
≤
c
e. There are strategic constrains of ∑
k
‍
f
i
j
k
=
1 and ∑
i
∈
N
‍
t
i
j
=
T
j. So, solution set S
=
{
(
M
T
,
R
)
} is a closed space. Because g
e and h
i
j are continuous, continuous function gets minimal value at the solution R
*, and H gets the minimal value at M
T
*. We have the inequalities as G
(
M
T
*
,
R
*
)
≤
G
(
M
T
*
,
R
) and H
(
M
T
*
,
R
*
)
≤
H
(
M
T
,
R
*
). When overlay decides the policy M
T
* and underlay decides the policy R
*, they will not deviate from this equilibrium solution, because they cannot gain more profit with other policies. Therefore, (
M
T
*
,
R
*
) is a subgame perfect information Nash Equilibrium.Proposition 2.
Overlay’s hyperselfish behavior and underlay’s reaction can be modeled as the Stackelberg competition.Stackelberg’s leadership model [23] is a game between two players; one of which is the leader and decides his strategy first and the other one is the follower and decides his strategy after the leader’s decision. In the competition between overlay and underlay, underlay is the leader who first deploys traffic engineering in its networks to limit the traffic from selfish overlay routing.Proposition 3.
Overlay hyperselfish behavior can just obtain a suboptimal profit when underlay decides an optimal reacting strategy to restrain the overlay.Proof.
Underlay takes the leadership to control the traffic through its networks. The control strategies are decided to limit some unfriendly traffic that cause high transit cost and to ensure QoS of ISP-friendly traffic. P2P traffic and background traffic (from ISP-friendly applications) will compete for network bandwidth. The dynamic game can be formatted as follows:(5)
t
i
j
*
(
P
(
p
i
j
)
)
=
arg
max
⁡
⁡
∑
P
(
p
i
j
)
‍
t
i
j
,
(6)
P
*
(
p
i
j
)
=
arg
min
⁡
⁡
∑
e
∈
E
‍
∑
i
,
j
∈
N
‍
∑
k
∈
S
‍
w
e
·
t
i
j
*
(
P
(
p
i
j
)
)
·
r
i
j
k
(
e
)
·
f
i
j
k
.
Hyperselfish P2P overlay obeys the rulet
i
j
*
(
P
(
p
i
j
)
) to generate as much as possible traffic on its detected short-delay path p
i
j. Underlay uses P
*
(
p
i
j
) as a congestion-proof strategy to reserve some bandwidth, leave enough bandwidth for ISP-friendly traffic, and leave the limited bandwidth for P2P traffic on the path p
i
j.
Considering each single link, we have the link costl
=
t
e
·
w
e. As shown in Figure 2, l
1, l
2, and l
3 are three different equal-cost curves. Vertical axis indicates traffic amounts t
e. Horizontal axis indicates w
e, that is, link cost per traffic unit. Suppose that the link capacity is C
e. Curve b represents P2P traffic up-bound limited by ISP at each link (across horizontal W-axis). Curve b is an increasing function because we want t
under
=
C
e
-
b
(
w
e
) to be the bandwidth for ISP-friendly traffic. The cheaper (e.g., shorter delay or lower congestion) the link is, the more ISP-friendly traffic the link has, so that it ensures QoS of ISP-friendly traffic. According to (6), the underlay’s strategy is to obtain the minimum link cost l
=
t
e
·
w
e. From the three equal cost curves, underlay will choose l
3. According to (5), overlay will choose t
over from the three points P
1, P
2, and P
3 on curve b because they are the maximum traffic volumes the overlay can generate. According to Proposition 2, underlay is the leader in this game and first chooses l
3. Then overlay follows underlay’s decision to choose the value t
over in Figure 2. Hence, cross-point P
3 is the equilibrium point of overlay and underlay. Compared with P
1 and P
2, P2P overlay traffic t
over at equilibrium point P
3 is a suboptimal traffic.Figure 2
Suboptimal profit for hyperselfish overlay.For example in Figure1, peer i chooses peer j rather than peer k to generate traffic demand, because overlay detects that underlay uses shorter (one hop) path 1 to transit traffic from j to i. If ISP limits P2P traffic on path B
A, the low available bandwidth for P2P traffic on this path may also cause long time overlay delay. In this case, P2P’s network-aware machinery is of no avail.Take the interaction between MPLS-TE and network-aware P2P as an example. Suppose that a P2P system deploys the topology-aware algorithm and accordingly find the shortest delay path from requester to responder. The requesting peer decides to demand traffic via this detected-best-path and desires download speed as fast as possible. So, profit utility of the requester is to maximize his available download link bandwidth. What the P2P overlay does above is hyperselfish. This unilateral behavior may cause troubles (e.g., congestion or bandwidth shortage) for the underlay ISPs when other background traffic also request bandwidth resource. Once the ISP discovers this hyperselfish intention, MPLS-TE can be used as self-adjustment for underlay and punishment to overlay. MPLS-TE enables ISP to map different services to multiple label switched paths (LSPs). Assisted by resource reservation protocol (RSVP), MPLS will provide background traffic (other ISP-friendly applications) with reserved path bandwidth firstly and optimally. Then, even if a short-delay end-to-end is detected by P2P, much bandwidth resource on this detected path has been reserved by ISP for transit cost-saving, leaving limited available bandwidth for P2P. This limitation by underlay will impact the QoS for overlay peers, but overlay cannot change this suboptimal profit by itself.


### 3.3. Hyperselfish Weakness of Underlay

Hyperselfish underlay regards P2P overlay as opponent and detects P2P traffic volume through physical network. As the first player, knowing underlay’s strategic rule, overlay can firstly choose an optimal reacting strategy before underlay’s action. The dynamic game is formatted as follows,According to detected overlay traffic matrixM
T, underlay chooses optimal routing strategy as follows:
(7)
R
*
(
M
T
)
=
arg
min
⁡
⁡
G
(
M
T
,
R
)
.Overlay reacts to the hyperselfish behaviorR
*
(
M
T
) with an optimal traffic decision as follows:
(8)
M
T
*
=
arg
min
⁡
⁡
H
(
M
T
,
R
*
(
M
T
)
)
subject to ∑
k
‍
f
i
j
k
*
=
1, S
i
j
*
=
{
1
,
…
,
|
p
i
j
*
|
}, p
i
j
*
=
{
p
i
j
k
*
}, for all e
∈
E, t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
*
‍
t
i
j
*
·
r
i
j
k
*
(
e
)
·
f
i
j
k
*
≤
c
e, ∑
i
∈
N
‍
t
i
j
*
=
T
j, i
,
j
∈
N.Proposition 4.
A subgame perfect information Nash Equilibrium solution exists in the dynamic game about underlay hyperselfish behavior, if link cost functiong
e and path delay cost function h
i
j are all continuous.This dynamic game model is applicable to many practical scenarios, where ISPs depend on traffic monitors to obtain traffic statistics of P2P or other applications. The statistics are used for bandwidth demand prediction or traffic routing adjustment in TE. Take bandwidth prediction as an example. ISPs always depend on current traffic state to predict bandwidth demand in future. ISP’s TE wants to reserve optimal bandwidth for other ISP-friendly application traffic. So, TE control the underlay-friendly traffict
u
e on each link e, while P2P overlay control the P2P traffic t
o
e on each link. Then underlay traffic and P2P traffic will compete for surplus bandwidth. The bandwidth competition game can be expressed as follows.To find the optimal strategyt
u
e, underlay solves the following problem:
(9)
max
⁡
⁡
(
∑
e
c
e
-
∑
e
t
u
e
-
∑
e
t
o
e
)
·
(
∑
e
t
u
e
)
T
.To find the optimal strategyt
o
e, overlay solves the following problem:
(10)
max
⁡
⁡
(
∑
e
c
e
-
∑
e
t
u
e
-
∑
e
t
o
e
)
·
(
∑
e
t
o
e
)
T
subject to t
u
e
+
t
o
e
≤
c
e, ∑
e
‍
t
u
e
+
∑
e
‍
t
o
e
≤
T.c
e denotes the capacity of link e. Constant T is the limited total traffic volume. TE controls the incremental ISP-friendly traffic to take up the surplus bandwidth, which is matched with the current proportion of t
u
e to the total traffic amount T. P2P overlay also wants its incremental bandwidth matched with the current P2P traffic proportion (
∑
e
‍
t
o
e
)
/
T. If TE tries to decide t
u
e according to t
o
e which is detected by the ISP traffic monitor, overlay can first decide a strategy t
o
e
* as self-protection according to underlay’s strategic rule t
u
e
*
(
t
o
e
).Proposition 5.
Hyperselfish underlay has a suboptimal result in the bandwidth competition with P2P overlay.Proof.
Considering each link, underlay decidest
u
e and overlay decides t
o
e. We compare the two games: noncooperation and hyperselfishness. The former is aCournot model [24] and can be expressed as follows,
Underlay solves the problem:max
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
u
e
/
T. Overlay solves the problem: max
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
o
e
/
T.
Solutions aret
u
e
*
=
t
o
e
*
=
c
e
/
3. Both underlay’s and overlay’s bandwidth profit equal c
e
2
/
9
T.
The dynamic game of hyperselfishness is a Stackelberg model [23] as follows:
(11)
t
u
e
*
(
t
o
e
)
=
arg
max
⁡
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
u
e
T
=
(
c
e
-
t
o
e
)
2
,
t
o
e
*
=
arg
max
⁡
⁡
(
c
e
-
t
u
e
*
(
t
o
e
)
-
t
o
e
)
·
t
o
e
T
=
c
e
2
.
Underlay profit equalsc
e
2
/
16
T, and overlay profit equals c
e
2
/
8
T.
Comparing the results in the two cases above, optimal bandwidth profit in hyperselfish case is inferior to optimal result in noncooperative case. So, hyperselfish underlay profit is suboptimal.Besides, hyperselfish weakness of underlay can also be ascribed to the routing change with P2P traffic state. ISPs rely too much on traffic monitoring infrastructures and distribute traffic engineering protocols (e.g., MPLS, ECMP) in many network nodes. So, it takes a relatively long time to update traffic statistics and to converge distributed TE to a stable equilibrium every time when overlay traffic change happens. Such hypersensitivity but slow reaction of the underlay fails to control the frequently changing P2P traffic.


### 3.4. From Hyperselfishness to Cooperation

Self-improvement by either CPs or ISPs may not achieve efficiency, though much effort has been made to evolve machinery for either traffic control or network-awareness. On the one hand, ISPs are committed to upgrade TE and enhance traffic control. MPLS-based TE can label different protocol packets and establish tunnels for differentiated traffic. Changeable IGP link weights or BGP routing attributes are deployed for intra- or interdomain TE, for example, SculpTE [12]. Due to efficient traffic monitoring technologies [10], virtual network topology based TE systems, such as AMPLE, are proposed to split traffic and balance load [25]. By central routing control for software defined network (SDN), MPLS-TE on OpenFlow platform is implemented [11]. Yet, evolving TE will still encounter routing conflict with overlay because P2P traffic changes are random. On the other hand, P2P systems keep on improving proximity discovery or network-aware mechanism (e.g., TopBT, CLOSER, and NAPA-WINE) and overlay structure (e.g., tree, mesh, and DHT) to select short-delay paths and satisfy traffic demand among peers efficiently [7–9]. Nevertheless, inaccurate and unreliable delay measurement and poor topology-aware performance will still be the bottleneck in overlay utility optimization.In many scenarios, without cooperation, no matter how much effort ISPs or CPs make, there is just a suboptimal profit for them. Hyperselfish topology-awareness does not solve the cross-layer routing problem because the path information which either layer gets by topology-awareness is not accurate or in real time. Such topology-awareness may cause damage to both layers. Hence, it is reasonable for both layers to cooperate by a deliberate mechanism of information exchange.


## 3.1. Negative Impacts of Noncooperation

Both P2P overlay and ISP underlay have their own routing strategies and utility objectives. Peers in a P2P system demand contents from closer peers to obtain QoS, for example, fast file-download and fluent video playback [19, 20]. The utility of P2P overlay is to minimize total end-to-end delays. Underlay use TE and selects paths to transit traffic. The utility of the underlay is to optimize the overall network cost.Overlay and underlay independently decide their strategy, but the strategy they choose will influence the utility of each other. Accordingly, a noncooperative game model can be built for interaction between overlay and underlay [21]. In a network G
=
(
V
,
E
) and its overlay node set N and given the notations and descriptions in Notations, we model the noncooperative game as follows.Underlay chooses the routing strategyR
=
{
r
i
j
k
(
e
)
·
f
i
j
k
} by solving the problem as follows:
(1)
min
⁡
⁡
G
(
R
,
M
T
)
=
∑
e
∈
E
∑
i
,
j
∈
N
∑
k
∈
S
i
j
g
e
(
t
i
j
,
r
i
j
k
(
e
)
·
f
i
j
k
)
subject to ∑
k
‍
f
i
j
k
=
1, for all e
∈
E, S
i
j
=
{
1
,
…
,
|
p
i
j
|
}, p
i
j
=
{
p
i
j
k
}, t
e
b
+
∑
k
‍
∑
i
,
j
‍
t
i
j
·
r
i
j
k
(
e
)
·
f
i
j
k
≤
c
e.Overlay decides the overlay traffic matrixM
T
=
{
t
i
j
} by solving the problem as follows:
(2)
min
⁡
⁡
H
(
M
T
,
R
)
=
∑
e
∈
E
‍
∑
i
,
j
∈
N
‍
h
i
j
(
t
i
j
,
P
(
p
i
j
)
)
subject to t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
‍
t
i
j
·
r
i
j
k
(
e
)
·
f
i
j
k
≤
c
e, ∑
i
∈
N
‍
t
i
j
=
T
j.Functiong
e
(
·
) represents the transit cost function of link e, G
(
R
,
M
T
) is underlay’s total cost function whose value is decided by R and M
T, function h
i
j
(
·
) represents the delay from overlay node i to j, H
(
M
T
,
R
) is overlay’s total cost function whose value is decided by R and M
T, |
p
i
j
| denotes number of elements in physical path set p
i
j for i
j, and P
(
p
i
j
) denotes the underlay routing policy for logical link i
j.From this basic model, we draw three negative results from the cross-layer conflict.


### 3.1.1. Selfish Routing Conflict

Different utilities may lead to conflicting routing strategies. P2P system select closer peers to minimize delay. When the physical path under the logical link between two peers is overloaded, this shortest-delay choice of overlay may be a congestion risk to underlay links. On the other side, because underlay uses TE to optimize global traffic transit regardless of QoS of P2P overlay, TE routing adjustment may map overlay logical link between geographically nearby peers into a long-delay physical path.


### 3.1.2. Inefficiently Detecting Each Other

ISPs always deploy infrastructures to monitor traffic and update a traffic matrix periodically, so as to make optimal routing selection. Yet, overlay is always active and the traffic changes frequently. So, underlay routing is not instantly adjusted and subject to time lag. Besides, inefficient network-aware machinery of P2P overlay may cause inaccurate proximity selection.


### 3.1.3. Slow Convergence and Oscillation

Although it can be proved that strategy equilibrium exists in the game, the actual converging process will experience several rounds of adjustments from both overlay and underlay. During these rounds, selfish and rational overlay/underlay will react to the other by changing routing to obtain optimal utility again and again. Frequent readjustment (oscillation) and longtime of equilibrium convergence will bring systematic instability.


## 3.1.1. Selfish Routing Conflict

Different utilities may lead to conflicting routing strategies. P2P system select closer peers to minimize delay. When the physical path under the logical link between two peers is overloaded, this shortest-delay choice of overlay may be a congestion risk to underlay links. On the other side, because underlay uses TE to optimize global traffic transit regardless of QoS of P2P overlay, TE routing adjustment may map overlay logical link between geographically nearby peers into a long-delay physical path.


## 3.1.2. Inefficiently Detecting Each Other

ISPs always deploy infrastructures to monitor traffic and update a traffic matrix periodically, so as to make optimal routing selection. Yet, overlay is always active and the traffic changes frequently. So, underlay routing is not instantly adjusted and subject to time lag. Besides, inefficient network-aware machinery of P2P overlay may cause inaccurate proximity selection.


## 3.1.3. Slow Convergence and Oscillation

Although it can be proved that strategy equilibrium exists in the game, the actual converging process will experience several rounds of adjustments from both overlay and underlay. During these rounds, selfish and rational overlay/underlay will react to the other by changing routing to obtain optimal utility again and again. Frequent readjustment (oscillation) and longtime of equilibrium convergence will bring systematic instability.


## 3.2. Hyperselfish Weakness of Overlay

We regard overlay and underlay as two players in the dynamic game. Unlike simultaneous strategy decision of noncooperative game in Section3.1, one player in the dynamic game decides his strategy before the other one decides his, and the later player has the information of the first’s choice [22]. Hyperselfish overlay as the later player tries to use network-awareness to obtain underlay routing information and make selfish profit optimization regardless of possible profit damage to underlay. As the first player, underlay has the advantage of knowing overlay’s strategic rule which underlay can use to decide an optimal reacting strategy to restrain overlay profit to be suboptimal. To analyze weakness of overlay hyperselfish behavior, we model the dynamic game as follows.According to the detected underlay strategyR, overlay chooses optimal traffic matrix as follows:
(3)
M
T
*
(
R
)
=
arg
min
⁡
⁡
H
(
M
T
,
R
)
.
Underlay punishes the hyperselfish behavior M
T
*
(
R
) with an optimal reacting routing strategy as follows:
(4)
R
*
=
arg
min
⁡
⁡
G
(
M
T
*
(
R
)
,
R
)
subject to ∑
k
‍
f
i
j
k
*
=
1, S
i
j
*
=
{
1
,
…
,
|
p
i
j
*
|
}, p
i
j
*
=
{
p
i
j
k
*
}, for all e
∈
E, t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
*
‍
t
i
j
*
·
r
i
j
k
*
(
e
)
·
f
i
j
k
*
≤
c
e, ∑
i
∈
N
‍
t
i
j
*
=
T
j, i
,
j
∈
N.In this game, hyperselfish overlay obeys the strategic ruleM
T
*
(
R
) to generate as much as possible traffic M
T
* via the detected short-delay paths from network-awareness result R. This behavior is a congestion risk and disarranges underlying global traffic optimization. To restrain this hyperselfishness, underlay can use (4) to first choose action R
* as self-protection before overlay’s possible adverse action M
T
*
(
R
).Proposition 1.
A subgame perfect information Nash Equilibrium solution exists in the dynamic game about overlay hyperselfish behavior, if link cost functiong
e and overly delay cost function h
i
j are all continuous.Proof.
On any linke, overlay traffic is subject to t
over
e
≤
c
e. There are strategic constrains of ∑
k
‍
f
i
j
k
=
1 and ∑
i
∈
N
‍
t
i
j
=
T
j. So, solution set S
=
{
(
M
T
,
R
)
} is a closed space. Because g
e and h
i
j are continuous, continuous function gets minimal value at the solution R
*, and H gets the minimal value at M
T
*. We have the inequalities as G
(
M
T
*
,
R
*
)
≤
G
(
M
T
*
,
R
) and H
(
M
T
*
,
R
*
)
≤
H
(
M
T
,
R
*
). When overlay decides the policy M
T
* and underlay decides the policy R
*, they will not deviate from this equilibrium solution, because they cannot gain more profit with other policies. Therefore, (
M
T
*
,
R
*
) is a subgame perfect information Nash Equilibrium.Proposition 2.
Overlay’s hyperselfish behavior and underlay’s reaction can be modeled as the Stackelberg competition.Stackelberg’s leadership model [23] is a game between two players; one of which is the leader and decides his strategy first and the other one is the follower and decides his strategy after the leader’s decision. In the competition between overlay and underlay, underlay is the leader who first deploys traffic engineering in its networks to limit the traffic from selfish overlay routing.Proposition 3.
Overlay hyperselfish behavior can just obtain a suboptimal profit when underlay decides an optimal reacting strategy to restrain the overlay.Proof.
Underlay takes the leadership to control the traffic through its networks. The control strategies are decided to limit some unfriendly traffic that cause high transit cost and to ensure QoS of ISP-friendly traffic. P2P traffic and background traffic (from ISP-friendly applications) will compete for network bandwidth. The dynamic game can be formatted as follows:(5)
t
i
j
*
(
P
(
p
i
j
)
)
=
arg
max
⁡
⁡
∑
P
(
p
i
j
)
‍
t
i
j
,
(6)
P
*
(
p
i
j
)
=
arg
min
⁡
⁡
∑
e
∈
E
‍
∑
i
,
j
∈
N
‍
∑
k
∈
S
‍
w
e
·
t
i
j
*
(
P
(
p
i
j
)
)
·
r
i
j
k
(
e
)
·
f
i
j
k
.
Hyperselfish P2P overlay obeys the rulet
i
j
*
(
P
(
p
i
j
)
) to generate as much as possible traffic on its detected short-delay path p
i
j. Underlay uses P
*
(
p
i
j
) as a congestion-proof strategy to reserve some bandwidth, leave enough bandwidth for ISP-friendly traffic, and leave the limited bandwidth for P2P traffic on the path p
i
j.
Considering each single link, we have the link costl
=
t
e
·
w
e. As shown in Figure 2, l
1, l
2, and l
3 are three different equal-cost curves. Vertical axis indicates traffic amounts t
e. Horizontal axis indicates w
e, that is, link cost per traffic unit. Suppose that the link capacity is C
e. Curve b represents P2P traffic up-bound limited by ISP at each link (across horizontal W-axis). Curve b is an increasing function because we want t
under
=
C
e
-
b
(
w
e
) to be the bandwidth for ISP-friendly traffic. The cheaper (e.g., shorter delay or lower congestion) the link is, the more ISP-friendly traffic the link has, so that it ensures QoS of ISP-friendly traffic. According to (6), the underlay’s strategy is to obtain the minimum link cost l
=
t
e
·
w
e. From the three equal cost curves, underlay will choose l
3. According to (5), overlay will choose t
over from the three points P
1, P
2, and P
3 on curve b because they are the maximum traffic volumes the overlay can generate. According to Proposition 2, underlay is the leader in this game and first chooses l
3. Then overlay follows underlay’s decision to choose the value t
over in Figure 2. Hence, cross-point P
3 is the equilibrium point of overlay and underlay. Compared with P
1 and P
2, P2P overlay traffic t
over at equilibrium point P
3 is a suboptimal traffic.Figure 2
Suboptimal profit for hyperselfish overlay.For example in Figure1, peer i chooses peer j rather than peer k to generate traffic demand, because overlay detects that underlay uses shorter (one hop) path 1 to transit traffic from j to i. If ISP limits P2P traffic on path B
A, the low available bandwidth for P2P traffic on this path may also cause long time overlay delay. In this case, P2P’s network-aware machinery is of no avail.Take the interaction between MPLS-TE and network-aware P2P as an example. Suppose that a P2P system deploys the topology-aware algorithm and accordingly find the shortest delay path from requester to responder. The requesting peer decides to demand traffic via this detected-best-path and desires download speed as fast as possible. So, profit utility of the requester is to maximize his available download link bandwidth. What the P2P overlay does above is hyperselfish. This unilateral behavior may cause troubles (e.g., congestion or bandwidth shortage) for the underlay ISPs when other background traffic also request bandwidth resource. Once the ISP discovers this hyperselfish intention, MPLS-TE can be used as self-adjustment for underlay and punishment to overlay. MPLS-TE enables ISP to map different services to multiple label switched paths (LSPs). Assisted by resource reservation protocol (RSVP), MPLS will provide background traffic (other ISP-friendly applications) with reserved path bandwidth firstly and optimally. Then, even if a short-delay end-to-end is detected by P2P, much bandwidth resource on this detected path has been reserved by ISP for transit cost-saving, leaving limited available bandwidth for P2P. This limitation by underlay will impact the QoS for overlay peers, but overlay cannot change this suboptimal profit by itself.


## 3.3. Hyperselfish Weakness of Underlay

Hyperselfish underlay regards P2P overlay as opponent and detects P2P traffic volume through physical network. As the first player, knowing underlay’s strategic rule, overlay can firstly choose an optimal reacting strategy before underlay’s action. The dynamic game is formatted as follows,According to detected overlay traffic matrixM
T, underlay chooses optimal routing strategy as follows:
(7)
R
*
(
M
T
)
=
arg
min
⁡
⁡
G
(
M
T
,
R
)
.Overlay reacts to the hyperselfish behaviorR
*
(
M
T
) with an optimal traffic decision as follows:
(8)
M
T
*
=
arg
min
⁡
⁡
H
(
M
T
,
R
*
(
M
T
)
)
subject to ∑
k
‍
f
i
j
k
*
=
1, S
i
j
*
=
{
1
,
…
,
|
p
i
j
*
|
}, p
i
j
*
=
{
p
i
j
k
*
}, for all e
∈
E, t
e
b
+
∑
i
,
j
∈
N
‍
∑
k
∈
S
i
j
*
‍
t
i
j
*
·
r
i
j
k
*
(
e
)
·
f
i
j
k
*
≤
c
e, ∑
i
∈
N
‍
t
i
j
*
=
T
j, i
,
j
∈
N.Proposition 4.
A subgame perfect information Nash Equilibrium solution exists in the dynamic game about underlay hyperselfish behavior, if link cost functiong
e and path delay cost function h
i
j are all continuous.This dynamic game model is applicable to many practical scenarios, where ISPs depend on traffic monitors to obtain traffic statistics of P2P or other applications. The statistics are used for bandwidth demand prediction or traffic routing adjustment in TE. Take bandwidth prediction as an example. ISPs always depend on current traffic state to predict bandwidth demand in future. ISP’s TE wants to reserve optimal bandwidth for other ISP-friendly application traffic. So, TE control the underlay-friendly traffict
u
e on each link e, while P2P overlay control the P2P traffic t
o
e on each link. Then underlay traffic and P2P traffic will compete for surplus bandwidth. The bandwidth competition game can be expressed as follows.To find the optimal strategyt
u
e, underlay solves the following problem:
(9)
max
⁡
⁡
(
∑
e
c
e
-
∑
e
t
u
e
-
∑
e
t
o
e
)
·
(
∑
e
t
u
e
)
T
.To find the optimal strategyt
o
e, overlay solves the following problem:
(10)
max
⁡
⁡
(
∑
e
c
e
-
∑
e
t
u
e
-
∑
e
t
o
e
)
·
(
∑
e
t
o
e
)
T
subject to t
u
e
+
t
o
e
≤
c
e, ∑
e
‍
t
u
e
+
∑
e
‍
t
o
e
≤
T.c
e denotes the capacity of link e. Constant T is the limited total traffic volume. TE controls the incremental ISP-friendly traffic to take up the surplus bandwidth, which is matched with the current proportion of t
u
e to the total traffic amount T. P2P overlay also wants its incremental bandwidth matched with the current P2P traffic proportion (
∑
e
‍
t
o
e
)
/
T. If TE tries to decide t
u
e according to t
o
e which is detected by the ISP traffic monitor, overlay can first decide a strategy t
o
e
* as self-protection according to underlay’s strategic rule t
u
e
*
(
t
o
e
).Proposition 5.
Hyperselfish underlay has a suboptimal result in the bandwidth competition with P2P overlay.Proof.
Considering each link, underlay decidest
u
e and overlay decides t
o
e. We compare the two games: noncooperation and hyperselfishness. The former is aCournot model [24] and can be expressed as follows,
Underlay solves the problem:max
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
u
e
/
T. Overlay solves the problem: max
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
o
e
/
T.
Solutions aret
u
e
*
=
t
o
e
*
=
c
e
/
3. Both underlay’s and overlay’s bandwidth profit equal c
e
2
/
9
T.
The dynamic game of hyperselfishness is a Stackelberg model [23] as follows:
(11)
t
u
e
*
(
t
o
e
)
=
arg
max
⁡
⁡
(
c
e
-
t
u
e
-
t
o
e
)
·
t
u
e
T
=
(
c
e
-
t
o
e
)
2
,
t
o
e
*
=
arg
max
⁡
⁡
(
c
e
-
t
u
e
*
(
t
o
e
)
-
t
o
e
)
·
t
o
e
T
=
c
e
2
.
Underlay profit equalsc
e
2
/
16
T, and overlay profit equals c
e
2
/
8
T.
Comparing the results in the two cases above, optimal bandwidth profit in hyperselfish case is inferior to optimal result in noncooperative case. So, hyperselfish underlay profit is suboptimal.Besides, hyperselfish weakness of underlay can also be ascribed to the routing change with P2P traffic state. ISPs rely too much on traffic monitoring infrastructures and distribute traffic engineering protocols (e.g., MPLS, ECMP) in many network nodes. So, it takes a relatively long time to update traffic statistics and to converge distributed TE to a stable equilibrium every time when overlay traffic change happens. Such hypersensitivity but slow reaction of the underlay fails to control the frequently changing P2P traffic.


## 3.4. From Hyperselfishness to Cooperation

Self-improvement by either CPs or ISPs may not achieve efficiency, though much effort has been made to evolve machinery for either traffic control or network-awareness. On the one hand, ISPs are committed to upgrade TE and enhance traffic control. MPLS-based TE can label different protocol packets and establish tunnels for differentiated traffic. Changeable IGP link weights or BGP routing attributes are deployed for intra- or interdomain TE, for example, SculpTE [12]. Due to efficient traffic monitoring technologies [10], virtual network topology based TE systems, such as AMPLE, are proposed to split traffic and balance load [25]. By central routing control for software defined network (SDN), MPLS-TE on OpenFlow platform is implemented [11]. Yet, evolving TE will still encounter routing conflict with overlay because P2P traffic changes are random. On the other hand, P2P systems keep on improving proximity discovery or network-aware mechanism (e.g., TopBT, CLOSER, and NAPA-WINE) and overlay structure (e.g., tree, mesh, and DHT) to select short-delay paths and satisfy traffic demand among peers efficiently [7–9]. Nevertheless, inaccurate and unreliable delay measurement and poor topology-aware performance will still be the bottleneck in overlay utility optimization.In many scenarios, without cooperation, no matter how much effort ISPs or CPs make, there is just a suboptimal profit for them. Hyperselfish topology-awareness does not solve the cross-layer routing problem because the path information which either layer gets by topology-awareness is not accurate or in real time. Such topology-awareness may cause damage to both layers. Hence, it is reasonable for both layers to cooperate by a deliberate mechanism of information exchange.


## 4. A Synergistic Cost-Saving Game

In contrast with noncooperation and hyperselfishness, cooperation enables underlay and overlay to optimize selfish profit without damaging each other. We highlight a common goal in cost functions of both underlay and overlay. Advantage of the common goal is due to reciprocity, that is, self-optimization as well as considering and supporting profit goal of the other. Topology-related information can be exchanged between cooperative underlay and overlay to achieve the common goal. With peer locations, for example, IP addresses, from overlay, underlay can indicate path delay between overlay peers. With path information, for example, delay metric such as IGP weight, from underlay, overlay can select closer peers to avoid generating traffic from remote area, cross AS, or cross ISPs.According to Propositions1 and 4, the link cost function g
e and the overly delay cost function h
i
j should be continuous. Let g
e
(
x
)
=
u
i
j
e
·
x and let h
i
j
(
x
)
=
v
i
j
·
x be two linear functions. These continuous and convex functions on the strategy set ensure the existence of the Nash Equilibrium solution. Our synergistic cost-saving game is modeled as follows.Underlay choosesR
=
{
r
i
j
k
(
e
)
·
f
i
j
k
} by solving the problem:
(12)
min
⁡
⁡
∑
i
,
j
∈
N
‍
∑
e
∈
E
‍
∑
k
∈
S
‍
u
i
j
e
·
(
t
i
j
·
f
i
j
k
·
r
i
j
k
(
e
)
+
t
b
e
)
.Overlay decidesM
T
=
{
t
i
j
} by solving the problem:
(13)
min
⁡
⁡
∑
i
,
j
∈
N
‍
v
i
j
·
t
i
j
subject to ∑
k
‍
∑
i
,
j
‍
t
i
j
·
f
i
j
k
·
r
i
j
k
(
e
)
+
t
b
e
≤
c
e, ∑
k
‍
f
i
j
k
=
1, ∑
i
‍
t
i
j
=
T
j.v
i
j refers to logical path-delay metric from i to j and is given by underlay. u
i
j
e refers to link cost to transit per unit traffic on physical link e if e is on logical path i
j. Path metric set {
v
i
j
,
∀
i
,
j
∈
N
,
i
≠
j
} for all logical peer connections are classified into numbers of path classes according to the path metric value. For example in Figure 1, we take hop-count as the path-delay metric. Underlay maps logical path i
j into physical path A
B (1 hop), j
k into B
C (1 hop), q
k into E
C (1 hop), i
k into A
B
C (2 hops), q
i into E
F
A (2 hops), and k
i into C
E
F
A (3 hops). These paths can be classified into three classes as {
i
j
,
j
k
,
q
k
}, {
i
k
,
q
i
}, and {
k
i
}.Proposition 6.
A Nash Equilibrium solution exists in the synergistic cost-saving game.Proof.
Link cost function in formula (12) and path-delay cost function in formula (13) are both continuous functions. Because of the constraints of t
over
e
≤
c
e, ∑
k
‍
f
i
j
k
=
1, and ∑
i
∈
N
‍
t
i
j
=
T
j, solution set S
=
{
(
M
T
,
R
)
} is a closed space. So, both underlay and overlay can get minimal costs at the solution S
*
=
{
(
M
T
*
,
R
*
)
}, which satisfies ∑
i
,
j
∈
N
‍
∑
e
∈
E
‍
∑
k
∈
S
‍
u
i
j
e
·
(
t
i
j
*
·
f
i
j
k
*
·
r
i
j
k
*
(
e
)
+
t
b
e
)
≤
∑
i
,
j
∈
N
‍
∑
e
∈
E
‍
∑
k
∈
S
‍
u
i
j
e
·
(
t
i
j
*
·
f
i
j
k
·
r
i
j
k
(
e
)
+
t
b
e
) and ∑
i
,
j
∈
N
‍
v
i
j
*
·
t
i
j
*
≤
∑
i
,
j
∈
N
‍
v
i
j
*
·
t
i
j. Underlay and overlay will not deviate from the solution S
*
=
{
(
M
T
*
,
R
*
)
}, because they cannot gain more profit with other policies. So, S
*
=
{
(
M
T
*
,
R
*
)
} is a Nash Equilibrium solution.In this synergistic game model, mechanisms of path information, path classes, and remote threshold are detailed as follows.


### 4.1. Path Information

Because each link has a weight to indicate delay or other cost metrics, each underlying physical path, consisting of one or multiple links, can get an accumulated weight, which is sum of link weights on the path. For logical pathi
j in overlay, underlay can split traffic into multiple physical paths. So, we use the average weight w
i
j of k paths to express the path weight for i
j as follows:
(14)
w
i
j
=
∑
k
‍
w
i
j
k
·
f
i
j
k
.The path metricv
i
j equals to or positively correlate to the path weight w
i
j. According to the value of v
i
j, path i
j will be classified into a path class and the class number x
i
j will be given to overlay. Because v
i
j is given by underlay, overlay has the accurate path-delay for proximity selection.Obtaining the peer locations from P2P overlay, for each logical path between peers, ISP underlay can provide the path information which includes the following.(i)
Path class numberx
i
j: indicating the path class which i
j belongs to.
(ii)
Remote threshold (RT) valuek: a selected class number, used to distinct between near and remote path classes.
(iii)
Limited traffic volumesT
i
j: T
i
j is given only when x
i
j
>
k (to limit traffic from remote candidate peer i to requesting peer j).
(iv)
Path-delay metricv
i
j: v
i
j is given only when x
i
j
≤
k. By solving formula (13), overlay can decide optimal traffic from i to j.For large-scale P2P overlays, it is difficult for ISP underlay to select a remote threshold from numerous logical paths, yet due to path classes, a proper class number can be selected as RT to limit traffic from remote areas and significantly improve cost for both overlay and underlay.


### 4.2. Remote Threshold

Remote threshold can be used to divide paths into the near and the remote. Suppose there are totaln path-classes in the network. Path metric values increase with order of class numbers. x
i
j is the class number of the logical path i to j. The threshold value is set to be k. When underlay gets the peer couple of i and j, it will calculate the path weight w
i
j. Path i
j can be classified into one of the n path classes. If the class number x
i
j which i
j belongs to is greater than k, distance between i and j is regarded as the remote, and the traffic from i to j is limited. If x
i
j
>
k, path metric v
i
j is not shown to overlay and only a limited value of traffic volume is included in path information for overlay. If x
i
j
≤
k, v
i
j will be given to overlay, and overlay will use proximity optimal algorithm to generate traffic from the closer peers. This threshold mechanism helps overlay quickly exclude remote peers or generate traffic less than the limitation from remote peers.ISPs do not want to transit cross-AS or cross-ISP traffic, because interdomain links cost much more than intradomain. In this scenario, RT can be used as a threshold for binary value classes, for example, “0” represents intradomain and “1” represents interdomain. When path class numberx
=
1, traffic on this path is limited. Through this way, underlay can guide overlay peers to generate traffic within the AS or the ISP.


### 4.3. Proximity Selection Process of Overlay

Only if two peers are close enough, that is, path class number not greater than RT, overlay can use the proximity selection algorithm to decide traffic between the two peers. Before making optimal traffic decision, overlay depends on the path information to delete remote candidate peers or know the traffic limitation from those peers.Overlay solves the formula (13) to obtain optimal traffic demand. Before using the path metric v
i
j, overlay has to consider path congestion risk and multiply v
i
j by a weight. The weight is related to traffic demand t
i
j, because t
i
j affects the link delay. If link e is on the path i
j, link delay is expressed as
(15)
D
e
=
1
c
e
-
t
i
j
e
-
t
b
e
.
Too much traffic into link e will cause long time delay. This part of delay cost should be included in the path weight.For example in Figure1, underlay uses path B
A to transit t
j
i, path C
E
F
A to transit t
k
i, and path E
F
A to transit t
q
i. Assume that total traffic demanded by i is a constant t. We use hop-count to weight each path. So v
j
i
=
1, v
q
i
=
2, and v
k
i
=
3. The remote threshold is set to be 2. So, the overlay path k
i is deleted by i. Assume that the links of the underlay have the same capacity 1. Multiplying the path weight by the delay factors, we get the new path weights as v
j
i
=
1
/
(
1
-
t
j
i
) and v
q
i
=
2
/
(
1
-
t
q
i
). With these new path weights, we solve the formula (13) as follows:
(16)
min
⁡
⁡
t
j
i
1
-
t
j
i
+
2
t
q
i
1
-
t
q
i
subject to t
j
i
+
t
q
i
=
t, t
j
i
≥
0, t
q
i
≥
0. So, peer i can demand optimal traffic from j and q.


### 4.4. Algorithm

Information can be directly exchanged between P2P system and ISP or through an impartial service between overlay and underlay. SC optimization is shown as Algorithm1.Algorithm 1:Synergistic cost-saving process.
/
/
Impartial Service (IS) Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
Receive locations of peer couple(
i
,
j
) from Overlay;
Give(
i
,
j
) locations to Underlay and query path delay;
Receive path-delay metricv
i
j from Underlay;
Classify all paths and get the path-class numberx
i
j;
Set RT to bek;
if
x
i
j
≥
k
then
Set traffic up-boundT
x
i
j and give it to Overlay;
else
Give Overlay the information including:x
i
j, k, v
i
j;
end  if
end  for
/
/
Overlay  Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
foreach x
i
j
do
if
x
i
j
>
k
then
generatet
i
j
≤
T
x
i
j;
else
solve formula (13) to obtain optimal t
i
j;
end  if
end  for
Report the updated peer locations to IS;
end  for
/
/
Underlay Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
Receive(
i
,
j
) locations and detect t
i
j;
Solve (12) to decide R
=
{
r
i
j
k
(
e
)
·
f
i
j
k
} in this round;
Indicate path metricv
i
j to IS;
end  for


## 4.1. Path Information

Because each link has a weight to indicate delay or other cost metrics, each underlying physical path, consisting of one or multiple links, can get an accumulated weight, which is sum of link weights on the path. For logical pathi
j in overlay, underlay can split traffic into multiple physical paths. So, we use the average weight w
i
j of k paths to express the path weight for i
j as follows:
(14)
w
i
j
=
∑
k
‍
w
i
j
k
·
f
i
j
k
.The path metricv
i
j equals to or positively correlate to the path weight w
i
j. According to the value of v
i
j, path i
j will be classified into a path class and the class number x
i
j will be given to overlay. Because v
i
j is given by underlay, overlay has the accurate path-delay for proximity selection.Obtaining the peer locations from P2P overlay, for each logical path between peers, ISP underlay can provide the path information which includes the following.(i)
Path class numberx
i
j: indicating the path class which i
j belongs to.
(ii)
Remote threshold (RT) valuek: a selected class number, used to distinct between near and remote path classes.
(iii)
Limited traffic volumesT
i
j: T
i
j is given only when x
i
j
>
k (to limit traffic from remote candidate peer i to requesting peer j).
(iv)
Path-delay metricv
i
j: v
i
j is given only when x
i
j
≤
k. By solving formula (13), overlay can decide optimal traffic from i to j.For large-scale P2P overlays, it is difficult for ISP underlay to select a remote threshold from numerous logical paths, yet due to path classes, a proper class number can be selected as RT to limit traffic from remote areas and significantly improve cost for both overlay and underlay.


## 4.2. Remote Threshold

Remote threshold can be used to divide paths into the near and the remote. Suppose there are totaln path-classes in the network. Path metric values increase with order of class numbers. x
i
j is the class number of the logical path i to j. The threshold value is set to be k. When underlay gets the peer couple of i and j, it will calculate the path weight w
i
j. Path i
j can be classified into one of the n path classes. If the class number x
i
j which i
j belongs to is greater than k, distance between i and j is regarded as the remote, and the traffic from i to j is limited. If x
i
j
>
k, path metric v
i
j is not shown to overlay and only a limited value of traffic volume is included in path information for overlay. If x
i
j
≤
k, v
i
j will be given to overlay, and overlay will use proximity optimal algorithm to generate traffic from the closer peers. This threshold mechanism helps overlay quickly exclude remote peers or generate traffic less than the limitation from remote peers.ISPs do not want to transit cross-AS or cross-ISP traffic, because interdomain links cost much more than intradomain. In this scenario, RT can be used as a threshold for binary value classes, for example, “0” represents intradomain and “1” represents interdomain. When path class numberx
=
1, traffic on this path is limited. Through this way, underlay can guide overlay peers to generate traffic within the AS or the ISP.


## 4.3. Proximity Selection Process of Overlay

Only if two peers are close enough, that is, path class number not greater than RT, overlay can use the proximity selection algorithm to decide traffic between the two peers. Before making optimal traffic decision, overlay depends on the path information to delete remote candidate peers or know the traffic limitation from those peers.Overlay solves the formula (13) to obtain optimal traffic demand. Before using the path metric v
i
j, overlay has to consider path congestion risk and multiply v
i
j by a weight. The weight is related to traffic demand t
i
j, because t
i
j affects the link delay. If link e is on the path i
j, link delay is expressed as
(15)
D
e
=
1
c
e
-
t
i
j
e
-
t
b
e
.
Too much traffic into link e will cause long time delay. This part of delay cost should be included in the path weight.For example in Figure1, underlay uses path B
A to transit t
j
i, path C
E
F
A to transit t
k
i, and path E
F
A to transit t
q
i. Assume that total traffic demanded by i is a constant t. We use hop-count to weight each path. So v
j
i
=
1, v
q
i
=
2, and v
k
i
=
3. The remote threshold is set to be 2. So, the overlay path k
i is deleted by i. Assume that the links of the underlay have the same capacity 1. Multiplying the path weight by the delay factors, we get the new path weights as v
j
i
=
1
/
(
1
-
t
j
i
) and v
q
i
=
2
/
(
1
-
t
q
i
). With these new path weights, we solve the formula (13) as follows:
(16)
min
⁡
⁡
t
j
i
1
-
t
j
i
+
2
t
q
i
1
-
t
q
i
subject to t
j
i
+
t
q
i
=
t, t
j
i
≥
0, t
q
i
≥
0. So, peer i can demand optimal traffic from j and q.


## 4.4. Algorithm

Information can be directly exchanged between P2P system and ISP or through an impartial service between overlay and underlay. SC optimization is shown as Algorithm1.Algorithm 1:Synergistic cost-saving process.
/
/
Impartial Service (IS) Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
Receive locations of peer couple(
i
,
j
) from Overlay;
Give(
i
,
j
) locations to Underlay and query path delay;
Receive path-delay metricv
i
j from Underlay;
Classify all paths and get the path-class numberx
i
j;
Set RT to bek;
if
x
i
j
≥
k
then
Set traffic up-boundT
x
i
j and give it to Overlay;
else
Give Overlay the information including:x
i
j, k, v
i
j;
end  if
end  for
/
/
Overlay  Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
foreach x
i
j
do
if
x
i
j
>
k
then
generatet
i
j
≤
T
x
i
j;
else
solve formula (13) to obtain optimal t
i
j;
end  if
end  for
Report the updated peer locations to IS;
end  for
/
/
Underlay Algorithm:
forRound i
=
1; i
<
n; i
+
+
do
Receive(
i
,
j
) locations and detect t
i
j;
Solve (12) to decide R
=
{
r
i
j
k
(
e
)
·
f
i
j
k
} in this round;
Indicate path metricv
i
j to IS;
end  for


## 5. Performance Evaluation

In this section, based on simulation in both real and generated topologies, we validate that SC model improves the negative impacts of noncooperation and a proper remote threshold should be selected for cost improvement.


### 5.1. Simulation Setup

To demonstrate the improvement for noncooperative negative impacts which have been summarized in Section3, we use real network topology of Abilene [26] for analysis. Also, we use GT-ITM [27] to generate three network topologies for proper remote threshold selection. The backbone topology of Abilene has 11 point-of-presence nodes and its actual link capacities. End-to-end latency-based IGP link weights in [28] can be used to calculate the path metric v
i
j in our SC model. We set the background traffic by referring to traffic statistical analysis of Abilene [29]. We refer to [30] and generate overlay traffic on several logical overlay paths. GT-ITM can generate transit-stub style topologies which can simulate ISP networks. We generate three topologies, each of which consists of 5 transit nodes and 2 stub domains connected to each transit node. Every stub domain has 3 nodes on average. Totally, in each topology, we get 35 underlay nodes and set the link capacity between each two nodes to be 10 Mbps. In each topology, 10 underlay nodes are mapped into a fully connected 10-node overlay. Each overlay node has its own constant traffic demand from other overlay nodes. We use hop-count as the path metric v
i
j for overlay peering pairs. Then SC algorithm can be deployed for cost optimization. To select a proper RT from path classes for the three topologies, we use one topology for analytical selection and use the other two for validating rationality of the selected threshold. Besides, we add the delay factor as format of (15) to the path weights which are used in overlay proximity selection.


### 5.2. Improvement by SC

We use SC model with path classes to improve the negative impacts of noncooperation. In the game-theoretic optimization, underlay and overlay take several rounds to converge to a strategic equilibrium, that is, optimal traffic demand between peers for overlay and optimal physical path selection and traffic splits for underlay. In each round, according to the strategic decision of underlay/overlay, overlay/underlay will react and adjust with an optimal strategy by executing SC Algorithm. We study the case that each node in overlay has a constant total traffic demand from other nodes and decides fraction of traffic demand from every other node. This optimization takes several rounds because overlay needs to react to routing change of underlay in each round. On the other hand, underlay will react to traffic change between overlay peers in each round and make an optimal routing adjustment. Noncooperative game takes many rounds to converge to equilibrium and makes the two-layer system in unstable oscillation. In addition to slow convergence, suboptimal cost for both overlay and underlay leave margin for improvement. In contrast with noncooperation, our SC model uses topology-related information exchange to help both overlay and underlay to improve their suboptimal costs and shorten the convergence duration. We also investigate whether path-class mechanism helps SC go further to save costs.Overlay traffic is set to 50 percents of the total traffic volume with the network utilization of 0.4 in the Abilene topology. We compare three cases: noncooperation, SC with path class mechanism in optimal algorithm and SC without path classes. Figures3 and 4, respectively, show overlay cost (normalized average delay relative to the initial value 1) and underlay cost (normalized MLU relative to the initial value 1) in 100 rounds. We can see that two types of SC have a faster converging speed to equilibrium than noncooperation. Although the costs flap with independently reacting decisions of the two layers in different rounds, yet due to information exchange between cooperative overlay and underlay, SC shows far slighter oscillation than noncooperation case and obtains systematical stability. Comparing stable costs of SC with noncooperation, SC saves about 30% cost in overlay and about 20% cost in underlay.Figure 3
Overlay cost improvement.Figure 4
Underlay cost improvement.It is also remarkable that SC with path classes outperforms SC without path classes. That is because classified path can help overlay node quickly delete remote candidate peers in order to minimize average end-to-end delay. Hence, both overlay and underlay take advantage of the common goal to limit traffic from remote areas. We also compare SC model with the leader-follower model [3] at different proportions of overlay traffic. As shown in Figure 5, though two models perform nearly the same in the underlay cost Figures 5(c) and 5(d), SC model performs much better than the other for saving overlay cost at the relatively high load of overlay traffic.Comparison of two models at the overlay traffic proportionρ: (a) ρ
=
30
%, (b) ρ
=
60
%, (c) ρ
=
30
%, and (d) ρ
=
60
%.
(a)
(b)
(c)
(d)


### 5.3. Proper RT Selection

We use a topology generated by GT-ITM to explore the existence of a proper remote threshold of path classes. Hop account on physical path is used as path metricv
i
j for overlay. We simulate performance of the two-layer system in 300 seconds and use cost results at four observation time points for analysis. In Figures 6(a) and 6(b), when remote threshold k
≤
3, the system shows lower and closer costs (delay and MLU) in stable state than k
=
4 case. Results demonstrate that if underlay does not limit traffic on the path whose class is larger than 3, overlay and underlay costs will increase significantly. So, a proper threshold can distinct between near and remote so as to leave closer candidate peers for an overlay node to generate traffic demand optimally.(a) Delay of overlay at four RT values. (b) MLU of underlay at four RT values.
(a)
(b)


### 5.4. Rationality of Selected RT

We use the other two topologies generated by GT-ITM to validate rationality of the threshold selection. For each topology we set thresholdk to be 3 and simulate system performance 25 times. Convergence duration means how long time it takes to arrive at the state of cost equilibria (i.e., stable delay, and stable MLU). Totally, we get 50 experimental points from the two topologies. Results are shown in Figure 7. Most (about 80%) of the points are around the point (13, 31, 0.042) which is approximate to the average experimental result in Section 5.3. So, the threshold value we selected is applicable to the same size networks (transit-stub topology with 35 underlay nodes and 10 overlay nodes). Corresponding to a topology with SC solution, a proper remote threshold exists and should be selected for cost improvement. Accordingly, it is efficient and convenient for ISPs to select a proper RT for one network and apply the RT to other same scale networks.Figure 7
50 times of test results when RT is equal to 3.Path classes and RT are even more important for large-scale ISP topologies. One of the main goals of ISP underlay in this cost-saving cooperation is to divide paths into near and remote and to limit traffic from remote areas. Path classes are helpful for this coarse-grained division because ISP can choose a proper RT from limited numbers of classes rather than find threshold value from all of the numerous paths. Mechanism of path class enables ISPs to select proper RT quickly and efficiently for saving cost of traffic transit.


## 5.1. Simulation Setup

To demonstrate the improvement for noncooperative negative impacts which have been summarized in Section3, we use real network topology of Abilene [26] for analysis. Also, we use GT-ITM [27] to generate three network topologies for proper remote threshold selection. The backbone topology of Abilene has 11 point-of-presence nodes and its actual link capacities. End-to-end latency-based IGP link weights in [28] can be used to calculate the path metric v
i
j in our SC model. We set the background traffic by referring to traffic statistical analysis of Abilene [29]. We refer to [30] and generate overlay traffic on several logical overlay paths. GT-ITM can generate transit-stub style topologies which can simulate ISP networks. We generate three topologies, each of which consists of 5 transit nodes and 2 stub domains connected to each transit node. Every stub domain has 3 nodes on average. Totally, in each topology, we get 35 underlay nodes and set the link capacity between each two nodes to be 10 Mbps. In each topology, 10 underlay nodes are mapped into a fully connected 10-node overlay. Each overlay node has its own constant traffic demand from other overlay nodes. We use hop-count as the path metric v
i
j for overlay peering pairs. Then SC algorithm can be deployed for cost optimization. To select a proper RT from path classes for the three topologies, we use one topology for analytical selection and use the other two for validating rationality of the selected threshold. Besides, we add the delay factor as format of (15) to the path weights which are used in overlay proximity selection.


## 5.2. Improvement by SC

We use SC model with path classes to improve the negative impacts of noncooperation. In the game-theoretic optimization, underlay and overlay take several rounds to converge to a strategic equilibrium, that is, optimal traffic demand between peers for overlay and optimal physical path selection and traffic splits for underlay. In each round, according to the strategic decision of underlay/overlay, overlay/underlay will react and adjust with an optimal strategy by executing SC Algorithm. We study the case that each node in overlay has a constant total traffic demand from other nodes and decides fraction of traffic demand from every other node. This optimization takes several rounds because overlay needs to react to routing change of underlay in each round. On the other hand, underlay will react to traffic change between overlay peers in each round and make an optimal routing adjustment. Noncooperative game takes many rounds to converge to equilibrium and makes the two-layer system in unstable oscillation. In addition to slow convergence, suboptimal cost for both overlay and underlay leave margin for improvement. In contrast with noncooperation, our SC model uses topology-related information exchange to help both overlay and underlay to improve their suboptimal costs and shorten the convergence duration. We also investigate whether path-class mechanism helps SC go further to save costs.Overlay traffic is set to 50 percents of the total traffic volume with the network utilization of 0.4 in the Abilene topology. We compare three cases: noncooperation, SC with path class mechanism in optimal algorithm and SC without path classes. Figures3 and 4, respectively, show overlay cost (normalized average delay relative to the initial value 1) and underlay cost (normalized MLU relative to the initial value 1) in 100 rounds. We can see that two types of SC have a faster converging speed to equilibrium than noncooperation. Although the costs flap with independently reacting decisions of the two layers in different rounds, yet due to information exchange between cooperative overlay and underlay, SC shows far slighter oscillation than noncooperation case and obtains systematical stability. Comparing stable costs of SC with noncooperation, SC saves about 30% cost in overlay and about 20% cost in underlay.Figure 3
Overlay cost improvement.Figure 4
Underlay cost improvement.It is also remarkable that SC with path classes outperforms SC without path classes. That is because classified path can help overlay node quickly delete remote candidate peers in order to minimize average end-to-end delay. Hence, both overlay and underlay take advantage of the common goal to limit traffic from remote areas. We also compare SC model with the leader-follower model [3] at different proportions of overlay traffic. As shown in Figure 5, though two models perform nearly the same in the underlay cost Figures 5(c) and 5(d), SC model performs much better than the other for saving overlay cost at the relatively high load of overlay traffic.Comparison of two models at the overlay traffic proportionρ: (a) ρ
=
30
%, (b) ρ
=
60
%, (c) ρ
=
30
%, and (d) ρ
=
60
%.
(a)
(b)
(c)
(d)


## 5.3. Proper RT Selection

We use a topology generated by GT-ITM to explore the existence of a proper remote threshold of path classes. Hop account on physical path is used as path metricv
i
j for overlay. We simulate performance of the two-layer system in 300 seconds and use cost results at four observation time points for analysis. In Figures 6(a) and 6(b), when remote threshold k
≤
3, the system shows lower and closer costs (delay and MLU) in stable state than k
=
4 case. Results demonstrate that if underlay does not limit traffic on the path whose class is larger than 3, overlay and underlay costs will increase significantly. So, a proper threshold can distinct between near and remote so as to leave closer candidate peers for an overlay node to generate traffic demand optimally.(a) Delay of overlay at four RT values. (b) MLU of underlay at four RT values.
(a)
(b)


## 5.4. Rationality of Selected RT

We use the other two topologies generated by GT-ITM to validate rationality of the threshold selection. For each topology we set thresholdk to be 3 and simulate system performance 25 times. Convergence duration means how long time it takes to arrive at the state of cost equilibria (i.e., stable delay, and stable MLU). Totally, we get 50 experimental points from the two topologies. Results are shown in Figure 7. Most (about 80%) of the points are around the point (13, 31, 0.042) which is approximate to the average experimental result in Section 5.3. So, the threshold value we selected is applicable to the same size networks (transit-stub topology with 35 underlay nodes and 10 overlay nodes). Corresponding to a topology with SC solution, a proper remote threshold exists and should be selected for cost improvement. Accordingly, it is efficient and convenient for ISPs to select a proper RT for one network and apply the RT to other same scale networks.Figure 7
50 times of test results when RT is equal to 3.Path classes and RT are even more important for large-scale ISP topologies. One of the main goals of ISP underlay in this cost-saving cooperation is to divide paths into near and remote and to limit traffic from remote areas. Path classes are helpful for this coarse-grained division because ISP can choose a proper RT from limited numbers of classes rather than find threshold value from all of the numerous paths. Mechanism of path class enables ISPs to select proper RT quickly and efficiently for saving cost of traffic transit.


## 6. Conclusion

In this paper we investigate cross-layer conflict between P2P overlay and ISP underlay and highlight solutions to use cooperation rather than hyperselfish topology-awareness. Two dynamic game models are built to illustrate suboptimal profit of hyperselfish initiator. We build a topology-information-exchange-based game model to improve negative impact of noncooperation. Simulation results validate that SC model with path classes can improve costs for both layers and decrease the time consumption to arrive at the stable equilibrium. The proper remote threshold selection is also proved essential for cost improvement of the two-layer system. With popularity of P2P streaming and content oriented networks, our future work will pertain to ISP traffic management through cooperation with P2P streaming systems and cross-ISP content distribution between cooperative ISPs.



---

*Source: 792563-2014-04-03.xml*