Gordon Wilfong

Murray Hill, NJ, USA
DMTS

Education

  • B.Sc. Mathematics (First Class Honours), Carleton University 1980
  • M.S. Computer Science, Cornell University, 1983
  • Ph.D. Computer Science, Cornell University, 1984

Honors and Awards

2010 ACM SIGCOMM Test of Time Award for "An Analysis of BGP Convergence Properties" with T. Griffin (University of Cambridge)

Selected Articles and Publications

Density decompositions of networks.

Glencora Borradaile, Theresa Migler, and Gordon T. Wilfong.
J. Graph Algorithms Appl., 23(4):625–651, 2019.

Dynamic switch migration in distributed software-defined networks to achieve controller load balance.

Yang Xu, Marco Cello, I-Chih Wang, Anwar Walid, Gordon T. Wilfong, Charles H.-P. Wen, Mario Marchese, and H. Jonathan Chao.
IEEE Journal on Selected Areas in Communications, 37(3):515–529, 2019.

Egalitarian graph orientations.
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, and Lisa Zhang.
J. Graph Algorithms Appl., 21(4):687–708, 2017.


Egalitarian graph orientations.
Adiseshu Hari, Urs Niesen, and Gordon T. Wilfong.

IEEE/ACM Trans. Netw., 25(1):189–198, 2017.
 

Overlaying conditional circuit clauses for secure computation.
W. Sean Kennedy, Vladimir Kolesnikov, and Gordon T. Wilfong.
In ASIACRYPT (2), volume 10625 of Lecture Notes in Computer Science, pages 499–528. Springer, 2017.
 

Balcon: A distributed elastic SDN control via efficient switch migration.
Marco Cello, Yang Xu, Anwar Walid, Gordon T. Wilfong, H. Jonathan Chao, and Mario Marchese.

In IC2E, pages 40–50. IEEE Computer Society, 2017.

 

Improving robustness of next-hop routing.
Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, and Lisa Zhang.
J. Comb. Optim., 31(3):1206–1220, 2016.
 

Overlaying circuit clauses for secure computation.
W. Sean Kennedy, Vladimir Kolesnikov, and Gordon T. Wilfong.
IACR Cryptology ePrint Archive, 2016:685, 2016.
 

Path switching: Reduced-state flow handling in SDN using path information.
Adiseshu Hari, T. V. Lakshman, and Gordon T. Wilfong.
In CoNEXT, pages 36:1–36:7. ACM, 2015.
 

Polylogarithmic approximations for the capacitated single-sink confluent flow problem.
F. Bruce Shepherd, Adrian Vetta, and Gordon T. Wilfong.
In FOCS, pages 748–758. IEEE Computer Society, 2015.
 

Sparsifying network topologies for application guidance.
Michael Scharf, Gordon T. Wilfong, and Lisa Zhang.
In IM, pages 234–242. IEEE, 2015.
 

Analysis of k-anonymity algorithms for streaming location data.
Matthew Andrews, Gordon T. Wilfong, and Lisa Zhang.
In INFOCOM Workshops, pages 1–6. IEEE, 2015.
 

Optimal path encoding for software-defined networks.
Adiseshu Hari, Urs Niesen, and Gordon T. Wilfong.
In ISIT, pages 2361–2365. IEEE, 2015.
 

Routing regardless of network stability.
Bundit Laekhanukit, Adrian Vetta, and Gordon T. Wilfong.
Algorithmica, 70(3):561–593, 2014.
 

PACE: Policy-aware application cloud embedding.
Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, and Chuanxiong Guo.
In INFOCOM, pages 638–646. IEEE, 2013.
 

The inherent difficulty of timely primary-backup replication.
Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, and Gordon T. Wilfong.
Bell Labs Technical Journal, 17(2):15–24, 2012.
 

The knapsack problem with neighbour constraints.
Glencora Borradaile, Brent Heeringa, and Gordon T. Wilfong.
J. Discrete Algorithms, 16:224–235, 2012.
 

IBGP and constrained connectivity.
Michael Dinitz and Gordon T. Wilfong.
In APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, pages 122–133. Springer, 2012.
 

Routing regardless of network stability.
Bundit Laekhanukit, Adrian Vetta, and Gordon T. Wilfong.
In ESA, volume 7501 of Lecture Notes in Computer Science, pages 719–730. Springer, 2012.
 

On the efficiency of the simplest pricing mechanisms in two-sided markets.
Volodymyr Kuleshov and Gordon T. Wilfong.
In WINE, volume 7695 of Lecture Notes in Computer Science, pages 284– 297. Springer, 2012.
 

Strategic network formation through peering and service agreements.
Elliot Anshelevich, F. Bruce Shepherd, and Gordon T. Wilfong.
Games and Economic Behavior, 73(1):17–38, 2011.
 

Energy-efficient design and optimization of wireline access networks.
Sourjya Bhaumik, David Chuck, Girija J. Narlikar, and Gordon T. Wilfong.
In INFOCOM, pages 451–455. IEEE, 2011.
 

The 1-neighbour knapsack problem.
Glencora Borradaile, Brent Heeringa, and Gordon T. Wilfong.
In IWOCA, volume 7056 of Lecture Notes in Computer Science, pages 71–84. Springer, 2011.
 

The inherent difficulty of timely primary-backup replication.
Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, and Gordon T. Wilfong.
In PODC, pages 349–350. ACM, 2011.
 

On the stable paths problem.
Penny E. Haxell and Gordon T. Wilfong.
SIAM J. Discrete Math., 24(3):1137–1152, 2010.
 

Designing multihop wireless backhaul networks with delay guarantees.
Girija J. Narlikar, Gordon T. Wilfong, and Lisa Zhang.
Wireless Networks, 16(1):237–254, 2010
 

A fractional model of the border gateway protocol (BGP).
Penny E. Haxell and Gordon T. Wilfong.
In SODA, pages 193–199. SIAM, 2008.
 

Network formation and routing by strategic agents using local contracts.
Elliot Anshelevich and Gordon T. Wilfong.
In WINE, volume 5385 of Lecture Notes in Computer Science, pages 386–393. Springer, 2008.
 

Economic modeling of global test strategy I: Mathematical models.
Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons, James H. Mosher Jr., and Gordon T. Wilfong.
Bell Labs Technical Journal, 12(1):161–173, 2007.
 

Economic modeling of global test strategy II: software system and examples.
Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons, James H. Mosher Jr., and Gordon T. Wilfong.
Bell Labs Technical Journal, 12(1):175–186, 2007.
 

Degree-constrained network flows.
P. Donovan, F. Bruce Shepherd, Adrian Vetta, and Gordon T. Wilfong.
In STOC, pages 681–688. ACM, 2007.
 

Design tools for transparent optical networks.
Chandra Chekuri, Paul Claisse, Ren ́e-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, and Lisa Zhang.
Bell Labs Technical Journal, 11(2):129–143, 2006.
 

Strategic network formation through peering and service agreements.
Elliot Anshelevich, F. Bruce Shepherd, and Gordon T. Wilfong.
In FOCS, pages 77–86. IEEE Computer Society, 2006.
 

Designing multihop wireless backhaul networks with delay guarantees.
Girija J. Narlikar, Gordon T. Wilfong, and Lisa Zhang.
In INFOCOM. IEEE, 2006.
 

Admission control for multihop wireless backhaul networks with QOS support.
Seungjoon Lee, Girija J. Narlikar, Martin Pal, Gordon T. Wilfong, and Lisa Zhang.
In WCNC, pages 92–97. IEEE, 2006.
 

Strictly nonblocking WDM cross-connects.
April Rasala Lehman and Gordon T. Wilfong.
SIAM J. Comput., 35(2):449–485, 2005.
 

A fast technique for comparing graph representations with applications to performance evaluation.
Daniel P. Lopresti and Gordon T. Wilfong.
IJDAR, 6(4):219–229, 2003.
 

Applications of graph probing to web document analysis.
Daniel Lopresti and Gordon T. Wilfong.
In Web Document Analysis, volume 55 of Series in Machine Perception and Artificial Intelligence, pages 19–38. World Scientific, 2003.
 

Applications of graph probing to web document analysis.
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, and Gordon T. Wilfong.
IJDAR, 4(3):140–153, 2002.
 

The stable paths problem and interdomain routing.
Timothy Griffin, F. Bruce Shepherd, and Gordon T. Wilfong.
IEEE/ACM Trans. Netw., 10(2):232–243, 2002.
 

Wide-sense nonblocking WDM cross-connects.
Penny E. Haxell, April Rasala, Gordon T. Wilfong, and Peter Winkler.
In ESA, volume 2461 of Lecture Notes in Computer Science, pages 538–549. Springer, 2002.
 

Analysis of the MED oscillation problem in BGP.
Timothy Griffin and Gordon T. Wilfong.
In ICNP, pages 90–99. IEEE Computer Society, 2002.
 

On the correctness of IBGP configuration.
Timothy Griffin and Gordon T. Wilfong.
In SIGCOMM, pages 17–29. ACM, 2002.
 

Route oscillations in I-BGP with route reflection.
Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, and Gordon T. Wilfong.
In SIGCOMM, pages 235–247. ACM, 2002.
 

Table structure recognition and its evaluation.
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, and Gordon T. Wilfong.
In Document Recognition and Retrieval, volume 4307 of SPIE Proceedings, pages 44–55. SPIE, 2001.
 

Evaluating document analysis results via graph probing.
Daniel P. Lopresti and Gordon T. Wilfong.
In ICDAR, pages 116–120. IEEE Computer Society, 2001.
 

Why table ground-truthing is hard.
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong, and George Nagy.
In ICDAR, pages 129–133. IEEE Computer Society, 2001.
 

Comparing semi-structured documents via graph probing.
Daniel P. Lopresti and Gordon T. Wilfong.
In Multimedia Information Systems, pages 41–50, 2001.
 

Comparison and classification of documents based on layout similarity.
Jianying Hu, Ramanujan S. Kashi, and Gordon T. Wilfong.
Inf. Retr., 2(2/3):227–243, 2000.
 

Medium-independent table detection.
Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, and Gordon T. Wilfong.
In Document Recognition and Retrieval, volume 3967 of SPIE Proceedings, page 291. SPIE, 2000.
 

A safe path vector protocol.
Timothy Griffin and Gordon T. Wilfong.
In INFOCOM, pages 490–499. IEEE Computer Society, 2000.
 

Strictly non-blocking WDM cross-connects.
April Rasala and Gordon T. Wilfong.
In SODA, pages 606–615. ACM/SIAM, 2000.
 

Strictly non-blocking WDM cross-connects for heterogeneous networks.
April Rasala and Gordon T. Wilfong.
In STOC, pages 514–523. ACM, 2000.
 

Document classification using layout analysis.
Jianying Hu, Ramanujan S. Kashi, and Gordon T. Wilfong.
In DEXA Workshop, pages 556–560. IEEE Computer Society, 1999.
 

Document image layout comparison and classification.
Jianying Hu, Ramanujan S. Kashi, and Gordon T. Wilfong.
In ICDAR, pages 285–288. IEEE Computer Society, 1999.
 

Policy disputes in path-vector protocols.
Timothy Griffin, F. Bruce Shepherd, and Gordon T. Wilfong.
In ICNP, pages 21–30. IEEE Computer Society, 1999.
 

An analysis of BGP convergence properties.
Timothy Griffin and Gordon T. Wilfong.
In SIGCOMM, pages 277–288. ACM, 1999.
 

Cross-domain approximate string matching.
Daniel P. Lopresti and Gordon T. Wilfong.
In SPIRE/CRIWG, pages 120–127. IEEE Computer Society, 1999.
 

Computing constrained minimum-width annuli of point sets.
Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, and Gordon T. Wilfong.
Computer-Aided Design, 30(4):267–275, 1998.
 

Computing the angularity tolerance.
Mark de Berg, Henk Meijer, Mark H. Overmars, and Gordon T. Wilfong.
Int. J. Comput. Geometry Appl., 8(4):467–482, 1998.
 

Ring routing and wavelength translation.
Gordon T. Wilfong and Peter Winkler.
In SODA, pages 333–341. ACM/SIAM, 1998.
 

Feasibility of design in stereolithography.
Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, and Binhai Zhu.
Algorithmica, 19(1/2):61–83, 1997.
 

On-line algorithms for compressing planar curves.
Gordon T. Wilfong.
In SODA, pages 158–165. ACM/SIAM, 1997.
 

