EP1825643A1 - Agregation de la signalisation de ressources inter-domaine - Google Patents

Agregation de la signalisation de ressources inter-domaine

Info

Publication number
EP1825643A1
EP1825643A1 EP05821733A EP05821733A EP1825643A1 EP 1825643 A1 EP1825643 A1 EP 1825643A1 EP 05821733 A EP05821733 A EP 05821733A EP 05821733 A EP05821733 A EP 05821733A EP 1825643 A1 EP1825643 A1 EP 1825643A1
Authority
EP
European Patent Office
Prior art keywords
domain
routing domain
routing
timer
route
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP05821733A
Other languages
German (de)
English (en)
Inventor
Thomas Engel
Thomas Schwabe
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Nokia Siemens Networks GmbH and Co KG
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 Nokia Siemens Networks GmbH and Co KG filed Critical Nokia Siemens Networks GmbH and Co KG
Publication of EP1825643A1 publication Critical patent/EP1825643A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/762—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
    • 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/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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/24—Multipath
    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
    • H04L47/785—Distributed allocation of resources, e.g. bandwidth brokers among multiple network domains, e.g. multilateral agreements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/827—Aggregation of resource allocation or reservation requests

Definitions

  • the invention relates to a method and a device for the efficient adaptation of resource reservations during route changes in the context of inter-domain routing.
  • Inter-domain routing, and the signaling required for this purpose, are particularly demanding where a large number of networks in a network network interact in an end-to-end transmission and at the same time guarantee quality criteria for the transmission should be.
  • the most important example of such a scenario is the transmission of real-time traffic over the Internet Protocol based on the IP protocol.
  • IP networks will also support applications that include the transmission of voice, video and data streams that require fast and reliable transport of IP packets.
  • Current development activities aim to ensure that future IP networks provide new transmission services in addition to the traditional "best effort" service, which will provide traffic with the bandwidths required and reliably transport IP packets to the receiver with little, little lag and very low packet loss rates.
  • a network equipped to implement these new transmission services is also referred to as NGN (Next Generation Network). Traffic that is transported as part of these services is also referred to as QoS (Quality of Service) traffic.
  • NGN Next Generation Network
  • Traffic that is transported as part of these services is also referred to as QoS (Quality of Service) traffic.
  • Today's Internet is an amalgamation of a growing number of individual IP networks, so-called autonomous systems (AS) or routing domains, managed and controlled by different organizations. At present, the Internet consists of more than 15,000 autonomous systems.
  • AS autonomous systems
  • QoS Quality of Service
  • aggregation is understood to be the pooling of reservations for different QoS traffic streams, that is to say of individual connections or of smaller aggregates, to a common reservation.
  • the traffic streams combined with the aggregation of reservations then form an aggregate for this purpose only a single reservation needs to be managed.
  • BGRP all reservations are grouped together to one destination.
  • SICAP additionally aggregates on intermediate sections of the end-to-end paths.
  • the aggregation of inter-domain reservations is necessary to limit the number of necessary reservations for QoS traffic between the very large number of different autonomous systems so that they can be transmitted and processed with reasonable computing and memory overhead in a suitable time. If the route changes to a destination, then the aggregates of the QoS traffic, which is transported via the changed route, must be resolved, since the route change can cause aggregates to lose their validity. After route changes, the traffic streams that have previously formed an aggregate can run on different routes and thus require new aggregates. Reasons for a route change may be the failure of a connection or overload on the connection used. In order to dissolve the aggregates, messages are sent to all the sources involved and the persons concerned have to adapt their reservations to the new routes.
  • a route resolution and consequent relocation or diversion of traffic in order to design the signaling as efficiently as possible.
  • a route change message eg UPDATE message of the BGP protocol
  • a route change message eg UPDATE message of the BGP protocol
  • the first routing domain is signaled a resource reservation adapted in accordance with the route change, which, for example, requests resources along an alternative route or new route.
  • These signaled resource reservations are aggregated and further communicated from the first routing domain, typically to a fourth routing domain, from which the route change was originally communicated to the first routing domain.
  • the invention has the advantage that resource reservations combined are further communicated and thus the signaling effort is optimized.
  • the number of signaling messages when dissolving and rebuilding an aggregate are thus significantly reduced.
  • the procedure according to the invention can lead to a delay of
  • the root of a route tree or a plurality of routes, which determines which route reservations can be aggregated is given by a routing domain that represents the end point of the routes, but it is also conceivable that it may not is a routing domain, but a network - for example, defined by a particular address - which can form part of a domain.
  • the destination is not necessarily the endpoint of routes, but may be a suitably chosen waypoint selected, along a route te, lying domain.
  • an aggregation of reservations that is not limited to the endpoints is also provided for in a context different from that of the application in the SICAP protocol.
  • the above embodiment of the subject invention can be advantageously extended, not only in the first routing domain, but also in other routing domains, which are notified of the route change on the first routing domain and which do not form the end point of a route, also a timer for aggregation of Resource reservations start.
  • a timer can also be started in the second routing domain; Preferably, however, timers are started in all routing domains, which are informed of the routing change from the first domain and which then receive resource re-reservations from more than one domain to the same destination.
  • Routing domain shorter than the duration of the timer to choose the routing domain then the aggregated route reservations are signaled.
  • such a tuning of the duration of the timer takes place for all routing domains that aggregate route reservations and with it Timers work. This results in a kind of timer cascade or timer interwall nesting, where the duration of the timer becomes shorter the further one approaches the endpoints or leaf nodes in the route tree. In general, the time it takes to run a timer will be shorter the later it starts. A vote of the timers on each other can be done by exchanging information that is part of the route change message, for example.
  • This information may include, for example, the duration of the timer, which, together with the transmission time of the message, which is often already provided by the protocol, for example in the form of a time stamp (Time Stamp) used to determine a suitable duration for the timer ,
  • a time stamp used to determine a suitable duration for the timer
  • Other solutions are also conceivable, for example, one can also imagine that there are empirical values for a suitable duration of timers in accordance with the distance of the routing domain from the tree located furthest forward in the tree. In this embodiment, for example, a domain which is located in third place with respect to the routing domains using the timers must only forward the information to a subsequent routing domain that it is located fourth, so that it selects the runtime provided for this position.
  • the invention also includes a device, e.g. B. a router, with means for performing a method according to the invention.
  • a device e.g. B. a router
  • FIG. 1 Routing domains with resource reservation aggregation for routing to a destination network N1.
  • FIG. 2 shows the routing domains shown in FIG. 1 with an aggregation according to the invention of new route reservations in the case of a change of routes leading to the destination N 1.
  • BGRP shows the disadvantages of the procedure according to the prior art.
  • the basic procedure for aggregation and deaggregation of BGRP and SICAP is very similar and thus has the same problem that is solved in this application. Therefore, only BGRP is considered below.
  • Fig. 1 shows an example of aggregation of reservations corresponding to BRGP.
  • each of the four autonomous systems AS4, AS5, AS6 and AS7 has each set up a reservation to the destination network N1.
  • the reservations start with the reservations Fl, F2, F3 and F4 between one of the autonomous systems AS4, AS5, AS6 and AS7 and AS2 or AS3 and are combined step by step into larger aggregates.
  • the autonomous system AS2 has combined the two reservations Fl and F2 from the autonomous system AS4 or the autonomous system AS5 to the aggregate A1 in the direction of AS1.
  • the autonomous system AS3 has combined the two reservations F3 and F4 from the autonomous system AS6 or the autonomous system AS7 to the aggregate A2.
  • the autonomous system ASl has again combined the two units Al and A2 into a larger aggregate A12. Based on the reservations Fl, F2, F3 and F4, this creates a tree-like system of reservations, which will be referred to below as a reservation tree.
  • Each of the autonomous systems AS4, AS5, AS6 and AS7 uses its reservations Fl, F2, F3 and F4 for the entire QoS traffic with destination addresses with the prefix 10.10.10.0/23.
  • the prefix 10.10.10.0/23 is split into the two prefixes 10.10.10.0/24 and 10.10.11.0/24, as shown in FIG. 2, and forwarded via the routing protocol to all affected autonomous systems corresponding routing messages. Then all autonomous systems (AS1-7), whose QoS traffic is part of the aggregate A12, must adapt their reservations to the prefix 10.10.11.0/23 to the new path via AS8. Via the routing protocol, at least one new route with the prefix 10.10.11.0/24 is made known, which leads from the autonomous system AS1 via the autonomous system AS8 to the network N1.
  • the autonomous system AS4 divides its reservation Fl into two reservations Fla and FIb corresponding to the traffic to the two prefixes 10.10.10.0/24 and 10.10.11.0/24, which are now reached via different routes.
  • the autonomous systems AS5, AS6 and AS7 react analogously and two new reservation trees are created.
  • the procedure according to the invention is illustrated below. After splitting the prefix 10.10.10.0/23 into the two prefixes 10.10.10.0/24 and 10.10.11.0/24, corresponding routing messages are forwarded via the routing protocol to all affected autonomous systems. Then all autonomous systems (AS1-7), whose QoS traffic is part of the aggregate A12, must adapt their reservations to the prefix 10.10.11.0/23 to the new path via the autonomous system AS8.
  • the autonomous system AS1 notices the changed routing at a time Tl.
  • the autonomous system ASl then sends to all neighbors whose reservations the aggregate A12 is made at time T1, i. to the autonomous systems AS2 and AS3, a message that causes them to check the reservations according to the changed routing and to respond with new reservations to the autonomous system AS1.
  • the autonomous system AS1 sends to all neighbors whose reservations the aggregate A12 is made at time T1, i. to the autonomous systems AS2 and AS3, a message that causes them to check the reservations according to the changed routing and to respond with new reservations to the autonomous system AS1.
  • the autonomous system ASl then answers the notified autonomous systems AS2 and AS3 and monitors with a timer the maximum response time.
  • the autonomous system ASl waits for four reservations, one each for the two prefixes 10.10.10.0/24 and 10.10.11.0/24 from the autonomous system AS2 and from the autonomous system AS3.
  • T2 be the time when either all expected responses have arrived or the timer has expired (the earlier of the two events).
  • ⁇ Tl T2 - Tl
  • the autonomous system ASl sets up two new aggregates according to the incoming reservations: one aggregate for the direct connection to Nl (prefix 10.10.10.0/24) and for the path via the autonomous system AS8 (prefix 10.10.11.0/24).
  • incoming signaling messages relating to reservations of the resolved aggregate A12 at time Tl during ⁇ Tl are not signaled further in the direction of the destination. Only new reservations that are not part of the resolved aggregate A12 at the time Tl are treated as usual.
  • the assignment of incoming reservations to the dissolved aggregate A12 is done via a unique identifier which was sent by the autonomous system AS1 with the resolution message to the autonomous systems AS2 and AS3 and is contained in the returning responses. Only at time T2 does the autonomous system AS1 signal the two new aggregates in the direction of the destination network N1.
  • the autonomous systems AS2 and AS3 react according to the invention as the autonomous system ASl on the message to rebuild the reservations of the aggregate A12. Only when the autonomous system AS2 has ever received a new reservation for the two prefixes 10.10.10.0/24 and 10.10.11.0/24 from AS4 and AS5, or a corresponding timer has expired, the autonomous system AS2 sends two reservation messages to the autonomous System ASl, one for each of the two prefixes.
  • the autonomous system AS3 reacts analogously. If no resources are to be reserved for a prefix, then a reservation can be made with the value 0 so as not to have to wait for the timer to expire.
  • the new procedure requires a total of 6 + 12 signaling messages (6 for dissolving the aggregates between AS4, AS5, AS6, AS7 and ASl + 12 for rebuilding). Without the new procedure, 6 + 24 signaling messages will be needed. In particular, the load of the autonomous system ASl decreases with the new method from 8 answers to 4, thus halving itself in this small example.
  • the autonomous system ASl starts a timer and sends a message to the autonomous systems AS2 and AS3.
  • Autonomous system AS2 then starts a timer again and sends a message to the autonomous systems AS4 and AS5.
  • the timer of the autonomous system AS2 will expire.
  • the autonomous system AS2 sends the reservations AIa and Alb to the autonomous system ASl. If the timers of the autonomous systems AS2 and AS3 comprise the same time period, then the timer has already expired from the autonomous system AS1, that is, the reservations from the autonomous system AS2 are no longer taken into account in the aggregation.
  • the autonomous system AS1 informs the autonomous system AS2 of the duration of its timer, and the autonomous system AS2 then selects a shorter duration, which allows the reservation messages to be sent before the autonomous system timer ASl expires.
  • This shorter duration of the timer takes into account the duration of the messages exchanged between the autonomous system AS1 and AS2.
  • the duration is then at least twice the duration of exchanged messages less (duration of the route change message + duration of the message with the aggregated reservations).

