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.
- 1 C. ADAMS AND S. FARRELL, "Internet X.509 public key infrastructure certificate management protocols," RFC 2510 (Mar 1999).]] Google ScholarDigital 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).]]Google Scholar
- 3 D. O. AWDUCHE,J.MALCOLM,J.AGOGBUA,M.O'DELL, AND J. MCMANUS, Requirements for traffic engineering over MPLS, RFC 2702 (Sep 1999).]] Google ScholarDigital 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).]] Google ScholarDigital 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).]]Google Scholar
- 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).]] Google ScholarDigital 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).]] Google ScholarDigital Library
- 8 R. CALLON, Use of OSI IS-IS for routing TCP/IP and dual environments, RFC 1195 (Dec 1990).]] Google ScholarDigital Library
- 9 I. CASTINEYRA, Hop-Spec: specifying the capabilities of the hop within an internetwork, Technical Report 7813, BBN Technologies (1992).]]Google Scholar
- 10 B. CHINOY, Dynamics of internet routing information, Proc. ACM SIGCOMM '93, pp. 45-52 (Sep 1993).]] Google ScholarDigital 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).]]Google Scholar
- 12 E. DIJKSTRA, A note on two problems in connexion with graphs, Numerische Mathematik, 1, pp. 269-271 (1959).]]Google ScholarDigital 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).]] Google ScholarDigital 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).]] Google ScholarDigital Library
- 15 J. GOSLING, B. JOY, AND G. STEELE, The Java language specification, Addison Wesley, Reading, MA (1996).]] Google ScholarDigital 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).]]Google Scholar
- 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).]] Google ScholarDigital Library
- 18 V. JACOBSON, Congestion avoidance and control, Proc. ACM SIGCOMM '88, pp. 314-329 (Aug 1988).]] Google ScholarDigital Library
- 19 S. KENT AND R. ATKINSON, Security architecture for the Internet Protocol, RFC 2401 (Nov 1998).]] Google ScholarDigital Library
- 20 S. KENT, C. LYNN, AND K. SEO, Secure Border Gateway Protocol (S-BGP), Technical report, BBN Technologies.]]Google Scholar
- 21 S. KENT AND R. ATKINSON, IP Encapsulating Security Payload (ESP), RFC 2406 (Nov 1998).]] Google ScholarDigital 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).]]Google Scholar
- 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).]]Google Scholar
- 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).]]Google ScholarCross Ref
- 25 J. MOY, OSPF version 2, RFC 2328 (Apr 1998).]]Google Scholar
- 26 S. MURPHY,M.BADGER, AND B. WELLINGTON, OSPF with digital signatures, RFC 2154 (Jun 1997).]] Google ScholarDigital Library
- 27 G. NECULA, Proof-carrying code, Proc. ACM POPL '97, pp. 106-119 (Jan 1997).]] Google ScholarDigital Library
- 28 K. NICHOLS,V.JACOBSON, AND L. ZHANG, A two-bit differentiated services architecture for the internet, RFC 2638 (Jul 1999).]] Google ScholarDigital Library
- 29 R. PERLMAN, Interconnections: Bridges and routers, Addison Wesley, Reading, MA (Aug 1997).]] Google ScholarDigital Library
- 30 T. RODEHEFFER AND M. SCHROEDER, Automatic Reconfiguration in Autonet, Proc. ACM SOSP '91, pp. 183-197 (Oct 1991).]] Google ScholarDigital Library
- 31 E. ROSEN, Vulnerabilities of network control protocols: An example, CCR, 11, 3, pp. 10-16 (Jul 1981).]] Google ScholarDigital Library
- 32 K. SKLOWER, A tree-based routing table for Berkeley Unix, Technical report, UC Berkeley (1993).]]Google Scholar
- 33 K. SOLLINS, The TFTP protocol (revision 2), RFC 1350 (Jul 1992).]] Google ScholarDigital 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).]] Google ScholarDigital 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).]] Google ScholarDigital 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).]]Google ScholarCross Ref
- 37 R. WHITE, A. RETANA, AND D. SLICE, EIGRP for IP, Addison Wesley, Reading, MA (In press).]]Google Scholar
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
SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer CommunicationCurrent 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 ...
Comments