Northeastern University

College of Computer and
Information Science

242 WVH, 360 Huntington Ave

Boston, MA 02115

Email: koods@ccs.neu.edu

**Ph.D., Electrical
Engineering and Computer Science August 1996**

Thesis: Interactive proof systems and approximation algorithms for optical networks

Advisor: Professor Michael Sipser, Department of Mathematics, MIT

**Massachusetts Institute of
Technology Cambridge, MA**

**M.S., Electrical Engineering
and Computer Science August 1993**

Thesis:
Spanning trees short or small

Advisor:
Professor Michael Sipser, Department of Mathematics,
MIT

**B.Tech****.,**** Computer
Science and Engineering July 1991**

President’s
Gold Medallist – top-graduating student across all majors
at IIT Madras

**Northeastern University,
College of Computer and Information Science Boston, MA**

**Professor
May 2014 - current**

·
Algorithmic game
theory

·
Network science

**Massachusetts Institute of
Technology & Akamai
Technologies, Inc Cambridge, MA**

·
Working on research problems in performance (measurement and
improvement), algorithms for (ad-hoc and other communication) networks, and
mobile and distributed systems.

**Akamai Technologies Cambridge, MA**

**Product Manager July 2001 **–** September 2002**

·
Managed three product lines that collectively generated over $20 million
annual revenue – Akamai Infrastructure Management and Analysis (user
interface), Edgescape (IP intelligence) and Akamai
Secure Content Delivery (SSL)

·
Created multi-quarter roadmap for Engineering based on customer
requirements and competitive demands and generated technical white papers and
service descriptions for Sales

·
Wrote grant proposals to defense agencies in the areas of security and
cyber-surveillance

·
Managed a group that grew from 5 to 35 – 23 developers and 12
scientists(PhD) over 2 years

·
Led teams to deliver four new products from concept and design through
to launch. As chief architect was responsible for all technical aspects of the
products end-to-end – algorithmic foundations and system constraints to quality
assurance and operationalization. Wrote code.

·
Mapper – Akamai’s core and proprietary technology for directing
browsers to the appropriate Akamai servers

·
FirstPoint – Global traffic management service in use by sites
such as Yahoo!, Microsoft and Verizon; directs traffic to and load-balances
between content providers’ own web site mirrors

·
Edgescape – IP intelligence product in use by content
providers such as Yahoo!, Microsoft and Nike; given an IP address returns a set
of attributes ranging from geographic location to speed of connectivity, device
type to number of users

·
Enhanced DNS – Secure and fault-tolerant DNS infrastructure product
implementing BGP based anycast that is closely
integrated with Akamai’s content delivery service; used by sites such as
Yahoo!, Victoria’s Secret and BestBuy

·
Built a reliable, scalable high-performance network for http, https and
streaming media (all three formats – Windows Media, Real and Apple’s QuickTime)
content

·
Played a key role in the build out of one of the larger distributed
systems in the world – over 13,000 servers in 1500 networks in over 65
countries

·
Designed and implemented the proprietary algorithms for mapping – Akamai’s core system

·
Managed a team that grew to 5 – 3 developers and 2 scientists (PhD)

**Software Developer November 1998 – December 1998**

·
Implemented thread-based Java middleware for generating summary
exposure reports

·
Developed and traded a wide range of proprietary fixed income
strategies – from
cross currency volatility and futures squeezes to statistical “arbitrage” and
EMU convergence

**Center for Nonlinear
Sciences Los Alamos, NM**

·
Implemented HJM-based two-factor model for pricing interest-rate
derivatives

**Bankers Trust, Inc New
York, NY**

·
Developed automated system to estimate year-end turn effect from
futures prices

·
Invited speaker COMSNETS (2016)

·
Best Student Paper Award ASONAM (2014)

·
Best Paper Award International Conference on Distributed Computing
Systems, IEEE ICDCS (2006)

·
Most Valued Employee award, Akamai Technologies, Inc,
(2000)

·
President’s Gold Medal for 1^{st} rank, IIT Madras (1991)

·
8^{th} All-India in the highly competitive IIT Joint Entrance
Exam (1987)

·
1^{st} in the Indian National Mathematical Olympiad (1986)

·
Top 20 all-India in the National Scholarship Examination in Physics
(1986)

**Instructor Spring 2015**

Course: Algorithms (CS5800)

Attendance:
90 MS students

**Instructor Spring 2015**

Course: Discrete Structures (CS1800)

