2013 IEEE Global Communications Conference (GLOBECOM) 2013
DOI: 10.1109/glocom.2013.6831268
|View full text |Cite
|
Sign up to set email alerts
|

A performance study of network migration to SDN-enabled Traffic Engineering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0
1

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 53 publications
(32 citation statements)
references
References 6 publications
0
31
0
1
Order By: Relevance
“…The SDN migration problem we met first was that the model recommended by Google is not appropriate for R&E network. As we mentioned above, users in R&E network can be a service provider at any time.…”
Section: Sdn‐based All‐in‐one Solving For Bottlenecks and Incrementalmentioning
confidence: 99%
“…The SDN migration problem we met first was that the model recommended by Google is not appropriate for R&E network. As we mentioned above, users in R&E network can be a service provider at any time.…”
Section: Sdn‐based All‐in‐one Solving For Bottlenecks and Incrementalmentioning
confidence: 99%
“…In [21], we examined migration to energy-efficient routers. In [22], we defined the SDN migration scheduling problem and extended it in [23] to effectively partition legacy networks using SDN. Unlike most of our previous studies, in this paper, (a) in addition to technological aspects of SDN migration, we also consider its cost constraints, and, (b) in addition to optimization schemes, we also propose novel computationally-inexpensive, near-optimal greedy algorithms for SDN migration and compare their optimality, computational complexities, run times and network capacity gains with optimization schemes.…”
Section: Related Workmentioning
confidence: 99%
“…We consider a multi-period time horizon, where few routers migrate in each period (or timestep). We consider two scenarios: (a) an ISP con-Algorithm 1 Key-node computation for a path Input: Path p Output: K p ← Set of key-nodes of path p K p ← φ A ← Set of paths between source and destination of p with cost lesser than that of p for all a ∈ A do We first summarize the migration scheduling framework from our previous work [22], and then showcase our contributions.…”
Section: Optimizations and Greedy Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…The length of the planning horizon, i.e., the question in how many years (and partitioned in how many time periods) should the network be fully migrated, is an important question for an ISP, which was extensively studied in [8]. In our past work on migration in [9], we studied multi-period migration planning for Software Defined Networking (SDN), where we showed that finding strategic locations for SDNenabled routers for the early migration stages can significantly increase the number of alternative paths. Furthermore, the work [10] demonstrated an agent based modeling approach from the techno-economical perspective with consideration of multiple technologies.…”
Section: Introductionmentioning
confidence: 99%