Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Computation of a shortest inter-domain te-lsp across a set of autonomous systems

一种标签交换路径、流量工程的技术，应用在流量工程标签交换路径计算最短路径领域，能够解决LSR或PCE没有知识等问题

Active Publication Date: 2008-02-27
CISCO TECH INC
View PDF3 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Neither the headend LSR nor any individual PCE has sufficient knowledge to compute the path, where the LSR or PCE may not have the required knowledge if the destination does not reside in a directly connected domain

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Computation of a shortest inter-domain te-lsp across a set of autonomous systems
  • Computation of a shortest inter-domain te-lsp across a set of autonomous systems
  • Computation of a shortest inter-domain te-lsp across a set of autonomous systems

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Figure 1 is a schematic block diagram of an exemplary computer network 100 including autonomous systems AS1 and AS5 interconnected by autonomous systems AS2, AS3 and AS4 as shown. An autonomous system (AS) is defined here as a group of intermediate nodes (eg, intra-domain routers) within a network that are subject to the same authority and implement one or more intra-domain routing protocols. Although each AS is shown as an autonomous system, those skilled in the art will appreciate that ASs may also be configured as routing domains or other networks or subnetworks. Autonomous system AS1 includes intra-domain routers, such as border routers ASBR1 and ASBR2, through which communications (eg, data packets) can enter and leave the AS to other AS border routers (not shown) in AS2 and AS4. Furthermore, within AS1 and AS5, there are exemplary intra-domain routers A and B, respectively. Those skilled in the art will understand that any number of routers may be used in the ASs...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of differ- ent remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along ''domain routes''). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.

Description

technical field [0001] The present invention relates to computer networks, and more particularly to computing shortest paths for Traffic Engineering (TE) Label Switched Paths (LSPs) traversing autonomous systems in computer networks. Background technique [0002] A computer network is a collection of geographically distributed nodes interconnected by communication links and network segments used to transfer data between end nodes such as personal computers and workstations. Many types of networks are available, ranging in type from local area networks (LANs) to wide area networks (WANs). A LAN typically connects nodes by dedicated private communication links located in the same general physical location, such as a building or campus. WANs, on the other hand, typically connect geographically dispersed nodes over long-distance communication links, such as common carrier telephone lines, optical paths, Synchronous Optical Network (SONET) or Synchronous Digital Hierarchy (SDH) ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F15/173
CPCH04L45/12H04L45/42H04L45/04H04L45/50
Inventor 让-菲利普·瓦瑟尔斯特凡诺·B·普雷维蒂
Owner CISCO TECH INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com