Attendance:
100 freshman students

**Instructor Spring 2014**

Course: Topics in Networks (CSG7780)

Attendance:
3 MS and 11 PhD students

**Instructor Spring 2014**

Course: Logic and Computation (CS2800)

Attendance:
148 freshman students

**Instructor Fall 2013**

Course: Logic and Computation (CS2800)

Attendance:
75 freshman students

**Instructor Spring 2013**

Course: Algorithms (CS5800)

Attendance:
75 MS students

**Instructor Fall 2012**

Course: Discrete Structures (CS1800)

Attendance:
95 freshman students

**Instructor Fall 2011**

Course: Advanced Algorithms (CS7800)

Attendance:
7 MS and 12 PhD students

**Instructor Fall 2011**

Course: Discrete Structures (CS1800)

Attendance:
86 freshman students

**Instructor Spring 2011**

Course: Logic and Computation(CS2800)

Attendance:
41 freshman students

**Instructor Spring 2011**

Course: Network Security (CS4740/6740)

Attendance:
8 undergraduates and 44 MS students

**Instructor Fall 2010**

Course: Fundamentals of Networks (CS4700/5700)

Attendance:
5 undergraduates and 35 MS students

**Instructor Fall 2008**

Course: Wireless Networks (CSG250)

Attendance:
49 MS students

**Instructor Fall 2008**

Course: Undergraduate Algorithms (CSU690)

Attendance:
24 undergraduate seniors

**Instructor Summer 2008**

Course: Network Security (CSG254)

Attendance:
12 undergraduate seniors and 30 MS and PhD students

**Instructor Spring 2008**

Course: Network Algorithms (CSG359)

Attendance:
5 MS and 8 PhD students

**Instructor Fall 2007**

Course: Network Algorithms (CSG399)

Attendance:
4 MS and 8 PhD students

**Instructor Fall 2007**

Course: Network Security (CSG254/CSU645)

Attendance: 27 undergraduate
seniors, 8 MS and 2 PhD students

**Instructor Spring 2007**

Course: Network Security (CSU645)

Attendance:
29 undergraduate seniors

Materials:
http://www.ccs.neu.edu/course/csu645

**Instructor Fall 2006**

Course: Fundamentals of Computer Networks (CSG150)

Attendance:
35 MS and 6 PhD students

Materials:
http://www.ccs.neu.edu/course/csg150

**Instructor Fall 2005**

Course: Network Security (CSU645)

Attendance:
21 undergraduate seniors

Materials:
http://www.ccs.neu.edu/course/csu645

**Instructor Fall 2005**

Course: Advanced Algorithms (CSG713)

Attendance:
10, graduate

Materials:
http://www.ccs.neu.edu/course/csg713

**Instructor Spring 2005**

Course: Network Security (CSU645)

Attendance:
20, undergraduate seniors

Materials:
http://www.ccs.neu.edu/course/csu645

**Instructor Fall 2004**

Course: Fundamentals of Computer Networks (CSG150)

Attendance:
15 MS and 3 PhD students

Materials:
http://www.ccs.neu.edu/course/csg150

**Instructor Spring 2004**

Course: Computer and Network Security (CSU650)

Attendance:
17 undergraduate seniors

Materials:
http://www.ccs.neu.edu/course/csu650

**Instructor Fall 2003**

Course: Special Topics: Security (CSU650)

Attendance:
42 undergraduate seniors

Materials:
http://www.ccs.neu.edu/course/csu650
Developed new undergraduate course.

**Instructor Summer 2003**

Course: Computer and Network Security

Attendance:
22 MS and PhD students

Materials:
Developed new graduate course.

**Instructor Spring 2002**

Course:
Topics in Theoretical Computer Science – Internet Research Problems (18.996)

Attendance:
30 graduate and undergraduate

Materials:
http://ocw.mit.edu/18/18.996/s02/index.html
courtesy MIT’s OpenCourseWare

**Instructor Fall 2001**

Course:
Internet Algorithms

Attendance:
10 – 20 Akamai employees, developers and scientists

Materials:
hosted on Akamai-internal website, also webcast live using Akamai technologies

**Teaching Assistant 1994, 1995**

Course:
Mathematics for Computer Science (6.042)

Attendance:
90, undergraduate

Instructors:
Professors Tom Leighton and Charles Leiserson

Materials:
Developed content – lecture materials and problem sets – for brand new course

1. Jiangzhuo Chen, “Confluent Flows,”
(co-advisor) graduated September 2005.

