Liang Guo

Computer Science Department Boston University 111 Cummington Street Boston, MA 0221 5 phone: (617)353-5222 fax: (617)353-6457 email: guol(at)cs.bu.edu http://cs-people.bu.edu/guol

327 Huntington Ave. Apt. 31 Boston, MA 02115 phone: (617)375-9206 cell phone: (617)962-2506

Research Interests

• Differentiated Services (Diffserv) network design, Quality-of-Service (QoS) routing, scalable and dynamic multicast routing, large-scale network simulation, performance evaluation and optimization.

Education

• Ph.D. Computer Science expected May 2003
  Boston University, Boston, MA
• M.S. Computer Science June 1999
  Northeastern University, Boston, MA
• M.E. Computer Engineering April 1997
  Beijing Univ. of Aeronautics and Astronautics (BUAA), Beijing, P.R.China
• B.S. Computer Engineering September 1994
  Beijing Univ. of Aeronautics and Astronautics, Beijing, P.R.China

Professional Experience

• Computer Science Department, Boston Univ., Boston, MA Jul. 1999 - Present
  Research Assistant
  Projects included characterization of TCP traffic, design of congestion control rules for TCP, and study of isolated versus aggregated traffic.

  On-going project: Internet Traffic Managers, which are special network elements placed in the Internet performing traffic control to achieve better resource usage.

• Motorola Broadband Networks Research Lab, Mansfield, MA May. 2002 - Aug. 2002
  Intern
  Projects include the implementation of a QoS networking simulation environment, and the design of an Active Queue Management policy.

• College of Computer Science, Northeastern Univ., Boston, MA Sept. 1997 - Jun. 1999
  Research Assistant
  Participated in several Quality-of-Service (QoS) routing related projects, which include a unicast multi-constraint routing algorithm SSR, a QoS-aware multicast routing algorithm QDMR, a study of the effect of different link cost functions on efficiency of routing algorithms, and a study of different topology (routing state) aggregation schemes.

• Dept. of Computer Science and Engineering, BUAA, P.R.China Jan. 1994 - Jun. 1997
  Research Assistant
  Participated in projects for the Aeronautics Enterprise Network of China. Research included designing and implementing network management modules (under multiple operating system platforms, e.g., SCO Unix, Linux, Windows, AIX, etc.) and providing security guarantees in the network.

• Network Infomation Center, BUAA, Beijing, P.R.China Jul. 1995 - Jun. 1997
  Research Engineer
  Participated in configuring and maintaining the university campus network. Network resources included FDDI and Fast Ethernet facilities, Sun, DEC, IBM workstations, Cisco routers and switches.

• Beijing Senson Tech. Ltd., Beijing, P.R.China Mar. 1997 - Aug. 1997
  Consultant
  Network design and troubleshooting.

Journal Publications

1. I. Matta and L. Guo. QDMR: An Efficient QoS Dependent Multicast Routing Algorithm. in Journal of Communications and Networks - Special Issue on QoS in IP Networks, 2(2), June 2000.
2. S. Jin, L. Guo, I. Matta, and A. Bestavros. A Spectrum of TCP-friendly Window-based Congestion Control Algorithms. To appear IEEE/ACM Transactions on Networking (TON), April 2003, accepted May 2002,
3. L. Guo and I. Matta. Search Space Reduction in QoS Routing. To appear Computer Networks Journal (Elsevier), accepted May 2002.

Conference Publications