Landscapes

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

Abstract

L'invention concerne un procédé d'agrégation ou de regroupement de messages de signalisation pour l'adaptation de réservations de ressources nécessaire en cas de modifications de routage. Une modification d'un routage inter-domaine nécessitant une adaptation de réservations de ressources est indiquée à un premier domaine de routage (AS1). Ce premier domaine de routage (AS1) communique cette modification du routage inter-domaine à au moins un deuxième (AS2) et un troisième (AS3) domaine de routage. Des réservations de ressources adaptées d'après la modification de routage sont ensuite communiquées par le deuxième (AS2) et le troisième (AS3) domaine de routage au premier domaine de routage (AS1) au niveau duquel elles sont regroupées en vue d'être transférées à un quatrième domaine de routage (AS8). Dans un mode de réalisation perfectionné de l'invention, une horloge limitant la période pour le regroupement de messages de réservation est utilisée pour accroître l'efficacité du transfert de réservations modifiées. L'invention permet de modifier efficacement sans moyens complexes des réservations de ressources en cas de modifications de routage.
EP05821733A 2004-12-07 2005-12-07 Agregation de la signalisation de ressources inter-domaine Withdrawn EP1825643A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004058927A DE102004058927B3 (de) 2004-12-07 2004-12-07 Aggregation der inter-domain Ressourcen-Signalisierung
PCT/EP2005/056550 WO2006061394A1 (fr) 2004-12-07 2005-12-07 Agregation de la signalisation de ressources inter-domaine

