[go: up one dir, main page]

WO2003017584A2 - Etablissement signalise de sequences de connexion - Google Patents

Etablissement signalise de sequences de connexion Download PDF

Info

Publication number
WO2003017584A2
WO2003017584A2 PCT/DE2002/002876 DE0202876W WO03017584A2 WO 2003017584 A2 WO2003017584 A2 WO 2003017584A2 DE 0202876 W DE0202876 W DE 0202876W WO 03017584 A2 WO03017584 A2 WO 03017584A2
Authority
WO
WIPO (PCT)
Prior art keywords
connection
tunnel
sequence
label
virtual
Prior art date
Application number
PCT/DE2002/002876
Other languages
German (de)
English (en)
Other versions
WO2003017584A3 (fr
Inventor
Heinrich Hummel
Original Assignee
Siemens Aktiengesellschaft
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2003017584A2 publication Critical patent/WO2003017584A2/fr
Publication of WO2003017584A3 publication Critical patent/WO2003017584A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems

Definitions

  • a nmeldungsussistand relates to a method Einrich ⁇ th of connections in a connection network are connected in the connecting nodes via links.
  • VN virtual communication networks
  • m bidirectional
  • MPLS multi protocol label switching
  • All telecommunication networks are physical "partial mesh * networks".
  • a full mesh “fill mesh * would be nonsensical.
  • a certain number of connections or tunnels can be established on a physical network, which as a whole each result in a so-called virtual network.
  • This virtual network comprises a total of n nodes. With full meshing of the virtual network one would need n * (n-l) / 2 bidirectional connections or n * (n-l) unidirectional connections.
  • This “virtual fill mesh” is still too complex (too expensive).
  • a somewhat more complex "Karo" network only requires 2 * n bidirectional connections or 4 * n unidirectional connections.
  • VSPN Virtual Service Provider Network More precisely: The connection network between the n switches / routers of a service provider, which bridges the network of another service provider. This connection network is also called the Carrier's Carrier Network.
  • MPOA Multi-Protocol-over-ATM
  • a lot of ATM-SVC connections are used to establish an ATM network as a kind of transit network for the Internet to use.
  • the ATM switches are also connected to Internet routers. IP packets are transported in the form of ATM cells through the ATM network in order to then forward them as IP packets in an IP network.
  • Previous solutions a) fill mesh ie n * (nl) / 2 SVCs, or b) SVC management, which can set up a maximum of m SVCs. If a SVC is required that does not yet exist, it will be set up if the maximum m has not yet been reached. Otherwise, either the transfer request rejected or it is broken down to create an existing SVC to "place * - about an SVC has the relative little Vehrerieslast.
  • partial mesh * the user data to be transported must pass through a certain sequence of connection tunnels in order to arrive at a predetermined destination node.
  • the subject of the application is based on the problem of producing a quasi full mesh, even if the full For example, for reasons of savings, it is far below the minimum .
  • connection ⁇ will stretch to sequences of connecting tunnels built and used as a transit tunnel, in which case consequences of virtuel ⁇ len links can be run through the data transport.
  • the subject of the application advantageously saves a lot of tunnel connections.
  • Such a sequence can in turn be viewed as a tunnel.
  • "Structure * or" structure sequence * should mean: Tunnel link settings are made (label switching entries) in such a way that the user data stream can change the individual tunnels just as quickly and easily as the lines within a tunnel.
  • FIG. 1 shows an abstracting representation of a switching network in which the invention can be implemented and 2 special features according to the invention in the formation of sequences of connecting lines.
  • the thin lines represent physical connection ⁇ stretch and their nearest physical router of a V determination network.
  • the individual connections / tunnels can be of various technologies:
  • ISDN connection ISDN connection
  • ATM-SVC frame relay SVC
  • MPLS-LSPs Internet tunnels according to the IETF standards such as IPSEC, L2TP, PPP, GRE, IP in IP.
  • connection / tunnel sequence established by signaling can be technology heterogeneous
  • a connection / tunnel sequence established by signaling is independent of the transmission standard (s) used.
  • connection / tunnel sequences can be set up: point-to-point sequence, point-to-multipoint sequence, multipoint-to-point sequence.
  • Point-to-multipoint The user data through the tree-like tunnel sequence set up flow from one transmitter tunnel exit point to several receiver tunnel end points.
  • Multipoint-to-point The user data through the tree-like tunnel sequence set up flow from several transmitter tunnel exit points to a receiver tunnel end point.
  • a tunnel of a higher hierarchical level consists of a linear sequence of element tunnels of a lower hierarchical level.
  • the element tunnels of a tree-like tunnel sequence can e.g. Tunnels of the 1st hierarchical level (VPN over the physical network of a service provider.)
  • the element tunnels of a tree-like tunnel sequence could also be of a higher hierarchical level (VPN over a virtual service provider network).
  • Each element tunnel includes identifying and characterizing data of the "globally significant *” and "locally significant *” types.
  • the globally significant data may include:
  • Ru router address of the upstream tunnel end point (where the user data go into the tunnel),
  • Rd router address of the downstream tunnel end point (where the user data leaves the tunnel),
  • Color abstract summary of all characterizing properties such as bandwidth, QoS (Quality of Service), purpose like "for voice * or” for data *, etc.
  • QoS Quality of Service
  • the (different) color becomes important especially when it is there are several parallel tunnels with identical soot and identical round.
  • This LSP-ID is, according to the invention, the router at the downstream end the tunnel sequence.
  • the globally significant data from many tunnels may - statically or dynamically - be passed on to a process that may determine certain tunnel sequences from them.
  • tunnel sequence that is built up (which consists of these element tunnels) also receives such globally and locally significant data.
  • the downstream router issues a label. He tells the upstream router "with this label you should send me the user data packets *.
  • the tunnel sequences are set up by signaling.
  • non-branching / non-uniting tunnel sequence - i.e. a linear tunnel sequence - is basically the same as building a tunnel at the very first hierarchical level.
  • a tunnel element us a VPN be constructed uniting doing ⁇ nelsequenzen that - no matter what the output node ⁇ beginning - the user data, to a predetermined destination node are transported.
  • a hierarchical multi-point-to-point LSP enables the following:
  • Any node S sends data intended for Z by giving these two MPLS labels.
  • the top label in the label stack is responsible for label switching at the next physical node of the first virtual link, i.e. it is used in the next physical node to determine the physical continuation link and the continuation label.
  • the lower label is carried transparently, i.e. unchanged, right through to the end of the first virtual link. There the upper label is removed and the lower label is used to access the following information: from the correct virtual follow-up link (in direction Z) the first physical line and its first label (which functions as the new upper label should greed. Furthermore, a new lower label, which should function as just described at the end of the second virtual link.
  • the upper label is a VPI (Virtual path identifier)
  • the lower label is a VCI (Virtual Channel identifier).
  • the virtual links are SVPs.
  • the tree- ⁇ -like effects of SVPs form a hierarchical multi ⁇ point-to-point SVC.
  • the upper label is a VCI
  • the lower label is a VPI.
  • the virtual links are SVCs.
  • the tree-like sequences of SVCs form a hierarchical multi-point-to-point SVP.
  • a unique ID is assigned to each virtual link. It consists of "address of its ingress node + a unique number assigned by it itself". The IDs of two virtual links must be different even if they belong to different VNs.
  • a suitable virtual link in the form of its ID must also be known for each virtual link. Suitable means: they must both belong to the same VN (only having the same end point nodes should not be sufficient).
  • This assignment knowledge must in particular have and be able to evaluate the two end nodes of the respective virtual link, but also each node Z (or a VN for this central proxy server), which is to determine the tree of a hierarchical multi-point-to-point connection.
  • the destination node Z is calculated as the tree of virtual links (or can it from a central server-zBVN be expected ⁇ ).
  • a minimal number of setup messages (e.g. as many virtual links as there are adjacent to Z) are sent, and this is provided with source routing information that satisfies the upcoming branches.
  • these could be "unsolicited" Label_Mapping messages.
  • Node Z send out an "unsolicited" Label_Mapping message. It contains a suitable TREE ROUTE TLV which corresponds to the branches to be walked on. It also includes, for example, in a specially defined Passed_Virtual_Link-TLV the ID of the virtual link via which the user data should arrive at node Z.
  • the individual ER-HOP TLVs in the source routing information may always contain the IDs of two inverse virtual links, namely the ID of the uplink (in the direction S) and the ID of the virtual downlinks (towards Z).
  • the relevant (inverse) uplink may be any one, or may always be the first listed or one that is labeled "for data”.
  • a node K-down has received the label mapping message for the establishment of a hierarchical multi-point-to-point TLV and has to evaluate a very specific ER-HOP TLV (if x-links are to be combined in K-down, so are es x ER-HOP TLVs).
  • the ID of the uplink tells him the physical start line including the start label in order to convey the message, appropriately modified, label-switched via the uplink to the node K-up. Before doing this, however, he determines an available label V Incomng with regard to the entire virtual downlink, which he intends to communicate to the node K-up via label TLV.
  • the node K-down has received a label V outgoing itself via label TLV.
  • Node K-down take from the Passed_Virtual_Link-TLV of the self-received setup message the ID of the virtual link that it is to use to forward the user data in the Z direction.
  • K-down sends the label mapping on to K-up, where it writes in the Passed_Virtual-Link TLV the ID of the virtual link via which it intends to receive the user data from K-up. If x should unite virtual links in K-down, he determined for each of x "incoming" links analogous one available label V ⁇ ncomng and a LIB entry in wel ⁇ chem is:
  • each of the x different nodes K-up is informed of the ID of the respective virtual link via Passed_Virtual_Link-TLV, via which it is to send the user data to K-down.
  • n-1 setup messages are transmitted in chronological succession in order to build up exactly one branch to exactly one start node S in accordance with the "ADD PARTY / SETUP" concept of the ATM Forum.
  • the setup message is also an unsolicited label mapping message. It contains two types of source routing information
  • Passed_Virtual_Link-TLV contains the ID of the downlink that is inverse to the very last uplink of the former ER- TLVs, i.e. the ID of the virtual link that is already integrated in the hierarchical multi-point-to-point connection and in which the current extension branch should flow.
  • the former ER-TLV does not apply to those build-up messages that build a branch up to node Z.
  • the PasD_Virtual_Link-TLV then contains the ID of the downlink via which Z is to receive the user data.
  • the join message contains exactly one ER-TLV (Explicit Route TLV) whose ER-HOP TLVs are the IDs of the virtual links to be passed.
  • the label must be assigned according to independent mode - anything else would be nonsense given the existence of variants la) and lb). That
  • Each join message is similar to a label request, which makes a label assignment after each HOP and reports exactly one hop back towards node S (by means of a label mapping message) to make the appropriate LIB entry there.
  • a Passed_Virtual_Link-TLV may contain the ID of the virtual link (downlinks) that the join message has just used.
  • a node K-down which has just received it, will be able to determine the ID of an inverse virtual link (uplink) and can use it to send a label mapping message exactly one hop back towards S.
  • This will be equipped with a label TLV in which K-down has entered a label V lncom ⁇ n ⁇ which it has assigned itself according to the principle of independent modes. For its part, K-down waits for a label mapping message and expects the analog label V outgoing from there. • It also knows the ID of the virtual link leading directly in the direction of Z, and thus its start line p outgoing together with the start label P outgoing based on the first ERHOP TLVs obtained.
  • K-down forms the LIB entry, which can be accessed via video and which contains:
  • Quasi-full meshing is only required for the order n many virtual links.
  • the VN could be both a Virtual Service Provider Network (VSPN) and a Virtual Private Network (VPN). Furthermore: VSPNs could in turn operate VPNs.
  • the VSPN consists of a number of 1st degree virtual links.
  • a VPN operated by him consists of second-degree virtual links.
  • Such a 2nd degree virtual link generally consists of several 1st degree virtual links.
  • W outoing is the label for the first virtual link of the 1st degree from the relevant virtual link of the 2nd degree.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)

