1285 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 flow based routing method and apparatus selects a path from a plurality of different paths for assignment to a flow. The path is selected based on a traffic performance measurements which identify relative congestion and performance of the different paths, so that traffic flows can be diverted away from network congestion points, thereby allowing network resources to be load balanced at a flow granularity. The present invention may be configured on physical or virtual links on an NE to enhance the forwarding of packets using the primary link and one or more alternate links to any given destination.

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.

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 a method for routing a queue tree in a wireless self-organization network applicable to a monitoring system. The invention includes a routing generation process, a dynamic maintenance of the routing and a monitoring data amalgamation transmission based on routing arithmetic. A network node selects the neighboring node with a small hot count to send a routing establishment request, and according to a handshaking mechanism, a routing relationship between an upper level and a lower level is established, and the whole network is formed a plurality of tree routing structures; according to ways of a connection detection, a past-due detection and upper node switching, a dynamic maintenance of the routing is realized, changes in network communication topology caused by factors such as the motion of the node and power change are adapted; by using the network structure of the tree routing, the node is able to inosculate the a communication desire to monitor the data in due time at the same time of maintaining the route. The method of the invention has the advantages of low spending on the communication, small delay of transmission and steady and reliable network.

A routing method for routing data packets from a source terminal to a destination terminal via at least one communication network, said at least one communication network comprising at least one mobility agent entity for each of said terminals, the method comprising the steps of: establishing a route from the source via at least one first mobility agent, at least two consecutively arranged second mobility agents, to said destination, deciding that said route is to be optimized, rerouting said route from one of said at least one first mobility agents directly to one of the at least two consecutively arranged second mobility agents such that at least one intermediate mobility agent in said route is bypassed in the resulting rerouted route.

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.

Systems and methods are described that employ multi-path BGP to realize dynamic multi-path load balancing based on an Intelligent Route Service Control Point (IRSCP) router control architecture that uses dynamic traffic flow information to perform dynamic load balancing to enable precise and effective load balancing.

A routing system for implementing a service and topology exchange protocol (STEP) comprises a primary STEP server configured to maintain a STEP repository and a plurality of routers, each router including a STEP client in communication with the primary STEP server. The STEP client of each router is configured to transmit, using the service and topology exchange protocol, service and topology state information for at least one route or service available through the router to the primary STEP server for storage in the STEP repository. The primary STEP server is configured to determine, for each router, whether the STEP repository includes any service and topology state information changes for the router based at least in part on the service and topology state information received from the routers and to transmit to the STEP client of each router for which there are service and topology state information changes, using the service and topology exchange protocol, only the service and topology state information changes.

A routing system for implementing a service and topology exchange protocol (STEP) includes a primary STEP server configured to maintain a STEP repository and a plurality of routers, with each router including a STEP client in communication with the primary STEP server. The STEP client of each router is configured to transmit, using STEP, STEP documents containing service and topology state information for at least one route or service available through the router to the primary STEP server for storage in the STEP repository. The primary STEP server is configured to transmit to the STEP client of each router, using STEP, service and topology state information from the STEP repository for at least one other router based on configured relationships between routers. Each router is configured to make routing decisions based at least in part on the service and topology state information from the at least one other router.

A method including formatting an advertisement message having a dedicated preferred route to one of a first physical entity and a first logical entity of a first autonomous system (“AS”), the dedicated preferred route being based on at least two routing attributes, and transmitting the advertisement message from the first AS to a second AS. A routing device including a formatting module formatting an advertisement message having a dedicated preferred route to one of a first physical entity and a first logical entity of a first autonomous system (“AS”), the dedicated preferred route being based on at least two routing attributes, and a transmitting module transmitting the advertisement message from the first AS to a second AS.

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.

Some embodiments of the invention provide a method of routing nets in a multi-layer integrated-circuit (“IC”) layout. For a particular net, the method specifies widths for routing the particular net in different directions on the same layer. It then defines a particular route for the particular net, where the route has different widths in the different directions on the same layer.

A router advertises an aggregated service or route that can be evaluated by other routers as a unitary segment rather than as a group of individual links/paths associated with the aggregated service or route. The aggregated service or route can be based on service and topology state information received from one or more other routers and can be advertised with the router as the nexthop for the aggregated service or route. The router can advertise an aggregated metric for the aggregated service or route for use in such evaluation. An aggregated route can be associated with different aggregated metrics for different services.

A routing system and method are provided which use a composite cost in identifying routes. This allows a simple way of identifying the best route taking multiple metrics into account for each link simultaneously. The system allows for the inclusion of pruning constraints, and allows for various objectives such as bin packing or load balancing to be achieved.

An IP routing lookup scheme and system for a multi-gigabit switching router which can reach 3 memory accesses in the worst case using memory size less than 512 KB is disclosed. The invention can compress a routing table with 40,000 routing entries into a forwarding table of 450–470 Kbytes. According to the present invention, a segmentation table storage device stores a next hop or a pointer for looking up a next hop for an incoming packet having prefix length less than or equal to 16 bits. The Next Hop Array storage device is for storing the next hops for a packet having prefix length larger than 16 bits and offset length less than or equal to 3 bits. A Compressed Next Hop Array storage device is encoded and decoded according to a Code Word Array storage device. The Compressed Next Hop Array storage device stores next hops for the incoming packet having prefix length larger than 16 bits and offset length larger than 3 bits. Thus, in the worst case, an output port for a route prefix can be found in 3 memory accesses.

A method and a computer program for reducing jitter in IP packet transmission in a Diffserv network having ingress and egress Border Routers and using premium service, expedited forwarding and source route option, recognize incoming packets which have firm jitter requirements. The program verifies if a recognized packet has an entry in the forwarding cache for its IP destination address. If affirmative, the identified packet is sent to the next hop. If not, the program checks to see if a route table entry exists for the specified destination address. If affirmative, the route table entry is stored in the forwarding cache, and the packet is sent on its way. Otherwise, the program uses special filters to extract and select the shortest and fastest path to an egress border router to match the destination address; a list of selected router addresses is inserted as part of a source route option. All intermediate routers receiving a packet with the strict source route option set will forward the packet to the first address in the strict source option list. Subsequent packets which follow after the recognized packet and are bound to the same destination address will be sent in the same path as the identified first packet with the source route option turned off. The method ensures reduced jitter for packets having firm jitter requirements in a network using either static or dynamic routing. The invention also teaches a memory and an algorithm using the method.

Some embodiments of the invention provide a method of routing. The method selects a net with a set of routable elements in a multi-layer layout region. In some embodiments, the method identifies a route for the net based on different congestion goals on different layers. In other embodiments, the method identifies a route for the net based on different congestion goals between different layer pairs. In some embodiments, the method identifies a route for the net based on both the different congestion goals on different layers and between different layer pairs.