Michael J. Donahoo

Michael J. Donahoo

Auto-generated profile, based on publicly available information

Michael J. Donahoo

Baylor University

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2013 in ACM SIGAPP Applied Computing Review
Verified
Journal Article
Open access
Tomas CernyTomas Cerny
Tomas Cerny
KCKarel Cemus
Karel Cemus
MDMichael J. Donahoo
Michael J. Donahoo
ESEunjee Song
Eunjee Song
The increasing use of Web-based applications continues to broaden the user groups of enterprise applications at large. Since ordinary users often equate the quality of user interface (UI) with the quality of the entire application, the importance of providing easy-to-use UIs has been significantly increasing. Unfortunately, designing a single UI satisfying all end users remains challenging. To address this issue, researchers and developers are looking to Context-aware/Adaptive UIs (CUIs) that aim to provide end users with more personalized user interaction experiences. Although multiple proposals have been made, very few production systems provide such malleable interfaces due to the excessive cost of development and maintenance. In this paper, we propose a technique that aims to reduce development and maintenance efforts of CUI to a level comparable with a single UI. Unlike most of the existing CUI approaches, our technique does not involve an external UI model. Instead, it aims to reflect runtime-information and structures already captured in the application, while extending them to provide an appropriate CUI. With this technique, developers do not design forms or tables directly for each page or panel. Instead they design generic and reusable transformation rules capable of presenting application data instances in the UI while considering the runtime context. To demonstrate our technique and its impact on CUI development and maintenance, we provide a case study. Moreover, we present our experience from its application to an existing production-level enterprise application, with high demands on performance.

24 July 2015 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
Tomas CernyTomas Cerny
Tomas Cerny
MDMichael J. Donahoo
Michael J. Donahoo

27 March 2023
Verified
Conference Paper
Open access
ECErnesto Quevedo Caballero
Ernesto Quevedo Caballero
MDMichael Donahoo
Michael Donahoo
Tomas CernyTomas Cerny
Tomas Cerny
Computing devices with multiple active network interfaces, such as cellular, wired, and WiFi, are becoming more and more common. Typically, such devices select a single interface for communication, but throughput and availability can increase by utilizing multipath protocols. Multipath TCP (MPTCP) is the predominant protocol in this space; however, Multipath QUIC (MPQUIC) provides several advantages over MPTCP and is increasing in adoption. Multipath protocols use a multipath scheduler to determine which packets use which interface. Legacy schedulers exhibit good performance but often poorly handle adjusting to dynamic changes in the network. Recent research includes the development of several Deep Reinforcement Learning (DRL) based schedulers that outperform legacy schedulers and improve adaptability to changing network conditions. Evaluation of any packet scheduling approach must include an assessment of fairness to concurrent TCP flows. Specifically, under congestion conditions, all flows (multipath or unipath) should tend toward an equal share of the bandwidth. Unfortunately, MPQUIC DRL-based scheduler research does not include a rigorous analysis of the fairness aspect under various network conditions, risking significant network problems as adoption increases. We present an efficiency and fairness comparison of MPQUIC using DRL-based schedulers with classic agents like DQN, Deep SARSA, and Double DQN. Experimental results over a bi-path network show that these schedulers are TCP-friendly in many cases on both paths and converge to link-centric fairness on one path. However, our work shows that they are not TCP-friendly or can be bullied under certain conditions, degrading TCP or MPQUIC performance.


1 September 2011
Verified
Book Chapter
Closed access
PDF file
Tomas CernyTomas Cerny
Tomas Cerny
MDMichael J. Donahoo
Michael J. Donahoo

25 January 2025
Verified
Book Chapter
Closed access
PDF file
AOAbanisenioluwa Orojo
Abanisenioluwa Orojo
PBPranish Bhagat
Pranish Bhagat
JWJohn Wilburn
John Wilburn
MDMichael Donahoo
Michael Donahoo
NVNishant Vishwamitra
Nishant Vishwamitra