Name
Abstract | ||
|---|---|---|
Software-defined Networking proposes an alternative paradigm on network programmability based on the separation of control and forwarding planes. Discovering network elements in a dynamic and optimized fashion, able to cope with the ever-growing network traffic, is a key requirement for SDN networks, in order to ensure a data center's robustness and manageability. OpenFlow's approach for creating the topology map is by exchanging LLDP frames between the controller and the forwarding elements. This paper proposes a better usage of LLDP by taking advantage of existing hardware capabilities to extract information directly from the data plane to the control plane in order to construct a dynamic and automatic topology discovery algorithm. Following this procedure to obtain the topology map and using the IETF's ForCES framework, we managed to model a generic method for extracting the required LLDP information from the datapath to the controller. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/NETSOFT.2015.7116181 | NetSoft |
Keywords | Field | DocType |
component, Software-Defined Networking, ForCES, OpenFlow, Topology Discovery, LLDP, Shortest Path | Logical topology,Forwarding plane,Control theory,Computer science,Computer network,Network topology,Robustness (computer science),OpenFlow,Network element,Routing table,Distributed computing | Conference |
Citations | PageRank | References |
8 | 0.60 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Tarnaras | 1 | 8 | 0.94 |
| Evangelos Haleplidis | 2 | 84 | 12.00 |
| Spyros G. Denazis | 3 | 131 | 19.98 |