2. Xin Liu, “Cross-layer Design
for Cooperative and Adversarial Wireless Networks,” (thesis advisor) completed Fall 2007.

3. Fangfei Zhou “New Cloud
Architectures for the Next Generation Internet” (thesis advisor) completed Spring 2012.

4. Abhishek Samanta
(expected to graduate in 2014)

5. Saber Shokatfadaee
(in progress)

6. Bochao Shen (in progress)

7. Matthew Dippel
(in progress)

1. Daria Antonova,
“Managing a Portfolio of Overlay Paths,” graduated April 2005.

2. Gilberto Molina, “Prestar: A website for borrowing and lending,” graduated
April 2006.

3. Manish Goel,
“Scheduler vulnerabilities and attacks in cloud computing,” graduated December
2009. See paper in NCA’11.

4. Victoria Bennett,
“Automobile Security: From hand-cranks to zero-knowledge,” graduated April
2013.

1. David Baldwin, “On some matching
problems,” graduated August 2006.

2. Nathan Faber, “On Locating
Parked Vehicles,” April 2006. See article
in Boston Globe on this work. Also,
“MOVARTO: Server Migration across Networks using Route Triangulation and DNS,”
April 2007.

3. Keith Bertolino,
“Jamming Steganography using Steganography,” graduated April 2008. See article
in IEEE Spectrum.

1. $400,000 NSF AitF grant with co-PI Rajmohan Rajaraman, 2015-2019.

2. $12,000 NSF ICES workshop
grant with co-PI Rajmohan Rajaraman,
2015-2016.

3. $50,000 Provost’s Office
Tier 1 grant with co-PI Mansoor Amiji,
2014-2015.

4. $30,000 Northeastern-RBC grant
extension with co-PIs Jay Aslam and Nikos Passas, 2013.

5. $400,000 ONR grant with
co-PI Rajmohan Rajaraman,
2012-2017.

6. $275,000 NSF ICES grant with
co-PI Rajmohan Rajaraman,
2012-2015.

7. $60,000 Microsoft grant,
2011-2012.

8. $650,000 DARPA subcontract
from BAE, joint with co-PIs Agnes Chan, Guevara Noubir
and Rajmohan Rajaraman,
2011-2013

9. $180,000 IARPA subcontract
from Argon/Boeing, 2011-2012

10. $180,000 Northeastern-RBC
grant, joint with co-PIs Jay Aslam and Nikos Passas, 2012.

11. $60,000 Microsoft grant,
2010-2011.

12. $100,000 SBIR subcontract
from Mayflower, 2009-2010.

13. $200,000 NSF TF, joint with
co-PI Rajmohan Rajaraman,
2006-2009.

14. $199,000 NSF MRI, joint with
co-PIs Gene Cooperman, Javed Aslam, Jennifer Dy and David Kaeli, 2006-2008.

15. $15,000 Air Force subcontract
through BBN, single PI, 2006.

16. $50,000 Microsoft grant,“Trustworthy Computing,”
joint with co-PI Guevara Noubir, 2006-2007.

17. $380,000 DARPA grant,
“SPREAD,” joint with co-PIs Agnes Chan, Guevara Noubir
and Rajmohan Rajaraman,
2005-2007.

18. $114,000 DARPA grant
“Internet Simulation,” single PI, 2004-2006.

19. $25,000 Madhav
Anand gift, “Summer Internship Program,” single PI,
2005-2006.

1. “Secure and scalable match:
overcoming the universal circuit bottleneck using group programs,” with R.
Krishnan, *PETS* *(Privacy Enhancing Technologies Symposium)*, Issue 2, 2015.

2. “Samaritan cloud: Secure
infrastructure for scalable location-based services,” with A. Samanta and F. Zhou.
*Computer Communications*, 56,
pp. 1-13, 2015.

3. “Bounded budget connection
(BBC) games or how to make friends and influence people on a budget,” with N. Laoutaris, L. Poplawski, R. Rajaraman and S. Teng. *Journal of Computer and System Sciences*,
80(7), pp. 1266-1284, 2014.

4. ``Scheduler vulnerabilities
and coordinated attacks in cloud computing'' with Fangfei
Zhou, Manish Goel and Peter Desnoyers.
*Journal of Computer Security*, 21(4),
pp. 533-559, 2013

