Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erhan Lokman

dblp:158/1476 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › SDN controller
controller load balancing
0.312018
Dynamic Control Plane for SDN at Scale · IEEE J. Sel. Areas Commun. 2018
Software-defined and programmable networks › control plane
distributed control plane
0.312018
Dynamic Control Plane for SDN at Scale · IEEE J. Sel. Areas Commun. 2018
Software-defined and programmable networks
SDN control plane
0.312018
Dynamic Control Plane for SDN at Scale · IEEE J. Sel. Areas Commun. 2018

Methods — techniques the papers use, named apart from their topics

in-band control · 0.7control flow table · 0.7
YearPublicationVenuePosition
2018 Dynamic Control Plane for SDN at Scale
abstract
As SDN migrates to wide area networks and 5G core networks, a scalable, highly reliable, low latency distributed control plane becomes a key factor that differentiates operator solutions for network control and management. In order to meet the high reliability and low latency requirements under time-varying volume of control traffic, the distributed control plane, consisting of multiple controllers and a combination of out-of-band and in-band control channels, needs to be managed dynamically. To this effect, we propose a novel programmable distributed control plane architecture with a dynamically managed in-band control network, where in-band mode switches communicate with their controllers over a virtual overlay to the data plane with dynamic topology. We dynamically manage the number of controllers, switches, and control flows assigned to each controller as well as traffic over control channels achieving both controller and control traffic load-balancing. We introduce “control flow table” (rules embedded in the flow table of a switch to manage in-band control flows) in order to implement the proposed distributed dynamic control plane. We propose methods for off-loading congested controllers and congested in-band control channels using control flow tables. A validation test-bed and experimental results over multiple topologies are presented to demonstrate the scalability and performance improvements achieved by the proposed dynamic control plane management procedures when the controller CPU and/or availability or throughput of in-band control channels becomes bottlenecks.
Burak Gorkemli, Sinan Tatlicioglu, A. Murat Tekalp, Seyhan Civanlar, Erhan Lokman
IEEE J. Sel. Areas Commun.5
2017 Secure virtual network embedding with flexible bandwidth-based revenue maximization
Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman
Comput. Networks4
2016 Flexible bandwidth-based virtual network embedding
abstract
Virtual network operators may distrust each other and require that their virtual infrastructure is not cohosted on the same physical equipment. In this paper, we formulate a virtual network embedding problem that maximizes the total revenue where conflicting virtual network operators utilize distinct physical devices. Virtual links in our model have the option of selecting among a range of discrete bandwidth values, which have a corresponding price. This way, any revenue function can be realized. We evaluate the performance of our model by comparing it with a fixed bandwidth scheme and demonstrate its superior performance in terms of revenue.
Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman, Özcan Özyurt, Kazim Ulusoy
NOMS4