Abstract

Dans un réseau de connexion, dans lequel des noeuds de connexion sont reliés par l'intermédiaire de trajets de connexion formant des tunnels de connexion, des suites de plusieurs tunnels de connexion peuvent être établies sous forme de tunnels de transit au moyen d'informations de signalisation individuelles pour le transport de données par l'intermédiaire de suites de liens virtuels.
PCT/DE2002/002876 2001-08-07 2002-08-05 Etablissement signalise de sequences de connexion WO2003017584A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE10138715.6 2001-08-07
DE2001138715 DE10138715A1 (de) 2001-08-07 2001-08-07 Signalisierter Aufbau von Verbindungssequenzen

Publications (2)

Publication Number Publication Date
WO2003017584A2 true WO2003017584A2 (fr) 2003-02-27
WO2003017584A3 WO2003017584A3 (fr) 2003-07-10

Family

ID=7694647

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2002/002876 WO2003017584A2 (fr) 2001-08-07 2002-08-05 Etablissement signalise de sequences de connexion

Country Status (2)

Country Link
DE (1) DE10138715A1 (fr)
WO (1) WO2003017584A2 (fr)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2239032A1 (fr) * 1998-05-28 1999-11-28 Newbridge Networks Corporation Acheminement par telephoniste de circuits intelligents pvc (spvc) dans un reseau en mode connexion
US6985447B2 (en) * 2000-10-20 2006-01-10 Nortel Networks Limited Label switched traffic routing and signaling in a label switched communication packet network