5. “Reducibility among
fractional stability problems,'' with S. Kintali, L. Poplawski, R. Rajaraman and S. Teng. *SIAM Journal on
Computing*, 42(6), pp. 2063-2113, 2013.

6. “Network effects of risk
behavior change following prophylactic intervention''

with R. Rajaraman,
Z. Sun and A. Vullikanti. *PLOS
ONE*.

7. “Delay tolerant bulk data
transfers on the Internet,” with N. Laoutaris, P.
Rodrigues and G. Smaragdakis. *ACM Transactions on Networking*, 21(6), pp. 1852-1865, 2013.

8. “(Almost) Tight bounds and
existence theorems for confluent flows,” with J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman and A. Vetta. *Journal of the
ACM*, 54(4), 2007.

9. “Meet and merge:
Approximation algorithms for confluent flows,” with J. Chen and R. Rajaraman. *Journal of
Computer and System Sciences*, 72(3), pp. 468-489, 2006.

10. “Alternation in
interaction,” with M. Kiwi, C. Lund, A. Russell and D. Spielman.
*Computational Complexity*, 9(3-4), pp.
202-246, 2000.

11. “Approximating Latin square
extensions,” with A. Russell and S. R. Kumar. *Algorithmica*, 24(2), pp. 128-138,
1999.

12. “Improving minimum cost
spanning trees by upgrading nodes,” with S. O. Krumke,
M.V. Marathe, H. Noltemeier,
R. Ravi, S.S. Ravi and H-C. Wirth. *Journal
of Algorithms*, 33(1), pp. 92-111, 1999.

13. “Improving spanning trees by
upgrading nodes,” with S. O. Krumke, H. Noltemeier, H-C. Wirth, M.V. Marathe,
R. Ravi and S.S. Ravi. *Theoretical
Computer Science*, 221(1-2), pp. 139-155, 1999.

