Mung Chiang

ORCID: 0000-0002-8920-651X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Wireless Network Optimization
  • Cooperative Communication and Network Coding
  • Wireless Networks and Protocols
  • Network Traffic and Congestion Control
  • Advanced MIMO Systems Optimization
  • Wireless Communication Networks Research
  • Mobile Ad Hoc Networks
  • Privacy-Preserving Technologies in Data
  • Caching and Content Delivery
  • ICT Impact and Policies
  • IoT and Edge/Fog Computing
  • Peer-to-Peer Network Technologies
  • Age of Information Optimization
  • Cloud Computing and Resource Management
  • Online Learning and Analytics
  • Green IT and Sustainability
  • Power Line Communications and Noise
  • Internet Traffic Analysis and Secure E-voting
  • Advanced Optical Network Technologies
  • Adversarial Robustness in Machine Learning
  • Mobile Crowdsensing and Crowdsourcing
  • Software-Defined Networks and 5G
  • Auction Theory and Applications
  • Digital Platforms and Economics
  • Network Security and Intrusion Detection

Purdue University West Lafayette
2017-2025

Princeton University
2012-2023

North Carolina State University
2020

Université d'Avignon et des Pays de Vaucluse
2019

Guangdong University of Technology
2017

Indian Institute of Technology Bombay
2017

Stanford University
2001-2014

University of Chicago
2014

Johns Hopkins University
2014

Rensselaer Polytechnic Institute
2008

Fog is an emergent architecture for computing, storage, control, and networking that distributes these services closer to end users along the cloud-to-things continuum. It covers both mobile wireline scenarios, traverses across hardware software, resides on network edge but also over access networks among users, includes data plane control plane. As architecture, it supports a growing variety of applications, including those in Internet Things (IoT), fifth-generation (5G) wireless systems,...

10.1109/jiot.2016.2584538 article EN IEEE Internet of Things Journal 2016-06-23

A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain most appropriate distributed algorithm for a given problem, quantifies comparison across architectural alternatives modularized design. Decomposition theory naturally provides mathematical language build an analytic foundation design control networks. In this tutorial paper, we first review basics convexity, Lagrange...

10.1109/jsac.2006.879350 article EN IEEE Journal on Selected Areas in Communications 2006-08-01

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Network protocols in layered architectures have historically been obtained on an <emphasis emphasistype="boldital">ad hoc</emphasis> basis, and many of the recent cross-layer designs are also conducted through piecemeal approaches. protocol stacks may instead be holistically analyzed systematically designed as distributed solutions to some global optimization problems. This paper presents a...

10.1109/jproc.2006.887322 article EN Proceedings of the IEEE 2007-01-01

Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each specific nodes and links in substrate network. Since general embedding problem computationally intractable, past research restricted space allow solutions, focused designing heuristic algorithms. In this paper, we advocate different...

10.1145/1355734.1355737 article EN ACM SIGCOMM Computer Communication Review 2008-03-31

In wireless cellular or ad hoc networks where Quality of Service (QoS) is interference-limited, a variety power control problems can be formulated as nonlinear optimization with system-wide objective, e.g., maximizing the total system throughput worst user throughput, subject to QoS constraints from individual users, on data rate, delay, and outage probability. We show that in high Signal-to- interference Ratios (SIR) regime, these apparently difficult, nonconvex transformed into convex form...

10.1109/twc.2007.05960 article EN IEEE Transactions on Wireless Communications 2007-07-01

In a wireless network with multihop transmissions and interference-limited link rates, can we balance power control in the physical layer congestion transport to enhance overall performance while maintaining architectural modularity between layers? We answer this question by presenting distributed algorithm that couples existing transmission protocols (TCPs) increase end-to-end throughput energy efficiency of network. Under rigorous framework nonlinearly constrained utility maximization,...

10.1109/jsac.2004.837347(410) article EN IEEE Journal on Selected Areas in Communications 2005-01-03

We present five axioms for fairness measures in resource allocation. A family of satisfying the is constructed. Special cases this include ¿-fairness, Jain's index, and entropy. Properties are proven, including Schur-concavity. Among engineering implications a generalized index that tunes resolution measure, new understanding ¿-fair utility functions, an interpretation "larger ¿ more fair". also construct alternative set to capture system efficiency feasibility constraints.

10.1109/infcom.2010.5461911 article EN 2010-03-01

Today's data centers need efficient traffic management to improve resource utilization in their networks. In this work, we study a joint tenant (e.g., server or virtual machine) placement and routing problem minimize costs. These two complementary degrees of freedom—placement routing—are mutually-dependent, however, are often optimized separately today's centers. Leveraging expanding the technique Markov approximation, propose an online algorithm dynamic environment under changing loads. The...

10.1109/infcom.2012.6195719 article EN 2012-03-01

Given that full duplex (FD) and MIMO both employ multiple antenna resources, an important question arises is how to make the choice between FD? We show optimal performance requires a combination of be used. Hence, we present design implementation MIDU, first system for wireless networks. MIDU employs cancellation with symmetric placement transmit receive antennas as its primary RF technique. MIDU's provides large amounts self-interference several key advantages: (i) It allows two stages...

