Works (173)

Updated: March 9th, 2026 15:25

2025 conference paper

Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs

International Conference on Machine Learning, https-proceedings.

By: J. Hu, Y. Ma & D. Eun

Source: ORCID
Added: March 9, 2026

2025 journal article

Effective Delayed Patching for Transient Malware Control on Networks

ArXiv e-Prints, arXiv-2510.

By: M. Phu Vuong, C. Lee & D. Eun

Source: ORCID
Added: March 9, 2026

2025 conference paper

Effective Delayed Patching for Transient Malware Control on Networks

2025 IEEE 22nd International Conference on Mobile Ad-Hoc and Smart Systems (MASS), 189–197.

By: M. Vuong, C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2024 conference paper

Accelerating distributed stochastic optimization via self-repellent random walks

International Conference on Learning Representations.

By: J. Hu, V. Doshi & D. Eun

Source: ORCID
Added: March 9, 2026

2024 conference paper

Central limit theorem for two-timescale stochastic approximation with markovian noise: Theory and applications

International Conference on Artificial Intelligence and Statistics, 1477–1485.

By: J. Hu, V. Doshi & others

Event: PMLR

Source: ORCID
Added: March 9, 2026

2024 journal article

Does worst-performing agent lead the pack? analyzing agent dynamics in unified distributed sgd

Advances in Neural Information Processing Systems, 37, 72754–72789.

By: J. Hu, Y. Ma & D. Eun

Source: ORCID
Added: March 9, 2026

2024 conference paper

Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks

Proceedings of the International AAAI Conference on Web and Social Media, 18, 1013–1026.

By: S. Mallick, V. Doshi & others

Source: ORCID
Added: March 9, 2026

2023 conference paper

Controlling epidemic spread under immunization delay constraints

2023 IFIP Networking Conference (IFIP Networking), 1–9.

By: S. Li, X. Huang, C. Lee & D. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2023 conference paper

Self-repellent random walks on general graphs-achieving minimal sampling variance via nonlinear markov chains

International Conference on Machine Learning, 8403–8423.

By: V. Doshi, J. Hu & others

Event: PMLR

Source: ORCID
Added: March 9, 2026

2022 conference paper

Bi-SIS Epidemics on Graphs -- Quantitative Analysis of Coexistence Equilibria

IEEE CDC (Conference on Decision and Control), 2022, https-arxiv.

By: V. Doshi, J. Hu & D. Eun

Source: ORCID
Added: March 9, 2026

2022 article

Convergence of Bi-Virus Epidemic Models With Non-Linear Rates on Networks—A Monotone Dynamical Systems Approach

Doshi, V., Mallick, S., & Eun, D. Y. (2022, November 3). IEEE/ACM Transactions on Networking.

By: V. Doshi n, S. Mallick n & D. Eun n

author keywords: Epidemics on networks; bi-virus models; multi-layer graphs; monotone dynamical systems
topics (OpenAlex): Mathematical and Theoretical Epidemiology and Ecology Models; Evolution and Genetic Dynamics; Complex Network Analysis Techniques
TL;DR: These results are the first in providing complete convergence analysis for the bi-virus system with non-linear infection and recovery rates on general graphs, and are the best of their knowledge. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: July 31, 2023

2022 conference paper

Efficiency Ordering of Stochastic Gradient Descent

NeurIPS 2022, https-arxiv.

By: J. Hu, V. Doshi & D. Eun

Source: ORCID
Added: March 9, 2026

2022 article

Minimizing File Transfer Time in Opportunistic Spectrum Access Model

Hu, J., Doshi, V., & Eun, D. Y. (2022, October 10). IEEE Transactions on Mobile Computing, Vol. 23, pp. 630–644.

By: J. Hu n, V. Doshi n & D. Eun n

author keywords: Delays; Throughput; Sensors; Switches; Mathematical models; Vehicle dynamics; Computational modeling; Opportunistic spectrum access; file transfer problem; minimum transfer time; shortest path problem
topics (OpenAlex): Cognitive Radio Networks and Spectrum Sensing; Age of Information Optimization; Advanced Queuing Theory Analysis
TL;DR: This work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transferTime in general. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: January 7, 2024

2022 journal article

Minimizing File Transfer Time in Opportunistic Spectrum Access Model

IEEE Transactions on Mobile Computing, 23(1), 630–644.

By: J. Hu, V. Doshi & others

Source: ORCID
Added: March 9, 2026

2021 article

Competing Epidemics on Graphs - Global Convergence and Coexistence

Doshi, V., Mallick, S., & Eun, D. Y. (2021, May 10). IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021).

By: V. Doshi n, S. Mallick n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Mathematical and Theoretical Epidemiology and Ecology Models; Opinion Dynamics and Social Influence
TL;DR: This paper obtains convergence results for the entirety of the model parameter space, giving precise conditions under which the system globally converges to a trichotomy of possible outcomes: a virus-free state, a single-virus state, and to a coexistence state – the first such result. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
3. Good Health and Well-being (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: November 23, 2021

2021 conference paper

Competing epidemics on graphs-global convergence and coexistence

IEEE infocom 2021-IEEE conference on computer communications, 1–10.

By: V. Doshi, S. Mallick & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2021 article

Controlling Metastable Infection Patterns in Multilayer Networks via Interlink Design

Chattopadhyay, S., Dai, H., & Eun, D. Y. (2021, August 27). IEEE Transactions on Network Science and Engineering.

By: S. Chattopadhyay n, H. Dai n & D. Eun n

author keywords: Epidemics; Nonhomogeneous media; Steady-state; Network topology; Transient analysis; Thermodynamics; Interlink design; localized epidemics; multilayer networks; susceptible-infected-susceptible model
topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Opportunistic and Delay-Tolerant Networks
TL;DR: This work compares the interlinking strategies developed in this work to some popular heuristics and demonstrates their superiority by extensive simulation experiments on both synthetic and real-world networks. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
3. Good Health and Well-being (OpenAlex)
Source: Web Of Science
Added: January 3, 2022

2021 conference paper

Opportunistic spectrum access: Does maximizing throughput minimize file transfer time?

2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt), 1–8.

By: J. Hu, V. Doshi & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2020 article

Energy-Aware Stochastic UAV-Assisted Surveillance

Hosseinalipour, S., Rahmati, A., Eun, D. Y., & Dai, H. (2020, December 21). IEEE Transactions on Wireless Communications, Vol. 20, pp. 2820–2837.

By: S. Hosseinalipour n, A. Rahmati n, D. Eun n & H. Dai n

Contributors: S. Hosseinalipour n, A. Rahmati n, D. Eun n & H. Dai n

author keywords: Surveillance; Inspection; Batteries; Trajectory; Unmanned aerial vehicles; Approximation algorithms; Programming; Unmanned aerial vehicles (UAVs); surveillance; random walks; energy-aware design; Markov chains
topics (OpenAlex): UAV Applications and Optimization; Distributed Control Multi-Agent Systems; Robotic Path Planning Algorithms
TL;DR: A novel framework for stochastic UAV-assisted surveillance that inherently considers the battery constraints of the UAVs, proposes random moving patterns modeled via random walks, and adds another degree of randomness to the system via considering probabilistic inspections is proposed. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Web Of Science, ORCID
Added: June 10, 2021

2020 journal article

Energy-aware stochastic UAV-assisted surveillance

IEEE Transactions on Wireless Communications, 20(5), 2820–2837.

By: S. Hosseinalipour, A. Rahmati, D. Eun & H. Dai

Source: ORCID
Added: March 9, 2026

2020 article

Fiedler Vector Approximation via Interacting Random Walks

Doshi, V., & Eun, D. Y. (2020, June 8). SIGMETRICS Performance 2020 - Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems, pp. 101–102.

By: V. Doshi n & D. Eun n

Contributors: V. Doshi n & D. Eun n

topics (OpenAlex): Graph theory and applications; Complex Network Analysis Techniques; Markov Chains and Monte Carlo Methods
Source: ORCID
Added: March 9, 2026

2020 journal article

Fiedler vector approximation via interacting random walks

Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4(1), 1–28.

By: V. Doshi & D. Eun

Source: ORCID
Added: March 9, 2026

2020 article

