EP1216540A1 - Modele de reseau a distribution recurrente du trafic ip/donnees - Google Patents

Modele de reseau a distribution recurrente du trafic ip/donnees

Info

Publication number
EP1216540A1
EP1216540A1 EP00955957A EP00955957A EP1216540A1 EP 1216540 A1 EP1216540 A1 EP 1216540A1 EP 00955957 A EP00955957 A EP 00955957A EP 00955957 A EP00955957 A EP 00955957A EP 1216540 A1 EP1216540 A1 EP 1216540A1
Authority
EP
European Patent Office
Prior art keywords
group
node
level
nodes
units
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
EP00955957A
Other languages
German (de)
English (en)
Other versions
EP1216540A4 (fr
Inventor
Michael S. Cox
Mickey Vucic
Bui Anh Jonathan Banh
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.)
Alcatel CIT SA
Alcatel Lucent SAS
Original Assignee
Alcatel CIT SA
Alcatel SA
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 Alcatel CIT SA, Alcatel SA filed Critical Alcatel CIT SA
Publication of EP1216540A1 publication Critical patent/EP1216540A1/fr
Publication of EP1216540A4 publication Critical patent/EP1216540A4/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
    • H04L45/12—Shortest path evaluation

Definitions

  • This invention relates to a method and arrangement for transferring network node status information between nodes.
  • Least cost routing examines the network topography to determine the shortest path between the source of a message and its destination. This method does not take account of the load status of the individual links of the chosen path so one or more of the links may become overloaded, preventing or disrupting the delivery of the message to the destination.
  • An alternative proposal is to take into account the load status of the links when determining the chosen path.
  • the system may determine all the shortest paths and make the path selection on the basis of the path with the links carrying the least traffic. To implement this, it is necessary for all the nodes to exchange load status information. As the number of nodes and links in a network grow, the implementation of this technique requires the exchange of a large amount of load status traffic, as each node broadcasts the load status of its associated links to the other nodes.
  • This specification discloses a network arrangement for a plurality of nodes each node being connected to one or more other nodes by corresponding node links, the network being arranged into a recursive hierarchy of units having two or more levels, the nodes being the units of the first level of the hierarchy, the units of higher levels of the hierarchy being formed by groupings of the units of the previous level, wherein the units of a level exchange a corresponding load status information.
  • This invention can be used in conjunction with the maximal flow techniques described in 44470/99 to determine suitable paths with available capacity.
  • Figure 1 is a schematic representation of a network in which the nodes are arranged in a recursive hierarchy, in accordance with an embodiment of the invention.
  • Figure 2 represents a load status monitor.
  • Figure 3 illustrates the message structure for exchanging information at different levels.
  • Figure 1 shows o network of nodes interconnected by links. According to the embodiment shown in Figure 1 , the nodes are linked in a logical hierarchy.
  • the nodes are formed into groups 10, 1 1 , 12, 20, 30.
  • the groups are interconnected by group links, for example 1 001 between node 105 of group 10 and node 1 21 of group 1 2.
  • the group links have a larger traffic capacity than node links.
  • Group links may equate to regional trunks within a particular carrier's network, or to links between different carriers, different countries or different global regions, for example.
  • the levels of the hierarchy start with the nodes.
  • the units of the second level are the groups of nodes.
  • the units L31 , L32, L33, of the third level are one or more groups, and the units of the fourth level, L41 , L42 are formed by aggregating units of the third level.
  • L41 is the aggregation of L31 and L33, while L42 encompasses L32.
  • the nodes are grouped on the basis of communication path topography so that there are relatively few links in the shortest path between any two nodes in a group.
  • a master node is assigned, 104, 1 1 3, 1 24, 201 , 301 .
  • each node in a group knows the load status of all the links in that group, the master node has the information to enable it to compile available capacity reports adapted to meet the requirements of the higher levels.
  • the physical node interconnections are illustrated at A in Figure 1 and B,C and D illustrate the conceptual logical links for the second, third and fourth levels of hierarchy.
  • the nodes of each group communicate load status information to each of the other nodes of the corresponding group.
  • the master nodes 1 04, 1 1 3, 1 24, of the network 1 shown at B are aggregated under the supervision of a single master node 1 1 3 which is assigned to the next higher level. Because, in the example shown, networks 2 and 3 have only one group, the same master 201 , 301 is used all levels.
  • the master nodes 1 1 3, 201 , 301 exchange information as to the overall load status of their associated networks 1 , 2, and 3.
  • the nodes at level C are then 1 1 3, 201 , 301 .
  • one of these two can be designated to manage the level D information exchange for both network 1 and network 2.
  • 201 and 301 can exchange information on the available capacity for the regions covered by L42 and L41 .
  • the nodes interchange information on traffic capacity at the node link level, within the groups.
  • Figure 2 shows an arrangement for monitoring the available capacity of the links connected to a node.
  • the traffic level monitor 50 checks the level of the contents of the buffers to measure the available capacity on the basis of the speed of the link associated with the buffer. The result of the monitoring is then reported to the other nodes in the same group.
  • the monitor may report whether or not a link has spare capacity, e.g. by checking whether a buffer's content is above or below a predetermined threshold.
  • the load status information exchange is carried out on the following basis.
  • the nodes within a group each notify the other nodes within that group of the load status of the links connected to the notifying node.
  • each group notifies the other groups of the load status of the links connected to the notifying group and a summary of the load status of internal paths within the group available for interconnecting the group links connected to the notifying group.
  • Group 1 2 is connected to Group 20 via link 1 201 , to Group 10 via link 1 001 , and to Group 1 1 via link 1 002.
  • the designated as a master node manages the interchange of information between the groups.
  • Table 2 shows the master nodes for each group. TABLE 2
  • the master nodes take part in the higher level exchanges but their number is progressively reduced by the recursive grouping.
  • the grouping is carried out on the basis of proximity in the sense of the number of links in the path.
  • this is not a strict rule at the node level because the nodes at either end of a group link are joined by a single link, while there may be more than 2 links between nodes within a group.
  • Other factors which influence grouping are geographical proximity and network ownership, as well as the traffic flows.
  • the nodes of network 2 may be geographically close to node of network 1 , but network 1 may be owned by a different carrier from network 2.
  • the nodes 201 and 301 exchange information on the available capacity between network 3 and network 2 and the transit capacity of the respective networks. This information would, for example, be based on the load status of links 1201 , 1301 , 1302, and the capacity across network 1 between link 1201 and the links 1 301 , 1 302. The information need only identify the maximum available capacity at the time, which varies in accordance with the load on the various network elements. For the sake of clarity the information will be given the following names:
  • Regional information may be, for example, the maximum available capacity between the "electrically" remotest groups.
  • electrically refers to the number of links and may include cable, optical and radio links.
  • Network information may be, for example, the capacity between the various networks, including the trans-network capacity between the network links 1 201 , 1 301 , 1 302.
  • Group information could be typified by the capacity between groups, including the trans-group capacity between the group links.
  • Node information is the information broadcast by a node to the other nodes within its group as the load status of the node and its associated links.
  • Group information can be deduced from node information.
  • Each node in a group knows the load status of all the nodes in that group.
  • the master none 1 24 in group 1 2 knows the status of group links 1 001 from node 1 21 , group link 1 002 from node 1 22, and group/network link 1 201 from node 1 23, as well as the status of all the internal nodes and links within group 1 2.
  • Node 1 24 can therefore calculate the available capacity across the group 1 2 between any pair of the links 1 201 , 1 001 , 1 002.
  • the master node 1 24 would use the "all practical paths" algorithm of our Australian Patent application 44470/99 (Docket No. 1 27045 SY) to calculate the trans-group capacity.
  • This group information is interchanged between the group master nodes 201 , 1 24, 1 1 3, 1 04, 301 at level B.
  • the units of the level B group domain are again grouped together, in this embodiment, into 3 network groups.
  • the network groups include two one member groups 201 and 301 , and one three member group 1 24, 1 1 3, 1 04.
  • the network master of each one member group is the member of the group, while 1 1 3 is designated as the master of the three member network group.
  • the three network masters from level B interchange network information at the level C network domain. The information relates to the network links connecting the respective networks, and the trans-network information relating to the capacity between the pairs of network links.
  • the network masters 201 , 1 1 3, 301 have been formed into two groups, resulting in two regional masters 201 , 301 , which exchange information on the available capacity between the two regions.
  • the regional master nodes 201 , 301 convey the regional link capacity information to the other regional nodes.
  • 301 conveys the information to 1 1 3.
  • 201 is the only regional node in the other regional grouping.
  • the regional nodes 201 , 1 1 3 and 301 are all network master nodes and they convey the inter-regional and inter-network capacity information to the network level nodes. In our embodiments, 1 1 3 conveys this information to the nodes 1 04, 1 24.
  • Each of the network level nodes 201 , 1 24, 1 1 3, 1 04, 301 is a group master and relays the higher level information to each of the nodes in its group.
  • the grouping of the units at each level means that the information exchanged at each level becomes more generalised.
  • a node has detailed capacity information about the other nodes in its group. Capacity information about other groups in its network, capacity information about the other networks in its region, and information about the interregional capacity.
  • the group master handles the interchange of node link capacity information.
  • Each node instead of broadcasting its load status to all the other nodes in the group, sends the information only to the group master, which collates the information from each node and relays the information to the other nodes.
  • the message from the group master preferably incorporates the higher level load status information, so that each node has an overall picture of the entire system.
  • the group master may broadcast a message including the information shown in Figure 3.
  • the first segment RL includes the load status at the regional link level D.
  • a second portion of the payload includes a number of segments of information on the inter-network load status NL.
  • a third portion includes segments GL on the inter-group load status, and the fourth portion includes segments NL on the load status of the nodes within the group.
  • this information can be flooded to other part of the network using other means, such as a broadcast or multicast mechanism.

