WO2010037420A1 - Procédé de routage dans un réseau extensible et élément de traitement - Google Patents

Procédé de routage dans un réseau extensible et élément de traitement Download PDF

Info

Publication number
WO2010037420A1
WO2010037420A1 PCT/EP2008/063198 EP2008063198W WO2010037420A1 WO 2010037420 A1 WO2010037420 A1 WO 2010037420A1 EP 2008063198 W EP2008063198 W EP 2008063198W WO 2010037420 A1 WO2010037420 A1 WO 2010037420A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
routing
network
path
physical network
Prior art date
Application number
PCT/EP2008/063198
Other languages
English (en)
Inventor
Simone Redana
Original Assignee
Nokia Siemens Networks Oy
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 Oy filed Critical Nokia Siemens Networks Oy
Priority to PCT/EP2008/063198 priority Critical patent/WO2010037420A1/fr
Publication of WO2010037420A1 publication Critical patent/WO2010037420A1/fr

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
    • H04L45/121—Shortest path evaluation by minimising delays
    • 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/20—Hop count for routing purposes, e.g. TTL
    • 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/26—Route discovery packet
    • 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/46—Cluster building
    • 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/64—Routing or path finding of packets in data switching networks using an overlay routing layer

Definitions

  • the present invention relates to the field of routing methods in a network, in particular computer networks. Further, the invention relates to a processing element, in particular for a network element in a computer network. Furthermore, the invention relates to a program element. Moreover, the invention relates to a computer-readable medium.
  • network elements e.g. controllers, application servers, databases, computers, gateways and the like are arranged at different locations and are connected with each other. All these elements of the computer network have to be connected to each other so that data can be forwarded from one element to the other.
  • a physical network is defined in the real world comprising the physical elements and connection lines between the same.
  • each of the network elements may have a nodeID associated with it, which nodeIDs form a logical network.
  • logical routing may provide an appealing solution for scalable computer or core networks.
  • logical routing e.g. the so called Pastry routing
  • each node and each message is identified by an address of m bits which may be computed by using a hash function.
  • the message is then routed through the node that provides the higher progression on the logical space towards the destination.
  • the logical routing does not provide any guarantee on the end-to-end delay, i.e. the time needed for passing data from one source network element to the destination network element. Therefore, this solution may not be applied to traffic flows with quality of service (QoS) constraints .
  • QoS quality of service
  • a routing method for a network comprising a plurality of nodes connected with each other and forming a physical network and having a logical network associated therewith is provided, wherein the method comprises determining a logical routing path from a first node to a second node taking into account information about the physical network.
  • the network may be a computer network.
  • the first node may be a source node and the second node may be a destination node of data to be transmitted.
  • a routing path between a source node and a destination node in the logical network may be determined based on proximity information of the nodes, wherein the proximity information relates to the physical network.
  • the routing path may comprise a plurality routing hops relating to a routing between two intermediate nodes.
  • a processing element for determining a routing path in a network comprising a plurality of nodes connected with each other and forming a physical network and having a logical network associated therewith, wherein the processing element comprises a determination unit adapted to determine a logical routing path from a first node to a second node taking into account information about the physical network.
  • a program element which, when being executed by a processor, is adapted to control or carry out a method according to an exemplary aspect of the invention.
  • a computer-readable medium in which a computer program is stored which, when being executed by a processor, is adapted to control or carry out a method according to an exemplary aspect of the invention .
  • the term "physical network” may particularly denote a real network comprising the nodes of the network, e.g. computers or servers, and the connection between the nodes, e.g. connection lines.
  • the term "logical network” may particularly denote a virtual network which is formed by nodeIDs of nodes arranged in logical space and the corresponding links between these nodeIDs .
  • logic routing path may particularly denote a path trough nodeIDs wherein the nodeIDs are linked with each other and forming a routing path or linking between the source node and the destination node, e.g. may correspond to a set of nodeIDs wherein the first nodeID corresponds to a source node, the intermediate nodeIDs correspond to intermediate nodes which are passed by the routing path, and the last nodeID corresponds to a destination node.
  • a logical routing process i.e. a routing in logical overlay networks, may lead to a scalable network or core network.
  • the information about the physical network relates to a distance in the physical network between the first node and another node of the physical network.
  • the another node may be a next node passed through by the routing path or intended to be passed through by the routing path.
  • the distance may be a spatial distance but other metrics may be used as well.
  • the distance may also be counted in number of hops, since also the number of hops is influencing the delay, i.e. the distance between the source node and the destination node may be determined by counting the hops on the path or may be the delay itself.
  • the routing method further comprises defining a neighbourhood subset of nodes for the first node, wherein each node of the neighbourhood subset of nodes has in the physical network a distance to the first node which is smaller than a predetermined distance.
  • a respective subset may be defined wherein each node included in the respective subset is closer to the node than a predetermined distance, which distance may correspond to a delay.
  • the neighbourhood subset may define a local area.
  • nodes which are a member of the subset of the first node are selected in the determining of the routing path from the first node to a second node.
  • each node of the logical network corresponds to a node of the physical network.
  • each logical node may correspond to a physical node.
  • each physical node corresponds to a logical node. That is, logical nodes may be a subset of physical nodes. Of course in some cases the subset of logical nodes may be exactly the set of physical nodes.
  • the routing method is based on a Pastry routing.
  • Such a method may form a neighbour aware Pastry routing process. That is, a routing method based on Pastry routing is used which additionally depends on or takes into account restrictions coming out of physical proximity of different nodes. Thus, delay restrictions may be implementable .
  • neighbour aware Pastry routing may apply delay constraint by selecting within a routing table a subset of logical nodes physically closer to the current one.
  • the routing method is based on a HERMES architecture.
  • a HERMES architecture may be used to create a path, e.g. a local path, i.e. a path in a local area, between a publisher and a subscriber in a computer network.
  • the routing method further comprises sending a message initiating a routing.
  • the message comprising a field indicating a maximum delay residual.
  • Such a maximum delay residual may in particular denote a value which may be set initially equal to maximum delay in an extended advertisement message of an HERMES architecture procedure. Then, it may decreased by the delay on each link or hop when the advertisement message is sent in a network. Therefore, the maximum delay residual may represent the maximum delay still acceptable from an intermediate node to the destination because this may guarantees that the end-to- end delay is below the maximum delay.
  • the method may comprise measuring an end-to-end delay for a path and in case the end-to-end delay is below the maximum delay the respective path may be set as a valid routing path.
  • a field in the message may be used to measure the end-to-end delay.
  • the message includes a setup path request and contains a field relating to an accumulated delay type.
  • the message may be broadcasted from the second node.
  • the accumulated delay type may relate to an accumulated delay already imposed to data to be transmitted up to the second node.
  • an intermediate node sends a setup path response message including a field relating to a path delay residual.
  • the path delay residual may relate to a residual or remainder of a maximum delay which is not spent up to the second node.
  • the intermediate node may be a rendezvous node for example.
  • setup path request and/or the setup path response may be stored in the respective or all nodes.
  • the storing may allow to quickly set up another path if one link of the established path, which satisfied delay requirements, fails.
  • use of these fields is only one possibility. Another possibility might be to use accumulated delay also in an advertisement and then send in a setup path response the sum of the two accumulated delays. The subscriber may then select the path with the lowest sum of accumulated delays.
  • the information about the physical network relates to costs for transmitting a message in the physical network between the first node and another node of the physical network .
  • the information may relate to costs which are associated with the respective routing path, e.g. different routing paths may correspond to different costs and a routing path may be chosen which ensures that the costs are below a predetermined maximum value .
  • a logical routing like Pastry may be modified by including information relating to the physical network, e.g. the distance between nodes of the network. For example, only nodes having a maximum distance to a specific node, i.e. which are located in a local area, may be considered for determining a routing path.
  • a neighbour aware Pastry routing and/or a delay sensitive HERMES architecture may be provided which allow controlling the delay in an overlay logical network.
  • neighbour aware Pastry routing may apply delay constraints selecting within a routing table a subset of logical nodes physically closer to the current one and selecting the next hop within this subset.
  • a delay sensitive HERMES architecture may create local paths between publisher and subscriber. In general routing methods may be provided which may be suitable to take into account delay constraints .
  • Fig. 1 schematically illustrates a computer network a routing method according to an exemplary embodiment of the invention may be used in.
  • Fig. 2 schematically illustrates a HERMES architecture.
  • Fig. 3 schematically illustrates a defining of a local area.
  • Fig. 4 schematically illustrates a neighbour aware Pastry routing.
  • Fig. 5A schematically illustrates a hybrid logical-physical routing.
  • Fig. 5B schematically illustrates an extension to a HERMES architecture .
  • Fig. 6 schematically shows simulation results for a routing method according to an exemplary embodiment.
  • Fig. 1 schematically illustrates a computer network 100 a routing method according to an exemplary embodiment of the invention may be used in.
  • the computer network 100 comprises a physical network 101 or physical network level comprising a plurality of nodes 102 which are connected to each other.
  • Fig. 1 schematically indicates a logical network
  • a gateway 103 overlaying the physical network. Additionally, a gateway
  • the computer network may comprise further components, e.g. database 106, application server 107 and controller 108.
  • Data provided by the sensor network may be transmitted to the controller 108 which is indicated by the arrow 109.
  • the controller 109 sends an action initiating message 110 to the sensor network and a notification message 111 to a node 112 of the logical network. Furthermore, the data 109 is sent to the data base.
  • Fig. 2 schematically illustrates a common HERMES architecture, in particular a type-based publish/subscribe process.
  • the HERMES architecture may be used in order to transmit data or a publication from a publisher 201 to a subscriber 202. Therefore, an advertisement 203 may be sent towards a rendezvous node which is schematically depicted by arrow 203.
  • the computing of the address of rendezvous node may comprise applying a hash function to the type.
  • a subscription which is indicated by arrow 204, is sent from subscriber 202.
  • the advertisement 203 and the subscription 204 meet at a rendezvous node 205.
  • the routing may be based on Pastry procedure and the address of the rendezvous node is computed by both publisher and subscriber by applying a hash function to the type.
  • the publication is then sent along a logical path 206 from the publisher 201 to the subscriber which is indicated by arrow 207.
  • HERMES is not able to control the communication delay between publisher and subscriber .
  • Fig. 3 schematically illustrates a defining of a local area and of a local path. In particular, on the left side a network 300 of logical nodes 301 including publisher 302 and subscriber 303 is depicted. Furthermore, a local area 304 is indicated by the dotted circle which includes some of the logical nodes 301. It should be mentioned that although the local area is indicated in a network of logical node the local area rather relates to physical distances in the corresponding physical network of the nodes.
  • a neighbour aware Pastry routing or a delay sensitive HERMES architecture may be achieved both representing routing methods combining logical routing and information of the respective physical network.
  • the concept of defining a local path within the local area may be introduced in order to provide a routing procedure based on HERMES architecture but enabling the controlling of communication delay between publisher and subscriber .
  • Fig. 4 schematically illustrates a neighbour aware Pastry routing.
  • a plurality of nodes 401 including source node 402 are depicted.
  • a subset of nodes is defined which forms a neighbourhood subset or local area 403.
  • a local area or neighbouring subset may be defined around each node, in particular when an advertisement is sent.
  • all nodes having a distance smaller than a predetermined distance from the source node 402 are included.
  • a possible Pastry route 404 is shown in the left as well as a neighbour aware Pastry route (NaPR) 405.
  • NaPR neighbour aware Pastry route
  • Such a Pastry routing table comprises a so called leaf set including nodes which are logically closer to the current node, i.e. the leaf set comprises nodes having a logical address which have the same high order bits as the current node.
  • the routing table may be organized in such a way that nodes in the n-th row have the same first n-th digits as the current node while nodes in the m-th column have m as the (n+l)-th digit.
  • the routing table of Fig. 4 the nodes outside the local area 403 are crossed out.
  • the routing may observe a delay constraint by providing that entries in the routing table that do not satisfy the requirement of being part of the local area are not considered. That is, a next hop is selected within set of logical nodes which are physically closer to the current node, i.e. members of the local area.
  • Fig. 5A schematically illustrates a hybrid logical-physical routing.
  • Fig. 5 illustrates a computer network 500.
  • the computer network 500 comprises a physical network
  • Fig. 5 schematically indicates a logical network 503 overlaying the physical network. Additionally, a local area 504 is shown in the logical network level and in the physical network level. Additionally, a publisher 505 and a subscriber 506 connectable by the computer network are depicted in Fig. 5A.
  • Fig. 5B schematically illustrates an extension to a HERMES architecture. In particular, Fig. 5B schematically shows an exemplary embodiment of a delay sensitive HERMES architecture
  • DSHA Dynamic Hossion Detection
  • HERMES architecture which is modified to set up a path that satisfy a constraint on the maximum delay the publisher 550 sends an advertisement message 553.
  • the subscriber 551 may broadcast a setup path request 554 which is broadcasted to the nodes which then in turn broadcast the setup path request. The broadcasting is indicated by a plurality of small arrows 554.
  • a setup path response is sent by an intermediate node, e.g. a rendezvous node the publisher 550 which is indicated by the arrow 555.
  • a delay residual information in the setup path response message may allow the subscriber to select the path and send the subscription along the selected path.
  • a subscription message 556 is sent from the subscriber to the publisher. After establishing a routing path the publication is sent from the publisher 550 to the subscriber 551 which sending is indicated by the arrow 557.
  • An advertisement may be sent from the publisher 505, wherein a path of the advertisement on the logical network is schematically depicted by arrow 507. Furthermore, a subscription is sent from subscriber 506, wherein a path of the subscription on the logical and physical network is schematically depicted by arrow 508. Also the resulting routing path of the publication, which belongs to the logical network and physical network and thus may ensure that delay constraints may be observable, is indicated by the arrow 509. That is, Fig. 5A schematically illustrates the result of a routing method combining logical routing and physical routing.
  • Fig. 6 schematically shows simulation results for a routing method according to an exemplary embodiment.
  • some assumption where made are in particular, that the same delay is introduced on each link, i.e. for each hop between nodes, that publisher and subscriber are placed at the edge of local area. Furthermore, the delay evaluation between publisher and subscriber is given in number of hops. For comparison reasons as a reference the minimum delay is evaluated as the shortest path on the physical network.
  • Fig. 6 illustrates the mean delay in number of hops for different sizes of local area for different routing methods.
  • the minimum delay is depicted as graph 601.
  • a first simulation evaluates the mean delay for a combination of common HERMES architecture based on common Pastry routing which mean delay is shown as graph 602.
  • a second simulation evaluates the mean delay for a combination of common HERMES architecture based on a neighbour aware Pastry routing (NaPR) which mean delay is shown as graph 603.
  • a second simulation evaluates the mean delay for a combination of a delay sensitive HERMES architecture (DSHA) based on a common Pastry routing which mean delay is shown as graph 604.
  • a fourth simulation evaluates the mean delay for a combination of a delay sensitive HERMES architecture (DSHA) based on a neighbour aware Pastry routing which mean delay is shown as graph 605.