Publications (1)

Publication Number Publication Date
EP1825643A1 true EP1825643A1 (fr) 2007-08-29

Family

ID=35623695

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05821733A Withdrawn EP1825643A1 (fr) 2004-12-07 2005-12-07 Agregation de la signalisation de ressources inter-domaine

Country Status (6)

Country Link
US (1) US20080107127A1 (fr)
EP (1) EP1825643A1 (fr)
CN (1) CN101073229A (fr)
CA (1) CA2591302A1 (fr)
DE (1) DE102004058927B3 (fr)
WO (1) WO2006061394A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101247345B (zh) * 2008-03-24 2010-12-08 中兴通讯股份有限公司 路由域的分割和合并方法
EP2146465A1 (fr) * 2008-07-15 2010-01-20 Deutsche Thomson OHG Procédé de gestion de transmission de données selon une qualité de service dans un ensemble de réseau et système de réseau informatique

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6538416B1 (en) * 1999-03-09 2003-03-25 Lucent Technologies Inc. Border gateway reservation protocol for tree-based aggregation of inter-domain reservations
US6636895B1 (en) * 1999-10-13 2003-10-21 Nortel Networks Limited System, device, and method for distributing multicast routing information in a protocol independent multicast network
EP1453250A1 (fr) * 2003-02-28 2004-09-01 Siemens Aktiengesellschaft Procédé pour une réaction rapide à une rupture de connection entre deux domaines de routage

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2006061394A1 *

Also Published As

Publication number Publication date
WO2006061394A1 (fr) 2006-06-15
CN101073229A (zh) 2007-11-14
DE102004058927B3 (de) 2006-05-18
US20080107127A1 (en) 2008-05-08
CA2591302A1 (fr) 2006-06-15

Similar Documents

Publication Publication Date Title
DE60026238T2 (de) Auf vorspezifizierter Dienstgüte basierender Verbindungsaufbau durch ein Kommunikationsnetz
DE69829203T2 (de) Paketnetzwerk
DE60022602T2 (de) Verfahren, Vorrichtung und Computerprogramm um Topologiedaten eines Link State Routing Netzwerkes aktuell zu halten
DE69927457T2 (de) Verfahren und Vorrichtung zur Cache-Speicherung von Informationen im Netzwerk
EP1133112B1 (fr) Procédé pour distribuer la charge du transfert des données d'un réseau de communication et réseau de communication
EP3577871B1 (fr) Procédé et dispositif permettant l'orientation modulaire d'un flux avb
EP1623541B1 (fr) Procede et noeuds de reseau pour une distribution du trafic autoregulee, autonome et decentralisee dans un reseau multivoie
WO2006013191A1 (fr) Procede et element reseau destines a la deviation de trafic, avec conservation de la qualite de service, dans des reseaux a convergence de route lente
DE60026006T2 (de) System zum Empfang von Mehrfachdaten
DE4434952A1 (de) Verfahren und Anordnung zur Adressierung von Teilnehmern in einem aus mindestens zwei Segmenten bestehenden Netzwerk
EP2119109A1 (fr) Procédé et dispositif de distribution d'un segment de données d'un flux de données à un groupe de plusieurs utilisateurs
WO2001054448A1 (fr) Procede et dispositif de commande d'acces a un reseau de communication
EP1825643A1 (fr) Agregation de la signalisation de ressources inter-domaine
DE60302865T2 (de) Bandbreitenmakler für ein Telekommunikationssystem
EP3906642B1 (fr) Procédé de communication de données, noeuds réseau, programme informatique et support lisible par ordinateur
DE10327545B4 (de) Verfahren und Vorrichtung zur Verarbeitung von Echtzeitdaten
EP1994676B1 (fr) Procédé de création d'un champ d'adresse, procédé et dispositif de transmission d'un message électronique et paquet de données
EP1376940A1 (fr) Procédé pour la transmission de données
DE102010042601A1 (de) Netzwerk
EP2016719B1 (fr) Procédé, agent de réseau et gestionnaire de bande passante pour la gestion des largeurs de bande disponibles pour des connexions entre des terminaux d'un réseau de communication orienté par paquets
DE10308954A1 (de) Übertragung von Daten in einem schaltbaren Datennetz
EP1757049A1 (fr) Procede pour mettre des ressources en reserve pour un routage inter-domaines avec attributs de qualite de service
EP1521497A2 (fr) Commutateur universel, procédé pour la réalisation d'une tâche de commutation, unité d'entrée, unité de sortie et unité de raccordement
WO2020169280A1 (fr) Procédé de transmission de données, appareil, programme d'ordinateur et support lisible par ordinateur
DE10047131A1 (de) Verfahren zum Betreiben eines Zugangsnetzes

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20070709

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS S.P.A.

17Q First examination report despatched

Effective date: 20071112

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20080326