Sally Floyd - Resume

Resume, Sally Floyd

Address:
ICSI Center for Internet Research (ICIR)
1947 Center St., Suite 600, Berkeley, CA 94704-1198
Work phone: (510) 666-2989. FAX: (510) 643-7684
Email: floyd at icir.org
Web page: http://www.icir.org/floyd/
Home address: 2027 Parker St., Berkeley, CA 94704. (510) 848-7930.

Position:
Research scientist at ICIR since February 1999. (From 1999 through 2001 we were named ACIRI, the AT&T Center for Internet Research at ICSI.)
From May 1990 until January 1999, I was a member of the Network Research Group at Lawrence Berkeley National Laboratory.

Research interests:
Congestion control in computer networks, the analysis of network dynamics.

Specific areas of research have included the following:

TCP protocol changes (e.g., adding the Selective Acknowledgement Option to the TCP protocol standards, increasing the permitted initial window for TCP);
TCP traffic dynamics (phase effects, distribution of bandwidth among competing TCP connections);
The addition of Explicit Congestion Notification to the IP architecture;
Reliable multicast transport protocols (e.g., Scalable Reliable Multicast (SRM));
Router mechanisms for packet scheduling and for active queue management (Class-Based Queueing (CBQ), Random Early Detection (RED) queue management);
Equation-based congestion control mechanisms (TCP-Friendly Rate Control (TFRC)) for unicast streaming multimedia or for multicast traffic.
Datagram Congestion Control Protocol (DCCP), a transport protocol for unicast, unreliable transport.
Models for the evaluation of congestion control mechanisms.

All of this work has involved collaborations with other members of ICIR, of LBNL's Network Research Group, and with the wider networking research community.

Education:

Ph.D. in Computer Science, December 1989, and M.S. in Computer Science, May 1987, both from the University of California at Berkeley. Major field: theoretical computer science. Minor fields: statistics, mathematics.
Certificate in Electronics, May 1974, Merritt College.
B.A., December 1971, University of California at Berkeley. Major: sociology. Minor: mathematics.

Professional Experience:

Research Scientist at ICSI, February 1999 to the present.
Staff Scientist at Lawrence Berkeley Laboratory, December 1983 to January 1999. I began working in the Network Research Group in the summer of 1988, and then full-time starting in May 1990.
Teaching Assistant at UC Berkeley, summer 1987, and tutor for several years for the Computer Science Reentry Program at UC Berkeley.
Computer Specialist and Computer Systems Engineer for Bay Area Rapid Transit, April 1975 to September 1982. Design, maintenance, and repair for BART's real-time computer systems, including work on a joint BART-LBL project to design a replacement for BART's train control computer system.

Selected networking publications:

Floyd, S., M. Allman, A. Jain, and P. Sarolahti. RFC 4782: Quick-Start for TCP and IP. RFC 4782, Experimental, January 2007.
Kohler, E., M. Handley, and S. Floyd, Designing DCCP: Congestion Control Without Reliability, SIGCOMM, September 2006.
Kohler, E., M. Handley, and S. Floyd, RFC 4340: Datagram Congestion Control Protocol (DCCP), RFC 4340, March 2006, Proposed Standard.
Medina, A., M. Allman, and S. Floyd, Measuring the Evolution of Transport Protocols in the Internet, ACM CCR, pp. 37-52, April 2005.
Floyd, S., RFC 3649: HighSpeed TCP for Large Congestion Windows, RFC 3649, December 2003.
Handley, M., Floyd, S., Pahdye, J., and Widmer, J, RFC 3448: TCP Friendly Rate Control (TFRC): Protocol Specification, RFC 3448, January 2003.
Floyd, S., and Kohler, E., Internet Research Needs Better Models, Hotnets-I, October 2002.
Ramakrishnan, K.K., Floyd, S., and Black, D., RFC 3168: The Addition of Explicit Congestion Notification (ECN) to IP, RFC 3168, September 2001.
Floyd, S., Handley, M., Padhye, J., and Widmer, J, Equation-Based Congestion Control for Unicast Applications , SIGCOMM 2000.
Floyd, S., and Fall, K., Promoting the Use of End-to-End Congestion Control in the Internet. IEEE/ACM Transactions on Networking, August 1999.
Paxson, V., and Floyd, S., Why We Don't Know How To Simulate The Internet, Proceedings of the 1997 Winter Simulation Conference, December 1997.
Floyd, S., Jacobson, V., Liu, C., McCanne, S., and Zhang, L., A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing, IEEE/ACM Transactions on Networking, December 1997, Volume 5, Number 6, pp. 784-803. An earlier version of this paper appeared in ACM SIGCOMM 95, August 1995, pp. 342-356.
Floyd, S., and Jacobson, V., Link-sharing and Resource Management Models for Packet Networks (compressed postscript, pdf). IEEE/ACM Transactions on Networking, Vol. 3 No. 4, pp. 365-386, August 1995.
Paxson, V, and Floyd, S., Wide-Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking, Vol. 3, No. 3, pp. 226-244, June 1995.
Romanow, A., and Floyd, S., Dynamics of TCP Traffic over ATM Networks (compressed postscript, pdf). IEEE JSAC, V. 13 N. 4, May 1995, p. 633-641.
Floyd, S., TCP and Explicit Congestion Notification (compressed postscript, pdf). ACM Computer Communication Review, V. 24 N. 5, October 1994, p. 10-23.
Floyd, S., and Jacobson, V., The Synchronization of Periodic Routing Messages (compressed postscript, pdf). IEEE/ACM Transactions on Networking, V.2 N.2, p. 122-136, April 1994.
Floyd, S., and Jacobson, V., Random Early Detection gateways for Congestion Avoidance IEEE/ACM Transactions on Networking, V.1 N.4, August 1993, p. 397-413.
Floyd, S., and Jacobson, V., On Traffic Phase Effects in Packet-Switched Gateways (compressed postscript, pdf). Internetworking: Research and Experience, V.3 N.3, September 1992, p.115-156.
Floyd, S., Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: One-way Traffic (compressed postscript, pdf). Computer Communication Review, Vol.21, No.5, October 1991, p. 30 -47.

Other publications:

Floyd, S., and Warmuth, M., Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, V. 21, p. 269, 1995.
Floyd, S. and Karp, R., FFD Bin-packing for Items with Distributions on [0, 1/2]. Algorithmica V.6, No.2, 1991, p.222-240.
Floyd, S., On Space-Bounded Learning and the Vapnik-Chervonenkis Dimension. Ph.D. thesis, International Computer Science Institute Technical Report TR -89-061, ICSI, Berkeley CA, December 1989.

Professional Activities:

Member of the Internet Architecture Board, 2001-2005.
Member of the Editorial Board for IEEE/ACM Transactions on Networking for 1996-2000 and IEEE Network for 1997-2000.
Member of several conference program committees (including member of the SIGCOMM Program Committee from 1994-1999, SIGMETRICS 2000).
Intermittently-active member of several IETF working groups ( DCCP, TSVWG).
Intermittently-active member of several IRTF groups (the Transport Modeling Research Group (TMRG), the End-to-end Research Group.
Vice-chair of SIGCOMM from July 1995 to June 1999.

Awards:

The 2007 SIGCOMM Award.
IEEE Internet Award for 2005.
Distinguished Alumni Award, Computer Science, University of California at Berkeley, 2002.
Communications Society William R. Bennett Prize Paper Award, 2002 (for 2001).
Communications Society William R. Bennett Prize Paper Award, 2000 (for 1999).
ACM Fellow, 2000.

Sally Floyd, floyd at icir.org
Last modified: August 2007