Article

Free access

FIRE: flexible Intra-AS routing environment

Authors:

Craig Partridge,

Alex C. Snoeren,

W. Timothy Strayer,

Beverly Schwartz,

Matthew Condell,

Isidro CastiñeyraAuthors Info & Claims

SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

Pages 191 - 203

https://doi.org/10.1145/347059.347544

Published: 28 August 2000 Publication History

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.

References

[1]

C. ADAMS AND S. FARRELL, "Internet X.509 public key infrastructure certificate management protocols," RFC 2510 (Mar 1999).]]

Digital Library

[2]

D. S. ALEXANDER, W. ARBAUGH, A.KEROMYTIS, AND J. SMITH, A secure active network environment architecure, IEEE Network, 12, 3, pp. 37-45 (May/Jun 1998).]]

[3]

D. O. AWDUCHE,J.MALCOLM,J.AGOGBUA,M.O'DELL, AND J. MCMANUS, Requirements for traffic engineering over MPLS, RFC 2702 (Sep 1999).]]

Digital Library

[4]

S. BAHK AND M. EL ZARKI, Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network, Proc. ACM SIGCOMM '92, pp. 53-64 (Aug 1992).]]

Digital Library

[5]

M. BAILEY,B.GOPAL,M.PAGELS,L.PETERSON, AND P. SARKAR, PathFinder: A Pattern-Based Packet Classifier, Proc. USENIX OSDI '94, pp. 115-123 (Nov 1994).]]

[6]

A. BALLARDIE,P.FRANCIS, AND J. CRO WCROFT, Core Based Trees (CBT): An architecture for scalable multicast routing, Proc. ACM SIGCOMM '93, pp. 85-95 (Sep 1993).]]

Digital Library

[7]

B. BRADEN,L.ZHANG,S.BERSON,S.HERZOG, AND S. JAMIN, Resource ReSerVation Protocol (RSVP) - Version 1 functional specification, RFC 2205 (Sep 1997).]]

Digital Library

[8]

R. CALLON, Use of OSI IS-IS for routing TCP/IP and dual environments, RFC 1195 (Dec 1990).]]

Digital Library

[9]

I. CASTINEYRA, Hop-Spec: specifying the capabilities of the hop within an internetwork, Technical Report 7813, BBN Technologies (1992).]]

[10]

B. CHINOY, Dynamics of internet routing information, Proc. ACM SIGCOMM '93, pp. 45-52 (Sep 1993).]]

Digital Library

[11]

A. DEMERS, S. KESHAV, AND S. SHENKER, Analysis and Simulation of a Fair Queueing Algorithm, Internetwork: Research and Experience, 1, 1, pp. 3-26 (Jan 1990).]]

[12]

E. DIJKSTRA, A note on two problems in connexion with graphs, Numerische Mathematik, 1, pp. 269-271 (1959).]]

Digital Library

[13]

D. ENGLER AND M. F. KAASHOEK, DPF: Fast, flexible message demultiplexing using dynamic code generation, Proc. ACM SIGCOMM '96, pp. 53-59 (Aug 1996).]]

Digital Library

[14]

D. ESTRIN, D. FARINACCI, A. HELMY, D. THALER, S. DEERING, M. HANDLEY, V. JACOBSON, C. LIU, P. SHARMA, AND L. WEI, Protocol Independent Multicast-Sparse Mode (PIM-SM), RFC 2362 (Jun 1998).]]

Digital Library

[15]

J. GOSLING, B. JOY, AND G. STEELE, The Java language specification, Addison Wesley, Reading, MA (1996).]]

Digital Library

[16]

M. HICKS, J. MOORE, D. S. ALEXANDER, C. GUNTER, AND S. NETTLES, PLANet: An active internetwork, Proc. IEEE INFOCOM '99, pp. 1124-1133 (Mar 1999).]]

[17]

H. HOLBROOK AND D. CHERITON, IP Multicast Channels: EXPRESS Support for Large-scale Single Source Applications, Proc. ACM SIGCOMM '99, pp. 65-79 (Sep 1999).]]

Digital Library

[18]

