2018
DOI: 10.5937/telfor1801014t
|View full text |Cite
|
Sign up to set email alerts
|

Traffic engineering approach to virtual-link provisioning in software-defined ISP networks

Abstract: -In this paper, we propose a new approach to virtual-link provisioning in ISP (Internet Service Provider) networks. The approach relies on Software Defined Networking (SDN) architecture based on OpenFlow that allows highly granular traffic splitting across multiple paths. The traffic control logic of SDN controller is divided into offline and online component. The online component handles dynamic arrivals of virtual-link requests in accordance with Service Level Agreements (SLAs) requirements. The offline comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…In order to evaluate the performance of the proposed approach, we built a simulator in Python that uses CPLEX [14] to solve the optimization problems. We used POP (Points of Presence)-level Sprint ISP topology [6], where link capacities were set to 1000 units, while delay on each link was derived from a great circle distance between the connected POPs and the speed of light in the fiber. Equal link capacities were assumed based on [15].…”
Section: The Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…In order to evaluate the performance of the proposed approach, we built a simulator in Python that uses CPLEX [14] to solve the optimization problems. We used POP (Points of Presence)-level Sprint ISP topology [6], where link capacities were set to 1000 units, while delay on each link was derived from a great circle distance between the connected POPs and the speed of light in the fiber. Equal link capacities were assumed based on [15].…”
Section: The Simulation Resultsmentioning
confidence: 99%
“…The pseudo-code of the heuristic is given in Algorithm 1. We start by solving the linear programming (LP) optimization model that minimizes MLU for the current traffic matrix [6]. The model can be solved in polynomial time if delay-matching tunnels for both traffic classes are known in advance.…”
Section: ) Generation Of Approximated Pareto Frontiermentioning
confidence: 99%
See 2 more Smart Citations