Content Based Routing With Elvin4

Proceedings International Parallel and Distributed Processing Symposium, 2003

Content networking is an emerging technology, where the requests for content are steered by content routers that examine not only the destinations but also content descriptors such as URLs and cookies. In the current deployments of content networking, content routing is mostly confined to selecting the most appropriate back-end server in virtualized web server clusters. In this paper, we present an architecture for wide-area content routing. The architecture is based on tagging the requests at ingress points. The tags are designed to incorporate several different attributes of the content in the routing process. Simulations are carried out to compare the performance of the proposed scheme with a DNS-based content access scheme.

2002

Supplemental Information for the New Definition of the EF PHB (Expedited Forwarding Per-Hop Behavior) Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2001). All Rights Reserved. This document was written during the process of clarification of RFC2598 "An Expedited Forwarding PHB " that led to the publication of revised specification of EF "An Expedited Forwarding PHB". Its primary motivation is providing additional explanation to the revised EF definition and its properties. The document also provides additional implementation examples and gives some guidance for computation of the numerical parameters of the new definition for several well known schedulers and router architectures.

Performance Evaluation and Planning Methods for the Next Generation Internet, 2005

IEEE Network, 2014

Off the shelf routing products often are constrained by design to meet specific needs, both in terms of software and hardware. Networking professionals may face problems that require customisation of software, additional processing facilities or data storage, that are not provided for by those products. The Quagga Routing Suite provides implementations of several common routing protocols, distributed over multiple processes communicating via IPC, and support for their development, with source code provided under a modification-friendly licence. Quagga can help networking professionals build such custom solutions, in combination with other Open Source software packages. Quagga also provides a path for network researchers to increase the visibility of their work, and make it available to a wider community for potential testing and use, increasing the impact of that research.

2009

IEEE Journal on Selected Areas in Communications, 2001

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-programmable algorithms and metrics over a secure link-state distribution protocol. By allowing the network operator to dynamically reprogram both the properties being advertised and the routing algorithms used to construct forwarding tables, 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 may be routed using completely different routing algorithms, all supported by a single routing protocol. This paper presents an overview of FIRE, focusing particularly on FIRE's novel aspects with respect to traditional routing protocols. We consider deploying several current unicast and multicast routing algorithms in FIRE, and briefly describe our Java-based implementation.

1995

This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from aiqr Qrpe of computer printer.

2013

North-Bound Distribution of Link-State and TE Information using BGP draft-gredler-idr-ls-distribution-02 In a number of environments, a component external to a network is called upon to perform computations based on the network topology and current state of the connections within the network, including traffic engineering information. This is information typically distributed by IGP routing protocols within the network This document describes a mechanism by which links state and traffic engineering information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a new BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism is applicable to physical and virtual links. The mechanism described is subject to policy control.

… in Developing Countries and Networks of …, 2011

A. Pont, G. Pujolle, and SV Raghavan (Eds.): WCITD/NF 2010, IFIP AICT 327, pp. 194–205, 2010. © IFIP International Federation for Information Processing 2010 ... New Routing Paradigms for the Next Internet ... Djamel H. Sadok, Luciana Pereira Oliveira, and Judith Kelner

IEEE Journal on Selected Areas in Communications, 2000

The locator/identifier split is a design principle for new routing architectures that make Internet routing more scalable. To find the location of a host, it requires a mapping system that returns appropriate locators in response to maprequests for specific identifiers. In this paper, we propose FIRMS, a "Future Internet Routing Mapping System". It is fast, scalable, reliable, secure, and it is able to relay initial packets. We introduce its design, show how it deals with partial failures, explain its security concept, and evaluate its scalability.