10.1145/2348543.2348576 article EN Proceedings of the 28th Annual International Conference on Mobile Computing And Networking 2012-08-22

Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of so-called dual decomposition technique. However, span possibilities includes many other elements that, thus far, have not been fully exploited, such use primal technique, versatile introduction auxiliary variables, potential...

10.1109/tac.2007.910665 article EN IEEE Transactions on Automatic Control 2007-12-01

Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper proposes two auction mechanisms, SNR power auction, that determine relay selection a distributed fashion. A single-relay network considered first, existence uniqueness Nash Equilibrium (i.e., auction's outcome) are proved. It shown achieves by maximizing total rate increase, flexible trading off fairness efficiency. For...

10.1109/jsac.2008.080919 article EN IEEE Journal on Selected Areas in Communications 2008-08-27

The two largest U.S. wireless ISPs have recently moved towards usage-based pricing to better manage the growing demand on their networks. Yet still requires over-provision capacity for at peak times of day. Time-dependent (TDP) addresses this problem by considering when a user consumes data, in addition how much is used. We present architecture, implementation, and trial an end-to-end TDP system called TUBE. TUBE creates price-based feedback control loop between ISP its end users. On side,...

10.1145/2342356.2342402 article EN 2012-08-13

Fog computing is an end-to-end horizontal architecture that distributes computing, storage, control, and networking functions closer to users along the cloud-to-thing continuum. The word "edge" may carry different meanings. A common usage of term refers edge network as opposed core network, with equipment such routers, base stations, home gateways. In sense, there are several differences between fog edge. First, inclusive cloud, core, metro, edge, clients, things. will further enable...

10.1109/mcom.2017.7901470 article EN IEEE Communications Magazine 2017-04-01

We study user behavior in the courses offered by a major massive online open course (MOOC) provider during summer of 2013. Since social learning is key element scalable education on MOOC and done via discussion forums, our main focus understanding forum activities. Two salient features these activities drive research: (1) high decline rate: for each studied, volume declined continuously throughout duration course; (2) high-volume, noisy discussions: at least 30 percent produced new threads...

10.1109/tlt.2014.2337900 article EN IEEE Transactions on Learning Technologies 2014-07-10

We study the dynamics of network selection in heterogeneous wireless networks (HetNets). Users such selfishly select best radio access technology (RAT) with objective maximizing their own throughputs. propose two general classes throughput models that capture basic properties random (e.g., Wi-Fi) and scheduled WiMAX, LTE, 3G) networks. Next, we formulate problem as a non-cooperative game, its convergence, efficiency, practicality. Our results reveal that: (i) Single-class RAT games converge...

10.1109/infcom.2013.6566889 article EN 2013-04-01

Federated learning has emerged recently as a promising solution for distributing machine tasks through modern networks of mobile devices. Recent studies have obtained lower bounds on the expected decrease in model loss that is achieved each round federated learning. However, convergence generally requires large number communication rounds, which induces delay training and costly terms network resources. In this paper, we propose fast-convergent algorithm, called <inline-formula...

10.1109/jsac.2020.3036952 article EN publisher-specific-oa IEEE Journal on Selected Areas in Communications 2020-11-09

Sign recognition is an integral part of autonomous cars. Any misclassification traffic signs can potentially lead to a multitude disastrous consequences, ranging from life-threatening accident even large-scale interruption transportation services relying on In this paper, we propose and examine security attacks against sign systems for Deceiving Autonomous caRs with Toxic Signs (we call the proposed DARTS). particular, introduce two novel methods create these toxic signs. First,...

10.48550/arxiv.1802.06430 preprint EN other-oa arXiv (Cornell University) 2018-01-01

A game-theoretic model for studying power control in multicarrier code-division multiple-access systems is proposed. Power modeled as a noncooperative game which each user decides how much to transmit over carrier maximize its own utility. The utility function considered here measures the number of reliable bits transmitted all carriers per joule energy consumed and particularly suitable networks where efficiency important. multidimensional nature users' strategies nonquasi-concavity make...

10.1109/jsac.2005.864028 article EN IEEE Journal on Selected Areas in Communications 2006-06-01

10.1561/1300000009 article EN Foundations and Trends® in Networking 2007-01-01

In a wireless network with multihop transmissions and interference-limited link rates, can we balance power control in the physical layer congestion transport to enhance overall performance while maintaining architectural modularity between layers? We answer this question by presenting distributed algorithm that couples existing transmission protocols (TCPs) increase end-to-end throughput energy efficiency of network. Under rigorous framework nonlinearly constrained utility maximization,...

10.1109/jsac.2004.837347 article EN IEEE Journal on Selected Areas in Communications 2005-01-01

10.1561/0100000005 article EN Foundations and Trends® in Communications and Information Theory 2005-01-01

For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput minimize delay. The distinguishing characteristics these resource allocation is that, by using convex optimization, they accommodate variety realistic fairness constraints. Their globally optimal solutions can be computed efficiently through polynomial time interior point methods, even though use nonlinear objectives...

10.1109/infcom.2002.1019292 article EN 2003-06-25
Coming Soon ...