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

Koray Kokten

dblp:133/8322 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
—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
2 papers
Network management and operations · 85% Software-defined and programmable networks · 12% Routing and switching · 4%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › fault management
fault diagnosis
0.422016
On Optimal Topology Verification and Failure Localization for Software Defined Networks · IEEE/ACM Trans. Netw. 2016
On diagnosis of forwarding plane via static forwarding rules in Software Defined Networks · INFOCOM 2014
Network management and operations › fault management › fault diagnosis › fault localization
link failure localization
0.422016
On Optimal Topology Verification and Failure Localization for Software Defined Networks · IEEE/ACM Trans. Netw. 2016
On diagnosis of forwarding plane via static forwarding rules in Software Defined Networks · INFOCOM 2014
Network management and operations › fault management
failure localization
0.212016
On Optimal Topology Verification and Failure Localization for Software Defined Networks · IEEE/ACM Trans. Netw. 2016
Network management and operations › network verification
topology verification
0.212016
On Optimal Topology Verification and Failure Localization for Software Defined Networks · IEEE/ACM Trans. Netw. 2016
Software-defined and programmable networks
control plane
0.212014
On diagnosis of forwarding plane via static forwarding rules in Software Defined Networks · INFOCOM 2014

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

simulation · 0.2optimization · 0.2static rule placement · 0.2reachability analysis · 0.2
YearPublicationVenuePosition
2016 On Optimal Topology Verification and Failure Localization for Software Defined Networks
abstract
We present a new set of solutions for topology verification and failure localization in Software Defined Networks (SDNs). Our solutions are targeted towards offloading the control plane as much as possible and bringing more resilience against congestion or partitioning in the control plane. The core idea is to define control flows for network diagnosis and utilize a fraction of the forwarding table rules on the switches to serve these control flows. For topology verification, we present provably optimal or order-optimal solutions in total number of static forwarding rules and control messages. For single link failure localization, we present a solution that requires at least 3 |E| but at most 6 |E| forwarding rules using at most 1+log2 |E| control messages, where |E| denotes the number of bidirectional links in the forwarding plane. We analyze the latency vs. rule and control message optimality trade-offs showing that sub-second failure localization is possible even in data center scale networks without significant additional overhead in the number of static rules and control messages. We further simulate the performance of failure localization in identifying multiple link failures.
Ulas C. Kozat, Guanfeng Liang, Koray Kokten, János Tapolcai
IEEE/ACM Trans. Netw.3
2014 On diagnosis of forwarding plane via static forwarding rules in Software Defined Networks
abstract
Software Defined Networks (SDN) decouple the forwarding and control planes from each other. The control plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the forwarding plane. When parts of the control plane become unavailable or unreliable, individual controllers should still be able to monitor the forwarding plane and run diagnostics to take the correct routing actions. In our paper, we present solutions that install an optimal or near-optimal number of static forwarding rules on switches/routers for any controller to be able to verify the topology connectivity and detect/locate link failures at data plane speeds without relying on state updates from forwarding plane nodes and other controllers while requiring reachability to only one (arbitrary) forwarding node. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.
Ulas C. Kozat, Guanfeng Liang, Koray Kokten
INFOCOM3