摘要:
The present invention relates to a method and apparatus for reserving network resources for pseudo point-to-point connections by means of an idempotent resource reservation protocol. A method according to the invention comprises the steps of: - encoding, into a resource reservation signaling message (rsvp_path12, rsvp_resv12), a group identifier (GID0) assigned to a group of pseudo point-to-point connections (MS-PW4..7) established between a root node (T-PE0) and at least one leaf node (T-PE4..7), and a sub-group identifier (SGID12) assigned to a sub-group of pseudo point-to-point connections (MS-PW4..5) out of the group of pseudo point-to-point connections, which sub-group of pseudo point-to-point connections sharing a common network tunnel (TUN12) established between a previous signaling hop (S-PE1) and a next signaling hop (S-PE2), - aggregating, into the resource reservation signaling message, resource reservation signaling related to the sub-group of pseudo point-to-point connections by means of the group identifier and the sub-group identifier, - exchanging the resource reservation signaling message between the previous signaling hop and the next signaling hop.
摘要:
Un dispositif (D) est dédié à la génération de messages de routage pour un réseau de communication fonctionnant avec un plan de contrôle de type GMPLS. Ce dispositif (D) comprend des moyens de traitement (MT) chargés de générer des messages de routage contenant un attribut comportant chacun des données d'information d'ingénierie de trafic (TE) représentatives de caractéristiques inhomogènes de segments d'au moins une connexion entre équipements de réseau (N) lors de sa déclaration dans son domaine de routage, la représentation de cette connexion définissant une structure de type bus linéaire, appelée adjacence de transmission à accès multiple ou FAMA.
摘要:
According to embodiments, the disclosure relates to a networking node for exchanging messages in a communication network. The networking node comprises a message exchange module configured to exchange these messages based on object locators of objects within this communication network. An object locator further comprises geometric coordinates of a respective object in a negatively curved hyperbolic space and a distance between objects in this negatively curved hyperbolic space relate to a travel time of messages exchanged between these objects.
摘要:
Method for use in updating a routing table of a router of a plurality of routers, said routing table comprising the route(s) to be used for at least one destination, wherein update messages with routing information are sent between said plurality of routers, typically BGP routers, wherein the following steps are performed at the router: receiving of an update message containing a path or a withdrawal of a path for a destination; determining if the (withdrawn) path is associated with a path exploration event; deciding on the updating of the routing table taking into account the result of the determination.
摘要:
System for routing data units, comprising a routing information base (RIB) storing routing entries; a forwarding information base (FIB) storing forwarding information used to forward data units to a plurality of destinations; a computing function for computing for each destination of said plurality of destinations a normal shortest path and an alternate shortest path using routing information received from adjacent nodes and/or local information; said forwarding information base storing for each of said plurality of destinations normal forwarding information and alternate forwarding information necessary to forward a data unit using the normal shortest path and the alternate shortest path, respectively; a forwarding control means for indicating to at least one following hop of the alternate shortest path that the alternate forwarding information should be used for this data unit.
摘要:
The invention presents an improvement to the OSPF routing protocol with respect to the handling of opaque LSAs. The delay in the establishment of fully adjacent routers is avoided by proceeding with the adjacency determination even if the opaque link-state database is not synchronized. The present invention segments the synchronization process and adds, on top of the database synchronization process known from RFC 2328, a synchronization process dedicated to the opaque LSAs.
摘要:
The present invention relates to a method and apparatus for reserving network resources for pseudo point-to-point connections by means of an idempotent resource reservation protocol. A method according to the invention comprises the steps of: - encoding, into a resource reservation signaling message (rsvp_path12, rsvp_resv12), a group identifier (GID0) assigned to a group of pseudo point-to-point connections (MS-PW4..7) established between a root node (T-PE0) and at least one leaf node (T-PE4..7), and a sub-group identifier (SGID12) assigned to a sub-group of pseudo point-to-point connections (MS-PW4..5) out of the group of pseudo point-to-point connections, which sub-group of pseudo point-to-point connections sharing a common network tunnel (TUN12) established between a previous signaling hop (S-PE1) and a next signaling hop (S-PE2), - aggregating, into the resource reservation signaling message, resource reservation signaling related to the sub-group of pseudo point-to-point connections by means of the group identifier and the sub-group identifier, - exchanging the resource reservation signaling message between the previous signaling hop and the next signaling hop.