Landscapes

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

Abstract

L'invention porte sur un procédé de routage pour un réseau qui comporte une pluralité de nœuds connectés entre eux, formant un réseau physique et un réseau logique étant associé à ceux-ci, le procédé comportant la détermination d'un trajet de routage logique d'un premier nœud à un second nœud en tenant compte d'informations concernant le réseau physique.
PCT/EP2008/063198 2008-10-02 2008-10-02 Procédé de routage dans un réseau extensible et élément de traitement WO2010037420A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/063198 WO2010037420A1 (fr) 2008-10-02 2008-10-02 Procédé de routage dans un réseau extensible et élément de traitement

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/063198 WO2010037420A1 (fr) 2008-10-02 2008-10-02 Procédé de routage dans un réseau extensible et élément de traitement

Publications (1)

Publication Number Publication Date
WO2010037420A1 true WO2010037420A1 (fr) 2010-04-08

Family

ID=40473456

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2008/063198 WO2010037420A1 (fr) 2008-10-02 2008-10-02 Procédé de routage dans un réseau extensible et élément de traitement

Country Status (1)

Country Link
WO (1) WO2010037420A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103283187A (zh) * 2010-12-28 2013-09-04 日本电气株式会社 信息系统、控制装置、虚拟网络的提供方法及程序

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999059304A1 (fr) * 1998-05-14 1999-11-18 Sun Microsystems, Inc. Determination de la distance entre les noeuds dans un reseau informatique
WO2007034313A1 (fr) * 2005-09-23 2007-03-29 Thomas Friedrich Theo Fuhrmann Procede et appareil d'acheminement
US20080056163A1 (en) * 2006-09-05 2008-03-06 The Hong Kong University Of Science And Technology Merging anonymous routers in end-to-end network topology inference

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999059304A1 (fr) * 1998-05-14 1999-11-18 Sun Microsystems, Inc. Determination de la distance entre les noeuds dans un reseau informatique
WO2007034313A1 (fr) * 2005-09-23 2007-03-29 Thomas Friedrich Theo Fuhrmann Procede et appareil d'acheminement
US20080056163A1 (en) * 2006-09-05 2008-03-06 The Hong Kong University Of Science And Technology Merging anonymous routers in end-to-end network topology inference

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ANTONY ROWSTRON, PETER DRUSCHEL: "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems", PROC. OF THE 18TH IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS, November 2001 (2001-11-01), Heidelberg, Germany, XP002522088, Retrieved from the Internet <URL:http://research.microsoft.com/en-us/um/people/antr/past/pastry.pdf> [retrieved on 20090330] *
PIETZUCH P R ET AL: "Hermes: a distributed event-based middleware architecture", DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, 2002. PROCEEDINGS. 22ND INTER NATIONAL CONFERENCE ON 2-5 JULY 2002, PISCATAWAY, NJ, USA,IEEE, 2 July 2002 (2002-07-02), pages 611 - 618, XP010601589, ISBN: 978-0-7695-1588-5 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103283187A (zh) * 2010-12-28 2013-09-04 日本电气株式会社 信息系统、控制装置、虚拟网络的提供方法及程序
EP2661026A1 (fr) * 2010-12-28 2013-11-06 Nec Corporation Système d'information, dispositif de contrôle, procédé de dimensionnement de réseau virtuel et programme
EP2661026A4 (fr) * 2010-12-28 2014-06-11 Nec Corp Système d'information, dispositif de contrôle, procédé de dimensionnement de réseau virtuel et programme
US10044830B2 (en) 2010-12-28 2018-08-07 Nec Corporation Information system, control apparatus, method of providing virtual network, and program

