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.

Shou-Chieh Chao

dblp:235/6124 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-author

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
Network measurement and analytics · 56% Internet architecture and protocols · 28% Routing and switching · 8%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › heavy hitter detection
elephant flow detection
0.412019
Flow Classification for Software-Defined Data Centers Using Stream Mining · IEEE Trans. Serv. Comput. 2019
Network measurement and analytics
traffic classification
0.412019
Flow Classification for Software-Defined Data Centers Using Stream Mining · IEEE Trans. Serv. Comput. 2019
Internet architecture and protocols
traffic management
0.412019
Flow Classification for Software-Defined Data Centers Using Stream Mining · IEEE Trans. Serv. Comput. 2019
Datacenter networks
flow scheduling
0.112019
Flow Classification for Software-Defined Data Centers Using Stream Mining · IEEE Trans. Serv. Comput. 2019
Routing and switching
routing
0.112019
Flow Classification for Software-Defined Data Centers Using Stream Mining · IEEE Trans. Serv. Comput. 2019

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

stream mining · 0.4data stream classification · 0.4
YearPublicationVenuePosition
2019 Flow Classification for Software-Defined Data Centers Using Stream Mining
abstract
Traffic management is known to be important to effectively utilize the high bandwidth provided by datacenters. Recent works have focused on identifying elephant flows and rerouting them to improve network utilization. These approaches however require either a significant monitoring overhead or hardware/end-host modifications. In this paper, we propose FlowSeer, a fast, low-overhead elephant flow detection and scheduling system using data stream mining. Our key idea is that the features from flows' first few packets allow us to train the streaming classification models that can accurately and quickly predict the rate and duration of any initiated flow. With these predicted information, FlowSeercan adapt routing polices of elephant flows to their demands and dynamic network conditions. Another nice property of FlowSeeris its capability of enabling the controller and switches to perform cooperative prediction. Most of decisions can be made by switches locally, thereby reducing both detection latency and signaling overhead. FlowSeerrequires less than 100 flow table entries at each switch to enable cooperative prediction, and hence can be implemented on off-the-shelf switches. The evaluation via both experiments in realistic virtual networks and trace-driven simulations shows that FlowSeerimproves the throughput by multiple times over Hedera, which pulls flow statistics, and performs comparably to Mahout, which needs end-host modification.
Shou-Chieh Chao, Kate Ching-Ju Lin, Ming-Syan Chen
IEEE Trans. Serv. Comput.1