4. L. Guo and I. Matta. Scheduling Flows with Unknown Sizes: Approximate Analysis. To appear Proc. ACM SIGMETRICS'02 poster session. Full paper available as BU CS Technical Report TR-2002-09.
5. L. Guo and I. Matta. The War between Mice and Elephants. Proc. 9th IEEE International Conference on Network Protocols (ICNP'01) , Riverside, CA, November, 2001.
6. S. Jin, L. Guo, I. Matta, and A. Bestavros. TCP-friendly SIMD Congestion Control and Its Convergence Behavior. Proc. 9th IEEE International Conference on Network Protocols (ICNP'01), Riverside, CA, November 2001.
7. L. Guo, M. Crovella and I. Matta. How does TCP Generate Pseudo-self-similarity? Proc. the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS'01) , Cincinnati, OH, August 2001.
8. I. Matta and L. Guo. Differentiated Predictive Fair Service for TCP Flows. Proc. 8th IEEE International Conference on Network Protocols (ICNP'00), Osaka, Japan, October 2000.
9. L. Guo and I. Matta. Search Space Reduction in QoS Routing. Proc. 19th International Conference on Distributed Computing Systems (ICDCS'99) . June, 1999.
10. L. Guo and I. Matta. QDMR: An Efficient QoS Dependent Multicast Routing Algorithm. Proc. Fifth IEEE Real-Time Technology and Applications Symposium (RTAS '99). June, 1999.
11. I. Matta and L. Guo. On Routing Real-Time Multicast Connections. Proc. Fourth IEEE Symposium on Computers and Communications (ISCC '99), July 1999.

Workshops

12. L. Guo and Ibrahim Matta. Differentiated Control of Web Traffic: A Numerical Analysis. Proc. SPIE ITCOM'2002: Scalability and Traffic Control in IP Networks, Boston, MA, August 2002.
13. L. Guo and I. Matta. On State Aggregation for Scalable QoS Routing. Proc. IEEE ATM '98 Workshop, Fairfax, VA, May 1998.

Professional Activities

• Member ACM/SIGCOMM, IEEE/Communications, ACM/UPE
• Organized the Network Reading Group Seminar at Boston University (Fall 1999 - present)
• Maintained the shared Network Simulator-2 at Boston University
• Referee: Infocom, ICNP, ISCC, IEEE/ACM Transactions on Networking, IEEE Transactions on Communication, Computer Networks Journal (Elsevier)

Public Domain Software

• Stateful TCP-friendly Congestion Control (source code). S. Jin, L. Guo, I. Matta and A. Bestavros.
  We proposed a spectrum of stateful congestion control algorithms that are TCP friendly in steady-state but exhibit much better transient behaviors such as better responsiveness to bandwidth changes and better convergence-to-fairness behavior.

• On-Line Network Evaluator (Z-Iteration) I. Matta, L. Guo and the Systems group at U. Maryland.
  The Z-iteration is a numerical-analytical method to obtain transient performance measures of large adaptive distributed systems such as integrated-services networks. The method yields time evolutions of probabilistic measures (e.g. instantaneous queue size distribution) at a cost several orders cheaper than simulation.

• QDMR algorithm (source code) L. Guo and I. Matta.
  QDMR is a fast algorithm for generating delay-constrained low-cost multicast routing trees. A salient feature of QDMR is that it dynamically adjusts its low-cost tree construction policy based on how far the current on-tree node is from violating the QoS/delay bound. This QoS dependent (adaptive) tree construction, together with the capability to merge least-delay paths into the low-cost tree in case of stringent delay requirements, make QDMR a fast and efficient candidate for large scale QoS-sensitive multicast routing.

Personal

• Citizen of P.R.China, currently on F1 visa

References

Prof. Ibrahim Matta (advisor) Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 (617)358-1062 matta@cs.bu.edu Prof. Azer Bestavros (chair) Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 (617)353-9726 best@cs.bu.edu Prof. John W. Byers Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 (617)353-8925 byers@cs.bu.edu

Prof. Mark E. Crovella Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 (617)353-8923 crovella@cs.bu.edu Dr. Whay C. Lee Distinguished Member of Technical Staff Broadband Network Research Lab Motorola Labs 20 Cabot Boulevard, Mansfield, MA 02048 (508)851-8335 Whay.Lee@motorola.com Prof. Rajmohan Rajaraman College of Computer Science Northeastern University 113 Cullinane Hall Boston, MA 02115 (617)373-2075 rraj@ccs.neu.edu

About this document ...

Liang Guo

This document was generated using the LaTeX2HTML translator Version 99.2beta6 (1.42)

Copyright © 1993, 1994, 1995, 1996, Nikos Drakos , Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore , Mathematics Department, Macquarie University, Sydney.

The command line arguments were:
latex2html -split 0 -noexternal_images cv2.tex

The translation was initiated by Liang Guo on 2002-10-28