Redback Networks

About: Redback Networks is a based out in . It is known for research contribution in the topics: Network packet & Network element. The organization has 98 authors who have published 101 publications receiving 2598 citations.

Method and apparatus for an attribute oriented routing update

Abstract: A computer implemented method and apparatus for an attribute-oriented routing update is described. The method comprises selecting an updated set of attributes in a routing table before selecting a set of updated destinations associated with the selected set of attributes, wherein the attributes are stored in an attribute table as a portion of the routing table and the attributes do not include the conventional network prefixes. An update message that includes the set of updated destinations for the set of attributes is then generated. The method is also extended to extraction of unreachable destinations by using a dummy attribute in the routing table, wherein the dummy attribute is selected first, followed by extracting the unreachable destinations.

Methods and apparatus for deploying quality of service policies on a data communication network

Abstract: A network policy management system and methods define service templates. The service templates contain information on the topologies of services such as video calls, web services, order processing applications, or the like. The service templates also contain information about the quality of service required by each of the data flows which will be generated when an instance of the service is used. The policy management system allows users to add new services by selecting a service template and specifying endpoints for the service on a map of the network. The system automatically generates updated packet forwarding rules for use at a plurality of packet processing devices in the network.

Methods and apparatus for packet classification with multi-level data structure

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to classify individual packets. Providing meaningful classification generally requires classifying data packets in several dimensions. A classification method represents a rule base as a hierarchy of linked tables and sequentially matches each parameter value in a packet signature against tables in the hierarchy. The method supports longest prefix matching and avoids time consuming backtracking by adding rules to the rule base.

Nexthop fast rerouter for IP and MPLS

Abstract: Methods and apparatus for rerouting network traffic are described herein. In one embodiment, an example of process includes maintaining as a part of a routing table of a network element information regarding one or more backup links leading to a node using label switched protocols (LSPs), the node being adjacent to the network element, and in response to a failure of a primary link coupling the network element to the node, the network element rerouting network traffic to the node via the one or more backup paths without having to notifying and waiting for a response from a headend node that originates the network traffic. Other methods and apparatuses are also described.

Packet scheduling methods and apparatus

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to schedule individual packets for forwarding on the data link. The invention provides scheduling methods which give preference to higher priority packets while treating lower priority packets fairly. The methods can provide shorter latencies for higher priority packets than can many prior scheduling methods. The methods and apparatus of the invention are readily adaptable for use with scheduling rules provided in the form of hierarchical policy trees.