Trapping Malicious Crawlers in Social Networks

Li, S., Lee, C.-H., & Eun, D. Y. (2020, October 19). International Conference on Information and Knowledge Management, Proceedings, pp. 775–784.

By: S. Li*, C. Lee* & D. Eun n

Contributors: S. Li*, C. Lee* & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Spam and Phishing Detection; Peer-to-Peer Network Technologies
Source: ORCID
Added: March 9, 2026

2020 conference paper

Trapping malicious crawlers in social networks

Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 775–784.

By: S. Li, C. Lee & D. Eun

Source: ORCID
Added: March 9, 2026

2019 article

Maximization of Robustness of Interdependent Networks Under Budget Constraints

Chattopadhyay, S., Dai, H., & Eun, D. Y. (2019, August 14). IEEE Transactions on Network Science and Engineering, Vol. 7, pp. 1441–1452.

By: S. Chattopadhyay n, H. Dai n & D. Eun n

Contributors: S. Chattopadhyay n, H. Dai n & D. Eun n

author keywords: Robustness; Measurement; Nonhomogeneous media; Mathematical model; Network topology; Optimization; Power system faults; Multilayer failure propagation; cost constrained optimization; network robustness; interdependent networks
topics (OpenAlex): Complex Network Analysis Techniques; Graph theory and applications; Advanced Optical Network Technologies
TL;DR: This work presents a surrogate metric based framework for constructing interlinks and proposes metrics to track the network robustness for each of these mechanisms, and is able to introduce the cost of construction into the interlink design problem, a practical feature largely ignored in relevant literature. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: September 21, 2020

2019 article

Non-Markovian Monte Carlo on Directed Graphs

Lee, C.-H., Kang, M., & Eun, D. Y. (2019, June 20). SIGMETRICS Performance 2019 - Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems, pp. 95–96.

By: C. Lee*, M. Kang n & D. Eun n

Contributors: C. Lee*, M. Kang n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Stochastic processes and statistical mechanics
Source: ORCID
Added: March 9, 2026

2019 conference paper

Non-Markovian Monte Carlo on Directed Graphs

Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 3(1).

By: C. Lee, M. Kang & D. Eun

Source: NC State University Libraries
Added: July 10, 2019

2019 journal article

Non-Markovian Monte Carlo on Directed Graphs

Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3(1), 1–31.

By: C. Lee, M. Kang & D. Eun

Source: ORCID
Added: March 9, 2026

2019 article

Prevention and Mitigation of Catastrophic Failures in Demand-Supply Interdependent Networks

Hosseinalipour, S., Mao, J., Eun, D. Y., & Dai, H. (2019, November 5). IEEE Transactions on Network Science and Engineering, Vol. 7, pp. 1710–1723.

By: S. Hosseinalipour n, J. Mao*, D. Eun n & H. Dai n

Contributors: S. Hosseinalipour n, J. Mao*, D. Eun n & H. Dai n

author keywords: Power system faults; Power system protection; Robustness; Stress; Load modeling; Adaptation models; Resource management; Interdependent networks; demand-supply networks; robustness; resource and load fluctuations; cascading failures
topics (OpenAlex): Infrastructure Resilience and Vulnerability Analysis; Complex Network Analysis Techniques; Supply Chain Resilience and Risk Management; Advanced Queuing Theory Analysis
TL;DR: A generic system model for a special category of interdependent networks, demand-supply networks, in which the demand and the supply nodes are associated with heterogeneous loads and resources, which sheds a light on a unique cascading failure mechanism induced by resource/load fluctuations. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: September 21, 2020

2019 article

Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks

Lee, C.-H., Tenneti, S., & Eun, D. Y. (2019, June 4). Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 191–200.

By: C. Lee*, S. Tenneti n & D. Eun n