V. JACOBSON, Congestion avoidance and control, Proc. ACM SIGCOMM '88, pp. 314-329 (Aug 1988).]]

Digital Library

[19]

S. KENT AND R. ATKINSON, Security architecture for the Internet Protocol, RFC 2401 (Nov 1998).]]

Digital Library

[20]

S. KENT, C. LYNN, AND K. SEO, Secure Border Gateway Protocol (S-BGP), Technical report, BBN Technologies.]]

[21]

S. KENT AND R. ATKINSON, IP Encapsulating Security Payload (ESP), RFC 2406 (Nov 1998).]]

Digital Library

[22]

I. LESLIE, D. MCAULEY, R. BLACK, T. ROSCOE, P. BARHAM, D. EVERS, R. FAIRBAIRNS, AND E. HYDEN, The Design and Implementation of an Operating System to Support Distributed Multimedia Applications, IEEE JSAC, 14, 7, pp. 1280-1297 (Sep 1996).]]

[23]

S. MCCANNE AND V. JACOBSON, The BSD packet filter: A new architecture for user-level packet capture, Proc. USENIX Technical Conference, pp. 259-269 (Jan 1993).]]

[24]

J. MCQUILLAN,I.RICHER, AND E. ROSEN, The new routing algorithm for the Arpanet, IEEE Transactions on Communications, 28, 5, pp. 711-719 (May 1980).]]

[25]

J. MOY, OSPF version 2, RFC 2328 (Apr 1998).]]

[26]

S. MURPHY,M.BADGER, AND B. WELLINGTON, OSPF with digital signatures, RFC 2154 (Jun 1997).]]

Digital Library

[27]

G. NECULA, Proof-carrying code, Proc. ACM POPL '97, pp. 106-119 (Jan 1997).]]

Digital Library

[28]

K. NICHOLS,V.JACOBSON, AND L. ZHANG, A two-bit differentiated services architecture for the internet, RFC 2638 (Jul 1999).]]

Digital Library

[29]

R. PERLMAN, Interconnections: Bridges and routers, Addison Wesley, Reading, MA (Aug 1997).]]

Digital Library

[30]

T. RODEHEFFER AND M. SCHROEDER, Automatic Reconfiguration in Autonet, Proc. ACM SOSP '91, pp. 183-197 (Oct 1991).]]

Digital Library

[31]

E. ROSEN, Vulnerabilities of network control protocols: An example, CCR, 11, 3, pp. 10-16 (Jul 1981).]]

Digital Library

[32]

K. SKLOWER, A tree-based routing table for Berkeley Unix, Technical report, UC Berkeley (1993).]]

[33]

K. SOLLINS, The TFTP protocol (revision 2), RFC 1350 (Jul 1992).]]

Digital Library

[34]

M. THORUP, Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM, 46, 3, pp. 362-394 (May 1999).]]

Digital Library

[35]

M. WALDVOGEL, G. VARGHESE, J. TURNER, AND B. PLAT- TNER, Scalable high speed IP routing lookups, Proc. ACM SIGCOMM '97, pp. 25-36 (Sep 1997).]]

Digital Library

[36]

D. WETHERALL, J. GUTTAG, AND D. TENNENHOUSE, ANTS: A toolkit for building and dynamically deploying network protocols, Proc. IEEE OPENARCH '98 (Apr 1998).]]

[37]

R. WHITE, A. RETANA, AND D. SLICE, EIGRP for IP, Addison Wesley, Reading, MA (In press).]]

Cited By

Wu ZXie MWang H(2008)SwiftProceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation10.5555/1387589.1387609(279-292)Online publication date: 16-Apr-2008
https://dl.acm.org/doi/10.5555/1387589.1387609
Yan HMaltz DNg TGogineni HZhang HCai Z(2007)TesseractProceedings of the 4th USENIX conference on Networked systems design & implementation10.5555/1973430.1973457(27-27)Online publication date: 11-Apr-2007
https://dl.acm.org/doi/10.5555/1973430.1973457
Anagnostakis KIoannidis SMiltchev SGreenwald MSmith JIoannidis J(2002)Efficient packet monitoring for network managementNOMS 2002. IEEE/IFIP Network Operations and Management Symposium. ' Management Solutions for the New Communications World'(Cat. No.02CH37327)10.1109/NOMS.2002.1015599(423-436)Online publication date: 2002
https://doi.org/10.1109/NOMS.2002.1015599
Show More Cited By

