Department of Computer Science
`
`Duke University
`Durham, NC 27708—0129
`bmm@cs.duke.edu
`
`Research Interests
`
`Bruce MacDowell Maggs
`
`402 Lyons Road
`
`Chapel Hill, NC 27514
`(919) 929—3997
`
`Networks for parallel and distributed computer systems.
`
`Employment
`
`Duke University
`
`Pelham Wilder Professor of Computer Science, July 2011*present.
`
`Professor of Computer Science, January 2010*July 2011.
`
`Visiting Professor of Computer Science, September 2007*August 2008,
`
`July 2009*January 2010.
`
`Carnegie Mellon University
`
`Adjunct Professor of Computer Science, July 2009*July 2010.
`
`Professor of Computer Science, July 2004*July 2009.
`Professor of Electrical and Computer Engineering (by courtesy), July 2004*July
`2009.
`
`Associate Professor of Computer Science, With tenure, July 1999*July 2004.
`
`Associate Professor of Computer Science, July 1997*July 1999.
`
`Assistant Professor of Computer Science, January 1994*July 1997.
`
`Akamai Technologies, Inc.
`Vice President for Research, January 1, 2000*present.
`
`Vice President for Research and Development, April 1, 1999*December 31, 1999.
`Senior Research Scientist, January 15, 1999*March 31, 1999.
`
`Massachusetts Institute of Technology
`
`Visiting Associate Professor of Computer Science, September 1998*January 1999.
`
`NEC Research Institute, Inc.
`Research Scientist (Permanent Status), October 1993*January 1994.
`Research Scientist (Provisional Status), September 1990*October 1993.
`
`Massachusetts Institute of Technology
`
`Postdoctoral Associate, September 1989*September 1990.
`
`Education
`
`Massachusetts Institute of Technology
`
`Ph.D., Computer Science, September 1989.
`
`Thesis title: Locality in Parallel Computation
`
`Thesis supervisor: Charles E. Leiserson
`
`S.M., Electrical Engineering and Computer Science, June 1986.
`
`Thesis title: Communication-Efiicient Parallel Graph Algorithms
`
`S.B., Computer Science and Engineering, June 1985.
`
`Thesis title: Computing Minimum Spanning Trees on a Fat- Tree Architecture
`
`University of Illinois at Urbana-Champaign
`
`September 1981*May 1983.
`
`Page 1 0f 25
`
`Verizon Exhibit 1017
`
`

`