Computing constrained minimum-width annuli of point sets.
Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, and Gordon T. Wilfong.
In WADS, volume 1272 of Lecture Notes in Computer Science, pages 392–401. Springer, 1997.
 

On-line recognition of handwritten symbols.
Gordon T. Wilfong, Frank Sinden, and Laurence Ruedisueli.
IEEE Trans. Pattern Anal. Mach. Intell., 18(9):935–940, 1996.
 

Computing the angularity tolerance.
Mark de Berg, Henk Meijer, Mark H. Overmars, and Gordon T. Wilfong.
In CCCG, pages 331–336. Carleton University Press, 1996.
 

Minimum wavelength in an all-optical ring network.
Gordon T. Wilfong.
In ISAAC, volume 1178 of Lecture Notes in Computer Science, pages 346–355. Springer, 1996.
 

The furthest-site geodesic Voronoi diagram.
Boris Aronov, Steven Fortune, and Gordon T. Wilfong.
Discrete & Computational Geometry, 9:217–255, 1993.
 

Feasability of design in stereolithography.
Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, and Binhai Zhu.
In FSTTCS, volume 761 of Lecture Notes in Computer Science, pages 228–237. Springer, 1993.
 

Nearest neighbor problems.
Gordon T. Wilfong.
Int. J. Comput. Geometry Appl., 2(4):383–416, 1992.
 

Planning constrained motion.
Steven Fortune and Gordon T. Wilfong.
Ann. Math. Artif. Intell., 3(1):21–82, 1991.
 

Motion planning in the presence of movable obstacles.
Gordon T. Wilfong.
Ann. Math. Artif. Intell., 3(1):131–150, 1991.
 

Minimum-speed motions.
Boris Aronov, Steven Fortune, and Gordon T. Wilfong.
I. J. Robotics Res., 10(3):228–239, 1991.
 

Nearest neighbor problems.
Gordon T. Wilfong.
In Symposium on Computational Geometry, pages 224–233. ACM, 1991.
 

Graphs with variable edge costs: a model for scheduling a vehicle subject to speed and timing restraints.
Gordon T. Wilfong.
In IROS, pages 73–79. IEEE, 1990.
 


Gordon T. Wilfong.
In Autonomous Robot Vehicles, pages 391–395. Springer, 1990.
 

Guest editor’s introduction: Robotics and automation.
Gordon T. Wilfong.

IEEE Computer, 22(3):6–7, 1989.
 

Shortest paths for autonomous vehicles.
Gordon T. Wilfong.
In ICRA, pages 15–20. IEEE Computer Society, 1989.
 

One-processor scheduling with symmetric earliness and tardiness penalties.
Michael R. Garey, Robert E. Tarjan, and Gordon T. Wilfong.
Math. Oper. Res., 13(2):330–348, 1988.
 

The furthest-site geodesic Voronoi diagram.
Boris Aronov, Steven Fortune, and Gordon T. Wilfong.
In Symposium on Computational Geometry, pages 229–240. ACM, 1988.
 

Motion planning in the presence of movable obstacles.
Gordon T. Wilfong.
In Symposium on Computational Geometry, pages 279–288. ACM, 1988.
 

Motion planning for an autonomous vehicle.
Gordon T. Wilfong.
In ICRA, pages 529–533. IEEE Computer Society, 1988.
 

Planning constrained motion.
Steven Fortune and Gordon T. Wilfong.
In STOC, pages 445–459. ACM, 1988.
 

Reducing multiple object motion planning to graph searching.
John E. Hopcroft and Gordon T. Wilfong.
SIAM J. Comput., 15(3):768–785, 1986.
 

Coordinated motion of two robot arms.
Steven Fortune, Gordon T. Wilfong, and Chee Yap.
In ICRA, pages 1216–1223. IEEE, 1986.

