2015 Fourth European Workshop on Software Defined Networks 2015
DOI: 10.1109/ewsdn.2015.77
|View full text |Cite
|
Sign up to set email alerts
|

DynPaC: A Path Computation Framework for SDN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0
2

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 1 publication
0
6
0
2
Order By: Relevance
“…In the control plane, the SDN controller runs the Disjoint Path-Computing (DisPaC) application, which is responsible for the forwarding in the core network. DisPaC is based on the path computation element (PCE) described in [13]. The PCE calculates disjoint paths between two switches-edge switches in Figure 3-and the service manager installs the correct flow rules in the OF switches.…”
Section: Sdn Path-computing Applicationmentioning
confidence: 99%
“…In the control plane, the SDN controller runs the Disjoint Path-Computing (DisPaC) application, which is responsible for the forwarding in the core network. DisPaC is based on the path computation element (PCE) described in [13]. The PCE calculates disjoint paths between two switches-edge switches in Figure 3-and the service manager installs the correct flow rules in the OF switches.…”
Section: Sdn Path-computing Applicationmentioning
confidence: 99%
“…until failure occurs, except some traffic engineering methods such as the ADMPCF (Luo et al, 2015), which continuously strive to look for good paths in the network that will be stored as backups and to be employed when an incident occurs. Similarly, Mendiola et al (2015) developed the Dynamic Path Computation (DynPac) framework as a traffic engineering technique to improve the network resource utilisation. DynPac uses a stateful path computation element (PCE) that computes and stores all possible paths between all source and destination pairs in a database and it guarantees the bandwidth allocation for the requested services.…”
Section: /26mentioning
confidence: 99%
“…As mentioned before, OpenFlow can improve the network resource utilisation through flow relocation and disaggregation mechanisms. On the one hand, the Dynamic Path Computation (DynPaC) Framework [146] provides resilient E2E L2 circuits with bandwidth guarantees in OpenFlow-enabled domains, and it is currently being integrated with AutoBAHN [18], the multi-domain BoD service provisioning tool of the pan-European REN Géant. The framework consists of a stateful PCE that computes the shortest path that satisfies the bandwidth constraints for a given period of time, in which the network resources already consumed by other services are taken into account.…”
Section: B Openflowmentioning
confidence: 99%
“…The case of OpenFlow is of particular interest because it does not impose a specific routing algorithm or any legacy routing protocol. In OpenFlow, the controller plane can be fully programmed from scratch and implement, for instance, alternative routing protocols, even non-IP ones [146].…”
Section: B Contributions Of D-cpi Protocols To Tementioning
confidence: 99%