`II. Publications
`
`Chapters in Books
`
`0]
`
`“Parallel algorithms,” G. E. Blelloch and B. M. Maggs. In M. J. Atallah, editor, Handbook
`
`of Algorithms and Theory of Computation, CRC Press, Boca Raton, FL, November 1998,
`
`chapter 47.
`
`Bl
`
`“Parallel algorithms,” G. E. Blelloch and B. M. Maggs.
`
`In A. B. Tucker, Jr., editor, The
`
`Computer Science and Engineering Handbook, CRC Press, Boca Raton, FL, 1997, pp. 277*
`315.
`
`Refereed Journal Papers
`
`0]
`
`“Enabling Content—Aware Traflic Engineering,” I. Poese, B. Frank, G. Smaragdakis, S. Uhlig,
`A. Feldmann, and B. Maggs. ACM SICCOMM Computer Communication Review, Vol. 42,
`
`No. 5, October 2012.
`
`B]
`
`“Posit: A Lightweight Approach for IP Geolocation,” B. Eriksson, P. Barford, B. Maggs, and
`
`R. Nowak, SICMETRICS Performance Evaluation Review, Vol. 40, No. 2, September 2012,
`pp. 2711.
`
`B]
`
`“Simultaneous Source Location,” K. Andreev, C. Garrod, D. Golovin, B. Maggs, and A.
`
`Meyerson. ACM Transactions on Algorithms, Vol. 6, No. 1, December 2009.
`
`Originally appeared in the Proceedings of the 7th International Workshop on Approximation
`
`Algorithms for Combinatorial Optimization Problems (APPROX), August, 2004.
`
`M]
`
`“On the Performance Benefits of Multihoming Route Control,” A. Akella, B. M. Maggs, S.
`
`Seshan, A. Shaikh, and R. Sitaraman. IEEE/ACM Transactions on Networking, Vol. 16, No.
`1, February 2008, pp. 917104.
`
`Originally appeared as “A measurement—based analysis of multihoming,” in the Proceedings
`
`of the ACM SICCOMM 2003 Conference on Applications, Technologies, Architectures, and
`Protocols for Computer Communication (SIGCOMM), August, 2003.
`
`E]
`
`W]
`
`“Globally distributed content delivery,” J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitara—
`man, and B. Weihl. IEEE Internet Computing, September/ October 2002, pp. 50758.
`
`“Protocols for asymmetric communication channels,” M. Adler and B. M. Maggs. Journal of
`Computer and Systems Sciences, Vol. 63, No. 4, December 2001, pp. 5737596.
`
`Originally appeared in the Proceedings of the 39th Annual Symposium on Foundations of
`
`Computer Science (FOCS), October 1998, pp. 522753.
`
`[0
`
`“On the bisection Width and expansion of butterfly networks,” C. F. Bornstein, A. Litman,
`
`B. M. Maggs, R. K. Sitaraman, and T. Yatzkar. Theory of Computing Systems, Vol. 34, No.
`
`6, November 2001, pp. 4917518.
`
`Originally appeared in the Proceedings of the 12th International Parallel Processing Sympo-
`sium (IPPS), March 1998, pp. 1447150.
`
`“On the benefit of supporting virtual channels in wormhole routers,” R. J. Cole, B. M. Maggs,
`
`and R. K. Sitaraman. Journal of Computer and System Sciences, Vol. 62, No. 1, February
`2001,pp.152*177.
`
`Originally appeared in the Proceedings of the 8th ACM Symposium on Parallel Algorithms
`and Architectures (SPAA), June 1996, pp. 1317141.
`
`Bl
`
`“Improved routing and sorting on multibutterflies,” B. M. Maggs and B. Vocking. Algorith-
`mica, Vol. 28, No. 4, 2000, pp. 4387464.
`
`Page 2 of 25
`
`

`

`Originally appeared in the Proceedings of the 28th Annual ACM Symposium on the Theory
`of Computing (STOC), May 1997, pp. 5177530.
`
`[10]
`
`“Sorting—based selection algorithms for hypercubic networks,” P. Berthomé, A. Ferreira, B.
`
`M. Maggs, S. Perennes, and C. G. Plaxton. Algorithmica, Vol. 26, No. 2, 2000, pp. 2377254.
`
`Originally appeared in the Proceedings of the 7th International Parallel Processing Symposium
`(IPPS), April 1993, pp. 89795.
`
`[11]
`
`“Fast algorithms for finding O(congestion+dilation) packet routing schedules,” F. T. Leighton,
`B. M. Maggs, and A. W. Richa. Combinatorica, Vol. 19, No. 3, 1999, pp. 3757401.
`
`Originally appeared in the Proceedings of the 28th Hawaii International Conference on System
`
`Sciences (HICSS), Volume 2, January, 1995, pp. 5557563.
`
`[12]
`
`“Simple algorithms for routing on butterfly networks with bounded queues,” B. M. Maggs
`
`and R. K. Sitaraman. SIAM Journal on Computing, Vol. 28, No. 3, June 1999, pp. 98471003.
`
`Originally appeared in the Proceedings of the 24th Annual ACM Symposium on the Theory
`
`of Computing (STOC), May 1992, pp. 1507161.
`
`[13]
`
`“Tight analyses of two local load balancing algorithms,” B. Ghosh, F. T. Leighton, B. M.
`
`Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D.
`
`Zuckerman. SIAM Journal on Computing, Vol. 29, No. 1, February 1999, pp. 29764.
`
`Originally appeared in the Proceedings of the 27th Annual ACM Symposium on the Theory
`of Computing (STOC), May 1995, pp. 5487558.
`
`[14]
`
`“On the fault tolerance of some popular bounded—degree networks,” F. T. Leighton, B. M.
`
`Maggs, and R. K. Sitaraman. SIAM Journal on Computing, Vol. 27, No. 5, October 1998,
`pp. 130371333.
`
`Originally appeared in the Proceedings of the 33rd Annual Symposium on Foundations of
`
`Computer Science (FOCS), October 1992, pp. 5427552.
`
`[15]
`
`“An experimental analysis of parallel sorting algorithms,” G. E. Blelloch, C. E. Leiserson, B.
`
`M. Maggs, C. G. Plaxton, S. Smith, and M. Zagha. Theory of Computing Systems, Vol. 31,
`No. 2, March/April 1998, pp. 1357167.
`
`Originally appeared as “A comparison of sorting algorithms for the Connection Machine
`
`CM—2,” in the Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and
`
`Architectures (SPAA), July 1991, pp. 3716.
`
`[16]
`
`“Reconfiguring arrays with faults part I: worst—case faults,” R. J. Cole, B. M. Maggs, and R.
`
`K. Sitaraman. SIAM Journal on Computing, Vol. 26, No. 6, December 1997, pp. 158171611.
`
`Originally appeared as “Multi—scale emulation: A technique for reconfiguring arrays with
`
`faults,” in the Proceedings of the 25th Annual ACM Symposium on the Theory of Computing
`(STOC), May 1993, pp. 5617572.
`
`[17]
`
`“Work—preserving emulations of fixed—connection networks,” R. R. Koch, F. T. Leighton, B.
`
`M. Maggs, S. B. Rao, A. L. Rosenberg, and E. J. Schwabe. Journal of the ACM, Vol. 44, No.
`
`1, January 1997, pp. 1047147.
`
`Originally appeared in the Proceedings of the 21st Annual ACM Symposium on Theory of
`Computing (STOC), May 1989, pp. 2277240.
`
`[18]
`
`“On—line algorithms for path selection in a nonblocking network,” S. Arora, F. T. Leighton,
`
`and B. M. Maggs. SIAM Journal on Computing, Vol. 25, No. 3, June 1996, pp. 6007625.
`
`Originally appeared in the Proceedings of the 22nd Annual ACM Symposium on Theory of
`Computing (STOC), May 1990, pp. 1497158.
`
`Page 3 of 25
`
`

`

`[19] “A maximum likelihood stereo algorithm,” 1. J. Cox, S. L. Hingorani, B. M. Maggs, S. B.
`Rao. Computer Vision and Image Understanding, Vol. 63, No. 3, May 1996, pp. 5427567.
`
`Originally appeared as “Stereo without disparity gradient smoothing: a Bayesian sensor fusion
`
`solution,” in D. Hogg and R. Boyle, ed., Proceedings of the British Machine Vision Conference,
`
`Springer—Verlag, September 1992, pp. 337—346.
`
`[20] “Randomized routing and sorting on fixed—connection networks,” F. T. Leighton, B. M.
`Maggs, S. B. Rao, and A. G. Ranade.
`Journal of Algorithms, Vol. 17, No. 1, July 1994,
`
`pp. 1577205.
`
`Originally appeared as “Universal packet routing algorithms,” T. Leighton, B. Maggs, and
`
`S. Rao. Proceedings of the 29th Annual Symposium on Foundations of Computer Science
`
`(FOCS), October 1988, pp. 2567271. Note: this conference paper was later broken into two
`journal papers.
`
`[21] “Packet routing and job—shop scheduling in O(congestion+dilation) steps,” F. T. Leighton,
`B. M. Maggs, S. B. Rao. Combinatorica, Vol. 14, No. 2, 1994, pp. 1677180.
`
`Originally appeared as “Universal packet routing algorithms,” T. Leighton, B. Maggs, and
`
`S. Rao. Proceedings of the 29th Annual Symposium on Foundations of Computer Science
`
`(FOCS), October 1988, pp. 2567271. Note: this conference paper was later broken into two
`journal papers.
`
`[22] “A parallel algorithm for reconfiguring a multibutterfly network with faulty switches,” A. V.
`Goldberg, B. M. Maggs, and S. A. Plotkin. IEEE Transactions on Computers, Vol. 43, No.
`
`3, March 1994, pp. 3217326.
`
`[23] “Fast algorithms for routing around faults in multibutterflies and randomly—wired splitter
`networks,” F. T. Leighton and B. M. Maggs. IEEE Transactions on Computers, Vol. 41, No.
`
`5, May 1992, pp. 5787587.
`
`Originally appeared as “Expanders might be practical: fast algorithms for routing around
`
`faults on multibutterflies,” in the Proceedings of the 30th Annual Symposium on Foundations
`of Computer Science (FOCS), October 1989, pp. 3847389.
`
`[24] “Fast algorithms for bit—serial routing on a hypercube,” W. A. Aiello, F. T. Leighton, B. M.
`Maggs, and M. Newman. Mathematical Systems Theory, Vol. 24, No. 4, 1991, pp. 2537271.
`
`Originally appeared in the Proceedings of the 2nd Annual ACM Symposium on Parallel Al-
`
`gorithms and Architectures (SPAA), July 1990, pp. 55764.
`
`[25] “Communication—eflicient parallel algorithms for distributed random—access machines,” C. E.
`Leiserson and B. M. Maggs. Algorithmica, Vol. 3, No. 1, 1988, pp. 53777.
`
`Originally appeared in the Proceedings of the 1986 International Conference on Parallel Pro-
`
`cessing (ICPP), August 1986, pp. 8617868.
`
`[26] “Minimum—cost spanning tree as a path—finding problem,” B. M. Maggs and S. A. Plotkin.
`Information Processing Letters, Vol. 26, No. 6, January 1988, pp. 2917293.
`
`Submitted for Journal Publication
`
`[1] “Designing overlay multicast networks for streaming”, K. Andreev, B. Maggs, A. Meyerson,
`and R. Sitaraman.
`
`Originally appeared in Proceedings of the Fifteenth Annual ACM Symposium on Parallel
`Algorithms and Architectures (SPAA), June 2003.
`
`[2] “On hierarchical routing in doubling metrics,” H. T—H. Chan, A. Gupta, B. M. Maggs, and
`S. Zhou.
`
`Page 4 of 25
`
`

`

`Originally appeared in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete
`Algorithms (SODA), January 2005.
`
`Refereed Conference and Workshop Papers Not Also Appearing in or Submitted to
`Journals
`
`lin, A.
`incrementally deployable ICN,” S. Fayazbaksh, Y.
`[1] “Less pain, most of the gain:
`Tootonchian, A. Ghodsi, T. Koponen, B. Maggs, K.—C. Ng, V. Sekar, and S. Shenker, Pro-
`ceedings of the ACM SICCOMM 2013 Conference (SIGCOMM), August, 2013, to appear.
`
`[2] “Reliable content—distribution networks,” P. Aditya, M. Zhao, Y. Lin, A. Haeberlen, P. Dr—
`uschel, B. Maggs, and B. Wishon, Proceedings of the 9th USENIX Symposium on Networked
`
`Systems Design and Implementation (NSDI), April 2012.
`
`[3] “Cutting the electrical bill for Internet—scale systems,” A. Qureshi, R. Weber, H. Balakrishnan,
`J. Guttag, and B. Maggs, Proceedings of the ACM SICCOMM 2009 Conference (SIGCOMM),
`August, 2009.
`
`[4] “Holistic query transformations for dynamic Web applications,” A. Manjhi, C. Garrod, B.
`M. Maggs, T. C. Mowry, and A. Tomasic, Proceedings of the 2009 IEEE 25th International
`
`Conference on Data Engineering (ICDE), April 2009.
`
`[5] “Holistic application analysis for update—independence,” C. Garrod, A. Manjhi, B. Maggs, T.
`Mowry, and A. Tomasic, Proceedings of the Second IEEE Workshop on Hot Topics in Web
`
`Systems and Technologies (HotWeb 2008), October, 2008, pp. 176.
`
`[6] “Scalable query result caching for Web applications,” C. Garrod, A. Manji, A. Ailamaki,
`B. Maggs, T. Mowry, C. Olston, and A. Tomasic. Proceedings of the 34th International
`Conference on Very Large Databases (VLDB), August 2008.
`
`[7] “On the impact of route monitor selection,” Y. Zhang, Z. Zhang, Z. M. Mao, Y. C. Hu, and B.
`M. Maggs, Proceedings of the Internet Measurement Conference 2007 (IMC), October 2007.
`
`[8] “Portcullis: protecting connection setup from denial—of—capability attacks,” B. Parno, D.
`Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y.—C. Hu, Proceedings of the ACM SICCOMM
`
`2007 Conference (SIGCOMM), August, 2007.
`
`[9] “R—BGP: staying connected in a connected world,” N. Kushman, S. Kandula, D. Katabi, and
`B. M. Maggs, Proceedings of the 4th USENIX Symposium on Networked Systems Design 63
`
`Implementation (NSDI), April 2007.
`
`[10] “Invalidation clues for database scalability services,” A. Manjhi, P. B. Gibbons, A. Ailamaki,
`B. M. Maggs, T. C. Mowry, C. Olston, A. Tomasic, and H. Yu. Proceedings of the 2007 IEEE
`23rd International Conference on Data Engineering (ICDE), April 2007.
`
`[ll] “Quorum placement in networks: minimizing network congestion,” D. Golovin, A. Gupta, B.
`M. Maggs, F. Oprea, and M. Reiter, Proceedingss of the 18th Annual ACM SICACT—SICOPS
`
`Symposium on Principles of Distributed Computing (PODC), July, 2006.
`
`[12] “Simultaneous scalability and security for data—intensive Web applications,” A. Manjhi, A.
`Ailamaki, B. M. Maggs, T. C. Mowry, C. Olston, and A. Tomasic. Proceedings of ACM
`SICM0D 2006 (SIGMOD), June, 2006.
`
`[13] “Finding effective support—tree preconditioners,” B. M. Maggs, G. L. Miller, 0. Parekh, R.
`Ravi, and S. L. M. Woo. Proceedings of the 17th Annual ACM Symposium on Parallel
`Algorithms and Architectures (SPAA), July 2005.
`
`Page 5 of 25
`
`

`

`[14]
`
`“Quorum placement in networks to minimize access delays,” A. Gupta, B. Maggs, F. Oprea,
`
`and M. Reiter, Proceedings of the 17th Annual ACM SICACT—SICOPS Symposium on Prin-
`ciples of Distributed Computing (PODC), July, 2005.
`
`[15]
`
`“A scalability service for dynamic Web applications,” C. Olston, A. Manjhi, C. Garrod, A.
`
`Ailamaki, B. M. Maggs, and T. C. Mowry, Proceedings of the 2nd Biennial Conference on
`
`Innovative Data Systems Research (CIDR), January 2005.
`
`[16]
`
`“A methodology for estimating interdomain Web trafiic demand,” A. Feldmann, N. Kammen—
`huber, O. Maennel, B. Maggs, R. De Prisco, and R. Sundaram. Proceedings of the Internet
`Measurement Conference 2004 (IMC), October 2004.
`
`[17]
`
`“An analysis of live streaming workloads on the Internet,” K. Sripanidkulchai, B. Maggs, and
`H. Zhang. Proceedings of the Internet Measurement Conference 2004 (IMC), October 2004.
`
`[18]
`
`“Availability, usage, and deployment characteristics of the Domain Name System”, J. Pang,
`
`J. Hendricks, A. Akella, S. Seshan, B. Maggs, and R. De Prisco. Proceedings of the Internet
`Measurement Conference 2004 (IMC), October 2004.
`
`[19]
`
`“Locating Internet routing instabilities”, A. Feldmann, O. Maennel, Z. Morley Mao, A.
`Berger, and B. Maggs. Proceedings of the ACM SICCOMM 2004 Conference (SIGCOMM),
`August, 2004.
`
`[20]
`
`“A comparison of overlay routing and multihoming route control”, A. Akella, J. Pang, A.
`
`Shaikh, B. Maggs, and S. Seshan. Proceedings of the ACM SICCOMM 2004 Conference
`(SIGCOMM), August, 2004.
`
`[21]
`
`“The feasibility of supporting large—scale live streaming applications with dynamic application
`
`end—points,” K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang. Proceedings of the
`ACM SICCOMM 2004 Conference (SIGCOMM), August, 2004.
`
`[22]
`
`“Efiicient content location using interest—based locality in peer—to—peer systems”, K. Sripanid—
`kulchai, B. M. Maggs, and H. Zhang. Proceedings of the 22nd Annual Joint Conference of
`
`the IEEE Computer and Communications Societies (INFOCOM’03), April 2003.
`
`[23]
`
`“Space—efiicient finger search on degree—balanced search trees”, G. E. Blelloch, B. M. Maggs,
`
`and S. L. M. Woo. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete
`Algorithms (SODA), January 2003, pp. 3747383.
`
`[24]
`
`“Tradeoffs between parallelism and fill in nested dissection,” C. F. Bornstein, B. M. Maggs,
`and G. L. Miller, Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms
`and Architectures (SPAA), June 1999, pp. 1917200.
`
`[25]
`
`“On balls and bins with deletions,” R. Cole, A. Frieze, B. M. Maggs, M. Mitzenmacher, A.
`W. Richa, R. K. Sitaraman, and E. Upfal, Proceedings of the 2nd International Workshop on
`
`Randomization and Approximation Techniques in Computer Science (RANDOM), October
`1998, pp. 1457158.
`
`[26]
`
`“Randomized protocols for low—congestion circuit routing in multistage interconnection net—
`
`works,” R. Cole, B. M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A. W. Richa, K.
`
`Schroder, R. K. Sitaraman, and B. Vocking. Proceedings of the 29th Annual ACM Symposium
`on the Theory of Computing (STOC), May 1998, pp. 3787388.
`
`[27]
`
`“Parallel Gaussian elimination with linear work and fill,” C. F. Bornstein, B. M. Maggs, G.
`
`Miller, and R. Ravi. Proceedings of the 38th Annual Symposium on Foundations of Computer
`Science (FOCS), October 1997, pp. 2747283.
`
`Page 6 of 25
`
`

`

`[28] “Exploiting locality for data management in systems of limited bandwidth,” B. M. Maggs,
`F. Meyer auf der Heide, B. Vocking, and M. Westermann. Proceedings of the 38th Annual
`Symposium on Foundations of Computer Science (FOCS), October 1997, pp. 2847293.
`
`[29] “Routing on butterfly networks with random faults,” R. Cole, B. Maggs, and R. Sitaraman.
`Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS),
`October 1995, pp. 5587570.
`
`[30] “An algorithm for finding predecessors in integer sets,” B. Maggs and M. Rauch. Proceedings
`of the 3rd Workshop on Algorithms and Data Structures (WADS). Vol. 709 of Lecture Notes
`in Computer Science, Spring—Verlag, August 1993, pp. 4837493.
`
`[31] “Approximate load balancing on dynamic and asynchronous networks,” W. Aiello, B. Awer—
`buch, B. Maggs, and S. Rao. Proceedings of the 25th Annual ACM Symposium on the Theory
`of Computing (STOC), May 1993, pp. 6327641.
`
`[32] “Empirical evaluation of randomly—wired multistage networks,” D. Lisinski, T. Leighton, and
`B. Maggs. Proceedings of the 1990 International Conference on Computer Design (ICCD),
`September 1990, pp. 3807385.
`
`Technical Reports
`
`[1] “Competitive analysis of call admission algorithms that allow delay,” A. Feldmann, B. M.
`Maggs, J. Sgall, D. D. Sleator, and A. Tomkins. Technical Report CMU—CS—95—102, School
`
`of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, January 1995.
`
`Other Publications - Surveys and Position Papers
`
`[1] “A survey of congestion+dilation results for packet scheduling,” B. M. Maggs. Proceedings
`of the 40th Conference on Information Science and Systems (CISS), March 2006.
`
`[2] “Real—time emulations of bounded—degree networks,” B. M. Maggs and E. J. Schwabe, Infor-
`mation Processing Letters, Vol. 6, No. 5, June 1998, pp. 2697276.
`
`[3] “A critical look at three of parallel computing’s maxims,” B. M. Maggs. Proceedings of the
`1996 International Symposium on Parallel Architectures, Algorithms, and Networks (I—SPAN
`’96), June 1996, pp. 177.
`
`[4] “Parallel algorithms,” G. E. Blelloch and B. M. Maggs, ACM Computing Surveys, Vol. 28,
`No. 1, March 1996, pp. 51754.
`
`[5] “Models of parallel computation: a survey and synthesis,” B. M. Maggs, L. R. Matheson, and
`R. E. Tarjan. Proceedings of the 28th Hawaii International Conference on System Sciences
`
`(HICSS), Volume 2, January, 1995, pp. 61770.
`
`[6] “The hidden cost of low bandwidth communication,” G. E. Blelloch, B. M. Maggs, and G.
`L. Miller. In U. Vishkin, ed., Developing a Computer Science Agenda for High-Performance
`
`Computing, ACM Press, 1994, pp. 22725.
`
`[7] “Randomly wired multistage networks.” Statistical Science, B. M. Maggs. Vol. 8, No. 1,
`February, 1993, pp. 70775.
`
`[8] “Beyond parallel random—access machines,” B. M. Maggs. In J. L. C. Sanz, ed., Opportunities
`and Constraints of Parallel Computing, Springer—Verlag, 1989, pp. 83784.
`
`Page 7 of 25
`
`

`

`Patents
`
`US. Patent Number 7,296,082, “Method and System for Fault Tolerant Media Stream—
`
`ing over the Internet,” F. T. Leighton, D. M. Lewin, D. Shaw, and B. Maggs,
`
`November 13, 2007.
`
`US. Patent Number 7,111,061, “Global Load Balancing Across Mirrored Data Centers,”
`F. T. Leighton, A. E. Lewin (legal representative), R. Sundaram, R. S. Dhanidina,
`R. Kleinberg, M. Levine, A. M. Soviani, B. Maggs, H. S. Rahul, S. Thirumalai, J.
`G. Parikh, Y. O. Yerushalmi, D. M. Lewin, September 19, 2006.
`
`US. Patent Number 7,010,578, “Internet Content Delivery Service with Third Party
`
`Cache Interface Support,” D. M. Lewin, B. Maggs, and J. J. Kloninger, March 7,
`2006.
`
`US. Patent Number 6,667,726, “Method and System for Fault Tolerant Media Stream—
`
`ing over the Internet,” F. T. Leighton, D. M. Lewin, D. Shaw, and B. Maggs,
`
`December 16, 2003.
`
`US. Patent Number 5,521,591, “Switching Networks with Expansive and /or Dispersive
`Logical Clusters for Message Routing,” S. A. Arora, T. F. Knight, J r., F. T. Leighton,
`B. M. Maggs, and E. Upfal, May 28, 1996.
`
`III. Evidence of External Reputation
`Awards
`
`Daniel L. Slotnick Award for Most Original Paper for “Communication—eflicient paral—
`lel graph algorithms,” C. E. Leiserson and B. M. Maggs, Proceedings of the 1986
`
`International Conference on Parallel Processing, August 1986, IEEE, pp. 8617868.
`
`Distinguished Lecture Series Talks
`
`“Cutting the Electrical Bill for Internet—Scale Systems,”
`AT 82. T Labs Research (7/10)
`
`“Lessons in Engineering Self—Managing Networks,”
`
`Microsoft Research Silicon Valley (11 / 07)
`
`“Experimenting with a Content Delivery Network”
`Boston University (1 1 / 03),
`Johns Hopkins University (11 / 03)
`
`“Global Internet Content Delivery”
`University of Illinois at Chicago (12/02),
`IBM Silicon Valley Laboratory (5/02).
`
`“Some Problems Related to Content Delivery”
`University of Massachusetts, Amherst (10/01).
`
`Keynote Addresses at Conferences and Workshops
`
`“A First Look at a Commercial Hybrid Content Delivery System,”
`
`15th IEEE Global Internet Symposium (3/ 12).
`
`“Cutting the Electric Bill for Internet—Scale Systems,”
`
`Student Workshop, 6th International Conference on emerging Networking EXperi—
`ments and Technologies (CoNEXT) (11/10).
`
`Page 8 of 25
`
`

`

`“Challenges in Engineering the World’s Largest Content Delivery Network,”
`Second IEEE Workshop on Hot Topics in Web Systems and Technologies (10/08).
`
`“Engineering a Large Self—Managed Network,”
`Tag der Informatik, Rheinisch—Westfalische Technische Hochschule Aachen (12/ 07).
`
`“A Scalable Approach to Alleviating Database Bottlenecks”
`
`Third Annual Delis Workshop (1 / 07).
`
`“A Methodology for Estimating Interdomain Web ’I‘raflic”
`Heinz Nixdorf Symposium (1 / 06).
`
`“Lessons in Engineering Self—Managing Networks,”
`
`Microsoft Self—Managing Networks Summit, 2005: Making Networks Self—Aware
`(6/ 05).
`
`“‘A Comparison of Overlay Routing and Multihoming Route Control,”
`
`High Performance Switching and Routing Workshop, (04/04),
`
`“Designing Overlay Multicast Networks for Streaming”,
`
`Tenth International Colloquium on Structural Information and Communication Com—
`
`plexity (SIROCCO 2003) (6/03).
`
`“Some Problems Related to Content Delivery”
`ACM/IEEE International Symposium on Cluster Computing and the Grid (CC—
`Grid2001) (5/01),
`Third NYC Metro Area Distributed Systems Meeting (NMADS—3) (04/01),
`International Symposium on Parallel Architectures, Algorithms, and Networks (I—
`SPAN ’00) (12/00),
`Ninth IEEE International Symposium on High Performance Distributed Computing
`(HPDC) (8/00).
`
`“Global Internet Content Delivery”
`
`21st Annual ACM Symposium on Principles of Distributed Computing (PODC ’02)
`(7/02),
`INFORMATIK ’99, International Workshop on Communication and Data Manage—
`ment in Large Networks, Heinz Nixdorf Institute, University of Paderborn, Pader—
`
`born, Germany (10/99).
`
`“Multibutterflies: The Most Powerful Multistage Interconnection Networks Known”
`Computing: the Australasian Theory Symposium, Sydney, Australia (2 / 97).
`
`“Improved Routing and Sorting on Multibutterflies”
`
`Midwest Theory Day, Chicago, IL (12 /96).
`
`“A Critical Look at Three of Parallel Computing’s Maxims”
`
`1996 International Symposium on Parallel Architectures, Algorithms, and Networks
`
`(I—SPAN ’96), Beijing, China (6/96).
`
`“What Makes a Good Routing Network?”
`
`International Workshop on Interconnection Networks, Centre International de Ren—
`
`contres Mathematiques, Luminy, France (7/95).
`
`One-Hour Plenary Session Invited Lectures at Conferences and Workshops
`
`“Designing Overlay Multicast Networks for Commercial Streaming”
`
`Workshop on Network Management and Design, Institute for Mathematics and its
`
`Applications (IMA), University of Minnesota (5/03).
`
`Page 9 of 25
`
`

`

`“Challenges in Building a Reliable System of Tens of Thousands of Servers”
`
`Dependability in Real Life, Second High Dependability Computing Consortium
`
`Workshop (5/01).
`
`“Variations on Nested Dissection”
`
`Symposium on High Performance Computing and Networks, Fordham University
`
`(3/99).
`
`“Protocols for Asymmetric Communication Channels”
`Symposium on Parallel and Distributed Computing and Networks, National Univer—
`
`sity of Singapore (7/ 98).
`
`“Multibutterflies: The Most Powerful Multistage Interconnection Networks Known”
`
`Workshop on Complexity Issues in Distributed and Parallel Computation, Fields
`
`Institute, Toronto, Canada (6 / 98).
`
`“Work—Preserving Network Emulations”
`2nd Workshop on Parallel Algorithms (WOPA), New Orleans, LA (5/91).
`
`Invited Lectures in Academia and Industry
`
`“A First Look at a Commercial Hybrid Content Delivery System,”
`Microsoft Research, Redmond, WA(10/ 11), University of Illinois (7/ 11), Technische
`Universitat Berlin / Deutsche Telekom Laboratories, Berlin, Germany (6/ 11), Inter—
`net Multi—Resolution Analysis Reunion Conference, Lake Arrowhead, CA (6/ 11).
`
`“Cutting the Electric Bill for Internet—Scale Systems,”
`Technische Universitat Berlin / Deutsche Telekom Laboratories, Berlin, Germany
`(12/10), LIP6 (Laboratoire d’Informatique de Paris 6), Paris, France (9/09), Max
`Planck Institute for Software Systems, Saarbriicken, Germany (9 / 09).
`
`“A Content Delivery Network’s Experiences with Denial of Service Attacks,” Interna—
`tional Conference on Cyber Security, New York, NY (8/ 10).
`
`“Measurements and their Application in a Content Delivery Network,” Internet Multi—
`
`Resolution Analysis Culminating Retreat, Lake Arrowhead, CA (12/08).
`
`“Engineering a Large Self—Managed Network,”
`University of California at Irvine (1/08).
`
`“Work—Preserving Network Emulations”
`
`Arny Fest: A Celebration of Arnold Rosenberg’s Distinguished Career, University
`of Massachusetts at Amherst (10/07).
`
`“R—BGP: Staying Connected in a Connected World”,
`
`KAIST Networking Seminar Series (KNSS 2007), Daejeon, Republic of Korea (9 / 07),
`Duke University, (3/09) .
`
`“A Scalable Approach to Alleviating Database Bottlenecks”
`
`Duke University (10 /06), LIP6 (Laboratoire d’Informatique de Paris 6), Paris, France
`(1 / 07).
`
`“A Methodology for Estimating Interdomain Web Traflic”
`Massachusetts Institute of Technology (2/05).
`
`“Using Akamai Traces to Drive End System Multicast Simulations”
`Workshop on Building Scalable Simulations of Complex Socio—Technical Systems,
`
`5th Symposium of the Los Alamos Computer Science Institute (LACSI) (11/04).
`
`Page 10 0f 25
`
`

`

`“Designing Overlay Multicast Networks for Streaming”
`
`Arizona State University (4/ 04), University of California at Berkeley (4/ 04), North—
`eastern University (11/03), Technical University of Munich (9 /03).
`
`“How Akamai Uses Consistent Hashing”
`
`Special Session on Probabilistic Methods in Combinatorics and the Internet, 108th
`Annual Meeting of the American Mathematical Society (AMS), (1 / 02).
`
`“Content Delivery on September 11”
`
`The Internet Under Crisis Conditions: Learning from the Impact of September 11,
`
`a Computer Science and Telecommunications Board Workshop, National Research
`
`Council (3/02).
`
`“Some Problems Related to Content Delivery”
`Northeastern University (4/ 01), The College of William and Mary (4/01), University
`of California, San Diego (1 / 01), University of Southern California (9/ 00), University
`of Arizona (9 /00), Arizona State University (9/ 00), University of California, Santa
`Barbara (5/00).
`
`“Global Internet Content Delivery”
`Stanford University (5/02), Lucent Bell Laboratories (11/99), University of Michigan
`(1 1 / 99) ,
`
`“Using Internet Measurements to Direct Clients to Servers”
`
`OPENSIG ’99 Workshop, Open Signalling for ATM, Internet and Mobile Networks,
`
`Pittsburgh, PA (10/ 99).
`
`“Variations on Nested Dissection”
`
`National Cheng Kung University, Tainan, Tawain (7/99), Heinz Nixdorf Institute,
`University of Paderborn, Paderborn, Germany (12 / 98), Massachusetts Institute of
`Technology (9/98),
`
`“Protocols for Asymmetric Communication Channels”
`Universidade Federal do Rio de Janeiro (3/00), Dagstuhl—Seminar on Parallel and
`Distributed Algorithms (7/ 99), Massachusetts Institute of Technology (10 /98), North—
`eastern University (10 / 98), Cornell University (2/98).
`
`“Multibutterflies: The Most Powerful Multistage Interconnection Networks Known”
`
`Special Session on Interconnection Networks, International Symposium on Paral—
`
`lel Architectures, Algorithms, and Networks (I—SPAN ’00), (12/00), Department of
`Computer and Information Engineering, National Sun Yat—Sen University, Kaohsi—
`
`ung, Taiwan (7/ 98), Kent Ridge Digital Laboratories, National University of Sin—
`gapore (7/98), AT&T Labs Research (2/98), Academia Sinica, Nankang, Taiwan
`(12/97), National Chiao Tung University, Hsinchu, Taiwan (12/97), University of
`Texas at Austin (8/97), Massachusetts Institute of Technology (5/97), India Insti—
`tute of Technology, Bombay, India (1 / 97).
`
`“A Critical Look at Three of Parallel Computing’s Maxims”
`University of Illinois at Chicago (12 / 96), Beijing University of Aeronautics and As—
`tronautics (6/96), IBM Tokyo Research Laboratory (6/96).
`
`“What Makes a Good Routing Network?”
`New York Academy of Sciences (1 /96), Massachusetts Institute of Technology (1 1 / 95).
`
`“Reconfiguring Parallel Computers with Faulty Components,”
`
`University of Waterloo, Waterloo, Canada (3/95), University of Aizu, Aizu—Wakamatsu,
`Japan (12/ 94), National Tsing Hua University, Hsinchu, Taiwan (12/ 94), Academia
`
`Page 11 0f 25
`
`

`

`Sinica, Nankang, Taiwan (12/94), The Johns Hopkins University (12/94), New Jer—
`sey Institute of Technology (4/94), University of Texas at Austin (12/93), Uni—
`versity of Central Florida (10/93), Dagstuhl—Seminar on Parallel and Distributed
`Algorithms (9 / 93), Universitat des Saarlandes, Saarbriicken, Germany (9 / 93), DI—
`MACS Workshop on Parallel Algorithms for Unstructured and Dynamic Problems
`(6/93), Princeton University (4/93), Massachusetts Institute of Technology (4/93),
`University of Pennsylvania (2 / 93).
`
`“Simple Algorithms for Routing on Butterfly Networks with Bounded Queues,”
`University of Maryland (4/ 92).
`
`“A Comparison of Sorting Algorithms for the Connection Machine CM—2,”
`
`University of Massachusetts (3/93), New York University (11/92), University of
`Illinois (4/ 92), University of British Columbia (2/92).
`
`“Asymptotically Optimal Schedules for Packet Routing,”
`SIAM Annual Meeting, Chicago, IL (7/90).
`
`“Fault—Tolerant Routing Algorithms for Multibutterfly Networks,”
`
`NEC C & C Research Laboratories, Yokohama, Japan (8/91), ACM Symposium
`on Gigabit Networks, Washington, DC (7/ 91), SIAM Int. Conf. on Industrial and
`Applied Math., Washington, DC (7/91), University of Maryland (2/91), Univer—
`sity of Illinois (1/91), Washington University, St. Louis (1 / 91), Harvard University
`(4/ 90), Cornell University (4/ 90), AT 82. T Bell Laboratories (3/ 90), Duke University
`(2/ 90), IBM Thomas J. Watson Research Cen