Patents

  • 9,992,108: Packet forwarding based on path encoding, with A. Hari and U. Niesen, June 2018.
  • 9,760,298: Anonymization of identifying portions of streaming data, with D.M. Andrews, A. Vyas and Y. Zhang, September 2017.
  • 9,723,074: Method and apparatus for in the middle primary backup replication, with P. Koppol, K. Namjoshi, and T. Stathopoulos, August 2017.
  • 9,667,499: Sparsification of pairwise cost information, with Y. Zhang and M. Scharf, May 2017.
  • 9,614,677: Secure function evaluation of tree circuits, with W. Kennedy and V. Kolesnikov, April 2017.
  • 9,507,932: Policy enforcement in a topology abstraction system, with M. Scharf, T.Voith, M. Stein and Y. Zhang, November 2016.
  • 9,361,480: Anonymization of streaming data, with V. Kolesnikov, June 2016.
  • 9,276,842: Methods and apparatus for routing using bifurcated network flows with F.B. Shepherd, March 2016.
  • 9,100,280: Undirected cross connects based on wavelength-selective switches, with C. Doerr, August 2015.
  • 8,868,862: Method and apparatus for synchronization in primary-backup replication schemes, with P. Koppol, K. Namjoshi and T. Stathopoulos, November 2014.
  • 8,798,086: Time-preserved transmissions in asynchronous virtual machine replication, with P. Koppol, K. Namjoshi, and T. Stathopoulos, August 2014.
  • 8,005,134: Optical Telecommunications Network and Method, with C. Nuzman, D. Mitra and I. Saniee, November 2011.
  • 7,994,859: Network Design Method, with S. Fortune, J. Zhao and M. El-Sayed, May 2011.
  • 7,801,156: Undirected Cross Connects Based on Wavelength-selective Switches, with C. Doerr, September 2010.
  • 7,720,382: Time-domain Wavelength Interleaved Network with Communications via Hub Node, with P. Haxell and P. Winkler, May 2010.
  • 7,653,306: Multiple Port Symmetric Transmissive Wavelength-selective Mesh Node, with C. Doerr, January 2010.
  • 7,486,682: Method and Apparatus for Grooming Traffic Demands According to Mileage Based Tariffs, with C. Nuzman, February 2009.
  • 7,366,178: Method and Apparatus for Scheduling Data Packet Transmission Over a Multihop Wireless Backhaul Network, with S. Lee, G. Narlikar and L. Zhang, April 2008.
  • 7,194,207: Wide-sense Wavelength Division Multiplexed WDM Cross-connect Device, with A. Rasala, March 2007.
  • 7,180,864: Method and Apparatus for Exchanging Routing Information within an Autonomous System in a Packet-based Data Network, with A. Basu, L. Ong, A. Rasala and B. Shepherd, February 2007.
  • 7,054,871: Method for Identifying and Using Table Structures, with J. Hu, R. Kashi and D. Lopresti, May 2006.
  • 6,728,779: Method and Apparatus for Exchanging Routing Information in a Packet-Based Data Network, with T. Griffin, April 2004.
  • 6,542,635: Method For Document Comparison and Classification Using Document Image, with J. Hu and R. Kashi, April 2003.
  • 6,535,310: Strictly Non-blocking Wavelength Division Multiplexed WDM Cross-connect Device, with A. Rasala, March 2003.
  • 6,532,090: Wavelength Selective Cross-connect with Reduced Complexity, with C. Doerr, B. Mikkelsen and M. Zirngibl, March 2003.
  • 6,487,332: Strictly Non-blocking Wavelength Division Multiplexed WDM Cross-connect Device for use in a Heterogeneous Network, with A. Rasala, November 2002.
  • 6,408,093: Method For Comparing Object Ranging Schemes, with J. Hu and R. Kashi, June 2002.
  • 6,381,046: Routing Method For Ring Networks, Such As WDM Ring Networks For Optical Communication, with P. M. Winkler, April 2002.
  • 5,940,511: Method and Apparatus for Secure PIN Entry Schemes, August 1999.
  • 5,930,380: Method And Apparatus For Verifying Static Signatures Using Dynamic Information, with R. Kashi and W. Nelson, July 1999.
  • 5,898,156: Validation Stamps for Electronic Signatures, April 1999.
  • 5,838,819: System and Method for Processing and Managing Electronic Copies of Handwritten Notes, with L. Ruedisueli, November 1998.
  • 5,754,652: Method and Apparatus for Secure PIN Entry, May 1998.
  • 5,537,489: Method of Normalizing Symbols, with F. W. Sinden, July 1996.
  • 5,333,209: Method of Recognizing Handwritten Symbols, with F. W. Sinden, 1994.