Abstract

Afin d'éviter la nécessité pour tous les noeuds d'un réseau de connaître l'état de charge de tous les autres noeuds et de toutes les autres liaisons, les noeuds (101....303) sont organisés en groupes (10, 11, 12, 20, 30) de noeuds. Chaque groupe comprend un noeud (104, 124, 113, 201, 301) principal qui est incorporé dans un groupe logique d'ordre supérieur. Par un regroupement récurrent des unités de chaque groupe précédent, on crée une structure logique hiérarchique dans laquelle le nombre d'unité décroît à chaque niveau (A, B, C, D). Chaque noeud informe les autres noeuds de son état de charge et chaque unité de niveau supérieur échange également des informations avec les autres unités. Cette structure hiérarchique récurrente réduit sensiblement la quantité d'information relative à l'état de charge échangée dans le réseau.
EP00955957A 1999-09-06 2000-08-30 Modele de reseau a distribution recurrente du trafic ip/donnees Withdrawn EP1216540A4 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
AU47400/99A AU4740099A (en) 1999-09-06 1999-09-06 Recursive traffic distribution IP/data network model
AU4740099 1999-09-06
PCT/AU2000/001023 WO2001019019A1 (fr) 1999-09-06 2000-08-30 Modele de reseau a distribution recurrente du trafic ip/donnees

Publications (2)

Publication Number Publication Date
EP1216540A1 true EP1216540A1 (fr) 2002-06-26
EP1216540A4 EP1216540A4 (fr) 2005-01-05

Family

ID=3734255

Family Applications (1)

Application Number Title Priority Date Filing Date
EP00955957A Withdrawn EP1216540A4 (fr) 1999-09-06 2000-08-30 Modele de reseau a distribution recurrente du trafic ip/donnees

Country Status (3)

Country Link
EP (1) EP1216540A4 (fr)
AU (1) AU4740099A (fr)
WO (1) WO2001019019A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI20010552A0 (fi) 2001-03-19 2001-03-19 Stonesoft Oy Tilatietojen käsittely verkkoelementtiklusterissa
GB0707666D0 (en) * 2007-04-20 2007-05-30 Prolego Technologies Ltd Analysis of path diversity structure in networks using recursive abstraction
EP2963875B1 (fr) * 2014-07-02 2018-02-28 ABB Schweiz AG Procédé de traitement de flux de données comprenant des messages à durée critique d'un réseau d'énergie

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0660569A1 (fr) * 1993-12-22 1995-06-28 International Business Machines Corporation Procédé et système pour améliorer le temps de traitement de la sélection de route dans un réseau de commutation de paquets à grande vitesse
EP0859491A1 (fr) * 1997-02-18 1998-08-19 Alcatel Procédé de réacheminement dans des réseaux à structure hiérarchique
EP0876076A2 (fr) * 1997-04-30 1998-11-04 Nec Corporation Agrégation de la topologie utilisant un paramètre obtenu par négotiation entre noeuds
WO1999022492A1 (fr) * 1997-10-23 1999-05-06 Telefonaktiebolaget Lm Ericsson (Publ) Dispositif et systeme d'evaluation des donnees de trafic pour un reseau utilisant un acheminement dynamique

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0608279B1 (fr) * 1991-10-15 1997-01-22 Siemens Aktiengesellschaft Procede pour l'ecoulement du trafic non hierarchise dans un reseau de communication
JP2581011B2 (ja) * 1993-07-23 1997-02-12 日本電気株式会社 ローカルエリアネットワークのトラフィック制御システム
US5872773A (en) * 1996-05-17 1999-02-16 Lucent Technologies Inc. Virtual trees routing protocol for an ATM-based mobile network
US5905871A (en) * 1996-10-10 1999-05-18 Lucent Technologies Inc. Method of multicasting
DE19742582C1 (de) * 1997-09-26 1999-04-29 Siemens Ag Verfahren und Telekommunikationsanlage zum Verteilen von Daten in einem Telekommunikationsnetz

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0660569A1 (fr) * 1993-12-22 1995-06-28 International Business Machines Corporation Procédé et système pour améliorer le temps de traitement de la sélection de route dans un réseau de commutation de paquets à grande vitesse
EP0859491A1 (fr) * 1997-02-18 1998-08-19 Alcatel Procédé de réacheminement dans des réseaux à structure hiérarchique
EP0876076A2 (fr) * 1997-04-30 1998-11-04 Nec Corporation Agrégation de la topologie utilisant un paramètre obtenu par négotiation entre noeuds
WO1999022492A1 (fr) * 1997-10-23 1999-05-06 Telefonaktiebolaget Lm Ericsson (Publ) Dispositif et systeme d'evaluation des donnees de trafic pour un reseau utilisant un acheminement dynamique

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HUI XIE ET AL: "Performance analysis of PNNI routing in ATM networks: hierarchical reduced load approximation" MILCOM 97 PROCEEDINGS MONTEREY, CA, USA 2-5 NOV. 1997, NEW YORK, NY, USA,IEEE, US, 2 November 1997 (1997-11-02), pages 998-1002, XP010260807 ISBN: 0-7803-4249-6 *
See also references of WO0119019A1 *

