Skip to main content
Article
Flying Hot Potatoes
Departmental Papers (ESE)
  • Pradyumna Mishra, University of Pennsylvania
  • George J Pappas, University of Pennsylvania
Document Type
Conference Paper
Date of this Version
5-8-2002
Comments
Copyright 2002 IEEE. Reprinted from Proceedings of the 2002 American Control Conference, Volume 1, pages 754-759.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Abstract

Optical communication networks and air traffic management systems share the same fundamental routing problem as both optical packets and aircraft must continuously move within the network, while avoiding conflicts. In this paper, we explore the use of hot potato and deflection routing algorithms, which are established routing methods in optical communication networks, in the conflict-free routing of air traffic. Hot potato algorithms allow the incorporation of conflict resolution constraints into the routing problem, in contrast to most approaches that decouple the optimal routing problem from the conflict resolution problem.

Citation Information
Pradyumna Mishra and George J Pappas. "Flying Hot Potatoes" (2002)
Available at: http://works.bepress.com/george_pappas/240/