Laboratory of Networked Systems

Computer Science Department, Yale University

Yang Richard Yang's Publications

Publications

 Robust, Efficient and Fair Internet Backbone Networks

  • Reliability as an Interdomain Service. Hao Wang, Yang Richard Yang, Paul H. Liu, Jia Wang, Alex Gerber, and Albert Greenberg. In Proceedings of ACM SIGCOMM, Kyoto, Japan, August 2007. (pdf)

  • this is a very simple idea: you may protect intradomain links using interdomain paths
     
  • Traffic Engineering in MPLS and VPN Networks. Zheng Ma, Hao Wang, Yang Richard Yang, Arvind Krishnamurthy, and Avi Silberschatz. Yale Computer Science Technical Report YALEU/DCS/TR-1366, August 2006. (bib)
     
    • reliable traffic engineering using MPLS, with path selection and integrated VPN
    • Path-Independent Load Balancing With Unreliable Machines. James Aspnes, Yang Richard Yang, and Yitong Yin. In Proceedings of SODA, New Orleans, LA, Jan. 2007. (bib, pdf)
       
      • Technical report version: Yale Computer Science Technical Report YALEU/DCS/TR-1363. July 2006. (bib, pdf).
         
    • COPE: Traffic Engineering in Dynamic Networks. Hao Wang, Haiyong Xie, Lili Qiu, Yang Richard Yang, Yin Zhang, and Albert Greenberg. In Proceedings of ACM SIGCOMM, Pisa, Italy, September 2006. (bib, pdf)
       
      • an optimal-oriented, yet reliable traffic engineering method: optimize for prediction and bound the worst case for all other cases; see "Traffic Engineering in MPLS and VPN Networks" for implementation using path-based routing
         
    • Interdomain Routing as Social Choice.  Ronny R. Dakdouk, Semih Salihoglu, Hao Wang, Haiyong Xie, and Yang Richard Yang. In Proceedings of Incentive-Based Computing (IBC), Lisboa, Portugal, July 2006. (bib, pdf, slides)
       
      • consider interdomain routing as social choice: negative results and positive possibilities
         
      • Interdomain Routing as Social Choice: A New Perspective.  Ronny R. Dakdouk, Hao Wang, Haiyong Xie, and Yang Richard Yang. Yale Computer Science Technical Report YALEU/DCS/TR-1331. July 2005. (abstract and bib, under revision, please send me email to ask for a copy).
         
    • On Route Selection for Interdomain Traffic Engineering. Yang Richard Yang, Haiyong Xie, Hao Wang,  Avi Silberschatz, Yanbin Liu, Li Erran Li, and Arvind Krishnamurthy. March 2005. In IEEE Network Magazine, special issue on interdomain routing. Nov/Dec 2005. (abstract and bib, pdf)
      • The above article is a survey paper.  For details, see the next two papers.
         
    • Stable Egress Route Selection for Interdomain Traffic Engineering: Model and Analysis. Hao Wang, Haiyong Xie, Yang Richard Yang, Li Erran Li, Yanbin Liu, and Avi Silberschatz. March 2005. (abstract and bib, pdf under revision for camera ready, to be posted soon.). In Proceedings of IEEE ICNP 2005, Boston, MA, Nov 2005. An extended abstract in ACM SIGCOMM 2005 poster session.
       
      • the egress part
         
    • On the Stability of Rational, Heterogeneous Interdomain Route Selection. Hao Wang, Haiyong Xie, Yang Richard Yang, Li Erran Li, Yanbin Liu, and Avi Silberschatz. March 2005. (abstract and bib, pdf under revision for camera ready, to be posted soon.). In Proceedings of IEEE ICNP 2005, Boston, MA, Nov 2005. An extended abstract in ACM SIGCOMM 2005 poster session.
       
      • the ingress part and generalization
         
    • On Stable Route Selection for Interdomain Traffic Engineering: Models, Analysis, and Guidelines. Hao Wang, Haiyong Xie, Yang Richard Yang, Li Erran Li, Yanbin Liu, and Avi Silberschatz. Yale Computer Science Technical Report YALEU/DCS/TR-1316. Feb. 2005. (abstract and bib, pdf)
       
      • complete technical report
         
    • Optimal ISP Subscription for Internet Multihoming: Algorithm Design and Implication Analysis. Hao Wang, Haiyong Xie, Lili Qiu, Avi Silberschatz, and Yang Richard Yang. In Proceedings of IEEE INFOCOM 2005, Miami, FL, March 13-17, 2005. (abstract and bib, pdf)
       
    • Optimizing Cost and Performance for Multihoming. David Goldenberg, Lili Qiu, Haiyong Xie, Yang Richard Yang and Yin Zhang. In Proceedings of ACM SIGCOMM '04, Portland, OR, August 31 -- September 3, 2004. (abstract and bib, pdf)

    Overlay/P2P

  • A Measurement-based Study of the Skype Peer-to-Peer VoIP Performance. Haiyong Xie and Yang Richard Yang. In Proceedings of IPTPS. Feb. 2007. (bib, pdf)
     
    • a measurement-based study (using MOS) to measure Skype
     
  • Towards ISP-Compliant, Peer-Friendly P2P Design. Haiyong Xie, Yang Richard Yang, Avi Silberschatz. August 2006. (bib, pdf coming soon)
     
    • we can regulate P2P by ISP without reducing bandwidth allocated to P2P
    • this is extended by the P4P project.
       
  • Network Routing Tree Topology Inference from End-to-End Measurements by Jian Ni, Haiyong Xie, Sekhar Tatikonda, and Y. Richard Yang. To appear in Proceedings of IEEE INFOCOM 2008. (pdf coming soon).
  • On Selfish Routing in Internet-Like Environments. Lili Qiu, Yang Richard Yang, Yin Zhang, and Scott Shenker. In ACM/IEEE Transactions on Networking. Selected papers of SIGCOMM 2004. August 2006. (bib, pdf)
     
    • On Selfish Routing in Internet-Like Environments. Lili Qiu, Yang Richard Yang, Yin Zhang, and Scott Shenker. In Proceedings of ACM SIGCOMM, Karlsruhe, Germany, August 2003. (abstract and bib, pdf). Please read this complete version containing inter-domain results.
       
  • Optimal Capacity Sharing of Networks with Multiple Overlays. Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy. In Proceedings of the 14th IEEE International Workshop on Quality of Service (IWQoS) , New Haven, CT, June 2006. (bib, pdf, slides)
     
    • how to extend traditional congestion control to include even overlay/p2p networks
    • On Self Adaptive Routing in Dynamic Environments -- An Evaluation and Design Using a Simple, Probabilistic Scheme. Haiyong Xie, Lili Qiu, Yang Richard Yang, and Yin Zhang. In Proceedings of International Conference on Network Protocols (ICNP) '04, Berlin, Germany, November 2004. (abstract and bib, pdf, technical report)

    End Host Fairness and Rate Control

    • Transient Behaviors of TCP-friendly Congestion Control Protocols. Yang Richard Yang, Min Sik Kim, and Simon S. Lam. In Computer Networks, Volume 41, Issue 2, pages 143-184, February 2003.  (abstract and bib, gzipped postscript, pdf)
       
      • Transient Behaviors of TCP-friendly Congestion Control Protocols. Yang Richard Yang, Min Sik Kim, and Simon S. Lam. In Proceedings of INFOCOM 2001, Anchorage, Alaska, April 2001.  (gzipped postscript, pdf)
         
      • Transient Behaviors of TCP-friendly Congestion Control Protocols. Yang Richard Yang, Min Sik Kim, and Simon S. Lam. Technical Report TR-00-23, Department of Computer Sciences, UT Austin, July 2000. (gzipped postscript, pdf).
         
    • Analysis of Binomial Congestion Control. Yang Richard Yang and Simon S. Lam. Technical Report TR-00-14, Department of Computer Sciences, UT Austin, June 8, 2000. (gzipped postscript, pdf).
       
    • Two Problems of TCP AIMD Congestion Control. Yang Richard Yang, Min S. Kim, Xincheng Zhang, and Simon S. Lam. Technical Report TR-00-13, Department of Computer Sciences, UT Austin, June 2000. (gzipped postscript, pdf).
      • An independent technical report (TR-00-18) with very similar results and more simulations by Sergey Gorinsky and Harrick Vin, also from UT Austin, is available from here.
         
    • Optimal Partitioning of Multicast Receivers. Yang Richard Yang, Min Sik Kim and Simon S. Lam. Technical Report TR-00-10, Department of Computer Sciences, UT Austin, May 10, 2000. (gzipped postscript, pdf). A shorter version  appeared in Proceedings of ICNP, Osaka, Japan, November 2000. (abstract and bib, gzipped postscript, pdf)
       
    • General AIMD Congestion Control. Yang Richard Yang and Simon S. Lam. Technical Report TR-00-09, Department of Computer Sciences, UT Austin, May 9, 2000. (gzipped postscript, pdf). A shorter version appeared in Proceedings of ICNP, Osaka, Japan, November 2000. (abstract and bib, gzipped postscript, pdf)
      • Another group from aciri (Sally Floyd, Mark Handley, and Jitendra Padhye) has independently investigated a similar idea.
         
    • Internet Multicast Congestion Control: A Survey. Yang Richard Yang and Simon S. Lam. In Proceedings of ICT 2000, Acapulco, Mexico, May 2000. (gzipped postscript, pdf)
      • My first paper, a survey!

     High Capacity and Incentive Compatible Wireless Networks

    • iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks by Richard Alimi, Li Erran Li, Ram Ramjee, Harish Viswanathan, and Y. Richard Yang. To appear in Proceedings of IEEE INFOCOM 2008. (pdf coming soon).

    • Proportional Fairness in Multi-rate Wireless LANs by Li (Erran) Li, Martin Pal, and Y. Richard Yang. To appear in Proceedings of IEEE INFOCOM 2008. (pdf coming soon).

    • Superposition Coding for Wireless Mesh Networks. L. E. Li, R. Alimi, R. Ramjee, J. Shi, Y. Sun, H. Viswanathan, and Y. R. Yang. In Proceedings of ACM MobiCom (4-pages), Montreal, Sept. 2007. (pdf)

      • superposition coding can substantially improve throughput
         
    • On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks. Sheng Zhong, Li Erran Li, Yanbin Liu, and Yang Richard Yang. To appear in ACM Baltzer Wireless Networks (WINET) Special Issue of Selected Papers of Mobicom 2005. 2007 (est.). (bib, pdf)
       
      • integrated routing and forwarding
         
      • On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks---An Integrated Approach Using Game Theoretical and Cryptographic Techniques. Sheng Zhong, Li Erran Li, Yanbin Liu, and Yang Richard Yang. August 2005. In Proceedings of the Eleventh ACM Annual International Conference on Mobile Computing and Networking (Mobicom), Cologne, Germany, Aug 28 - Sept 2, 2005. (abstract and bib, pdf)
         
      • On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks --- an Integrated Approach Using Game Theoretical and Cryptographic Techniques. Sheng Zhong, Li Li, Yanbin Liu, and Yang Richard Yang. Yale Computer Science Technical Report YALEU/DCS/TR-1286. March 2004. (abstract and bib, pdf
         
    • Cooperation-Optimal Protocols: A New Solution Framework for Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad Hoc Networks. Sheng Zhong and Li Li and Yanbin Grace Liu and Yang Richard Yang. The Tenth Annual International ACM Conference on Mobile Computing and Networking (Mobicom) (student poster), Philadelphia, PA, September 31 -- October 3, 2004. (abstract and bib, pdf)
       
    • Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. Sheng Zhong, Jiang Chen, and Yang Richard Yang. Technical Report Yale/DCS/TR1235, Department of Computer Science, Yale University, July 2002.  A revised version in Proceedings of IEEE INFOCOM '03, San Francisco, CA, April 2003. (abstract and bib, pdf)
       
    • Reputation Propagation and Agreement in Mobile Ad-Hoc Networks. Yanbin Liu and Yang Richard Yang. In Proceedings of IEEE Wireless Communication and Networks Conference (WCNC), New Orleans, LA, March 2003. (abstract and bib)

    Network Localization

    • Graph Properties of Easily Localizable Networks. Brian D O Anderson, Peter N Belhumeur, Tolga Eren, David K Goldenberg, A Stephen Morse, Walter Whiteley, and Y Richard Yang. August 2006. In ACM Baltzer Wireless Networks (WINET) (bib, pdf)
       
      • in 2D, "double" an edge 2-connected network, we obtain a unique localizable network that can be localized with a known algorithm; "treble" a connected network, we obtain a unique localizable network that can be localized by trilateration; similar results in 3D are also shown in the paper
       
    • A Theory of Network Localization. J. Aspnes, T. Eren, D. K. Goldenberg, A. S. Morse, W. Whiteley, Y. R. Yang, B. D. O. Anderson, and P. N. Belhumeur. IEEE Transactions on Mobile Computing, July 2006. (bib, pdf)
       
      • a comprehensive study on condition for unique localizability, computational complexity in unit-disk graphs, and localization in random graphs; for algorithm, see the Mobicom'06 paper
         
    • Localization in Sparse Networks using Sweeps. David Goldenberg, Pascal Bihler, Ming Cao, Jia Fang, Brian D.O. Anderson, A. S. Morse, Y. Richard Yang. To appear in Proceedings of ACM MOBICOM, Los Angeles, CA, September 2006.  (bib, pdf, ppt slides)
       
      • the Sweeps algorithm to sequentially localize all bilateration networks
         
    • Network Localization in Partially Localizable Networks. D. Goldenberg, A. Krishnamurthy, W.C. Maness, Y. R. Yang, A. Young, A. S. Morse, A. Savvides, and B.D.O. Anderson. In Proceedings of IEEE INFOCOM 2005, Miami, FL, March 13-17, 2005. (abstract and bib, pdf)
       
    • On the Computational Complexity of Sensor Network Localization. James Aspnes, David Goldenberg, and Yang Richard Yang. Yale Computer Science Technical Report YALEU/DCS/TR-1282. April 2004. In Proceedings of Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS), Turku, Finland, July 16, 2004. Lecture Notes in Computer Science 3121, Springer-Verlag, 2004, pp. 32-44. Available as YALEU/DCS/TR-1282, April 2004.(abstract and bib, pdf)
       
    • Rigidity, Computation, and Randomization of Network Localization. Tolga Eren, David Goldenberg,  Walter Whitley, Yang Richard Yang, A. Stephen Morse, Brian D.O. Anderson and Peter N. Belhumeur.  In Proceedings of IEEE INFOCOM, Hong Kong, China, April 2004. (abstract and bib, pdf)

    Mobility

    • Wide-Area IP Network Mobility by Xin Hu, Li Li, Z. Morley Mao, and Yang Richard Yang, To appear in Proceedings of IEEE INFOCOM 2008. (pdf coming soon).

    • Towards Mobility as a Network Control Primitive. David Goldenberg, Jie Lin, A. Stephen Morse, Brad Rosen, and Yang Richard Yang. In Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Tokyo, Japan, May 2004. (abstract and bib, pdf)

    • Parcels: Pervasive Ad-hoc Relaying for Cellular Systems. Jie (Jay) Zhou and Yang Richard Yang.  In Proceedings of Med-Hoc-Net, Sardegna, Italy, September 2002. (abstract and bib, pdf)

    Mobile Agent

    • Verifiable Distributed Oblivious Transfer and Mobile Agent Security. Sheng Zhong, and Yang Richard Yang. In MONET Special Issue on Foundations of Mobile Computing. 2005. (abstract and bib, pdf)
       
      • Verifiable Distributed Oblivious Transfer and Mobile Agent Security. Sheng Zhong, and Yang Richard Yang. In Proceedings of DIALM-POMC 2003. September 2003. (abstract and bib, pdf)

    Security and Privacy

    • Privacy-Preserving Location-based Services for Mobile Users in Wireless Networks. Sheng Zhong, Li Li, Yanbin Liu, and Yang Richard Yang. Yale Computer Science Technical Report YALEU/DCS/TR-1297. July  2004.
       
    • Protocol Design for Scalable and Reliable Group Rekeying. X. Brian Zhang, Simon S. Lam, Dong-Young Lee, and Yang Richard Yang. In IEEE/ACM Transactions on Networking, December 2003. (abstract and bib, pdf)
       
      • Protocol Design for Scalable and Reliable Group Rekeying. X. Brian Zhang, Simon S. Lam, Dong-Young Lee, and Y. Richard Yang. In Proceedings of SPIE. Denver, CO, August 2001
  • Reliable Group Rekeying: Design and Performance Analysis. Yang Richard Yang, X. Steve Li, X. Brian Zhang, and Simon S. Lam. (pdf). A revised version appeared in Proceedings of ACM SIGCOMM 2001, San Diego, CA, USA, August 2001. (abstract and bib)
     
  • Towards Scalable and Reliable Group Key Management. Yang Richard Yang, Xiaozhou Li, Xincheng Zhang, and Simon S. Lam, Extended abstract appeared in Proceedings of ACM SIGMETRICS 2001, Cambridge, MA, USA, June 2001. Here is the powerpoint file I used to present at the NSF-Networking PI Workshop, Irvine, CA, November 2000.
     
  • Batch Updates of Key Trees. X. Steve Li, Yang Richard Yang, Mohamed Gouda, and Simon S. Lam. Technical Report TR-00-22, Department of Computer Sciences, UT Austin, September 2000. A revised version appeared in Proceedings of the Tenth International World Wide Web Conference (WWW10), Hong Kong, China, May 2001. (abstract and bib, ps, pdf)
     
  • A Secure Group Key Management Communication Lower Bound. Yang Richard Yang and Simon S. Lam, Technical Report TR-00-24, Department of Computer Sciences, UT Austin, July 2000, revised September 2000. (abstract and bib, gzipped postscript, pdf).
    • Here is the powerpoint file I used to present at the SMuG meeting, IBM Watson Research, October 5, 2000.

  • Misc.

    • Robot Motion Planning with Many Degrees of Freedom. Chenyu Ma, Wei Li, Yang Yang, Liuchen Chang. In Proceedings of IEEE International Conference on Systems, Man and Cybernetics '95. October 1995. (pdf)

    Last modified: 06/21/2007 01:06:46 PM -0400

    LANS at Yale University. Initial CSS template from free css templates. Last modified at $Id$