Also Published As

Publication number Publication date
EP1216540A4 (fr) 2005-01-05
AU4740099A (en) 2001-03-08
WO2001019019A1 (fr) 2001-03-15

Similar Documents

Publication Publication Date Title
US6775295B1 (en) Scalable multidimensional ring network
CN102204188B (zh) 虚拟网络单元中的路由计算方法和主节点设备
CA2212278C (fr) Reperage de voie dans des reseaux de telecommunications
CN101227377B (zh) 一种实现跨域路径的共享风险链路组分离的方法
Komine et al. A distributed restoration algorithm for multiple-link and node failures of transport networks
US7002963B1 (en) Integrated switching and facility networks
US6188674B1 (en) Method and apparatus for packet loss measurement in packet networks
CN101605278B (zh) 分布式管控协同光网络中的自适应信令实现方法
US20070242607A1 (en) Method and system for controlling distribution of network topology information
US10021025B2 (en) Distributed determination of routes in a vast communication network
JPH077525A (ja) パケット交換のための通信ネットワーク、ネットワーク・ノード及び方法
CN101753455B (zh) 转发方法及装置
CN107547365A (zh) 一种报文传输路径选择方法及装置
CN106941455A (zh) 均衡负荷分担的方法及装置
US20160134524A1 (en) Distributed ROUTING CONTROL in a Vast Communication Network
US6744734B1 (en) Method for generating the optimal PNNI complex node representations for restrictive costs
US5844981A (en) Method and system of improved routing to WATS
CN1953409A (zh) 一种半网状网的组网方法及其系统
EP1216540A1 (fr) Modele de reseau a distribution recurrente du trafic ip/donnees
Kim et al. Adaptive packet routing in a hypercube
Garcia-Luna-Aceves et al. Analysis of routing strategies for packet radio networks
Bar-Noy et al. Topology distribution cost vs. efficient routing in large networks
CN101977159A (zh) 窄带网络带宽资源的管理方法
CN110139173A (zh) 一种降低光传送网端到端时延的网络分域方法
JPH04306938A (ja) ループ構造を有するマンハッタンストリートネットワーク

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

AK Designated contracting states

Kind code of ref document: A1

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

A4 Supplementary search report drawn up and despatched

Effective date: 20041118

RIC1 Information provided on ipc code assigned before grant

Ipc: 7H 04L 12/56 B

Ipc: 7H 04L 12/00 A

Ipc: 7H 04L 12/24 B

17Q First examination report despatched

Effective date: 20050217

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