Date post: | 12-Jul-2015 |
Category: |
Documents |
Upload: | webhostingguy |
View: | 151 times |
Download: | 0 times |
1
iREX : Inter-domain Resource Exchange Architecture
Ariffin Datuk Yahaya & Tatsuya Suda{ariffin, suda} @ ics.uci.edu
University of California, Irvine
Zuse – Berlin 2006
2
http://netresearch.ics.uci.edu/ariffin/irex
iREX Presentation Outline
Problem Statement Our Solution Simulation Results Conclusion
3
http://netresearch.ics.uci.edu/ariffin/irex
Problem Statement
How to self-manage QoS policy across multiple autonomous domains in the Internet? Note: policy must be supported by network resources.
AT&T SBC
Level 3
MCIBR
BRBR
BR BR
BR
BR BR
INT
ER
NE
T
QWESTBR BR
…… … BR
DomainsBorder Router
S D
Agree to provide resource for AT&TAT&T negotiates for resource
D
4
http://netresearch.ics.uci.edu/ariffin/irex
S to D connection
Intra-domain QoS Policy EASY to deploy & manage
Domains directly control its own resources (connectivity)
Inter-domain QoS Policy HARD to deploy & manage
Domains are autonomously run by multiple entities Have no information or control beyond their domain borders
Must deal with many different resources owners
BR = Border RouterR = Router
Intra-DomainQoS Policy
Multiple Inter-Domain QoS Policies
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
Intra-DomainQoS Policy
D
BR
S
BR
RR
AT&T Domain MCI Domain
5
http://netresearch.ics.uci.edu/ariffin/irex
Problem Statement
Inter-Domain QoS Policy Management
BRBR
BR
BR BR
BR
BR BR
INT
ER
NE
T
BR BR
…… … BR
How to self-manage QoS policy across multiple autonomous domains in the Internet?
DomainsBorder Router
S D
…
QoS
Man
agem
ent
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
Inter-domainQoS
PolicyIntra-domain
QoSPolicy
6
http://netresearch.ics.uci.edu/ariffin/irex
iREX Presentation Outline
Problem Statement Our Solution Simulation Results Conclusion
7
http://netresearch.ics.uci.edu/ariffin/irex
iREX Goals
Self Manage QoS Policy Negotiation & Deployment
Congestion Avoidance
Accountability & Responsibility*
Approach
Enable an economic market for inter-domain network resources
Domains optimize for their own benefit
Ensure architecture conformance Domain Reputation System Fault Tolerance System
Enable a self perpetuating resource filtering process through the economic market
Design a protocol to provide resource information & full control to the initiating (source) domain.
Inter-domain Resource Exchange Architecture
* Not presented, but in the paper.
8
http://netresearch.ics.uci.edu/ariffin/irex
iREX use of Economics iREX Economic Model:
“Posted Price Competition” Domains are both sellers and
buyers. Sellers
Advertise the price of their available inter-domain resources
Buyers Choose among advertised
resources to deploy inter-domain QoS policy
SBCBR
BR
BR
Need QoS to AT&T
Path A
$20
Path B
$10
Path C
$5
9
http://netresearch.ics.uci.edu/ariffin/irex
$1
$1 $1
$1
$2
$2
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
iREX Economics Example
Each resource owner prices his links and periodicallyadvertises the cheapest known link prices.
BR
BR BR
BR
Source Domain
DestinationDomain
IntermediateDomains
BorderRouters
10
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
iREX Economics Example
$1
$1 $1
BR
BR BR
BR
$1
$2
$2
SYWXD:$4
S gets information that SYWXD is the cheapest path.S then uses source routing to deploy QoS policy along SYWXD.
$2
$2
YWXD:$3
11
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
iREX Economics Example
Bandwidth use causes link prices to increase.
$2
$2 $2
$2BR
BR BR
BR
$2 $2
SYWXD:$8
YWXD:$6
12
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
iREX Economics Example
Deployments increase along the same path andprices continue to increase.
$3
$3 $3
$2BR
BR BR
BR
$3 $2
SYWXD:$12
Domains continuously advertise the cheapest prices andS gets new information on a cheaper route SYZXD.
YZXD:$7
$2
$2
13
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
iREX Economics Example
S chooses SYZXD for next deployment(s).
$3
$3 $3
$2BR
BR BR
BR
$3 $2
SYZXD:$10
14
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Note: Congestion avoidance
Deployments avoid congestion automatically bydistributing deployments.
$4
$3 $4
$3BR
BR BR
BR
$3 $3
Sending simultaneously on more than 1
path
15
http://netresearch.ics.uci.edu/ariffin/irex
Resource Price Economic Analysis Two commodities are sold from the same ID link
BE traffic (Email, www, ecommerce, etc.) Must keep BE users happy by providing REASONABLE
service.
Premium traffic (VPN, Video, Telephony, etc.) Must keep Premium users happy by providing PERFECT
service.
Allocating some of the link for QoS incurs risk for the Domain because it cuts down on the bandwidth available for BE. It increases the probability of impacting Premium
traffic that has already been deployed
16
http://netresearch.ics.uci.edu/ariffin/irex
Domain Link Bandwidth AllocationP
rice
% Bandwidth allocated to QoS
Demand
Sup
ply
MinimumPrice
Max
imum
Allo
catio
n
Max Price due to Physical Constraints
Min
imum
Allo
catio
n
100 %Min Risk MAX Risk
As demand curve moves up the supply curve the price the ID
market is willing to pay increases
a domain will allocate bandwidth between the Min Risk and Max Risk point on the x axis.
More risk, higher price
17
http://netresearch.ics.uci.edu/ariffin/irex
Distributed Database
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Reputation Example
Domains can check for a reputation scores andwill not advertise domains/resources with bad reputation.
$4
$3 $4
BR
BR BR
BR
$3
$2
$2
YZXD:$8BUT Z
has bad reputation
YWXD:$10
Reputation
Query
Rep. Score
iREX has a distributed reputation database system whereany domains can register complains for non-conformance.
Z = +3
ZXD:$6
18
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Reputation Example
$4
$4 $4
BR
BR BR
BR
$4
$2
$2
Reputation
Z = +4
Distributed Database
The reputation system isolates “bad” domains from the market.Because Y does not advertise paths through Z,
S continues to deploy on SYWXD.
19
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Fault Tolerance Example
Any domain that detect faults will try to redeploy
$4
$3 $4
$3BR
BR BR
BR
$3 $3 FAULT
X
If a domain has no viable routes for redeploying, it signals backward so that another domain can try recovery.
No Path
20
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Fault Tolerance Example
Y takes on the responsibility of recovery and finds path YWXD
$4
$3 $4
$3BR
BR BR
BR
$3 $3 FAULT
X
Y informs the source about the available path to reroute.
YWXD
21
http://netresearch.ics.uci.edu/ariffin/irex
S
W
YBR BR
X
Z
DBRBR
BR
BR
BR
BR
Fault Tolerance Example
Source then can decide to reroute the faulted deployments.
$4
$3 $4
$2BR
BR BR
BR
$3 $3
22
http://netresearch.ics.uci.edu/ariffin/irex
iREX Presentation Outline
Problem Statement Our Solution Simulation Results Conclusion
23
http://netresearch.ics.uci.edu/ariffin/irex
iREX Simulator Packet level simulation
for control packets. Flow level simulation for
QoS policy. Domains
Implements BGP & iREX protocols
only have local knowledge react to reservations
random pricing functions selfish goal to maximize
profit
Domain Node
Wire
Input & Output Queue
Input & Output Queue
Process Queue
Simulator Components
24
http://netresearch.ics.uci.edu/ariffin/irex
Simulated Price Functions
Each domain in the simulation is assigned a price function randomly
We initially simulated 3 models of pricing for the domains in the simulationFlat then CubedFlat then LinearTiered.
Each domain uses different parameters for the price functions.
25
http://netresearch.ics.uci.edu/ariffin/irex
Flat then Cubed
Price has multiple 1 until a cutoff % is reached for link capacity usage.
After cutoff %, the price increases according to a constant multiplied by a cube of the bandwidth used.
Parameters: Cutoff % Constant multiplier (c)
Pric
e M
ultip
le
Used Link Capacity (0% to 100%)
100%
1
Pmax
Cutoff %
Slope = cX3
26
http://netresearch.ics.uci.edu/ariffin/irex
Flat then Linear
Price has multiple 1 until a cutoff % is reached for link capacity usage.
After cutoff %, the price increases according to a linear equation of Price = c (mX) + 1
Parameters Cutoff % Constant Multiplier (c) Linear Slope (m)
Pric
e M
ultip
le
Used Link Capacity (0% to 100%)
100%
1
Pmax
Cutoff %
Slope = c(mX)
27
http://netresearch.ics.uci.edu/ariffin/irex
Tiered
Price has multiple 1 until a cutoff % is reached for link capacity usage.
There are 4 cutoff percentages with 4 price multiple levels.
Parameters Cutoff %
CP1, CP2, CP3, CP4
Price Levels P1, P2, P3, P4
Pric
e M
ultip
le
Used Link Capacity (0% to 100%)
P4
CP1 %
P3
P2
P1
CP2 % CP4 %CP3%
1
100 %
28
http://netresearch.ics.uci.edu/ariffin/irex
Simulation Topology
vBNSMCI’s Very High Speed Backbone Network System
L3Tier 1 ISP
29
http://netresearch.ics.uci.edu/ariffin/irex
iREX Metrics
SLA Comparative Metrics Congestion Probability Blocking Probability
iREX behavior Metrics Pareto Fairness Multipath Probability Num. Unique Paths
Overhead Metrics Setup Time Control Packets
Reputation Metrics Reputation Effectiveness Reputation Control Packets
Fault Tolerance Metrics Recovery Probability Recovery Time Recovery Control Packets
30
http://netresearch.ics.uci.edu/ariffin/irex
Congestion The total number of links that are congested globally divided by
the total number of requests successfully deployed globally. Link congested when > 50% of its capacity is in use.
iREX Causes Less Congestion
31
http://netresearch.ics.uci.edu/ariffin/irex
Blocking Probability The number of unsuccessful global ID deployments
divided by the total number of ID deployments attempted globally.
iREX allows moreReservations
32
http://netresearch.ics.uci.edu/ariffin/irex
Pareto Fairness The percentage of deployments that were successful
in the SLA configuration that is also successful in the iREX configuration.
iREX is > 80% Pareto Fair
33
http://netresearch.ics.uci.edu/ariffin/irex
Multi-Path probability The number of policies that are deployed globally that, at the
time of deployment, have more than one path connecting the same source destination domain pair divided by the total number of policies deployed globally.
iREX starts using Multipath at about18 % traffic load to
Maximize Bandwidth Efficiency
34
http://netresearch.ics.uci.edu/ariffin/irex
Unique Paths (between Los Angeles to Boston) The number of paths that has at least one path vector
link different from all other paths being used at the time of deployment.
iREX exploitsavailable pathswhen there is
available bandwidth
35
http://netresearch.ics.uci.edu/ariffin/irex
Setup Time The time starting when the domain first issues a
request for a policy deployment up to the time that the policy deployment is finally successful.
Worse case under 510 msat 6,000 kilometers.
36
http://netresearch.ics.uci.edu/ariffin/irex
Control Packets The average number of packet to setup a
deployment. Control packets divided by the number of deployments
Maximum of 10 control packetsper reservation deployment.
37
http://netresearch.ics.uci.edu/ariffin/irex
Reputation Effectiveness The number of reservation requests that arrive at the “bad”
domain while the iREX reputation system is active divided by the number of reservation requests that arrive at the “bad” domain without using the iREX reputation system.
iREX Reputationsystem is about
70% effective and takes about 3
minutes to activate.
38
http://netresearch.ics.uci.edu/ariffin/irex
Reputation Control PacketsAll reputation related control packets
generated across a time period
iREX ReputationOverhead is low
39
http://netresearch.ics.uci.edu/ariffin/irex
Recovery Probability The global total number of failed deployments
successfully recovered divided by the global total number of failed deployments.
iREX recovers 100%faults up to 30% load.
40
http://netresearch.ics.uci.edu/ariffin/irex
Recovery Time The time starting when a deployment fails up to the
time that the deployment is finally recovered.
iREX worse recovery timeis less than 1,200 ms
41
http://netresearch.ics.uci.edu/ariffin/irex
Recovery Control PacketsAll recovery related control packets divided by
the number of recovered deployments
iREX Overhead is low
42
http://netresearch.ics.uci.edu/ariffin/irex
iREX Presentation Outline
Problem Statement Our Solution Simulation Results Conclusion
43
http://netresearch.ics.uci.edu/ariffin/irex
Conclusion iREX
Architecture for self-managing inter-domain QoS policy deployment
Domains cooperate indirectly by optimizing their own benefit Ideas:
Economics (price) determine inter-domain path dynamics Reputation & Fault Tolerance enforces conformance
Benefits: Self Managing Inter-domain QoS policy Totally Distributed Low setup time ( < 500 ms) Efficient global traffic distribution Happily profitable non-cooperating ISPs