Index Terms

FIRE: flexible Intra-AS routing environment

Recommendations

FIRE: flexible Intra-AS routing environment

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 ...
FIRE: flexible intra-AS routing environment

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 ...
Fire ant: an algorithm providing high-performance distributed fault-tolerant communication for internet-scale network survivability

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

August 2000

348 pages

ISBN:1581132239

DOI:10.1145/347059

Chairman:
Craig Partridge
BBN Technologies, Cambridge, MA

ACM SIGCOMM Computer Communication Review Volume 30, Issue 4
October 2000
319 pages
ISSN:0146-4833
DOI:10.1145/347057
Editor:
Roch Guerin
Univ. of Pennsylvania, Philadelphia
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 August 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM00

Sponsor:

SIGCOMM

SIGCOMM00: ACM SIGCOMM 2000

August 28 - September 1, 2000

Stockholm, Sweden

Acceptance Rates

SIGCOMM '00 Paper Acceptance Rate 26 of 238 submissions, 11%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
668
Total Downloads

Downloads (Last 12 months)66
Downloads (Last 6 weeks)13

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu ZXie MWang H(2008)SwiftProceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation10.5555/1387589.1387609(279-292)Online publication date: 16-Apr-2008
https://dl.acm.org/doi/10.5555/1387589.1387609
Yan HMaltz DNg TGogineni HZhang HCai Z(2007)TesseractProceedings of the 4th USENIX conference on Networked systems design & implementation10.5555/1973430.1973457(27-27)Online publication date: 11-Apr-2007
https://dl.acm.org/doi/10.5555/1973430.1973457
Anagnostakis KIoannidis SMiltchev SGreenwald MSmith JIoannidis J(2002)Efficient packet monitoring for network managementNOMS 2002. IEEE/IFIP Network Operations and Management Symposium. ' Management Solutions for the New Communications World'(Cat. No.02CH37327)10.1109/NOMS.2002.1015599(423-436)Online publication date: 2002
https://doi.org/10.1109/NOMS.2002.1015599
Anagnostakis KGreenwald MIoannidis SMiltchev S(2002)Open Packet Monitoring on FLAME: Safety, Performance, and ApplicationsActive Networks10.1007/3-540-36199-5_10(120-131)Online publication date: 8-Nov-2002
https://doi.org/10.1007/3-540-36199-5_10
Wu ZXie MWang H(2011)Design and implementation of a fast dynamic packet filterIEEE/ACM Transactions on Networking10.1109/TNET.2011.211138119:5(1405-1419)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1109/TNET.2011.2111381
Anagnostakis KGreenwald MIoannidis SLi DSmith J(2006)Flexible network monitoring with FLAMEComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2006.04.01850:14(2548-2563)Online publication date: 5-Oct-2006
https://dl.acm.org/doi/10.1016/j.comnet.2006.04.018
Hideaki Imaizumi H(2005)FMEHR: An Alternative Approach to Multi-Path Forwarding on Packet Switched Networks2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic10.1109/ICON.2005.1635467(196-201)Online publication date: 2005
https://doi.org/10.1109/ICON.2005.1635467
Smith JNettles S(2004)Active networkingIEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews10.1109/TSMCC.2003.81849334:1(4-18)Online publication date: 1-Feb-2004
https://dl.acm.org/doi/10.1109/TSMCC.2003.818493
Papadimitratos PHaas Z(2004)Secure Communication in Adverse Mobile Ad Hoc NetworksAd Hoc Wireless Networking10.1007/978-1-4613-0223-0_12(447-485)Online publication date: 2004
https://doi.org/10.1007/978-1-4613-0223-0_12
Papadimitratos PHaas Z(2003)Secure link state routing for mobile ad hoc networks2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.10.1109/SAINTW.2003.1210190(379-383)Online publication date: 2003
https://doi.org/10.1109/SAINTW.2003.1210190

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents