EP1762060A1 - Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles - Google Patents

Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles

Info

Publication number
EP1762060A1
EP1762060A1 EP05754546A EP05754546A EP1762060A1 EP 1762060 A1 EP1762060 A1 EP 1762060A1 EP 05754546 A EP05754546 A EP 05754546A EP 05754546 A EP05754546 A EP 05754546A EP 1762060 A1 EP1762060 A1 EP 1762060A1
Authority
EP
European Patent Office
Prior art keywords
routing
node
routes
nodes
central
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
EP05754546A
Other languages
German (de)
English (en)
Inventor
Thomas Engel
Christoph Reichert
Joachim Charzinski
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.)
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Siemens AG
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 Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV, Siemens AG, Nokia Siemens Networks GmbH and Co KG filed Critical Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Publication of EP1762060A1 publication Critical patent/EP1762060A1/fr
Withdrawn legal-status Critical Current

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
    • 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/42—Centralised routing

Definitions

  • the invention relates to a method and a device for calculating a routing table for routing within a communication network formed with nodes and links.
  • next node determines from the routing table present to the node, which relates the destination addresses contained in the packets to next hops.
  • the routing tables are set up or calculated by means of routing protocols. Examples of such routing protocols are the Open Shortest Path First (OSPF) protocol used on the Internet and used in conjunction with the IP (Internet Protocol) protocol and the IS / IS (Intermediate System to Intermediate System) protocol , Routing based on destination addresses specified in the packets is also referred to as "destination-based routing" or routing based on destination addresses.
  • OSPF Open Shortest Path First
  • IP Internet Protocol
  • IS / IS Intermediate System to Intermediate System
  • the object of the invention is to optimize the calculation of routing tables for communication networks formed with nodes and links.
  • the object is achieved by the subject matters of the independent claims 1 and 10.
  • the invention is based on the idea of carrying out part of the calculations for setting up routing tables on a server.
  • the following is a simplified assumption of a server and its calculations are called central calculations, although the
  • a central calculation of routes is carried out between in each case one network-internal start and end node.
  • start and end nodes are nodes of the network, that is, edge nodes or inner nodes.
  • For traffic which is routed to a destination outside the communication network it makes sense to use one of the edge nodes of the communication network as the end node, from which the traffic is transmitted in the direction of the destination to another network.
  • Information about the centrally calculated routes are communicated to a node of the network, for example by means of a communication protocol. This information consists e.g. from the specification of the next hop for the routing to an edge node.
  • the node calculates by means of a routing protocol, for example the OSPF protocol or the IS / IS protocol, the entries for a Routingtabel ⁇ le.
  • a routing protocol for example the OSPF protocol or the IS / IS protocol
  • destination addresses learned via the routing protocol of packets to be transported are assigned to the centrally calculated network-internal routes.
  • This mapping can be done using unique router IDs, such as the 32-bit router ID described in the OSPF Standard RFC2328.
  • the information transmitted to the router does not necessarily include complete routes. In principle, the information about the calculated routes can be limited to the information needed for an assignment of
  • Destination addresses to routes is necessary. How extensive the information is in the individual case depends on the routing used. In conventional IP networks, e.g. the next hops are routed to an end node within the network (e.g., an edge node from which a further route to another network occurs) and the respective end node is specified.
  • an end node within the network e.g., an edge node from which a further route to another network occurs
  • the invention has the advantage that the calculation of the routes takes place centrally and thus the information relating to the routes can be forwarded to a plurality of nodes, for example all nodes of the network, so that the corresponding computational effort is only once and not for all nodes using the routes are incurred.
  • the invention is particularly advantageous in the use of multipath routing, because in this case the route calculation is considerably more complex and thus more computational effort can be saved. Information that is used only for route calculation, for example a traffic matrix, does not need to be distributed to the individual nodes in this way. In the case of multipath routing, a central determination of traffic distribution weights can also be carried out.
  • the traffic distribution weights serve to control the distribution of the traffic to the alternative routes of the multipath routing and can be used at the router for the determination or calculation of routing tables.
  • each node can continue to react autonomously in the event of a fault, ie Thus, from a failed connection to a neighbor, the remaining routes of the multipath routing have to be changed, that is, they do not depend on a quick reaction of the central calculations.
  • the invention also encompasses a device for calculating a routing table within a communication network formed with nodes and links, which has a central device (eg a server) with means for calculating routes between end nodes of a network and at least one node
  • a central device eg a server
  • Means for creating a routing table by means of a routing protocol are provided for communication between the central device and the respective node, which comprise, for example, a communication protocol. If the network works with multipath routing, means for determining traffic distribution weights in the central device and means for transmitting the distribution weights to the nodes can also be provided.
  • NCS Network Control Server
  • routers or nodes A through G are shown which form part of a network.
  • the figure describes how the router D computes a part of its routing table with the aid of routing information provided by the central device NCS.
  • Routers A, F, G and E represent next hops or nodes directly connected to router D.
  • Routers B and C are edge routers of the network over which traffic is routed to other networks.
  • the dotted links connecting these two edge routers B and C to the other illustrated routers of the network indicate dropped network elements (roughness). ter and links) via which traffic can be forwarded to the edge nodes.
  • the table T1 contains information which is transmitted from the central device NCS to the node D. This information is intended for multipath routing, which provides at least two alternative next hops of D for the transmission of traffic to a destination.
  • the central device specifies to the node that traffic to be transmitted to the edge node B is to be transmitted 20% over the next hop F and 80% over the next hop G. Traffic to edge node C is to be transferred 60% over the next hop E and 40% over the next hop G.
  • addresses Pl to P3 of networks are shown, which are accessible via the edge router or edge node C.
  • the addresses P4 to P6 of networks which can be reached via the edge router B are shown in the table T3.
  • the representation of the addresses follows the usual convention for the representation of IP addresses, whereby the address and the mask (behind the slash) necessary for the interpretation of the address as network address are specified.
  • the information about the networks which can be reached via respective edge routers is propagated through the network.
  • the router D learns which networks it can reach via the edge routers B and C, respectively. It therefore assigns these network addresses to next hops in accordance with the information transmitted by the central device.
  • the resulting routing table FIB (FIB: stands for forwarding information base) is shown in the figure.
  • the network addresses Pl to P3 are assigned the next hops E and G and the network addresses P4 to P6 the next hops F and G.
  • the table FIB shown in the figure shows only a very small section of a realistic routing table. Actual routing tables are far more extensive.
  • the invention requires only a simple assignment of the network addresses available to the edge routers the central device are made predetermined next hops or vor ⁇ given routes. There is no need to complete route calculation at each of the nodes.

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é et un dispositif (NCS) permettant un calcul réparti de tables de routage pour un routage dans un réseau de communication constitué de noeuds (A...G) et de liaisons. Le calcul des routes à utiliser est effectué de manière centrale. Des informations concernant les routes à utiliser sont transmises à un réseau (D) qui calcule, sur la base de ces informations, une table de routage (FIB) par affectation d'adresses de paquets aux routes. Le calcul centralisé des routes accroît l'efficacité des ressources eu égard à la charge de calcul. Cette réduction de la charge de calcul est notamment perceptible dans les réseaux à routage par trajets multiples dans lesquels le calcul de tables de routage (FIB) est particulièrement lourd, une nouvelle réduction de la charge étant en outre possible par le calcul central des poids de répartition.
EP05754546A 2004-06-30 2005-06-28 Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles Withdrawn EP1762060A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004031717A DE102004031717A1 (de) 2004-06-30 2004-06-30 Effiziente Berechnung von Routingtabellen für ein Routing anhand von Zieladressen
PCT/EP2005/053017 WO2006003141A1 (fr) 2004-06-30 2005-06-28 Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles

Publications (1)

Publication Number Publication Date
EP1762060A1 true EP1762060A1 (fr) 2007-03-14

Family

ID=34971473

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05754546A Withdrawn EP1762060A1 (fr) 2004-06-30 2005-06-28 Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles

Country Status (5)

Country Link
US (1) US20100329154A1 (fr)
EP (1) EP1762060A1 (fr)
CN (1) CN1998196A (fr)
DE (1) DE102004031717A1 (fr)
WO (1) WO2006003141A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8811158B1 (en) * 2012-02-29 2014-08-19 Juniper Networks, Inc. Fast reroute for common network routes
US9479437B1 (en) * 2013-12-20 2016-10-25 Google Inc. Efficient updates of weighted cost multipath (WCMP) groups
GB201706475D0 (en) 2017-04-24 2017-06-07 Microsoft Technology Licensing Llc Communications network node
US10411990B2 (en) * 2017-12-18 2019-09-10 At&T Intellectual Property I, L.P. Routing stability in hybrid software-defined networking networks

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6041049A (en) * 1997-05-06 2000-03-21 International Business Machines Corporation Method and apparatus for determining a routing table for each node in a distributed nodal system
JP3623680B2 (ja) * 1999-01-11 2005-02-23 株式会社日立製作所 経路検証機能を備えるネットワークシステム、経路管理装置及び交換機
US6363319B1 (en) * 1999-08-31 2002-03-26 Nortel Networks Limited Constraint-based route selection using biased cost
DE19983979T1 (de) * 1999-09-06 2002-08-01 Ericsson Telefon Ab L M System und Verfahren zum Weiterleiten von Zwischenknoteninformation innerhalb eines Kommunikationsnetzes
CA2310872A1 (fr) * 1999-12-22 2001-06-22 Nortel Networks Corporation Commutation de protection automatique au moyen de la redondance au niveau liaison en soutien a la commutation d'etiquettes multi-protocole
EP1133112B1 (fr) * 2000-03-10 2005-02-09 Siemens Aktiengesellschaft Procédé pour distribuer la charge du transfert des données d'un réseau de communication et réseau de communication
JP3479834B2 (ja) * 2000-09-04 2003-12-15 日本電気株式会社 無線アクセスネットワークの経路制御システム及び方法
WO2002046947A1 (fr) * 2000-12-04 2002-06-13 Rensselaer Polytechnic Institute Systeme de gestion proactive de routage de reseau
US7111074B2 (en) * 2001-07-24 2006-09-19 Pluris, Inc. Control method for data path load-balancing on a data packet network
US20040006640A1 (en) * 2002-07-03 2004-01-08 Inderieden Daniel W. Notification to routing protocols of changes to routing information base
JP2004129156A (ja) * 2002-10-07 2004-04-22 Ntt Docomo Inc 経路制御システム、経路制御装置、転送装置及び経路制御方法

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO2006003141A1 (fr) 2006-01-12
CN1998196A (zh) 2007-07-11
DE102004031717A1 (de) 2006-01-26
US20100329154A1 (en) 2010-12-30

Similar Documents

Publication Publication Date Title
EP2171935B1 (fr) Procédé, réseaux et noeuds de réseau pour la sélection d'un itinéraire
DE60022602T2 (de) Verfahren, Vorrichtung und Computerprogramm um Topologiedaten eines Link State Routing Netzwerkes aktuell zu halten
DE60026238T2 (de) Auf vorspezifizierter Dienstgüte basierender Verbindungsaufbau durch ein Kommunikationsnetz
DE69727930T2 (de) Zusammenfassung von verbindungen in vermittlungskommunikationsnetzen
DE60035969T2 (de) Verfahren und Anordnung zur Behandlung der Informationpakete durch vom Nutzer auswählbare Relaisknoten
DE60014138T2 (de) System um etikettierte wegelenkungsbäume zu kommunizieren
EP1623541B1 (fr) Procede et noeuds de reseau pour une distribution du trafic autoregulee, autonome et decentralisee dans un reseau multivoie
DE102011112852A1 (de) Zugangsnetz-Doppelwegkonnektivität
EP3577871B1 (fr) Procédé et dispositif permettant l'orientation modulaire d'un flux avb
EP2137897A1 (fr) Procédé de détermination d'une valeur de distance de trajectoire et noeud réseau
EP1588531A1 (fr) Procede d'adaptation des ponderations de liaisons dans l'optique d'une repartition optimisee du trafic
DE602005000724T2 (de) Wegleitung in einem Kommunikationsnetzwerk
EP1532780B1 (fr) Acheminement d'intra-domaine efficace dans des reseaux de commutation par paquets
WO2005013564A1 (fr) Procede de routage inter-domaine par trajets multiples
EP1762060A1 (fr) Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles
EP1894363B1 (fr) Procede et element de reseau de communication independant destines a determiner des routes etiquetees dans un tel element de reseau de communication
EP2775677A1 (fr) Procédé de transmission de paquets de données dans un réseau de données à partir d'une pluralité de noeuds de réseau
EP1597872B1 (fr) Procede et noeuds de reseau pour determiner des voies de transmission par trajets multiples dans un reseau de communication a commutation par paquets
EP1992127B1 (fr) Système de communication, ordinateur et procédé de détermination d'un protocole de communication à employer dans un système de communication
DE60027423T2 (de) Kommunikationseinrichtungen
DE10047131B4 (de) Verfahren zum Betreiben eines Zugangsnetzes
DE10328620B4 (de) Verfahren und Netzknoten zur Wegesuche in einem paketvermittelnden Kommunikationsnetz
WO2004066568A1 (fr) Procede pour devier des paquets de donnees en cas de detection locale de defaillances de liaison par routage multiple
DE69933082T2 (de) Leitweglenkungsverfahren von Paketen in einem Kommunikationsnetz
EP2048834A1 (fr) Procédé, réseaux et noeuds de réseau pour la sélection d'une route

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: 20061207

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 MC NL PL PT RO SE SI SK TR

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

Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWAN

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

DAX Request for extension of the european patent (deleted)
RAP3 Party data changed (applicant data changed or rights of an application transferred)

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

Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWAN

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

Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWAN

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

17Q First examination report despatched

Effective date: 20080717

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: 20081128