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

Kun-Che Hsu

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

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

Software engineering, systems software and programming languages · 1

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
Internet of things and sensor networks · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 50% Performance modeling and evaluation · 50%

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

TopicWeightPapersLastEvidence papers
Services computing and microservices
service-oriented architecture
0.212014
Improving Heterogeneous SOA-Based IoT Message Stability by Shortest Processing Time Scheduling · IEEE Trans. Serv. Comput. 2014
Performance modeling and evaluation › queueing models
priority queueing
0.112014
Improving Heterogeneous SOA-Based IoT Message Stability by Shortest Processing Time Scheduling · IEEE Trans. Serv. Comput. 2014
Embedded and real-time systems
real-time scheduling
0.112014
Improving Heterogeneous SOA-Based IoT Message Stability by Shortest Processing Time Scheduling · IEEE Trans. Serv. Comput. 2014

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

shortest processing time scheduling · 0.6
YearPublicationVenuePosition
2014 Improving Heterogeneous SOA-Based IoT Message Stability by Shortest Processing Time Scheduling
abstract
An Internet of Things (IoT) system features integration information from heterogeneous sensor devices, allowing them to deliver a variety of sensed information through networks. An IoT broker in the system acts as an information exchange center, relaying periodic messages from heterogeneous sensor devices to IoT clients. As more devices participate in the IoT system, the service scale of entire system increases. To overcome the limitation of the number of direct links to an single working element, the whole IoT system should be divided into many subsystems, called IoT units, to form the system hierarchy. Furthermore, applying the service-oriented architecture (SOA) concept to realize the IoT service can facilitate to adapt the future-proof devices to the IoT system. Normally, a web-based message visualization can unify the client interface in a SOA-based system. However, a large volume of web-based messages with various sizes are not easy to be stably displayed at the client side. This paper proposes an IoT system skeleton and a shortest processing time (SPT) algorithm for scheduling web-based IoT messages. The implemented scheduling scheme supported by a priority queue model can effectively stablize the response messages from the scattered IoT sensors per each client request.
Jenq-Shiou Leu, Chi-Feng Chen, Kun-Che Hsu
IEEE Trans. Serv. Comput.3