1328 results about "Route" patented technology

A technique maintains Interior Gateway Protocol (IGP) transparency of Virtual Private Network (VPN) routes when Border Gateway Protocol (BGP) is used as a Provider Edge Device (PE) to Customer Edge Device (CE) protocol in a computer network. According to the novel technique, a first CE generates a BGP advertisement to advertise one or more VPN routes of its customer network, the BGP advertisement having one or more transitive IGP attributes for the advertised routes. The first CE sends the BGP advertisement to a first PE, which then propagates the BGP advertisement among devices of a provider network maintaining the transitive IGP attributes. A second PE sends the BGP advertisement to a second CE, along with the transitive IGP attributes. Upon receiving the BGP advertisement, the second CE converts the BGP advertisement and transitive IGP attributes into corresponding IGP advertisements. The second CE may then propagate the IGP advertisements into its customer network as either internal VPN routes or as external routes accordingly.

A BGP route monitoring device includes a routing information receiving unit configured to receive BGP routing information. The device also includes a first database storing a plurality of pieces of BGP routing information registered in an IRR server. The server also includes a routing failure detecting unit to classify the received BGP information into states by comparing the received BGP information with the first database and to determine whether the received BGP routing information is an invalid path based on the classified states. In this configuration, the plurality of states include a state where Prefix of the received BGP information matches Prefix of BGP routing information in the first database, the PrefixLength of the received BGP information is shorter than PrefixLength of the BGP routing information in the first database, and Origin AS number of the received BGP routing information matches Origin AS number of the BGP routing information in the first database.

A method of managing virtual routing forwarding (VRF) tables at a provider edge PE router of a L3 virtual private network (VPN) is provided. An import route target (ImpRT) tree is maintained at the PE router, which keeps the association between all ImpRT attributes currently configured on said PE router and the virtual routing table VRF at that router. When an ImpRT attribute is configured on a VRF table, the PE router first searches the tree to identify a local VRF table that contains a route(s) with that ImpRT attribute. If this information is available locally, the VRF is updated by copying the route information, and there is no need to do a route refresh. When an ImpRT is deleted from a VRF, a route refresh is avoided by parsing all the routes in the VRF and removing the routes that no longer have a matching route target. In an alternative implementation, the local source is the master RIB (routing information base) which includes all routes in all VRFs at the router, and optionally even rejected routes that were filtered out using ImpRTs. In this variant, even routes associated with ImpRTs that are new to the router would be available to update the VRF without requiring a route refresh.

A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request / response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.

A system and method for network routing is provided where significant (those that impact optimal network routes) state changes of network components are considered. A set of optimal communication paths are generated for a number of actual and potential component failure scenarios. An optimal communication path is generated for each failure scenario. In addition, a method that enables continued communication using intermediate routing points and routing update propagation during periods of network non-convergence or congestion is disclosed.

A technique manages route optimization for one or more groups of links in a computer network. According to the novel technique, each group or “subgroup” of links comprises one or more links, wherein the group may be configured based on various measures, such as, e.g., connectivity (physical or virtual), policies to be applied, per-prefix, per-application (e.g., Internet traffic or voice over IP, VoIP), geographic location, and / or quality-based (e.g., primary links and secondary / backup links). One or more policies may be defined for the groups of links (i.e., where these group policies are to be applied to the group as a whole), in addition to policies that may be defined for individual to links and / or prefixes. Once the link groups are established, traffic over the groups of links (e.g., routes to reachable address prefixes) may be managed and optimized according to the group policies, such as in accordance with Optimized Edge Routing (OER) techniques.

In a networking environment including one or more network processing (NP) devices and implementing a routing protocol for routing data packets from a source NP devices to destination NP devices via a switch fabric, with each network processing device supporting a number of interface ports, a system and method for enabling a routing system to recover more quickly that the routing protocol so as to significantly reduce the occurrence of lost data packets to a failed target interface / blade. The routing system is enabled to track the operational status of each network processor device and operational status of destination ports supported by each network processor device in the system, and maintains the operational status as a data structure at each network processing device. Prior to routing packets, an expedient logical determination is made as to the operational status of a target network processing device and target interface port of a current packet to be routed as represented in the data structure maintained at the source NP device. If the target blade / interface is not operations, an alternative route may be provided by ECMP. In this manner, correct routing of packets is ensured with reduced occurrence of lost data packets due to failed target NP devices / ports.

