Flying hot potatoes

被引：1

作者：

Mishra, P ^{[1
]}

Pappas, GJ ^{[1
]}

机构：

[1] Univ Penn, Dept Comp & Informat Sci, Philadelphia, PA 19104 USA

来源：

PROCEEDINGS OF THE 2002 AMERICAN CONTROL CONFERENCE, VOLS 1-6 | 2002年 / 1-6卷

关键词：

D O I：

10.1109/ACC.2002.1024904

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：754 / 759

页数：6

共 12 条

[1] Potential function analysis of greedy hot-potato routing [J].

BenDor, A ;

Halevi, S ;

Schuster, A .

THEORY OF COMPUTING SYSTEMS, 1998, 31 (01) :41-61

[2] Deterministic many-to-many hot potato routing [J].

Borodin, A ;

Rabani, Y ;

Schieber, B .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (06) :587-596

[3]

BRINTON CR, 1992, P 11 DIG AV SYST C S

[4]

Devasia S., 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), P2456, DOI 10.1109/CDC.1999.831294

[5]

Green S., 1993, P AGARD GUID CONTR S

[6]

Harman W. H., 1989, Lincoln Laboratory Journal, V2, P437

[7]

ISAACSON DR, 1997, P AIAA GUID NAV CONT

[8] Air traffic management: Evolution with technology [J].

Kahne, S ;

Frolow, I .

IEEE CONTROL SYSTEMS MAGAZINE, 1996, 16 (04) :12-21

[9]

NAOR J, 1998, J GRAPH ALGOR APPL, V2, P1

[10]

Paielli R. A, 1996, CONFLICT PROBABILITY

← 1 2 →