Similar Documents

Publication Publication Date Title
CN101772918B (zh) 服务链的操作、管理和维护(oam)
CN102027712B (zh) 确定网络中的故障路由器的系统、方法和程序
CN102045252B (zh) 用于内容连网的自适应多接口使用
JP2022523184A (ja) パケット転送経路を決定するための方法及びシステム、並びに、ネットワークノード
JP2016086413A (ja) ネットワーク特性に基づいて仮想インターフェースを作成するためのシステム及び方法
US20150207736A1 (en) Multi-Domain Source Routed Forwarding Based on Collaborating Network Controllers
US10355971B2 (en) System and method for data path validation and verification
CN105191215A (zh) 双向服务链的数据平面学习
CN106030542A (zh) 代理服务器故障转移和负载集群
US8009669B2 (en) System of path computation element protocol support for large-scale concurrent path computation
US20130100817A1 (en) Method for discovery and load balancing of path computation elements based on transport plane link metrics
CN104243320A (zh) 一种优化网络访问路径的方法及装置
CN109842670A (zh) 运算装置、其资源分配方法及通信系统
CN102484611B (zh) 链路状态标识符冲突处理
US7734813B2 (en) Method and system for communicating predicted network behavior between interconnected networks
CN104205752A (zh) 分布式存储系统、控制装置、客户终端、负载平衡方法以及程序
CN106797319A (zh) 网络服务感知路由器及其应用
US10536368B2 (en) Network-aware routing in information centric networking
CN108156247B (zh) 一种数据通信方法、装置、系统、终端和可读存储介质
US7480735B2 (en) System and method for routing network traffic through weighted zones
CN104348737B (zh) 一种组播报文的传输方法及交换机
WO2010037420A1 (fr) Procédé de routage dans un réseau extensible et élément de traitement
CN104767684A (zh) 数据传输方法及相关装置和通信系统
WO2016068238A1 (fr) Système de commande de réseau, dispositif de commande, procédé de gestion d&#39;informations de réseau, et programme
US20140181307A1 (en) Routing apparatus and method

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08804985

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08804985

Country of ref document: EP

Kind code of ref document: A1