@article{wang_rozhnova_narayanan_oran_rhee_2013, title={An improved hop-by-hop interest shaper for congestion control in named data networking}, volume={43}, DOI={10.1145/2491224.2491233}, abstractNote={Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.}, number={4}, journal={Computer Communication Review}, author={Wang, Y. G. and Rozhnova, N. and Narayanan, A. and Oran, D. and Rhee, I.}, year={2013} }
 @inproceedings{selvanayagam_wang_jiang_lee_rhee_2012, title={Reducing redundant cross-ISP traffic in peer-to-peer systems via explicit coordination}, DOI={10.1109/ccnc.2012.6181137}, abstractNote={Locality-aware P2P file sharing systems have drawn the attention of the research community as a promising technique to alleviate the tussle between P2P traffic and ISPs. However, existing locality-based schemes mainly focus on how to distinguish whether a peer is local or not and pay less attention to how to utilize the locality information. Typically, they simply bias the peer selection towards local peers in the hope that it will reduce cross-ISP traffic. In this paper, we argue that such coarse-grained control is inadequate and propose a fine-grained mechanism called Swarm-over-Swarm (SOS). Through explicit coordination on piece selection among local peers, SOS is much more effective in reducing redundant cross-ISP traffic than existing schemes. We implement SOS in both NS-2 and a real BitTorrent client and demonstrate the effectiveness of our solution via both simulations and Internet experiments.}, booktitle={2012 ieee consumer communications and networking conference (ccnc)}, author={Selvanayagam, A. H. A. and Wang, Y. G. and Jiang, H. Q. and Lee, K. and Rhee, I.}, year={2012}, pages={603–607} }
 @inproceedings{wang_2010, title={SIP overload control: A backpressure-based approach}, volume={40}, number={4}, booktitle={Computer Communication Review}, author={Wang, Y. G.}, year={2010}, pages={399–400} }