Contributors: C. Lee*, S. Tenneti n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Network Security and Intrusion Detection
TL;DR: A theoretical framework is developed that allows for an accurate closed-form approximate solution to the original SI dynamics on any arbitrary network, which captures the temporal dynamics over all time and is tighter than the existing approximation, and also to provide a new interpretation via reliability theory. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
3. Good Health and Well-being (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 24, 2020

2019 conference paper

Transient dynamics of epidemic spreading and its mitigation on large networks

Proceedings of the twentieth ACM international symposium on mobile ad hoc networking and computing, 191–200.

By: C. Lee, S. Tenneti & D. Eun

Source: ORCID
Added: March 9, 2026

2017 article

Challenging the limits: Sampling online social networks with cost constraints

Xu, X., Lee, C.-H., & Eun, D. Y. (2017, May 1).

By: X. Xu n, C. Lee* & D. Eun n

Contributors: X. Xu n, C. Lee* & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Spam and Phishing Detection
TL;DR: A mathematical framework such that the cost of sampling is properly taken into account is developed, which re-defines a widely used asymptotic variance into a cost-based asymPTotic variance, and enables one to design more sophisticated sampling strategies with an array of control knobs. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2017 conference paper

Challenging the limits: Sampling online social networks with cost constraints

IEEE Infocom 2017-IEEE Conference on Computer Communications, 1–9.

By: X. Xu, C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2017 article

Designing Optimal Interlink Patterns to Maximize Robustness of Interdependent Networks Against Cascading Failures

Chattopadhyay, S., Dai, H., Eun, D. Y., & Hosseinalipour, S. (2017, May 29). IEEE Transactions on Communications, Vol. 65, pp. 3847–3862.

By: S. Chattopadhyay n, H. Dai n, D. Eun n & S. Hosseinalipour n

Contributors: S. Chattopadhyay n, H. Dai n, D. Eun n & S. Hosseinalipour n

author keywords: Interdependent networks; optimal interlinks; targeted attack; network robustness
topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Stochastic processes and statistical mechanics
Sources: Web Of Science, ORCID
Added: August 6, 2018

2017 journal article

Designing Optimal Interlink Patterns to Maximize Robustness of Interdependent Networks Against Cascading Failures

IEEE Transactions on Communications, 65(9), 3847–3862.

By: H. Srinjoy Chattopadhyay, D. Eun & S. Hosseinalipour

Source: ORCID
Added: March 9, 2026

2017 conference paper

On the Rao-Blackwellization and its application for graph sampling via neighborhood exploration

IEEE INFOCOM 2017-IEEE Conference on Computer Communications, 1–9.

By: C. Lee, X. Do & Y. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2017 article

On the rao-blackwellization and its application for graph sampling via neighborhood exploration

Lee, C.-H., Do, X. X., & Eun, Y. (2017, May 1). Proceedings - IEEE INFOCOM.

By: C. Lee*, X. Do n & Y. Eun n

Contributors: C. Lee*, X. Do n & Y. Eun n

topics (OpenAlex): HIV, Drug Use, Sexual Risk; Complex Network Analysis Techniques; Advanced Combinatorial Mathematics
TL;DR: This work proposes two forms of Rao-Blackwellization that can be used as a swap-in replacement for virtually all random-walk graph sampling methods, and proves that the ‘Rao- blackwellized’ estimators reduce the (asymptotic) variances of their original estimators yet maintain their inherent unbiasedness. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (OpenAlex)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2016 conference paper

An Antithetic Coupling Approach to Multi-Chain based CSMA Scheduling Algorithms

IEEE Infocom.

By: J. Eun & D. Young

Source: ORCID
Added: March 9, 2026

2016 article

An antithetic coupling approach to multi-chain based CSMA scheduling algorithms

Kwak, J., & Eun, D. Y. (2016, April 1). Proceedings - IEEE INFOCOM.

By: J. Kwak n & D. Eun n

Contributors: J. Kwak n & D. Eun n

topics (OpenAlex): Advanced Queuing Theory Analysis; Age of Information Optimization; Wireless Communication Networks Research
TL;DR: This paper develops a new approach via an antithetic coupling (AC) method, which can further improve the delay performance of those that virtually emulate multiple chains of CSMA algorithms, and confirms that AC-CSMA always delivers better queueing performance over a variety of network scenarios. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2016 article

Optimal CSMA Scheduling With Look Ahead Mechanism for Wireless Networks

Choi, J.-G., & Eun, D. Y. (2016, August 1). IEEE Wireless Communications Letters, Vol. 5, pp. 508–511.

By: J. Choi* & D. Eun n

Contributors: J. Choi* & D. Eun n

author keywords: Optimal CSMA; distributed link scheduling; low delay; throughput optimality; multihop wireless network
topics (OpenAlex): Advanced Wireless Network Optimization; Advanced MIMO Systems Optimization; Wireless Communication Networks Research
TL;DR: This work proposes looks ahead (LA)-CSMA algorithm in which each link LA its state update in advance and utilizes this free information during the contention stage of Q-CSMA, thereby leading to significantly smaller delay without any additional overhead. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2016 journal article

Optimal CSMA Scheduling With Look Ahead Mechanism for Wireless Networks

IEEE Wireless Communications Letters, 5(5), 508–511.

By: J. Choi & others

Source: ORCID
Added: March 9, 2026

2015 article

A High-Order Markov-Chain-Based Scheduling Algorithm for Low Delay in CSMA Networks

Kwak, J., Lee, C.-H., & Eun, D. Y. (2015, August 18). IEEE/ACM Transactions on Networking, Vol. 24, pp. 2278–2290.

By: J. Kwak n, C. Lee* & D. Eun n

Contributors: J. Kwak n, C. Lee* & D. Eun n

author keywords: Carrier sense multiple access (CSMA); Markov chain; scheduling algorithms; wireless networks
topics (OpenAlex): Advanced Wireless Network Optimization; Interconnection Networks and Systems; Advanced MIMO Systems Optimization
TL;DR: This paper shows that the proposed CSMA algorithm, named delayed CSMA, achieves the throughput optimality, and also provides much better delay performance by effectively “decorrelating” the link state process (and thus resolves link starvation). (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 journal article

Characterizing link connectivity in opportunistic networks

Opportunistic Mobile Social Networks, 71–97.

By: C. Lee & D. Eun

Source: NC State University Libraries
Added: August 6, 2018

2015 article

Energy-Efficient Wi-Fi Sensing Policy Under Generalized Mobility Patterns With Aging

Jeong, J., Yi, Y., Cho, J.-W., Eun, D. Y., & Chong, S. (2015, September 10). IEEE/ACM Transactions on Networking, Vol. 24, pp. 2416–2428.

By: J. Jeong*, Y. Yi*, J. Cho*, D. Eun n & S. Chong*

Contributors: J. Jeong*, Y. Yi*, J. Cho*, D. Eun n & S. Chong*

author keywords: Aging; energy efficiency; functional optimization; Wi-Fi sensing
topics (OpenAlex): Green IT and Sustainability; Advanced MIMO Systems Optimization; Human Mobility and Location-Based Analysis
TL;DR: This paper develops a new sensing algorithm, called Wi-Fi Sensing with AGing (WiSAG), and demonstrates that WiSAG outperforms the existing sensing algorithms up to 37% through extensive trace-driven simulations for which real mobility traces gathered from hundreds of smartphones is used. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 journal article

Energy-efficient Wi-Fi sensing policy under generalized mobility patterns with aging

IEEE/ACM Transactions on Networking, 24(4), 2416–2428.

By: J. Jeong, Y. Yi, J. Cho, D. Eun & S. Chong

Source: ORCID
Added: March 9, 2026

2015 article

Exploiting Heterogeneity for Improving Forwarding Performance in Mobile Opportunistic Networks: An Analytic Approach

Lee, C.-H., & Eun, D. Y. (2015, February 26). IEEE Transactions on Mobile Computing, Vol. 15, pp. 150–162.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

author keywords: Mobile opportunistic networks; heterogeneous contact behaviors between different mobile nodes; heterogeneity-aware forwarding policies; forwarding performance; performance analysis
topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; ICT in Developing Communities; Caching and Content Delivery
TL;DR: An analytical framework is developed to quantify the performance gain achievable by exploiting the heterogeneity in mobile nodes' contact dynamics and derive a delay upper bound of a heterogeneity-aware static forwarding policy per each given number of message copies, which enables a quantitative study on the benefit of leveraging underlying heterogeneity structure in the design of forwarding algorithms. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 journal article

Exploiting heterogeneity for improving forwarding performance in mobile opportunistic networks: An analytic approach

IEEE Transactions on Mobile Computing, 15(1), 150–162.

By: C. Lee & others

Source: ORCID
Added: March 9, 2026

2015 article

Modeling time-sensitive information diffusion in online social networks

Xu, X., Chen, X., & Eun, D. Y. (2015, April 1). Proceedings - IEEE INFOCOM, pp. 408–413.

By: X. Xu n, X. Chen n & D. Eun n

Contributors: X. Xu n, X. Chen n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Opinion Dynamics and Social Influence; Opportunistic and Delay-Tolerant Networks
TL;DR: A continuous-time model for information diffusion with time-varying diffusion (infection) rate is proposed and it is proved that there exists an elegant time-rescaling relationship between these two cases, such that any available result on the standard SI model can readily carry over to the time-Varying case. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 conference paper

Modeling time-sensitive information diffusion in online social networks

2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 408–413.

By: X. Xu, X. Chen & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2015 conference paper

On the Efficiency-Optimal Markov Chains for Distributed Networking Applications

IEEE INFOCOM.

By: C. Eun & D. Young

Source: ORCID
Added: March 9, 2026

2015 article

On the efficiency-optimal Markov chains for distributed networking applications

Lee, C.-H., & Eun, D. Y. (2015, April 1). Proceedings - IEEE INFOCOM, Vol. 26, pp. 1840–1848.

By: C. Lee* & D. Eun n

Contributors: C. Lee* & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Stochastic processes and statistical mechanics; Optimization and Search Problems
TL;DR: This work presents simple yet effective distributed algorithms that are guaranteed to improve the Metropolis-Hastings algorithm over time when running on a graph, and eventually reach `efficiency-optimality', while ensuring the same desired stationary distribution throughout. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 article

Towards Distributed Optimal Movement Strategy for Data Gathering in Wireless Sensor Networks

Lee, C.-H., Kwak, J., & Eun, D. Y. (2015, February 27). IEEE Transactions on Parallel and Distributed Systems, Vol. 27, pp. 574–584.

By: C. Lee n, J. Kwak n & D. Eun n

Contributors: C. Lee n, J. Kwak n & D. Eun n

author keywords: Wireless sensor networks; mobile collectors; data gathering; Markovian random-walk movement strategies; distributed optimal movement strategy; network loss probability
topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Energy Efficient Wireless Sensor Networks
TL;DR: This paper obtains the optimal movement strategy among a class of Markovian strategies so as to minimize the data loss rate over all sensor nodes, and explains how such an optimalmovement strategy can be made to work in a distributed fashion. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 journal article

Towards distributed optimal movement strategy for data gathering in wireless sensor networks

IEEE Transactions on Parallel and Distributed Systems, 27(2), 574–584.

By: C. Lee, J. Kwak & others

Source: ORCID
Added: March 9, 2026

2014 conference paper

A High-order Markov Chain Based Scheduling Algorithm for Low Delay in CSMA Networks

IEEE Infocom.

By: J. Kwak, C. Lee & D. Eun

Source: ORCID
Added: March 9, 2026

2014 article

A general framework of hybrid graph sampling for complex network analysis

Xu, X., Lee, C.-H., & Eun, D. Y. (2014, April 1). Proceedings - IEEE INFOCOM, pp. 2795–2803.

By: X. Xu n, C. Lee n & D. Eun n

Contributors: X. Xu n, C. Lee n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Stochastic processes and statistical mechanics; Markov Chains and Monte Carlo Methods
TL;DR: A hybrid graph sampling framework is developed that inherits the benefit of returning immediate samples from random walk-based crawling, while incorporating the advantage of reducing the correlation in the obtained samples fromrandom jump, to strike the right balance between random jump and crawling. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2014 conference paper

A general framework of hybrid graph sampling for complex network analysis

IEEE INFOCOM 2014-IEEE Conference on Computer Communications, 2795–2803.

By: X. Xu, C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2014 article

A high-order Markov chain based scheduling algorithm for low delay in CSMA networks

Kwak, J., Lee, C.-H., & Eun, D. Y. (2014, April 1). Proceedings - IEEE INFOCOM, pp. 1662–1670.

By: J. Kwak n, C. Lee n & D. Eun n

Contributors: J. Kwak n, C. Lee n & D. Eun n

topics (OpenAlex): Advanced Wireless Network Optimization; Advanced MIMO Systems Optimization; Wireless Communication Networks Research
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2014 journal article

Characterizing Link Connectivity in Opportunistic Networks

Opportunistic Mobile Social Networks, 71.

By: C. Lee & D. Eun

Source: ORCID
Added: March 9, 2026

2014 article

Opportunistic Mobile Social Networks

Lee, C.-H., & Eun, D. Y. (2014, July 17). Opportunistic Mobile Social Networks, pp. 71–98.

By: C. Lee & D. Eun

Contributors: C. Lee & D. Eun

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Caching and Content Delivery; Mobile Ad Hoc Networks
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 9, 2026

2013 article

Characterizing link connectivity for opportunistic mobile networking: Does mobility suffice?

Lee, C.-H., Kwak, J., & Eun, D. Y. (2013, April 1). Proceedings - IEEE INFOCOM, pp. 2076–2084.

By: C. Lee n, J. Kwak n & D. Eun n

Contributors: C. Lee n, J. Kwak n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Caching and Content Delivery; Mobile Ad Hoc Networks
TL;DR: This work investigates how each user's availability jointly with mobility-induced contact/inter-contact process affects the link-level connectivity depending on their relative operating time scales and suggests the presence of many uncharted research territories for further exploration. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2013 conference paper

Characterizing link connectivity for opportunistic mobile networking: Does mobility suffice?

2013 Proceedings IEEE INFOCOM, 2076–2084.

By: C. Lee, J. Kwak & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2013 article

Exploiting the past to reduce delay in CSMA scheduling

Kwak, J., Lee, C.-H., & Eun, D. Y. (2013, June 14). ACM SIGMETRICS Performance Evaluation Review, Vol. 41, pp. 353–354.

By: J. Kwak n, C. Lee n & D. Eun n

Contributors: J. Kwak n, C. Lee n & D. Eun n

topics (OpenAlex): Advanced Wireless Network Optimization; Wireless Networks and Protocols; Advanced MIMO Systems Optimization
Source: ORCID
Added: March 9, 2026

2013 journal article

Exploiting the past to reduce delay in CSMA scheduling: A high-order Markov chain approach

ACM SIGMETRICS Performance Evaluation Review, 41(1), 353–354.

By: J. Kwak, C. Lee & D. Eun

Source: ORCID
Added: March 9, 2026

2013 article

Wi-Fi sensing: Should mobiles sleep longer as they age?

Jeong, J., Yi, Y., Cho, J.-woo, Eun, D. Y., & Chong, S. (2013, April 1). Proceedings - IEEE INFOCOM, pp. 2328–2336.

By: J. Jeong*, Y. Yi*, J. Cho*, D. Eun n & S. Chong*

Contributors: J. Jeong*, Y. Yi*, J. Cho*, D. Eun n & S. Chong*

topics (OpenAlex): Green IT and Sustainability; Wireless Networks and Protocols; Context-Aware Activity Recognition Systems
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Source: ORCID
Added: March 9, 2026

2013 conference paper

Wi-Fi sensing: Should mobiles sleep longer as they age?

2013 Proceedings IEEE INFOCOM, 2328–2336.

By: J. Jeong, Y. Yi, J. Cho, D. Eun & S. Chong

Event: IEEE

Source: ORCID
Added: March 9, 2026

2012 article

Beyond random walk and metropolis-hastings samplers

Lee, C.-H., Xu, X., & Eun, D. Y. (2012, June 11). Performance Evaluation Review, Vol. 40, pp. 319–330.

By: C. Lee n, X. Xu n & D. Eun n

Contributors: C. Lee n, X. Xu n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Markov Chains and Monte Carlo Methods; Stochastic processes and statistical mechanics
Source: ORCID
Added: March 9, 2026

2012 journal article

Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling

ACM SIGMETRICS Performance Evaluation Review, 40(1), 319–330.

By: C. Lee, X. Xu & D. Eun

Source: ORCID
Added: March 9, 2026

2012 thesis

Design and Analysis of Opportunistic Forwarding in Challenged Networks

North Carolina State University.

By: C. Lee

Source: ORCID
Added: March 9, 2026

2012 article

From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA

Lee, C.-H., Eun, D. Y., Yun, S.-Y., & Yi, Y. (2012, July 1). IEEE International Symposium on Information Theory - Proceedings, pp. 2681–2685.

By: C. Lee n, D. Eun n, S. Yun* & Y. Yi*

Contributors: C. Lee n, D. Eun n, S. Yun* & Y. Yi*

topics (OpenAlex): Cooperative Communication and Network Coding; Error Correcting Code Techniques; Advanced MIMO Systems Optimization
Source: ORCID
Added: March 9, 2026

2012 conference paper

From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA

2012 IEEE International Symposium on Information Theory Proceedings, 2681–2685.

By: C. Lee, S. Yun, Y. Yi & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2012 article

On the Forwarding Performance under Heterogeneous Contact Dynamics in Mobile Opportunistic Networks

Lee, C.-H., & Eun, D. Y. (2012, April 12). IEEE Transactions on Mobile Computing, Vol. 12, pp. 1107–1119.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

author keywords: Mobile opportunistic networks; heterogeneous contact dynamics; non-Poisson contact dynamics; forwarding performance; stochastic/convex ordering relationships
topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; ICT in Developing Communities
TL;DR: This paper considers two representative heterogeneous network models, each of which captures heterogeneity among node pairs and heterogeneity in underlying environment (spatial), respectively, and demonstrates that the heterogeneity in mobile nodes' contact dynamics should be properly taken into account for the performance evaluation of forwarding algorithms. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
3. Good Health and Well-being (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2012 journal article

On the forwarding performance under heterogeneous contact dynamics in mobile opportunistic networks

IEEE Transactions on Mobile Computing, 12(6), 1107–1119.

By: C. Lee & others

Source: ORCID
Added: March 9, 2026

2012 article

Optimal CSMA: A survey

Yun, S.-Y., Yi, Y., Shin, J., & Eun, D. Y. (2012, November 1). 2012 IEEE International Conference on Communication Systems, ICCS 2012, pp. 199–204.

By: S. Yun*, Y. Yi*, J. Shin* & D. Eun n

Contributors: S. Yun*, Y. Yi*, J. Shin* & D. Eun n

topics (OpenAlex): Advanced Wireless Network Optimization; Wireless Networks and Protocols; Cooperative Communication and Network Coding
Source: ORCID
Added: March 9, 2026

2012 conference paper

Optimal CSMA: a survey

2012 IEEE international conference on communication systems (ICCS), 199–204.

By: S. Yun, Y. Yi, J. Shin & D. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2012 article

Toward distributed optimal movement strategy for data harvesting in wireless sensor networks

Lee, C.-H., & Eun, D. Y. (2012, June 1). Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, Vol. 1, pp. 551–559.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Energy Efficient Wireless Sensor Networks
Source: ORCID
Added: March 9, 2026

2012 conference paper

Toward distributed optimal movement strategy for data harvesting in wireless sensor networks

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 551–559.

By: C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2011 article

Exploiting Heterogeneity to Prolong the Lifetime of Large-Scale Wireless Sensor Networks

Lee, C.-H., & Eun, D. Y. (2011, June 1). IEEE International Conference on Communications.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

topics (OpenAlex): Complex Network Analysis Techniques; Mobile Ad Hoc Networks; Energy Efficient Wireless Sensor Networks
Source: ORCID
Added: March 9, 2026

2011 conference paper

Exploiting heterogeneity to prolong the lifetime of large-scale wireless sensor networks

2011 IEEE International Conference on Communications (ICC), 1–5.

By: C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2011 article

Proceedings of the 6th international conference on Wireless algorithms, systems, and applications

Springer-Verlag.

By: Y. Cheng, D. Eun, Z. Qin, M. Song & K. Xing

Source: ORCID
Added: March 9, 2026

2011 article

Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

Lee, C.-H., & Eun, D. Y. (2011, April 1). Proceedings - IEEE INFOCOM, pp. 611–615.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Energy Efficient Wireless Sensor Networks
TL;DR: This paper proposes a simple modification of random duty cycling, named Smart Sleep, which achieves more power-saving as well as faster packet diffusion (or smaller delay) while retaining the benefits of SRW. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2011 conference paper

Smart sleep: sleep more to reduce delay in duty-cycled wireless sensor networks

2011 Proceedings IEEE INFOCOM, 611–615.

By: C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2010 article

A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks

Lee, C.-H., & Eun, D. Y. (2010, December 1). GLOBECOM - IEEE Global Telecommunications Conference.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

topics (OpenAlex): Mobile Ad Hoc Networks; Energy Efficient Wireless Sensor Networks; Opportunistic and Delay-Tolerant Networks
TL;DR: It is proved that the proposed algorithm outperforms pure homogeneous duty cycling, where every node uses the same wake-up rate, in its guaranteed asymptotic upper bound of the worst-case delay for \emph{any} graph. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2010 article

Age Invariant Regime for Multi-Source Content Update in Mobile Opportunistic Networks

Kim, S., & Eun, D. Y. (2010, December 1). GLOBECOM - IEEE Global Telecommunications Conference.

By: S. Kim n & D. Eun n

Contributors: S. Kim n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Caching and Content Delivery; Age of Information Optimization
TL;DR: This paper analyzes how the age of time-evolving contents changes in publish/subscribe scenario when Poisson update and contact are assumed, and shows that there exists an age-invariant regime where the average age does not depend on content update rate or contact rate. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2010 conference paper

Age Invariant Regime for Multi-Source Content Update in Mobile Opportunistic Networks

2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 1–5.

By: S. Kim & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2010 article

Exploiting Heterogeneity in Mobile Opportunistic Networks: An Analytic Approach

Lee, C.-H., & Eun, D. Y. (2010, June 1). SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

By: C. Lee n & D. Eun n

Contributors: C. Lee n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Caching and Content Delivery; Mobile Ad Hoc Networks
Source: ORCID
Added: March 9, 2026

2010 conference paper

Exploiting heterogeneity in mobile opportunistic networks: An analytic approach

2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 1–9.

By: C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2010 conference paper

Netviewer: A universal visualization tool for wireless sensor networks

2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 1–5.

By: L. Ma, L. Wang, L. Shu, J. Zhao, S. Li, Z. Yuan, N. Ding

Event: IEEE

Source: ORCID
Added: March 9, 2026

2010 article

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

Chiu, Y.-M., & Eun, D. Y. (2010, January 26). IEEE Transactions on Parallel and Distributed Systems, Vol. 21, pp. 1487–1500.

By: Y. Chiu* & D. Eun n

Contributors: Y. Chiu* & D. Eun n

author keywords: Computer network performance; P2P networks
topics (OpenAlex): Peer-to-Peer Network Technologies; Caching and Content Delivery; Recommender Systems and Techniques
TL;DR: This paper investigates the relationship among the average download time, system utilization, and the level of competition among downloading peers in a stochastic P2P network, and derives an achievable lower bound on theaverage download time and proposes algorithms to give the peers the minimum average downloading time. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2010 journal article

On the performance of content delivery under competition in a stochastic unstructured peer-to-peer network

IEEE Transactions on Parallel and Distributed Systems, 21(10), 1487–1500.

By: Y. Chiu & others

Source: ORCID
Added: March 9, 2026

2009 article

Aging rules

Cai, H., & Eun, D. Y. (2009, May 18). Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 115–124.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Vehicular Ad Hoc Networks (VANETs)
Source: ORCID
Added: March 9, 2026

2009 conference paper

Aging rules: What does the past tell about the future in mobile ad-hoc networks?

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, 115–124.

By: H. Cai & D. Eun

Source: ORCID
Added: March 9, 2026

2009 article

Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks

Cai, H., & Eun, D. Y. (2009, July 30). IEEE/ACM Transactions on Networking, Vol. 17, pp. 1578–1591.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

author keywords: Bounded domain; exponential versus power-law; intermeeting time distribution; mobile ad hoc network (MANET); time and space scaling
topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Cooperative Communication and Network Coding
TL;DR: It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the intermeeting time and that by simply removing the boundary in a simple two-dimensional isotropic random walk model, one is able to obtain the empirically observed power-law decay of the IntermeetingTime. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2009 journal article

Crossing over the bounded domain: From exponential to power-law intermeeting time in mobile ad hoc networks

IEEE/ACM Transactions on Networking, 17(5), 1578–1591.

By: H. Cai & others

Source: ORCID
Added: March 9, 2026

2009 conference paper

Heterogeneity in contact dynamics: Helpful or harmful to forwarding algorithms in DTNs?

Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009, 72–81.

By: C. Lee & D. Eun

Contributors: C. Lee & D. Eun

Sources: ORCID, NC State University Libraries
Added: August 6, 2018

2009 conference paper

Heterogeneity in contact dynamics: Helpful or harmful to forwarding algorithms in DTNs?

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 1–10.

By: C. Lee & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2009 article

Multicast scheduling in cellular data networks

Won, H., Cai, H., Eun, D., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2009, September 1). IEEE Transactions on Wireless Communications, Vol. 8, pp. 4540–4549.

By: H. Won n, H. Cai n, D. Eun n, K. Guo*, A. Netravali*, I. Rhee n, K. Sabnani*

Contributors: H. Won n, H. Cai n, D. Eun n, K. Guo*, A. Netravali*, I. Rhee n, K. Sabnani*

author keywords: Multicast scheduling; 3G; downlink schedule; optimization; proportional fair; cellular data networks
topics (OpenAlex): Advanced Wireless Network Optimization; Cooperative Communication and Network Coding; Advanced MIMO Systems Optimization
TL;DR: It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2009 journal article

Stochastic convex ordering for multiplicative decrease internet congestion control

Computer Networks, 53(3), 365–381.

By: H. Cai, S. Ha, I. Rhee, L. Xu & others

Source: ORCID
Added: March 9, 2026

2009 article

Stochastic link-level dynamics in mobile ad-hoc networks

Cai, H., & Eun, D. Y. (2009, January 1). MobiHoc S3 2009 - Proceedings of the 2009 MobiHoc S3 Workshop, Co-Located with MobiHoc 2009, pp. 17–19.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Vehicular Ad Hoc Networks (VANETs)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: ORCID
Added: March 9, 2026

2009 conference paper

Stochastic link-level dynamics in mobile ad-hoc networks: several interesting aspects

Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3, 17–20.

By: H. Cai & D. Eun

Source: ORCID
Added: March 9, 2026

2009 article

Superdiffusive Behavior of Mobile Nodes and Its Impact on Routing Protocol Performance

Kim, S., Lee, C.-H., & Eun, D. Y. (2009, July 15). IEEE Transactions on Mobile Computing, Vol. 9, pp. 288–304.

By: S. Kim n, C. Lee n & D. Eun n

Contributors: S. Kim n, C. Lee n & D. Eun n

author keywords: Mobility models; trace-based models; superdiffusion; mobile ad hoc networks; routing protocols
topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Caching and Content Delivery
TL;DR: The work in this paper suggests that the diffusive behavior of mobile nodes should be correctly captured and taken into account for the design and comparison study of network protocols. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2009 journal article

Superdiffusive behavior of mobile nodes and its impact on routing protocol performance

IEEE Transactions on Mobile Computing, 9(2), 288–304.

By: S. Kim, C. Lee & others

Source: ORCID
Added: March 9, 2026

2008 journal article

2008 Index IEEE/ACM Transactions on Networking Vol. 16

IEEE/ACM TRANSACTIONS ON NETWORKING, 16(6), 1489.

By: I. Aad, D. Adkins, M. Aia, O. Akan, A. Akella, I. Akyildiz, S. Al-Harthi, Z. Ali ...

Source: ORCID
Added: March 9, 2026

2008 article

Achieving 100% Throughput in TCP/AQM Under Aggressive Packet Marking With Small Buffer

Eun, D. Y., & Wang, X. (2008, August 1). IEEE/ACM Transactions on Networking, Vol. 16, pp. 945–956.

By: D. Eun n & X. Wang*

Contributors: D. Eun n & X. Wang*

author keywords: router buffer sizing; small buffer; stochastic modeling; transmission control protocol
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
TL;DR: By capturing randomness both in packet arrivals and in packet markings, a doubly-stochastic model for a TCP/AQM system with many flows is developed and it is proved that the system always performs well in the sense that the link utilization goes to 100% and the loss ratio decreases to zero as the system size JV increases. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 journal article

Achieving 100% throughput in TCP/AQM under aggressive packet marking with small buffer

IEEE/ACM Transactions on Networking, 16(4), 945–956.

By: X. Wang & others

Source: ORCID
Added: March 9, 2026

2008 article

Impact of Super-Diffusive Behavior on Routing Performance in Delay Tolerant Networks

Kim, S., & Eun, D. Y. (2008, January 1). IEEE International Conference on Communications, pp. 2941–2945.

By: S. Kim n & D. Eun n

Contributors: S. Kim n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Caching and Content Delivery
TL;DR: The work in this paper suggests that the diffusive behavior of mobile nodes should be taken into account, for the design and the performance evaluation of network protocols in DTNs. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 conference paper

Impact of super-diffusive behavior on routing performance in delay tolerant networks

2008 IEEE International Conference on Communications, 2941–2945.

By: S. Kim & D. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2008 article

Invariance Property of Isotropic Random Walk Mobility Patterns in Mobile Ad-Hoc Networks

Cai, H., Lee, C.-H., & Eun, D. Y. (2008, January 1). IEEE International Conference on Communications, pp. 2141–2145.

By: H. Cai n, C. Lee n & D. Eun n

Contributors: H. Cai n, C. Lee n & Y. Do n

topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Vehicular Ad Hoc Networks (VANETs)
TL;DR: It is found that the mean contact time of two mobile nodes following isotropic random walk mobility models is invariant with respect to the step-length distribution under both the simplest distance-based (Boolean) interference model and the more realistic SINR-based interference model. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 conference paper

Invariance property of isotropic random walk mobility patterns in mobile ad-hoc networks

2008 IEEE International Conference on Communications, 2141–2145.

By: H. Cai, C. Lee & D. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2008 article

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

Chiu, Y.-M., & Eun, D. Y. (2008, April 1). IEEE/ACM Transactions on Networking, Vol. 16, pp. 253–266.

By: Y. Chiu n & D. Eun n

Contributors: Y. Chiu n & D. Eun n

author keywords: network performance; peer-to-peer network; peer selection strategy
topics (OpenAlex): Peer-to-Peer Network Technologies; Caching and Content Delivery; Network Traffic and Congestion Control
TL;DR: It is rigorously proved that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then a simple, distributed algorithm is analyzed to effectively remove these negative factors, thus minimizing theaverage download time. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 journal article

Minimizing file download time in stochastic peer-to-peer networks

IEEE/ACM Transactions on Networking, 16(2), 253–266.

By: Y. Chiu & others

Source: ORCID
Added: March 9, 2026

2008 article

Stochastic convex ordering for multiplicative decrease internet congestion control

Cai, H., Eun, D. Y., Ha, S., Rhee, I., & Xu, L. (2008, November 12). Computer Networks, Vol. 53, pp. 365–381.

By: H. Cai n, D. Eun n, S. Ha n, I. Rhee n & L. Xu*

Contributors: H. Cai n, D. Eun n, S. Ha n, I. Rhee n & L. Xu*

author keywords: High-speed TCP; Convex ordering; Window growth function
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Interconnection Networks and Systems
TL;DR: A new stochastic tool, called convex ordering, is presented that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 journal article

Super-diffusive behavior of mobile nodes from GPS traces

ACM SIGMOBILE Mobile Computing and Communications Review, 12(1), 28.

By: S. Kim n, C. Lee n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Caching and Content Delivery
TL;DR: Mobility models that fail to capture real movement pattern of mobile nodes will result in misleading guidelines on the design of new protocols and their performance evaluations and thus prevent us from making judicious decisions. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Crossref, ORCID
Added: June 14, 2019

2008 article

Toward stochastic anatomy of inter-meeting time distribution under general mobility models

Cai, H., & Eun, D. Y. (2008, May 26). Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 273–282.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

topics (OpenAlex): Opportunistic and Delay-Tolerant Networks; Mobile Ad Hoc Networks; Energy Efficient Wireless Sensor Networks
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: ORCID
Added: March 9, 2026

2008 conference paper

Toward stochastic anatomy of inter-meeting time distribution under general mobility models

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 273–282.

By: H. Cai & D. Eun

Source: ORCID
Added: March 9, 2026

2008 article

Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization

Cai, H., & Eun, D. Y. (2008, January 1). IEEE International Conference on Communications, pp. 2931–2935.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & Y. Do n

topics (OpenAlex): Advanced Wireless Network Optimization; Cooperative Communication and Network Coding; Mobile Ad Hoc Networks
TL;DR: It is proved that there exists ordering relationship for the success probability of any neighborhood when the contention probability vectors are ordered in the sense of majorization, which improves the performance of a class of distributed collision-based scheduling algorithms, called constant-time distributed scheduling algorithms. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 conference paper

Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization

2008 IEEE International Conference on Communications, 2931–2935.

By: H. Cai & D. Eun

Event: IEEE

Source: ORCID
Added: March 9, 2026

2007 article

A Dynamic TCP-Aware Call Admission Control Scheme for Generic Next Generation Packet-Switched Wireless Networks

Wang, X., Eun, D., & Wang, W. (2007, September 1). IEEE Transactions on Wireless Communications, Vol. 6, pp. 3344–3352.

By: X. Wang*, D. Eun n & W. Wang n

Contributors: X. Wang*, D. Eun n & W. Wang n

author keywords: admission control; wireless networks; TCP
topics (OpenAlex): Advanced Wireless Network Optimization; Wireless Communication Networks Research; Network Traffic and Congestion Control
TL;DR: This work proposes a TCP-aware CAC scheme to regulate the packet-level dynamics of TCP flows and demonstrates that the proposed scheme can effectively improve the system performance in terms of call blocking probability, call-level throughput (call/min) and link utilization. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2007 journal article

A dynamic TCP-aware call admission control scheme for generic next generation packet-switched wireless networks

IEEE Transactions on Wireless Communications, 6(9), 3344–3352.

By: X. Wang, W. Wang & others

Source: ORCID
Added: March 9, 2026

2007 article

Crossing over the bounded domain

Cai, H., & Eun, D. Y. (2007, September 9). Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM, pp. 159–170.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Vehicular Ad Hoc Networks (VANETs)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: ORCID
Added: March 9, 2026

2007 conference paper

Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet

Proceedings of the 13th annual ACM international conference on Mobile computing and networking, 159–170.

By: H. Cai & D. Eun

Source: ORCID
Added: March 9, 2026

2007 journal article

Local and global stability of TCP-newReno/RED with many flows

Computer Communications, 30(5), 1091–1105.

By: X. Wang & others

Source: ORCID
Added: March 9, 2026

2007 journal article

MobiCom Poster Abstract: Super-diffusive Behavior of Mobile Nodes from GPS Traces

By: S. Do & Y. Eun

Source: ORCID
Added: March 9, 2026

2007 article

Multicast Scheduling in Cellular Data Networks

Won, H., Cai, H., Eun, D. Y., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2007, January 1). Proceedings - IEEE INFOCOM, pp. 1172–1180.

By: H. Won n, H. Cai n, D. Eun n, K. Guo, A. Netravali, I. Rhee n, K. Sabnani

Contributors: H. Won n, H. Cai n, D. Eun n, K. Guo, A. Netravali, I. Rhee n, K. Sabnani

topics (OpenAlex): Advanced Wireless Network Optimization; Cooperative Communication and Network Coding; Advanced MIMO Systems Optimization
Source: ORCID
Added: March 9, 2026

2007 conference paper

Multicast scheduling in cellular data networks

IEEE Infocom.

By: H. Hyungsuk Won, K. Do Young Eun, K. Arun Netravali & I. Rhee

Source: ORCID
Added: March 9, 2026

2007 article

On the Performance of Download Strategies in a P2P Like Network

Chiu, Y.-M., & Eun, D. Y. (2007, November 1). GLOBECOM - IEEE Global Telecommunications Conference, pp. 416–420.

By: Y. Chiu n & D. Eun n

Contributors: Y. Chiu n & D. Eun n

topics (OpenAlex): Peer-to-Peer Network Technologies; Caching and Content Delivery; Complex Network Analysis Techniques
Source: ORCID
Added: March 9, 2026

2007 conference paper

On the performance of download strategies in a p2p like network

IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference, 416–420.

By: Y. Chiu & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2007 article

Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes

Eun, D. Y., & Wang, X. (2007, April 25). Computer Networks, Vol. 51, pp. 3655–3671.

By: D. Eun n & X. Wang*

Contributors: D. Eun n & X. Wang*

author keywords: congestion control; buffer sizing; active queue management; discrete-time stochastic models; performance analysis
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
TL;DR: A stochastic model in a discrete-time setting is developed and it is shown that it can have 100% link utilization and zero packet loss probability for a large number of flows when the buffer size is chosen anywhere between O(N) and O( N). (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2007 journal article

Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes

Computer Networks, 51(12), 3655–3671.

By: X. Wang & others

Source: ORCID
Added: March 9, 2026

2007 conference paper

Stochastic Ordering for Internet Congestion Control

PFLDnet.

By: D. Han Cai, I. Sangtae Ha & L. Xu

Source: ORCID
Added: March 9, 2026

2007 article

Stochastic Ordering for Internet Congestion Control and its Applications

Cai, H., Eun, D. Y., Ha, S., Rhee, I., & Xu, L. (2007, January 1). Proceedings - IEEE INFOCOM, pp. 910–918.

By: H. Cai n, D. Eun n, S. Ha n, I. Rhee n & L. Xu*

Contributors: H. Cai n, D. Eun n, S. Ha n, I. Rhee n & L. Xu*

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Wireless Networks and Protocols
Source: ORCID
Added: March 9, 2026

2007 conference paper

Stochastic ordering for internet congestion control and its applications

IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications, 910–918.

By: H. Cai, D. Eun, S. Ha, I. Rhee & L. Xu

Event: IEEE

Source: ORCID
Added: March 9, 2026

2007 journal article

Super diffusive behavior of mobile nodes from mobility traces

NC State University," Technical Report.

By: C. Lee, S. Kim & D. Eun

Source: ORCID
Added: March 9, 2026

2006 article

A Doubly-Stochastic Model for a TCP/AQM System under Aggressive Packet Marking

Eun, D. Y., & Wang, X. (2006, March 1). 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings, pp. 579–584.

By: D. Eun n & X. Wang n

Contributors: D. Eun n & X. Wang n

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
Source: ORCID
Added: March 9, 2026

2006 article

A TCP-Aware Call Admission Control Scheme for Packet-Switched Wireless Networks

Wang, X., Eun, D. Y., & Wang, W. (2006, May 25). Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference, Vol. 2006, pp. 169–176.

By: X. Wang n, D. Eun n & W. Wang n

Contributors: X. Wang n, D. Eun n & W. Wang n

topics (OpenAlex): Network Traffic and Congestion Control; Wireless Communication Networks Research; Advanced Wireless Network Optimization
Source: ORCID
Added: March 9, 2026

2006 conference paper

A TCP-aware call admission control scheme for packet-switched wireless networks

2006 IEEE International Performance Computing and Communications Conference, 8-pp.

By: X. Wang, D. Eun & W. Wang

Event: IEEE

Source: ORCID
Added: March 9, 2026

2006 conference paper

A doubly-stochastic model for a TCP/AQM system under aggressive packet marking

2006 40th Annual Conference on Information Sciences and Systems, 579–584.

By: X. Wang & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2006 conference paper

A novel multipath mitigation scheme based on slope differential of correlator output for Galileo systems

2006 8th International Conference Advanced Communication Technology, 2, 4-pp.

By: C. Lee, S. Yoo, S. Yoon & S. Kim

Event: IEEE

Source: ORCID
Added: March 9, 2026

2006 article

Local and global stability of TCP-newReno/RED with many flows

Wang, X., & Eun, D. Y. (2006, December 16). Computer Communications, Vol. 30, pp. 1091–1105.

By: X. Wang* & D. Eun n

Contributors: X. Wang* & D. Eun n

author keywords: TCP; NewReno; local stability; global stability
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
TL;DR: A normalized discrete-time model is presented to capture the essential dynamics of TCP- newReno/RED with many flows and obtain its local stability criterion and shows that by properly choosing some 'free' parameters, it can always ensure that a locally stable TCP-newR Reno/RED system is in fact globally stable. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2006 article

Minimizing File Download Time over Stochastic Channels in Peer-to-Peer Networks

Chiu, Y.-ming, & Eun, D. (2006, March 1). 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings, pp. 159–164.

By: Y. Chiu n & D. Eun n

Contributors: Y. Chiu n & D. Eun n

topics (OpenAlex): Peer-to-Peer Network Technologies; Caching and Content Delivery; Network Traffic and Congestion Control
Source: ORCID
Added: March 9, 2026

2006 conference paper

Minimizing file download time over stochastic channels in peer-to-peer networks

2006 40th Annual Conference on Information Sciences and Systems, 159–164.

By: Y. Chiu & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2006 article

On the limitation of fluid-based approach for Internet congestion control

Eun, D. Y. (2006, December 7). Telecommunication Systems, Vol. 34, pp. 3–11.

By: D. Eun n

Contributors: D. Eun n

author keywords: congestion control; fluid modeling; markov chains; stability analysis
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Peer-to-Peer Network Technologies
TL;DR: It is proved that the equilibrium point of a fluid model can be quite different from the true average rate of the corresponding stochastic system, which implies that the current congestion control design can be much more flexible, to the benefit of efficient usage of network resources. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2006 article

On the limitation of fluid-based approach for internet congestion control

Eun, D. Y. (2006, October 11). Proceedings - International Conference on Computer Communications and Networks, ICCCN, Vol. 2005, pp. 463–468.

By: D. Eun n

Contributors: D. Eun n

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Peer-to-Peer Network Technologies
Source: ORCID
Added: March 9, 2026

2006 article

Performance Modeling of TCP/AQM with Generalized AIMD under Intermediate Buffer Sizes

Eun, D. Y., & Wang, X. (2006, May 25). Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference, Vol. 2006, pp. 367–374.

By: D. Eun n & X. Wang n

Contributors: D. Eun n & X. Wang n

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
Source: ORCID
Added: March 9, 2026

2006 conference paper

Performance modeling of TCP/AQM with generalized AIMD under intermediate buffer sizes

2006 IEEE International Performance Computing and Communications Conference, 8-pp.

By: D. Eun & X. Wang

Event: IEEE

Source: ORCID
Added: March 9, 2026

2006 conference paper

Stability of Internet Congestion Control with Asynchronous Updates

IEEE CDC.

By: S. Updates

Source: ORCID
Added: March 9, 2026

2006 article

Stability of Network Congestion Control with Asynchronous Updates

Cai, H., & Eun, D. Y. (2006, January 1). Proceedings of the IEEE Conference on Decision and Control, pp. 1906–1911.

By: H. Cai n & D. Eun n

Contributors: H. Cai n & D. Eun n

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Software-Defined Networks and 5G
Source: ORCID
Added: March 9, 2026

2006 conference paper

Stability of Network Congestion Control with Asynchronous Updates

Proceedings of the 45th IEEE Conference on Decision and Control, 1906–1911.

By: H. Cai & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2005 conference paper

Analysis of allograft biopsy specimens in renal transplants with proteinuria: is proteinuria a culprit of graft loss?

Transplantation proceedings, 37(2), 984–986.

By: C. Kang, G. Kim, C. Lee, J. Kwak & O. Kwon

Event: Elsevier

Source: ORCID
Added: March 9, 2026

2005 conference paper

Global stability of TCP/RED with many-flows: A numerical approach

IEEE International Conference on Communications, 1, 369–373. http://www.scopus.com/inward/record.url?eid=2-s2.0-24344496631&partnerID=MN8TOARS

By: X. Wang & D. Eun

Contributors: X. Wang & D. Eun

Source: ORCID
Added: March 9, 2026

2005 conference paper

Global stability of TCP/RED with many-flows: a numerical approach

IEEE International Conference on Communications, 2005. ICC 2005. 2005, 1, 369–373.

By: X. Wang & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2005 journal article

Network decomposition: Theory and practice

IEEE/ACM Transactions On Networking, 13(3), 526–539.

By: N. Shroff & others

Source: ORCID
Added: March 9, 2026

2005 article

Network decomposition: theory and practice

Eun, D. Y., & Shroff, N. B. (2005, June 1). IEEE/ACM Transactions on Networking, Vol. 13, pp. 526–539.

By: D. Eun n & N. Shroff*

Contributors: D. Eun n & N. Shroff*

author keywords: aggregation; many-sources-asymptotic; network decomposition; overflow probability; performance analysis
topics (OpenAlex): Advanced Queuing Theory Analysis; Network Traffic and Congestion Control; Wireless Communication Networks Research
TL;DR: A network decomposition approach in which network analysis can be greatly simplified, and it is proved that the queue length at the downstream queue converges to that of a single queue obtained by removing the upstream queue, as the capacity and the number of flows at the upstream queues increase. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2005 conference paper

On the Limitation of Fluid-based Approach for Internet Congestion Control

IEEE International Conference on Computer Communications and Networks (ICCCN).

By: D. Eun

Source: ORCID
Added: March 9, 2026

2005 conference paper

Stationary behavior of TCP/AQM with many flows under aggressive packet marking

IEEE International Conference on Communications, 1, 316–320. http://www.scopus.com/inward/record.url?eid=2-s2.0-24344449707&partnerID=MN8TOARS

By: D. Eun & X. Wang

Contributors: D. Eun & X. Wang

Source: ORCID
Added: March 9, 2026

2005 conference paper

Stationary behavior of TCP/AQM with many flows under aggressive packet marking

IEEE International Conference on Communications, 2005. ICC 2005. 2005, 1, 316–320.

By: X. Wang & others

Event: IEEE

Source: ORCID
Added: March 9, 2026

2004 article

Analyzing a Two-Stage Queueing System with Many Point Process Arrivals at Upstream Queue

Eun, D. Y., & Shroff, N. B. (2004, September 1). Queueing Systems, Vol. 48, pp. 23–43.

By: D. Eun n & N. Shroff*

Contributors: D. Eun n & N. Shroff*

author keywords: queueing networks; overflow probability; many-sources-asymptotic; point processes
topics (OpenAlex): Advanced Queuing Theory Analysis; Optimization and Search Problems; graph theory and CDMA systems
TL;DR: It is shown that as the capacity and the number of flows aggregated at the upstream queue increases, the overflow probability at the downstream queue converges to that of a simplified single queue obtained by removing the upstream queues from the original two-stage queueing system. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2004 journal article

Analyzing a two-stage queueing system with many point process arrivals at upstream queue

Queueing Systems, 48(1), 23–43.

By: D. Eun & N. Shroff

Source: ORCID
Added: March 9, 2026

2004 journal article

General Applied Probability-Network decomposition in the many-sources regime

Advances in Applied Probability, 36(3), 993.

By: D. Eun & N. Shroff

Source: ORCID
Added: March 9, 2026

2004 article

Network decomposition in the many-sources regime

Eun, D. Y., & Shroff, N. B. (2004, August 31). Advances in Applied Probability, Vol. 36, pp. 893–918.

By: D. Eun* & N. Shroff*

Contributors: D. Eun* & N. Shroff*

author keywords: aggregation; queueing network; many-sources asymptotic; speed of convergence
topics (OpenAlex): Advanced Queuing Theory Analysis; Network Traffic and Congestion Control; Advanced Wireless Network Optimization
TL;DR: This model consists of a two-stage queueing system where the first queue serves many flows, of which a certain subset arrive at the second queueing queue, and it is proved that, as the number of flows being aggregated in the upstream queue increases, the overflow probability of the downstream queue converges uniformly in the buffer level. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2004 journal article

Network decomposition in the many-sources regime

Advances in Applied Probability, 36(03), 893–918.

By: D. Eun* & N. Shroff*

topics (OpenAlex): Advanced Queuing Theory Analysis; Network Traffic and Congestion Control; Advanced Wireless Network Optimization
Source: Crossref
Added: February 24, 2020

2004 journal article

Network decomposition in the many-sources regime

Advances in Applied Probability, 36(3), 893–918.

By: N. Shroff & others

Source: ORCID
Added: March 9, 2026

2003 article

A measurement-analytic approach for QoS estimation in a network based on the dominant time scale

Eun, D. Y., & Shroff, N. B. (2003, April 1). IEEE/ACM Transactions on Networking, Vol. 11, pp. 222–235.

By: D. Eun* & N. Shroff*

Contributors: D. Eun* & N. Shroff*

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Optical Network Technologies
Source: ORCID
Added: March 9, 2026

2003 journal article

A measurement-analytic approach for QoS estimation in a network based on the dominant time scale

IEEE/ACM Transactions on Networking, 11(2), 222–235.

By: N. Shroff & others

Source: ORCID
Added: March 9, 2026

2003 journal article

Analysis, QOS estimation, and decomposition of large networks.

By: D. Eun

Source: ORCID
Added: March 9, 2026

2003 conference paper

Simplification of network analysis in large-bandwidth systems

Proceedings - IEEE INFOCOM, 1, 597–607. http://www.scopus.com/inward/record.url?eid=2-s2.0-0042975419&partnerID=MN8TOARS

By: D. Eun & N. Shroff

Contributors: D. Eun & N. Shroff

Event: IEEE

Source: ORCID
Added: March 9, 2026

2002 article

A measurement-analytic framework for QoS estimation based on the dominant time scale

Eun, D. Y., & Shroff, N. B. (2002, November 13). Proceedings - IEEE INFOCOM, Vol. 2, pp. 924–932.

By: D. Eun* & N. Shroff*

Contributors: D. Eun* & N. Shroff*

topics (OpenAlex): Network Traffic and Congestion Control; Advanced Queuing Theory Analysis; Advanced Wireless Network Optimization
Source: ORCID
Added: March 9, 2026

2001 conference paper

A Measurement-Analytic Framework for QoS Estimation based on the Dominant Time Scale

IEEE Infocom.

By: D. Shroff & B. Ness

Source: ORCID
Added: March 9, 2026

2001 conference paper

End-to-end traffic analysis in large networked systems

PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING, 39(1), 603–612.

By: D. Eun, H. Kim & N. Shroff

Event: The University; 1998

Source: ORCID
Added: March 9, 2026

1997 conference paper

Effects of long-range dependence of VBR video traffic on queueing performances

Conference Record / IEEE Global Telecommunications Conference, 3, 1440–1444. http://www.scopus.com/inward/record.url?eid=2-s2.0-0031381048&partnerID=MN8TOARS

By: D. Eun, H. Ahn, B. Roh & J. Kim

Contributors: D. Eun, H. Ahn, B. Roh & J. Kim

Event: IEEE

Source: ORCID
Added: March 9, 2026

journal article

Characterizing Link Connectivity for Opportunistic Mobile Networking: Does Mobility Suffice?

Do Young Eun

Source: ORCID
Added: March 9, 2026

journal article

Designing Optimal Interlink Patterns to Maximize Robustness of Interdependent Networks Against Cascading Failures

Do Young Eun

Source: ORCID
Added: March 9, 2026

conference paper

Efficiency Ordering of Stochastic Gradient Descent

Jie Hu, V. D., & Eun, D. Y. NeurIPS 2022, https-arxiv.

By: V. Jie Hu & D. Eun

Source: ORCID
Added: March 9, 2026

journal article

Stochastic Convex Ordering for Multiplicative Decrease Internet Congestion Control

Han Caia, D. Y. E., Hab, S., Rheeb, I., & Xuc, L.

By: D. Han Caia, S. Hab, I. Rheeb & L. Xuc

Source: ORCID
Added: March 9, 2026

Employment

Updated: March 9th, 2026 14:08

2003 - present

North Carolina State University Raleigh, North Carolina, US
Professor Electrical and Computer Engineering

Education

Updated: June 2nd, 2021 08:04

Purdue University West Lafayette, IN, US
PhD, 2003 Electrical Engineering

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2026) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.