A method of routing data from a source node to a destination node in a multi-hop network of nodes interconnected by links comprises: (a) determining that a link-flow vector satisfies one or more necessary scheduling conditions for achievability, wherein the link-flow vector represents a set of flows to be routed on one or more links from the source node to the destination node; (b) generating a scheduling multi-graph for the network, wherein the scheduling multi-graph comprises a graph having at least one pair of nodes with multiple edges therebetween; (c) deriving one or more sufficient scheduling conditions for achievability of the link-flow vector by edge-coloring the scheduling multi-graph; (d) solving a linear optimization problem over the one or more necessary scheduling conditions to obtain an upper bound on the achievability of the link-flow vector; (e) generating, based on the scheduling multi-graph, a solution comprising a set of routes and an associated schedule for achieving the link-flow vector, the solution being a lower bound on the achievability of the link-flow vector; and (f) implementing a routing method using the set of routes and the associated schedule to route the link-flow vector from the source node to the destination node. At least one node v of the network is adapted to receive transmissions from a specified plurality Ω(v) of other nodes, and at least one of the scheduling conditions depends on Ω(v).

The invention relates to method for prefetching content from multisource by an edge routing node of a content central network and the edge routing node. The method includes: judging whether a data packet arrives the first time or not; if so, inquiring whether the node caches corresponding contents or not; and if not, judging whether the contents satisfy conditions for starting multisource prefetching or not, and if so, performing multisource prefetching. The multisource prefetching includes: inquiring which routing nodes caches the contents, by the edge routing node, parallelly acquiring different blocks of the contents from a content source server of the content central network and routing nodes cached with the contents. Multisource prefetching is started on the basis of size of contents, parallel prefetching proportion is set on the basis of available link bandwidth, route path of newly increased routes fields can be appointed, utilization efficiency of network resources is improved, and distribution and acquisition efficiency of contents are improved.

Each node of a telecommunications network determines interface point connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.

The present invention provides a method and apparatus for extending a zone routing protocol. The invention is configured to provide a robust scalable framework for routing data in wireless ad-hoc networks when unidirectional links 210 are present. When the reverse path from a destination node (the tail) of a unidirectional link 210 to the originating node (the head) of the link is beyond a designated length, the invention is configured to revert to an on-demand search mechanism. The on-demand search mechanism recursively attempts to build a path to the destination 206 by recognizing nodes that have a route to the destination.

Methods for authenticating and authorizing a mobile device using tunneled extensible authentication protocol are provided. The methods include evaluating an inner user identifier against a policy engine to determine a home AAA server to route an access request for inner user authentication. Instead of having a static route configured based on an outer identifier / roaming identity, the policy engine can have multiple rules and actions for routing the request. The evaluation can be based on the conditions of the inner user identifier and or other AAA attributes received in the request. The request is transmitted within a secure communication tunnel. There are several embodiments of evaluating an inner user identifier against a policy engine.

PCT No. PCT / CA95 / 00600 Sec. 371 Date Apr. 24, 1997 Sec. 102(e) Date Apr. 24, 1997 PCT Filed Oct. 26, 1995 PCT Pub. No. WO96 / 13945 PCT Pub. Date May 9, 1996A DCR telecommunications network comprises a plurality of network switching elements interconnected by circuit groups for carrying calls, and a network processor communicating with the network elements. If it cannot use a direct route to a neighbouring network element, the switching element may access a routing table containing alternate routes which are updated periodically by the network controller. The network functions as a group of nodes interconnected by links. Routing takes place on a node-to-node basis. At least one of the nodes is a virtual destination node, vis. a logical entity corresponding to a group of two or more components which are network elements. A link to the virtual destination node is a set of circuit groups connecting to its components. Final destinations outside the network can be associated with the virtual destination node as an intermediate destination node, thereby allowing a call to exit the DCR network via any of the components rather than via only one Unique Exit Gateway. Where a link to the virtual destination node comprises a plurality of circuit groups, the associated switching element stores proportions for those circuit groups. When attempting to route a call via the link to the virtual destination node, the switching element attempts the circuit groups in dependence upon the proportions. The proportions may be fixed, i.e. computed off-line and stored. Alternatively, the proportions may be updated by the network processor based upon call completion information it receives periodically from the switching elements.