FIRE
- 28 August 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 30 (4) , 191-203
- https://doi.org/10.1145/347057.347544
Abstract
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and the protocol used to distribute these metrics as an integrated package. The Flexible Intra-AS Routing Environment (FIRE) is a link-state, intra-domain routing protocol that decouples these components. FIRE supports run-time-pro- grammable algorithms and metrics over a secure link-state distribution protocol. By allowing the network operator to dynamically reprogram both the information being advertised and the routing algorithm used to construct forwarding tables in Java, FIRE enables the development and deployment of novel routing algorithms without the need for a new protocol to distribute state. FIRE supports multiple concurrent routing algorithms and metrics, each constructing separate forwarding tables. By using operator-specified packet filters, separate classes of traffic are routed using completely different routing algorithms, all supported by a single routing protocol.Keywords
This publication has 15 references indexed in Scilit:
- IP multicast channelsPublished by Association for Computing Machinery (ACM) ,1999
- Undirected single-source shortest paths with positive integer weights in linear timeJournal of the ACM, 1999
- DPFPublished by Association for Computing Machinery (ACM) ,1996
- Core based trees (CBT)Published by Association for Computing Machinery (ACM) ,1993
- Dynamics of internet routing informationPublished by Association for Computing Machinery (ACM) ,1993
- Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area networkPublished by Association for Computing Machinery (ACM) ,1992
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- Vulnerabilities of network control protocolsACM SIGCOMM Computer Communication Review, 1981
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959