Bibliografische Daten

Dokument EP000002257002A1 (Seiten: 26)

Bibliografische Daten Dokument EP000002257002A1 (Seiten: 26)
INID Kriterium Feld Inhalt
54 Titel TI [DE] Verfahren zur Auswahl eines optimalen mehrfach eingeschränkten Pfades zwischen zwei Netzwerkknoten über mehrere Netzwerkdomänen
[EN] A method for selecting an optimal multi-constrained path between two network nodes across multiple network domains
[FR] Procédé de sélection d'un chemin optimal à contraintes multiples entre deux noeuds de réseau dans des domaines de réseau multiples
71/73 Anmelder/Inhaber PA ALCATEL LUCENT, FR
72 Erfinder IN BUI DINH THAI, FR ; DJARALLAH NABIL BACHIR, FR ; DOUVILLE RICHARD, FR ; POUYLLAU HELIA, FR
22/96 Anmeldedatum AD 26.05.2009
21 Anmeldenummer AN 09305482
Anmeldeland AC EP
Veröffentlichungsdatum PUB 01.12.2010
33
31
32		 Priorität PRC
PRN
PRD

51 IPC-Hauptklasse ICM H04L 12/56 (2006.01)
51 IPC-Nebenklasse ICS H04L 12/753 (2013.01)
IPC-Zusatzklasse ICA
IPC-Indexklasse ICI
Gemeinsame Patentklassifikation CPC H04L 45/04
H04L 45/48
MCD-Hauptklasse MCM H04L 12/715 (2013.01)
MCD-Nebenklasse MCS H04L 12/753 (2013.01)
MCD-Zusatzklasse MCA
57 Zusammenfassung AB [EN] The present invention relates to a building method of a path between a network management element of a domain and another network management element of neighbor domains, a domain comprising a plurality of network nodes. It is characterized in that it comprises the steps of: - When none of the network nodes of said domain is a target network node: - Expanding a path tree from at least one network node of said domain towards entry network nodes of at least one neighbor domain ; - Applying node colors to path tree nodes to indicate whether a path tree node is or is not under the scope of a neighbor domain to which a request is to be forwarded ; and - Forward a request with said path tree expanded to at least one network management element of said neighbor domain.
56 Entgegengehaltene Patentdokumente/Zitate,
in Recherche ermittelt		 CT EP000001715636A1
US020060171320A1
56 Entgegengehaltene Patentdokumente/Zitate,
vom Anmelder genannt		 CT
56 Entgegengehaltene Nichtpatentliteratur/Zitate,
in Recherche ermittelt		 CTNP A. FARREL, A. AYYANGAR, J. P. VASSEUR: "Inter domain Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering - RSVP-TE extensions;", IETF STANDARD-WORKING-DRAFT, INTERNET ENGINEERING TASK FORCE, IETF, CH, vol. ccamp, no. 7, 1 September 2007 (2007-09-01), XP015051134, ISSN: 0000-0004 0;
AWDUCHE J MALCOLM J AGOGBUA M O'DELL J MCMANUS UUNET (MCI WORLDCOM) D: "Requirements for Traffic Engineering Over MPLS; rfc2702.txt", IETF STANDARD, INTERNET ENGINEERING TASK FORCE, IETF, CH, 1 September 1999 (1999-09-01), XP015008485, ISSN: 0000-0003 0;
MANAYYA KB WIPRO TECHNOLOGIES: "Constrained Shortest Path First; draft-manayya-constrained-shortest-path-first-00.txt", CONSTRAINED SHORTEST PATH FIRST; DRAFT-MANAYYA-CONSTRAINED-SHORTEST-PATH-FIRST-00.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, 20 February 2009 (2009-02-20), XP015061545 0;
PAN P; HAHNE E L; SCHULZRINNE H: "BGRP: a Tree-Based Aggregation Protocol for Inter-Domain Reservations", INTERNET CITATION, 6 December 1999 (1999-12-06), XP002345641, Retrieved from the Internet [retrieved on 20090907] 0
56 Entgegengehaltene Nichtpatentliteratur/Zitate,
vom Anmelder genannt		 CTNP
Zitierende Dokumente Dokumente ermitteln
Sequenzprotokoll
Prüfstoff-IPC ICP H04L 12/56
H04L 12/715
H04L 12/753
H04L 45/02
H04L 45/484
H04L 45/48
H04L 45/64