14. “A note on the asymptotics
and computational complexity of graph distinguishability,” with A. Russell. *Electronic Journal of Combinatorics*,
5(1), R23, 1998 (http://www.combinatorics.org/Volume_5/v5i1toc.html).

15. “Symmetric alternation captures BPP,” with A.
Russell. *Computational Complexity*,
7(2), pp. 152-162, 1998.

16. “Bicriteria
network design problems,” with M.V. Marathe, R. Ravi,
S.S. Ravi, D. Rosenkrantz and H. Hunt. *Journal of Algorithms*, 28(1), pp.
142-171, 1998.

17. “A note on embedding
complete graphs into hypercubes,” with M. Klugerman and A. Russell. *Discrete Mathematics*, 186, pp. 1-3, 1998.

18. “A note on optical routing,”
with R. Panigrahy, A. Russell and S. R, Kumar. *Information Processing Letters*, 62, pp.
295-300, 1997.

19. “Service-constrained network
design problems,” with M. V. Marathe and R. Ravi. *Nordic Journal of Computing*, 3(4), pp.
367-387, 1996.

20. “Spanning trees short or
small,” with R. Ravi, M.V. Marathe, D. Rosenkrantz and S.S. Ravi. *SIAM Journal of Discrete Mathematics*, 9(2), pp. 178-200, 1996.

21. “The relationship between
probabilistically checkable debate systems, IP and PSPACE,” with A. Russell. *Information Processing Letters*, 53(2),
pp. 61-68, 1995.

22. “Treewidth
of circular-arc graphs,” with K.S. Singh and C.P. Rangan.
*SIAM Journal of Discrete Mathematics*,
7(4), pp. 647-655, 1994.

23. “Efficient parallel shuffle recognition,” with
M. Nivat, C.P. Rangan and
A. Saoudi. *Parallel
Processing Letters*, 4(4), pp. 455-463, 1994.

24. “Optimal path cover problem
on block graphs and bipartite permutation graphs,” with R. Srikant,
K.S. Singh and C.P. Rangan. *Theoretical Computer Science*, 115(2), pp. 351-357, 1993.

1. “Markovian hitters and the
complexity of blind rendezvous,” with S. Chen, M. Dippel,
A. Russell and A. Samanta. SODA 2016.

2. “A study of the structure
and vulnerabilities of metropolitan area networks,” with J. Chen, M. Marathe, M. Thakur, S. Thulasidasan
and A. Vullikanti. COMSNETS 2016.

3. “Rumors over radio, wireless
and telephone,” with J. Iglesias, R. Rajaraman and R.
Ravi. FST-TCS 2015.

4. “Secure and scalable match: overcoming the
universal circuit bottleneck using group programs,” with R. Krishnan, *PETS* *(Privacy
Enhancing Technologies Symposium)*, 2015.

5. “Multiplex networks: a
generative model and algorithmic complexity,” with M. Dippel
and P. Basu. ASONAM 2015.

6. “An upper bound on trilaterating simple polygons,” with M. Dippel.
CCCG 2015.

7. “Designing overlapping
networks for publish-subscribe systems,” with J. Iglesias, R. Rajaraman and R. Ravi. APPROX-RANDOM 2015.

8. “SmartShift:
Expanded load shifting incentive mechanism for risk-averse consumers,” with B.
Shen and B. Narayanaswamy. AAAI 2015.

9. “Deterministic blind
rendezvous in cognitive radio networks,” with S. Chen, A. Russell and A. Samanta. ICDCS 2014.

10. “The network you keep:
analyzing persons of interest using Cliqster”, with
S. Fadaee, M. Farajtabar,
J. Aslam and N. Passas. ASONAM 2014. (Best Student Paper Award)

11. “Evaluating encrypted
Boolean function on encrypted bits: Secure decision-making on the black side,”
with R. Krishnan. SPIE DSS 2013.

12. “Samaritan cloud: Secure and
scalable infrastructure for enabling location-based services,” with A. Samanta and F. Zhou.
IFIP Networking 2013.

13. ``Maygh:
Building a CDN from client web browsers,'' with L. Zhang, F. Zhou and A. Mislove. EuroSys 2013.

14. ``Prediction of arrival of
nodes in a scale free network'' with V. Mahantesh, S.
Iyengar, M. Vijesh, S. Nayak and N. Shenoy. ASONAM 2012

15. ``Cache me if you can:
Capacitated Selfish Replication Games ,'' with Ragavendran Gopalakrishnan, Dimitrios Kanoulakis, Naga Naresh
Karuturi, Rajmohan Rajaraman and C. Pandu Rangan.
LATIN 2012.

16. ``Wed-Cloud: recruiting web
users for content distribution,'' with F. Zhou, Eric Franco, L.Zhang, R. Revis and A. Mislove. NCA 2012.

17. ``Network effects of risk
behavior change following prophylactic intervention'' with V. S. Anil Kumar, Rajmohan Rajaraman and Zhifeng Sun. International Conference on ``Networks in
Biology, Social Science and Engineering,'' 2012.

18. ``Scheduler vulnerabilities
and coordinated attacks in cloud computing'' with Fangfei
Zhou, Manish Goel and Peter Desnoyers.
NCA 2011.

19. ``PhoneGuard:
A smartphone in the coalmine'' with Nicolas Mayor, Abhishek Samanta
and Fred Wagen. ACM ACWR 2011.

20. ``Optimization of
Directional Antenna Network Topology in Airborne Networks,'' with Gregory Hadynski, Seoungbum Lee, Gowri Rajappan, Xiaofei Wang and Fangfei Zhou.
MILCOM 2010.

21. ``Policy-Agile Encrypted
Networks Via Secure Function Computation,'' with
Rajesh Krishnan. MILCOM 2010.

22. ``HARD-DNS: Highly-Available
Redundantly-Distributed DNS,'' with Carlos Gutierrez, Rajesh Krishnan and Fangfei Zhou. MILCOM 2010.

23. “Existence theorems and
approximation algorithms for generalized network games,” with V. Anil Kumar, R.
Rajaraman and Z. Sun. To appear in Proceedings of IEEE
ICDCS, 2010

24. “Algorithms for constrained
bulk-transfer of delay-tolerant data,” with P. Chhabra, V. Erramilli,
N. Laoutaris and P. Rodriguez. To appear in
Proceedings of IEEE ICC, 2010.

25. “Reducibility among
fractional stability problems,” with S. Kintali, L. Poplawski, R. Rajaraman and S. Teng. Proceedings of IEEE FOCS, pp. 283-292, 2009.

26. “Delay tolerant bulk data
transfers on the Internet,” with N. Laoutaris, G. Smaragdakis and P. Rodriguez. Proceedings of ACM
SIGMETRICS, pp. 229-238, 2009.

27. “Preprocessing DNS log data
for effective data mining,” with M. Snyder and M. Thakur. Proceedings of ICC,
pp. 1-5, 2009.

28. “Jamming steganography using
steganography,” with K. Bertolino. Proceedings of IEEE
International Conference on Technologies for Homeland Security, 2008.

29. “Bounded budget connection
(BBC) games or how to make friends and influence people on a budget,” with N. Laoutaris, L. Poplawski, R. Rajaraman and S. Teng.
Proceedings of ACM PODC, pp. 165-174, 2008.

30. “A Game-Theoretic Framework
for Bandwidth Attacks and Statistical Defenses,” with M. Snyder and M. Thakur.
To appear in Proceedings of IEEE LCN (Local Computer Networks) Conference,
2007.

31. “SPREAD: Foiling Jammers
using Multi-layer Agility,” with X. Liu, G. Noubir
and S. Tan. IEEE INFOCOM Minisymposium, 2007.

32. “MOVARTO: Server Migration
across Networks using Route Triangulation and DNS,” with N. Faber. VMWorld, San Francisco, 2007.

33. “On completing Latin
Squares,” with I. Hajirasouliha, H. Jowhari and Ravi Kumar. Proceedings of STACS, LNCS 4393,
pp. 524-535, 2007.

34. “Scaling laws for the
Internet over Urban Regions,” with V. S. Anil Kumar, M. V. Marathe,
M. Thakur and S. Thulasidasan, CAIDA’s ISMA WIT,
(Short Paper) 2006.

35. “Group-independent Spanning
Tree for Data Aggregation in Dense Sensor Networks,” with L. Jia, G. Noubir and R. Rajaraman. Proceedings of IEEE DCOSS, LNCS 4026, pp.
282-304, 2006.

36. “Steganographic
Communication in Ordered Channels,” with Ch. Ravi Chandra, A. Kumarasubramaniam, R. Manokaran,
G. Noubir and C. Pandu Rangan.
Proceedings of Information Hiding IH 2006.

37. “The Confluent Capacity of
the Internet: Congestion vs. Dilation,” with J. Chen, M. V. Marathe
and R. Rajaraman. Proceedings of IEEE ICDCS 2006. (Best Paper Award)

38. “Towards a Topology
Generator Modeling AS Relationships,” with X. Dimitropoulos,
G. Riley and D. Krioukov. Proceedings of IEEE ICNP
(Short Paper) 2005.

39. “Unweaving a web of
documents,” with R. Guha, Ravi Kumar and D. Sivakumar. Proceedings of KDD, pp. 574-579, (Short Paper)
2005.

40. “Expressiveness and
complexity of crosscut languages,” with K. Lieberherr
and J. Palm. Proceedings of FOAL 2005.

41. “Universal approximations
for TSP, Steiner tree and set cover,” with L. Jia, G.
Lin, G. Noubir and R. Rajaraman.
Proceedings of STOC, pp. 386-395, 2005.

42. “Minimum energy accumulative
routing in wireless networks,” with J. Chen, L. Jia,
X. Liu and G. Noubir . Proceedings of INFOCOM, vol. 3, pp. 1875-1886, 2005.

43. “A methodology for
estimating inter-domain web traffic demand,” with A. Feldmann,
O. Maennel, N. Kammenhuber,
B. Maggs and R. de Prisco.
Proceedings of *Internet**
Measurement Conference (IMC)*, pp. 322-335, 2004.

44. “Managing a portfolio of
overlay paths,” with D. Antonova, A. Krishnamurthy
and Z. Ma. Proceedings of *Networking and Operating Systems Support for
Digital Audio and Video* (*NOSSDAV)*, pp. 30-35, 2004.

45. “Batching Schnorr identification scheme with applications to
privacy-preserving authorization and low-bandwidth communication devices,” with
R. Gennaro, D. Leigh and W. Yerazunis.
Proceedings of *AsiaCrypt*, LNCS 3329, pp.
276-292, 2004.

46. “(Almost) Tight bounds and existence theorems
for confluent flows,” with J. Chen, R. Kleinberg, L. Lovasz,
R. Rajaraman and A. Vetta.
Proceedings of *Symposium on Theory of
Computing (STOC)*, pp. 529-538, 2004.

47. “Meet and merge:
approximation algorithms for confluent flows,” with J. Chen and R. Rajaraman. *Symposium
on Theory of Computing (STOC)*, pp. 373-382, 2003.

48. “Improving spanning trees by
upgrading nodes,” with S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi,
S.S. Ravi and H-C. Wirth. *International
Colloquium on Automata, Languages and Programming (ICALP)*, LNCS 1256, pp.
281-291, 1997.

49. “Faster algorithms for
optical switch configurations,” with A. Russell and S.R. Kumar. *IEEE International Conference on
Communications (ICC)*, pp. 1320-1324, 1997.

50. “Approximating Latin square
extensions,” with A. Russell and S. R. Kumar. *International Conference on Computation and Combinatorics (COCOON)*,
LNCS 1090, pp. 280-289, 1996.

51. “Service-constrained network
design problems,” with M.V. Marathe and R. Ravi. *Scandinavian Workshop on Algorithm Theory
(SWAT)*, LNCS 1097, pp. 28-40, 1996.

52. “Bicriteria
network design problems,” with M.V. Marathe, R. Ravi,
S.S. Ravi, D. Rosenkrantz, and H. Hunt. *International Colloquium on Automata,
Languages and Programming (ICALP)*, LNCS 944, pp. 487-498, 1995.

53. “Symmetric alternation
captures BPP,” with A. Russell. *Workshop
on Interactive Proof Systems,* Weizmann Institute, Israel, 1995.

54. “Alternation in
interaction,” with M. Kiwi, C. Lund, A. Russell and D. Spielman.
*IEEE Conference on Structure in
Complexity Theory*, pp. 294-303, 1994.

55. “Spanning trees short or
small,” with R. Ravi, M.V. Marathe, D. Rosenkrantz and S.S. Ravi. *ACM-SIAM Symposium on Discrete Algorithms (SODA)*, pp. 546-555,
1994.

56. “Efficient parallel shuffle
recognition,” with M. Nivat, C.P. Rangan,
G.D.S. Ramkumar and A. Saoudi.
*International Parallel Processing
Symposium (IPPS)*, pp. 112-115, 1992.

57. “Treewidth
of circular-arc graphs,” with K.S. Singh and C.P. Rangan.
*Workshop on Algorithms and Data
Structures (WADS)*, LNCS 519, p. 41, 1991.

1. “Improved results on
service-constrained network design problems,” with M.V. Marathe
and R. Ravi. *Network Design: Connectivity
and Facilities Location*, P.M. Pardalos and D.Z.
Du, editors, DIMACS Series, Vol. 40, AMS, pp. 269-276, 1998.

1. “Low
bandwidth zero knowledge authentication protocol and device,” with W. Yerazunis. Patent #: 7,245,718. Granted July 17, 2007.

2. “Methods and systems for
network attack detection and prevention through redirection,” with W. Milliken.
Filed June 2003.

3. “Method
and system for providing on-demand content delivery for an origin server,”
with H. Rahul. Patent #: 7,136,922. Granted November 14, 2006. Continuation
patent #: 7,376,736. Granted May 20, 2008.

4. “Method
and system for protecting websites from public Internet threats,” with M. Afergan, A. Ellis and H. Rahul. Patent #: 7,260,639.
Granted August 21, 2007.

5. “Global
load balancing across mirrored data centers,” with F. T. Leighton, D.
Lewin, R. Dhanidina, R. Kleinberg, M. Levine, B. Maggs, H. Rahul, S. Thirumalai,
J. Parikh and Y. Yerushalmi. Patent #: 7,111,061.
Granted Sep 19, 2006.

6. “Method
for predicting file download time from mirrored data centers in a global
computer network,” with F. T. Leighton, A. Soviani,
M. Levine, A. Parker, S. Hanono-Wachman and A.
Berger. Patent #: 7,096,263. Granted Aug 22, 2006.

7. “Method
for generating a network map,” with F. T. Leighton, M. Levine and A. Soviani. Patent #: 7,251,688. Granted July 31, 2007.

8. “Optimal
route selection in a content delivery network,” with C. Bornstein, T.
Canfield, G. Miller and S. Rao. Patent #: 7,274,658. Granted Sep 25, 2007.

9. “Method and system for
providing content providers with information about how their users access the
Internet.” Filed August 18, 2000.

10. “Network performance
monitoring in a content delivery service.” Filed July 20, 2000.

11. “System and Method for
Virtual Server Migration across Networks using DNS and Route Triangulation,”
with N. Faber. Application #: 12/180,813. Filed July 28, 2008.

12. “Jamming Steganography using
Steganography,” with K. Bertolino. Provisional: INV-0949,
filed May 5, 2009.

13. “Offering Incentives in a
Flat Rate Charging System,” with P. Chhabra, N. Laoutaris
and P. Rodriguez. Application #: 12/832,417. Filed June 8, 2010.

14. “Content distribution
network using a web browser and locally stored content to directly exchange
content between users,” with A. Mislove. Application
# 13/274,705. Filed October 17, 2011.

5 more patent applications
currently in the process of being drafted and filed.

1. “Network effects of risk
behavior change,” Indian Statistical Institute, Chennai, November 2012.

2. “Content Delivery through
the Ages: Akamai to WebCloud,” Indian Institute of
Science, Bangalore, July 2012.

3. “Secure Pub/Sub Schemes,”
Indian Statistical Institute, Kolkata, June 2012.

4. “Content Delivery through
the Ages: Akamai to WebCloud,” Invited talk at
International Conference on Wireless Technologies, Kayamkollam,
India, December 2011.

5. “Search-based complexity
classes,” Boston University, Boston, MA, April 2010.

6. “Stealing Cycles in the
Clouds,” Microsoft Research, Redmond, WA, April 2010.

7. “Game theory and the
Internet,” Telefonica R&D, Barcelona, Spain, March 2008.

8. “Confluent Capacity of the
Internet, University of Massachusetts Boston, Boston, MA, April 2007.

9. “Net and the City,” Virginia
Tech, Blacksburg, VA, January 2006.

10. “Net and the City,” opening
speaker in Dan Rosenkrantz Festschrift, SUNY Albany,
New York, USA, May 2005.

11. “CDNs – Principles and
Practice,” University of Glasgow, Glasgow, Scotland, March 2005.

12. “Net and the City,” NU
Innovation Series, Northeastern University, Boston, MA, February 2005.

13. “Algorithms for CDNs and
Sensor Networks,” HP, Palo Alto, USA, November 2004.

14. “Algorithms for CDNs and
Sensor Networks,” BBN, Cambridge, Massachusetts, USA, October 2004.

15. “Confluent flows,” CSAIL MIT,
Cambridge, Massachusetts, USA, May 2004.

16. “FirstPoint
– Location-aware mapping,” Microsoft Research Redmond, Washington, USA, March
2004.

17. “Content delivery,” RPI
Troy, New York, USA, November 2003.

18. “The mapping problem,” SUNY
Albany, New York, USA, November 2003.

19. “Some problems of content
delivery,” IBM Hawthorne, New York, USA, April 2003.

20. “Content Delivery Networks –
Practice and Theory,” Center for Discrete Mathematics and Theoretical Computer
Science (DIMACS), Rutgers, New Jersey, USA, March 2001.

21. “Statistical models in
finance,” Los Alamos National Laboratory, New Mexico, USA, September 1997.

22. “Approximating Latin square
extensions,” Hong Kong University, Hong Kong, May 1996.

23. “Approximation algorithms
for optical networks,” Bellcore, New Jersey, US, April
1996.

24. “Alternation in
Interaction,” Centrum Wiskoonde Informatik,
Amsterdam, Netherlands, June 1994.

25. “Alternation in
Interaction,” Universite Paris-Sud,
Paris, France, May 1994.

26. “Spanning trees short or
small,” SUNY Albany, New York, USA, October 1993.

- Associate Editor IEEE
Transactions on Mobile Computing.
- College Committees –
served on MS (1 time), PhD (1 time), Colloquium (2 times), Merit (2 times)
and Tenure (1 time) Committees.
- University Committee –
serving member on Patents Committee.
- Conference Program
Committees – served on the following international conference committees –
WCAN’05, AdHoc Now’06, ACNS’06, WCAN’06, NCA’06,
WCAN’07, NCA’07, HiPC’07, SODA’08, INFOCOM’08, INFOCOM’09, COMSNETS’09,
ICC’10, STOC’11, IPDPS’12, SPAA’13, INFOCOM’14, SSS’15.
- Organized NetSci workshop as part of INFOCOM’16 jointly with B. Mitra and N. Ganguly of
IIT-KGP.
- Distinguished Lecture
Series – initiated and manages the series, invited speakers, printed
posters, set up website and managed logistics.
- Set up a Top Secret
secure lab in Hayden 007HA, with Onity locks,
secure walls, filing cabinet safe, the works.Working on securing certification.
- IIT – obtained funding
from Northeastern alumnus to support summer interns from IIT with goal of
attracting them to Northeastern for graduate studies.
- PhD Recruiting – worked
with Agnes Chan to print and distribute posters to NITs and set up website
to attract students from top Indian universities.
- Placement – placed many
PhD, MS and undergraduate students in coops, summer internships and
full-time jobs.