@conference {
	title = {Combined Single-Path Routing and Flow Control in Many-User Region: A Case for Nash Efficiency},
	author = {Chen, Huigang., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {We consider the problem of combined single-path routing and flow control, which is nonconvex and NP-hard to solve exactly. We focus on the {\textquotedblleft}many-user{\textquotedblright} region, i.e. large networks that have far more number of users than that of bottleneck links, which is close to real network scenarios. We first show that by allowing a proportionally small number of users to use multipath routing~while keeping the remaining majority to use single-path routing, the resulting solution achieves multipath optimality. Therefore it is conceptually plausible that in the many-user region a local algorithm can achieve solutions arbitrarily close to the optimal solution. To show this is indeed correct, we focus on the solutions brought out by the simplest local algorithm, the Nash algorithm. We first examine a special type of network and show that the Nash equilibrium exists and the Nash algorithm always converges. It is then shown that the price of anarchy, that is the gap between the worst Nash equilibrium and the social optimal, is bounded when the number of users goes to infinity. For general networks, it is not known whether there exists a Nash equilibrium. However, we introduce the concept of approximate Nash equilibrium and we show its existence given a~sufficiently large number of users. Then we prove that the approximate Nash equilibrium will be arbitrary close to the social optimal when the number of users is sufficiently large.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 26-31}
}
@conference {
	title = {Scalable and Distributed Control Laws for Network flow Optimization},
	author = {Chen, Huigang., Baras, John S.},
	year = {2006},
	month = {07/2006},
	abstract = {We investigate the design of scalable and distributed control laws for flow control in a large network - equivalently an optimization problem. We identify the implications of the desired "plug-and-play{\textquoteright} property of of such protocols and propose design principles upon which our algorithm should be built: the class of our algorithms must achieve little extra communication cost and global asymptotic stability. General structural properties of such algorithms are presented and we finally provide an algorithm which satisfies our design principles for a network with heterogeneous delays.},
	address = {Kyoto, Japan},
	booktitle = {17th International Symposium on Mathematical Networks and Systems},
	pages = {pp. 42-49}
}
@conference {
	title = {Performance Evaluation and Traffic Analysis for Routing Protocols in a Real MANET},
	author = {Chen, Huigang., Jou,  Jia-Shiang., Dharmaraju, Dinesh., Papageorgiou, George., Baras, John S.},
	year = {2003},
	month = {04/2003},
	abstract = {Mobile Ad-hoc NETworks (MANETs) are characterized by bandwidth constrained links, multiple hops, varying link qualities and highly dynamic topologies. In this paper, we evaluate the performance and analyze the traffic of a mobile ad-hoc network in a realistic setting. Using simulation, we provide results of performance evaluation in terms of various metrics. We study performance with scenarios of different propagation matrices, different traffic mixes, and different routing protocols (DSDV, DSR, AODV). The results show that in most cases, the performance is sensitive to the routing protocol, path loss, and traffic characteristics. This provides rationale and insight for choosing the right protocols to provide quality of service in terms of different metrics in different environments. Also, we find that in a MANET, we obtain long-range dependency traffic regardless of source file size distribution. This discovery will help in providing methodology to tackle the network dimensioning problem in ad hoc networks.},
	address = {College Park, Maryland},
	booktitle = {Collaborative Technology Alliances (CTA) Communications \&amp; Networks (C\&amp;N) Alliance - 2003 Annual Symposium},
	pages = {pp.147-151},
	organization = {University of Maryland Conference Center}
}
@techreport {
	title = {Dynamical Properties of TCP System with AQM Routers},
	author = {Chen, Huigang., Liu, Nelson X.},
	year = {2003},
	month = {01/2003},
	abstract = {In this report we discuss the dynamics of heterogeneous TCP systems with propagation delays. Instead of studying the local linearized TCP dynamics, we study the global stability conditions and obtain the stability regions. Also we provide proof of periodic behavior of a single TCP connection when stability conditions are not met.},
	number = {Number: CSHCN TR 2003-22}
}