Also Published As

Publication number Publication date
WO2003017584A3 (fr) 2003-07-10
DE10138715A1 (de) 2003-02-20

Similar Documents

Publication Publication Date Title
DE60103338T2 (de) Etikettvermitteltes Kommunikationsnetzwerk
DE69727930T2 (de) Zusammenfassung von verbindungen in vermittlungskommunikationsnetzen
DE60122457T2 (de) System und Verfahren zum Herstellen eines Kommunikationsweges auf einer ATM Plattform
DE69808753T2 (de) Mehrfachübertragungsvermittlung und -verfahren
DE69938570T2 (de) Verfahren und Vorrichtung für eine reservierte und dynamische Dienstqualität in einem Kommunikationsnetz
DE60037368T2 (de) Verfahren und Architektur zur Unterstüzung von mehreren Diensten in einem Etikettvermittlungsnetzwerk
DE60102047T2 (de) Etikettvermitteltes Kommunikationsnetzwerk
DE69916747T2 (de) Verfahren zur Bereitstellung von Dienstgüte in IP-Netzwerken für verzögerungsempfindliche Verkehr
DE69734258T2 (de) Anordnung und Verfahren zur hierarchischen Mehrfachsende-Leitweglenkung in einem ATM-Netz
DE60112700T2 (de) System und Verfahren zum Betreiben eines Netzwerks auf einer ATM-Plattform
DE102007022704B4 (de) Verfahren zum Einrichten eines logischen Verbindungspfads in einem verbindungsorientierten paketvermittelten Kommunikationsnetzwerk
DE69919569T2 (de) Verwaltung von verbindungsorientierten diensten über das internet-protokoll
DE102004008376B4 (de) Verfahren und System zum Schaffen einer garantierten Qualität des Dienstes in einem IP-Netz
DE60026238T2 (de) Auf vorspezifizierter Dienstgüte basierender Verbindungsaufbau durch ein Kommunikationsnetz
EP0929884B1 (fr) Procede de transmission de donnees dans un reseau de telecommunication et commutateur pour la mise en oeuvre de ce procede
DE60212404T2 (de) Mehrfachsendung in paketvermittelten punkt-zu-punkt-netzwerken
DE69637290T2 (de) Verbindungsreservation in Kommunikationsnetzwerken
DE60205748T2 (de) Mehrfachsendung in punkt-zu-punkt-paketdatennetzwerken
DE60108404T2 (de) Vorrichtung und Verfahren zum Ausrichten des Mehrfachdatenverkehrs in einem Ethernet-MAN
DE69737342T2 (de) Internet-NCP(Netzwerksteuerungspunkt) über ATM
DE60026006T2 (de) System zum Empfang von Mehrfachdaten
DE60128320T2 (de) Durchführung von MPLS auf einer ATM Plattform
EP0872090A1 (fr) Procede pour etablir des informations d'acheminement
DE10152011A1 (de) Verfahren und Vorrichtung zur Abbildung von Netzwerk-Headern auf MPLS-Header in Bearer-Architekturen
DE60012736T2 (de) Verfahren zur leitwegerzeugung für mehrfachdatenverkehr

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Kind code of ref document: A2

Designated state(s): US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SK TR

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FR GB GR IE IT LU MC NL PT SE SK TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2002767086

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 2002767086

Country of ref document: EP

122 Ep: pct application non-entry in european phase