EP1842343A1 - Procede pour determiner la direction de transmission de trames ethernet - Google Patents

Procede pour determiner la direction de transmission de trames ethernet

Info

Publication number
EP1842343A1
EP1842343A1 EP06700604A EP06700604A EP1842343A1 EP 1842343 A1 EP1842343 A1 EP 1842343A1 EP 06700604 A EP06700604 A EP 06700604A EP 06700604 A EP06700604 A EP 06700604A EP 1842343 A1 EP1842343 A1 EP 1842343A1
Authority
EP
European Patent Office
Prior art keywords
switch
destination address
address
forwarding
network
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
EP06700604A
Other languages
German (de)
English (en)
Inventor
Torsten Langguth
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 EP1842343A1 publication Critical patent/EP1842343A1/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
    • H04L45/123—Evaluation of link metrics
    • 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
    • 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/18—Loop-free operations
    • 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/36—Backward learning

Definitions

  • the invention relates to a method for determining the forwarding direction of Ethernet frames for their forwarding to a destination and adapted for the implementation of such a method most Ethernet switch.
  • Ethernet technology which is commonly used in local area networks (LANs) is being developed further for use in metro networks.
  • LANs local area networks
  • efforts are being made in the further development of Ethernet networks prior to a training.
  • high availability (fail-safe) necessary.
  • metro networks often use RJLnog- pologies (loops), and simple loops are very susceptible to faults - a cable break or a loose plug usually leads to failure or overloading of the network - high availability must also be provided in ring architectures be .
  • a switch examines each passing frame - sometimes the terms frame and packet instead of frame in the literature - on the destination MAC address (MAC: Media Access Control) and forwards it directly in the appropriate direction. This is generally a
  • Self-learning mechanism used, which extracts the source address in all incoming frames. Traffic to a ge ist ⁇ th Adres se is usually sent on the port where the frame from which the source address is extracted, is dripped Giveaway-. If no forwarding information is available, flooding usually takes place; H . the frame is on gesen- al ⁇ len belonging to the corresponding network segment ports det. This makes network dimensioning, traffic engineering and compliance with quality of service difficult.
  • STP pending tree protocol
  • RTSP Rapid Spanning Tree Protocol
  • Ring-based loop-avoidance techniques such as EAPS (Ethernet Automatic P-Rotation Switching), RRSTP (Riverstone's Rapid Spanning T_ree) or patented methods by Siemens AG (DE 10 004 432) and Siemens AG / Hirschmann (DE 298 20 587) are also known .
  • EAPS Ethernet Automatic P-Rotation Switching
  • RRSTP Raverstone's Rapid Spanning T_ree
  • Siemens AG DE 10 004 432
  • Siemens AG / Hirschmann DE 298 20 587
  • a method for determining the forwarding direction of Ethernet frames for their forwarding to a destination eg. B. a terminal, presented by means of Ethernet switches, wherein a frame is received by a first switch.
  • the first switch notes that the Ur ⁇ jump address of the frame not registered in the switch destination ⁇ address for forwarding of frames is.
  • the Ur ⁇ jump address is used as a new destination for the further line of frames in the first switch registered.
  • the first switch communicates the new destination address to a second Ethernet switch and checks for the arrival of the destination address. se from the second switch for the forwarding of frames to the specified by the new Zieladres se destination a forwarding direction set.
  • This method is usually used in a network, e.g. B. a metro network running.
  • the network includes z. B. a plurality of Ethernet switches.
  • the first switch is then the switch of the network from which the frame is first received.
  • Such a switch usually has at least one edge port, i. H . a port where no information from other switches of the network arrives.
  • the first switch can detect by the arrival of the frame at this port that it is the first switch of the network from which the frame is received.
  • the second switch can also communicate the new destination address to another Ethernet switch or. communicate.
  • the new destination is determined by the message je ⁇ Weils of a neighbor switch, z. B. by means of bridge frames, communicated to all the switches of the network except the first switch.
  • a bridge frame is a frame which is sent between the two switches and information, for example, about the destination address of the frame to be determined or a forwarding direction. the address of a switch implies. This then has a similar function to the configuration BPDUs defined in IEEE Standard 802.1 (Bridge P_rotocol .Data Units_). On the arrival of the destination address in a switch towards the network for the transmission of frames is set to the given by the new destination address a target Rothlei ⁇ power direction of the switches and the destination address to the neighbor's witche communicates.
  • a switch can have multiple witche neighbor's, the new destination is often the net more than one message with the Zielad ⁇ ress from a switch received during propagation.
  • This switch can then register a plurality of forwarding directions and evaluate them in accordance with metric information. For this purpose, when communicating to a neighbor switch Metric information and / or address information related to the first switch, e.g. B. Ethernet address with the destination address ⁇ communicate together. For a determination of a forwarding direction by a switch, which receives a bridge frame, there are then z. B. following two remediesswei ⁇ sen:
  • the bridge package contains the destination address and a met ⁇ rikinformation.
  • the switch then registers the direction from which the bridge frame was obtained, as a forwarding direction, which is evaluated by means of Metrikinforma ⁇ tion.
  • the Bridge package contains the destination address and the Ad ⁇ ress of the first switches. If the switch is aware of the topology of the network, then the optimal path in terms of the metric and possibly Substitute paths are determined and the associated forwarding direction is registered. Although this procedure places higher demands on the switch, it has the advantage that optimal paths can be determined when a bridge packet arrives. Further, the same addresses communi ⁇ thde bridge packets can then be discarded.
  • Each switch can provide a forwarding database for registering multiple forwarding directions. This allows a fast local switching of the forward ⁇ line direction of a frame in case of failure in a switch, as alternative ways to forward the frame are available.
  • the metric information may relate to hop counts and / or transmission costs for transmission between switches of the network. Thus, based on the metric information, an optimal path for forwarding a frame to a destination among all registered forwarding directions can be selected. For the same metric, a distribution can be applied to all. the metric of equivalent ports or a selection of one of the ports. The selection can be made automatically or specified by configuration. As an automatic selection method, for example, the port are selected, over which the address information arrives first. The address information can be used to determine ways or.
  • a forwarding decision can be made for unicast, multicast, and broadcast traffic.
  • the forwarding decision is based on the destination address and the corresponding registry in the forwarding database. Routing of multicast and broadcast traffic typically occurs only for frames arriving at the lowest metric port for the source address. Incoming multi ⁇ cast or broadcast frames via other ports clears ge ⁇ .
  • the invention is with respect. Propagating the messages on the destination address given a termination criterion to limit the signaling load within the network.
  • the destination address is z. B. not communicated to ei ⁇ NEN neighboring switch when the arrived destination address was sent from the neighbor switch or if ⁇ be undergoing the neighboring switches a transmission of Zielad ⁇ ress Affected termination criterion is satisfied.
  • the abort ⁇ criterion can be given by the fact that the destination address is not communicated to a neighboring switch when the neighbor switch already a notification about the accessibility of the Zieladres se has been sent with more favorable Metrikinformati ⁇ on.
  • Adres se is removed after ei ⁇ nem predetermined time interval when einteffen not be forwarded to the address frames within the time interval. But this aging function performs only the initiator. If a frame is removed, all other switches are informed again via bridge frame.
  • a further development of the invention is a transmission of the initiator functionality.
  • the destination address of a frame arrived at an edge port of the first switch which has previously arrived at another edge port of another switch of the network, is communicated from the first switch to the second switch, if the transmission is the initiator -Functionality on the first switch he ⁇ wishes is.
  • the other switch is notified of the first switch and registers the destination address as a destination address ⁇ , which requires a route the frames to another switch in the network.
  • D. H the first switch becomes the new initiator switch and communicates with the other one
  • Switch which includes a different edge port st, the adoption of the initiator functionality or. the switching of the forwarding direction for frames to be sent to the destination address.
  • the further switch d. H . the old initiator switch removes the registry as an initiator switch and retains only the forwarding information. If the changeover, however undesirable, such a one edge port of the f ⁇ th switches incoming frame are ignored by the first switch. If a forwarding direction for a frame with a destination address can not be determined, it makes sense to select the frame no longer forward, but to remove. Flooding of frames can be avoided.
  • the self-learning / determining the forwarding direction no longer affects the path or the direction of transmission. Way is limited but distributed throughout the network. As a result, all relevant forwarding information (eg destination address) is known in all switches and it is possible to quickly switch to alternative paths.
  • D. H It is an interruption-free operation of a network in the event of failure of individual or few network components (eg., Switches, lines) allows. This results in very short switching times, which are independent of the network dimension.
  • the load can be distributed over several paths. There is no blocking of ports, i. H . the entire Netzka ⁇ capacity is fully available. Since the forwarding information is known, flooding can be dispensed with. So no additional traffic is generated.
  • the method enables the highly available use of Ethernet in access networks with different topologies, such as rings and cascades.
  • the process is characterized by its efficiency, speed and autonomy, and thus represents a significant advance interpreting ⁇ is compared to the known processes.
  • the invention is illustrated below in the context of an embodiment with reference to a figure.
  • the figure shows an Ethernet network structure with switches according to the invention.
  • the figure shows five switches (Sl, S2, S3, S4, S5) a Net ⁇ zes as well as a with the edge port El: l of the switch Sl ver ⁇ -bound computer which is connected to a Ethernetadres se X marked.
  • edge ports for example El: 2, El: 3, for the switch Sl and E2: l, E2: 2, E3: 2 for the switch S2, etc. shown. If the switch Sl encounters a frame sent from the computer via the edge port El: l, whose source address X is not in the bank Rothtechnischtechnischs Scheme- of Sl is present, then this address will be added, since ⁇ tenbank in the. Then the switch is called Sl. Initiator for the routing to the address X.
  • This bridge frame includes, for example here Informa ⁇ tions about the address X and the address of the switch Sl.
  • the switches S2 and S3 evaluate the incoming bridge frames, add the entries of the forwarding database and also send bridge frames to all other ports of the corresponding network segment. For example, the switch S2 would process the information received from the switch Sl and forward it to the switches S4 and S5.
  • the bridge frames receive a field that identifies the path length, which is z. B. is described by Hopcount (number of hops) or connection costs.
  • the switch S4 would be able to deduce from the bridge frame from the switch S2 that a frame forwarded to the address X within the network requires two hops via the switch S2.
  • the switch S4 Bridge frames sends to the switches S3 and S5.
  • the switch S3 now has forwarding information for the frames to be sent to the address X via two different ports. Via port 3: 1, the destination is reachable within the network with a hopcount of 1, via port 3: 4 the destination can be reached with a hopcount of 3 within the network. Both entries are added to the database.
  • the load can be distributed to paths with the same metric (for example, port 4: 2 and 4: 3 to switch S4).
  • the bridge frames as long as instructed by the switches goge ⁇ until there is no need to pass in either direction.
  • the switch S4 would not forward incoming information over port 4: 5 (Hopcount 3) to switches S3 and 2 if the information about the shorter directions has already been forwarded via Swich S2 (Hopcount 2) and S3 (Hopcount 3).
  • the switches change their forwarding tables and forward the corresponding information to the other switches. In case of failure of Switch S2 z shares.
  • Switch S3 and Switch S5 indicate that the hopcount has changed from 2 (direction switch S2) to 3 (direction switch S4).

Landscapes

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

Abstract

L'invention concerne un procédé pour déterminer la direction de transmission de trames Ethernet pour leur transmission vers une destination, p. ex. un ordinateur, au moyen de commutateurs Ethernet, une trame étant reçue par un premier commutateur (S1). Ce premier commutateur (S1) reconnaît que l'adresse source de la trame ne représente aucune adresse de destination enregistrée dans le commutateur (S1) pour la transmission de trames. L'adresse source est enregistrée comme nouvelle adresse de destination (X) pour la transmission de trames par ledit premier commutateur (S1). Cette nouvelle adresse de destination (X) est communiquée par ce premier commutateur (S1) à un deuxième commutateur Ethernet (S2, S3) et, à l'arrivée de cette adresse de destination (X), une direction de transmission est déterminée par ce deuxième commutateur (S2, S3) pour la transmission de trames vers la destination fournie par la nouvelle adresse de destination (X).
EP06700604A 2005-01-18 2006-01-03 Procede pour determiner la direction de transmission de trames ethernet Withdrawn EP1842343A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102005002358A DE102005002358A1 (de) 2005-01-18 2005-01-18 Verfahren zur Bestimmung der Weiterleitungsrichtung von Ethernet-Frames
PCT/EP2006/050011 WO2006077173A1 (fr) 2005-01-18 2006-01-03 Procede pour determiner la direction de transmission de trames ethernet

Publications (1)

Publication Number Publication Date
EP1842343A1 true EP1842343A1 (fr) 2007-10-10

Family

ID=35788314

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06700604A Withdrawn EP1842343A1 (fr) 2005-01-18 2006-01-03 Procede pour determiner la direction de transmission de trames ethernet

Country Status (6)

Country Link
US (1) US20080304480A1 (fr)
EP (1) EP1842343A1 (fr)
KR (1) KR20070103435A (fr)
CN (1) CN101147367A (fr)
DE (1) DE102005002358A1 (fr)
WO (1) WO2006077173A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10883891B2 (en) 2017-09-07 2021-01-05 X Development Llc Unibody flexure design for displacement-based force/torque sensing

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9294395B2 (en) 2009-04-23 2016-03-22 Futurewei Technologies, Inc. Media access control bridging in a mesh network
EP2667544B1 (fr) * 2009-04-23 2016-10-26 Huawei Technologies Co., Ltd. Passerelle de contrôle d'accès au support dans un réseau maillé
CN104038425B (zh) 2013-03-06 2018-01-02 阿里巴巴集团控股有限公司 转发以太网报文的方法和装置
EP3343303B1 (fr) * 2016-12-29 2019-06-26 Siemens Aktiengesellschaft Système de radiocommunication pour un système d'automatisation industrielle et son procédé de fonctionnement
US10938709B2 (en) * 2018-12-18 2021-03-02 Advanced Micro Devices, Inc. Mechanism for dynamic latency-bandwidth trade-off for efficient broadcasts/multicasts
CL2018003852A1 (es) * 2018-12-28 2020-07-24 Univ Técnica Federico Santa Maria Un método de tolerancia a la falla en cualquier conjunto de fallas de enlace simultáneo en redes ópticas wdm dinámicas con resistencias de continuidad de longitud de onda
KR102272204B1 (ko) * 2019-02-22 2021-07-01 엘에스일렉트릭(주) 링 네트워크를 이용한 배전반 관리 시스템

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5485455A (en) * 1994-01-28 1996-01-16 Cabletron Systems, Inc. Network having secure fast packet switching and guaranteed quality of service
US6154462A (en) * 1997-08-21 2000-11-28 Adc Telecommunications, Inc. Circuits and methods for a ring network
US6556541B1 (en) * 1999-01-11 2003-04-29 Hewlett-Packard Development Company, L.P. MAC address learning and propagation in load balancing switch protocols
US6829651B1 (en) * 2000-04-11 2004-12-07 International Business Machines Corporation Local MAC address learning in layer 2 frame forwarding
US7139267B2 (en) * 2002-03-05 2006-11-21 Industrial Technology Research Institute System and method of stacking network switches
KR100611125B1 (ko) * 2003-05-09 2006-08-10 삼성전자주식회사 애드 혹 네트워크에서 트리구조를 이용한 최적 라우팅경로 설정 장치 및 방법

Non-Patent Citations (1)

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

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10883891B2 (en) 2017-09-07 2021-01-05 X Development Llc Unibody flexure design for displacement-based force/torque sensing

Also Published As

Publication number Publication date
DE102005002358A1 (de) 2006-08-24
KR20070103435A (ko) 2007-10-23
CN101147367A (zh) 2008-03-19
WO2006077173A1 (fr) 2006-07-27
US20080304480A1 (en) 2008-12-11

Similar Documents

Publication Publication Date Title
EP2070256B1 (fr) Procédé pour reconfigurer un réseau de communication
DE3904403C2 (fr)
EP1842343A1 (fr) Procede pour determiner la direction de transmission de trames ethernet
DE3888818T2 (de) Aufgeteilte Lastverteilung.
DE60022602T2 (de) Verfahren, Vorrichtung und Computerprogramm um Topologiedaten eines Link State Routing Netzwerkes aktuell zu halten
DE60133316T2 (de) System und verfahren zum abfangen von telekommunikationen
EP1532771B1 (fr) Methode d'essai de chemins de messages dans des reseaux de communication et element de reseau
DE102007015539B4 (de) Verfahren zum Rekonfigurieren eines Kommunikationsnetzwerks
DE60212108T2 (de) Selektiver Schutz für Ringtopologien
DE60214639T2 (de) Verfahren zur Betriebsverwaltung und Management eines RPR-Netzes durch eine Auswechslung von "Frage-Antwort" Paketen
DE60026006T2 (de) System zum Empfang von Mehrfachdaten
DE69819088T2 (de) Umweglenkung
WO2020125987A1 (fr) Procédé de communication de données, comportant une exigence applicable relative à la fiabilité, appareil de communication, programme informatique et support lisible par ordinateur
DE602004012788T2 (de) Verfahren und Vorrichtung zum Aktualisieren der Anbieter-Domain durch Kundentopologie-Änderungsmitteilungen
EP2130331B1 (fr) Procédé de reconfiguration d'un réseau de communication
EP1894363B1 (fr) Procede et element de reseau de communication independant destines a determiner des routes etiquetees dans un tel element de reseau de communication
EP1566039A1 (fr) Procede pour devier des paquets de donnees lorsque des echecs de liaison sont identifiees
EP1649644A1 (fr) Procede et noeud de reseau pour signaler au moins une panne de voie de communication dans un reseau de communication
DE60027423T2 (de) Kommunikationseinrichtungen
DE10260640A1 (de) Verfahren zur Topologie-Erkennung und Weglenkung von Datenpaketen in einem Pakete vermittelnden Ring
WO2004107676A1 (fr) Noeud reseau d'un reseau de communication a commutation de paquets et procede de distribution du trafic de donnees dans un reseau de communication a commutation de paquets
EP1757049A1 (fr) Procede pour mettre des ressources en reserve pour un routage inter-domaines avec attributs de qualite de service
EP1394995B1 (fr) La redondance dans l'infrastructure du réseau
EP1701557B1 (fr) Méthode pour la transmission de messages SS7, arrangement de réseau et élément de réseau
DE10055066A1 (de) Verfahren zum multidirektionalen Austausch von Informationen zwischen Teilnehmern auf Ethernet Basis

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

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.

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

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

17Q First examination report despatched

Effective date: 20071129

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