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

Sumet Prabhavat

dblp:20/10117 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0002-2880-7370ORCID · corroborated

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

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
Routing and switching · 61% Network performance modeling · 30% Content delivery and video streaming · 9%

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

TopicWeightPapersLastEvidence papers
Routing and switching
load sharing
0.112011
Effective Delay-Controlled Load Distribution over Multipath Networks · IEEE Trans. Parallel Distributed Syst. 2011
Routing and switching
multipath routing
0.112011
Effective Delay-Controlled Load Distribution over Multipath Networks · IEEE Trans. Parallel Distributed Syst. 2011
Content delivery and video streaming
multimedia transmission
0.012011
Effective Delay-Controlled Load Distribution over Multipath Networks · IEEE Trans. Parallel Distributed Syst. 2011

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

simulation · 0.1analytical modeling · 0.1
YearPublicationVenuePosition
2019 Low Overhead Localized Routing in Mobile Ad Hoc Networks
abstract
Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.
Sumet Prabhavat, Worrawat Narongkhachavana, Thananop Thongthavorn, Chanakan Phankaew
Wirel. Commun. Mob. Comput.1
2016 An efficient spreading Epidemic Routing for Delay-Tolerant Network
abstract
Delay-Tolerant Network (DTN) is a network technology which can provide communication in an environment where an end-to-end path may not be possible. Over the past years, Epidemic Routing has been recognized as the DTN protocol that can deliver messages quickly by spreading messages from node to node all over the network. However, many pieces of research argue against using Epidemic Routing due to the large number of message exchanges. In this paper, we propose Speed Epidemic Routing (SEd), which is the renovation of Epidemic Routing scheme. By applying broadcast transmission, we can increase the speed of messages spreading and reduce forwarding redundant messages. The simulation results show that SEd is a protocol providing high delivery rate and low packet rate at the same time.
Teerapong Choksatid, Worrawat Narongkhachavana, Sumet Prabhavat
CCNC3
2016 A new explicit congestion notification scheme for satellite IP networks
Satoshi Utsumi, Salahuddin Muhammad Salim Zabir, Sumet Prabhavat
J. Netw. Comput. Appl.3
2014 An Epidemic Routing with Low Message Exchange Overhead for Delay Tolerant Networks
Teerapong Choksatid, Sumet Prabhavat
ICSEng2
2011 Effective Delay-Controlled Load Distribution over Multipath Networks
abstract
Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. An effective model of delay-controlled load distribution becomes essential to efficiently utilize such parallel paths for multimedia data transmission and real-time applications, which are commonly known to be sensitive to packet delay, packet delay variation, and packet reordering. Recent research on load distribution has focused on load balancing efficiency, bandwidth utilization, and packet order preservation; however, a majority of the solutions do not address delay-related issues. This paper proposes a new load distribution model aiming to minimize the difference among end-to-end delays, thereby reducing packet delay variation and risk of packet reordering without additional network overhead. In general, the lower the risk of packet reordering, the smaller the delay induced by the packet reordering recovery process, i.e., extra delay induced by the packet reordering recovery process is expected to decrease. Therefore, our model can reduce not only the end-to-end delay but also the packet reordering recovery time. Finally, our proposed model is shown to outperform other existing models, via analysis and simulations.
Sumet Prabhavat, Hiroki Nishiyama 0001, Nirwan Ansari, Nei Kato
IEEE Trans. Parallel Distributed Syst.1