WO2013000711A1 - Procédé et dispositifs pour créer des adresses pour des abonnés dans un réseau - Google Patents

Procédé et dispositifs pour créer des adresses pour des abonnés dans un réseau Download PDF

Info

Publication number
WO2013000711A1
WO2013000711A1 PCT/EP2012/061215 EP2012061215W WO2013000711A1 WO 2013000711 A1 WO2013000711 A1 WO 2013000711A1 EP 2012061215 W EP2012061215 W EP 2012061215W WO 2013000711 A1 WO2013000711 A1 WO 2013000711A1
Authority
WO
WIPO (PCT)
Prior art keywords
address
addresses
subscriber
value
hash
Prior art date
Application number
PCT/EP2012/061215
Other languages
German (de)
English (en)
Inventor
Hermann Angst
Franz-Josef GÖTZ
Joachim Lohmeyer
Matthias Scheffel
Original Assignee
Siemens Aktiengesellschaft
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 Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2013000711A1 publication Critical patent/WO2013000711A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/50—Address allocation
    • H04L61/5038—Address allocation for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2101/00—Indexing scheme associated with group H04L61/00
    • H04L2101/60—Types of network addresses
    • H04L2101/618—Details of network addresses
    • H04L2101/622—Layer-2 addresses, e.g. medium access control [MAC] addresses
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2101/00—Indexing scheme associated with group H04L61/00
    • H04L2101/60—Types of network addresses
    • H04L2101/672—Short addresses

Definitions

  • the invention relates to methods and apparatus for
  • MAC addresses MAC - Media Access Control
  • IPv4 addresses IP - Internet Protocol, v4 / v6 - version 4/6
  • IP - Internet Protocol IP - Internet Protocol, v4 / v6 - version 4/6
  • the respective address of the subscribers is stored at certain points in the network, such as in a switch that controls a distribution of data packets for subpaths according to OSI layer 2 (OSI Open Systems Interconnection).
  • OSI layer 2 OSI Open Systems Interconnection
  • shortened addresses which are referred to below as address values
  • address values can be used in a forwarding table, for example by means of a hash function [1] to convert the address into the address value, for example, from the address with 48 bits in an address value with 12 bit a reduction in the address length achieves the memory requirement, as well as an acceleration in the search for an address value in the routing table.
  • the shortening of the address also requires that different addresses be encoded by the hash algorithm to an identical address value. This is called a hash collision. An approach to this is, when occurring
  • Hash collisions provide a memory area in the form of a list in which addresses are entered with the same hash value. This does not solve the problem satisfactorily because a number of list entries and thus a permissible number of addresses with the same hash value are still limited. When searching for an address by means of the address value, this results in a considerable amount of time.
  • Another approach is described in [2]. An implementation of a hash function optimized for a certain address distribution in LA switches (LAN Local Area Network) is presented. However, this approach is associated with a considerable implementation effort and is therefore usually excluded for commercial applications.
  • the object is to provide methods and devices which avoid a hash collision and allow a simple realization.
  • the invention relates to a method for creating a first address of a first subscriber in a network with the first subscriber and at least one second subscriber, wherein the second subscriber has a second address, and a length of the addresses is greater than a length of address values associated with the addresses, comprising the steps of: i) providing the second address value of the second subscriber by applying a hash function based on second
  • This method is advantageous because a complex error treatment in the case of hash collisions can be avoided.
  • a memory space for storing e.g. Redirection information for address values in routers or switches is reduced because no exceptions for hash collisions need to be stored.
  • a time to process lists based on address values is reduced because no hash collision routines need to be edited.
  • the address means an address of a subscriber in a network, e.g. Sender and / or recipient address.
  • a length of the address e.g. 48bit, is longer than a length of the address value associated with the address, e.g. 12bit.
  • the address generally has more bits than the address value that can be assigned by means of the hash function.
  • IPv4 or IPv6 IP-
  • the hash function is any algorithm that transforms the address into an address value that is shorter in length than the address.
  • a hash function can be a classic hash algorithm, such as known from a document [1].
  • the invention can be implemented by a method for creating a first address of a first subscriber for a network, which has at least two further subscribers with associated further addresses, and a length of the addresses is longer than a length of address values belonging to the addresses following the steps below:
  • This variant of the method makes it possible in an existing system to change addresses which cause a hash collision in pairs in such a way that the hash collision can be avoided.
  • the resulting advantages are analogous to the previously described method.
  • the creation of the first address is performed as follows:
  • creating the first address in a second extension can be done as follows:
  • this second extension generally achieves a quicker selection than the first extension, since a "trial and error" of candidates for the first address, as in the case of first extension, not applicable.
  • the second extension can be supplemented in an advantageous manner by deleting the first address from the set after selection of one of the possible addresses, whereby the selection is further accelerated, since only unallocated addresses are taken into account in the selection.
  • the invention further relates to an apparatus for establishing a first address of a first subscriber in a network with the first subscriber and at least one second subscriber, wherein the second subscriber has a second address, and a length of the addresses is longer than a length of the addresses associated with the addresses, by the following means: First means for providing the second address value of the second party by applying a hash function based on the second address;
  • the invention also relates to a device for generating a first address of a first subscriber for a network, which has at least two further subscribers with associated further addresses, and the addresses are longer than address values associated with the addresses, by the following means:
  • Basis of the first address is generated, different from a second address value, which is the further address value of the second further subscriber;
  • the second means for creating the first address is set up in such a way that the following steps are feasible:
  • the second means for creating the first address is set up in such a way that the following steps are feasible:
  • the second means is further adapted to delete the first address from the set after selecting one of the further addresses. This further speeds up the selection, as only addresses that have not yet been allocated are taken into account in the selection.
  • the method can be used in a switch of a network, wherein the network is in particular an administered network.
  • the network is in particular an administered network.
  • FIG. 1 shows a network with a first and second subscriber and a device in the form of an assignment unit according to a first exemplary embodiment
  • FIG. 3 shows a network with a first further and second further subscriber according to a further exemplary embodiment.
  • FIG. 4 shows a flowchart of a method and structure of a method
  • FIG. 1 shows a network NET with two subscribers T1, T2 and a device DEV, which is also referred to as an allocation unit.
  • the allocation unit and the subscribers can send messages for exchanging data via paths PI, P2, P3. These paths are realized, for example, by means of copper wire lines, whereby data can be exchanged by means of MAC (MAC-Media Access Control) addressing.
  • the assignment unit DEV has the task of receiving a request message from a subscriber to this configuration data, such as to send its MAC address.
  • Such MAC addresses are referred to as addresses in this example.
  • the second subscriber T2 has a second address L2 with 01.44.8A. BC .AA.64 on.
  • all addresses are displayed in hexadecimal notation.
  • the allocation unit selects from a set ML of the possible addresses a first address Li for the first subscriber. The procedure is as follows:
  • a second address value K2 of the second subscriber T2 is formed by applying a hash function HASH on the basis of the second address L2.
  • the hash function see for example document [1] maps the address with 48 bits into an address value with 8 bits.
  • the hash function discards the first 40 bits of the address and generates a remainder resulting from dividing the last 8 bits of the address by a value of 7.
  • the second address value K2 is calculated to be 2.
  • the assignment unit takes the first address Li from the
  • Amount ML The first address Li is EF .01. B2. F9.79.37.
  • the associated first address value Kl results in 6. Thus, both the first and second address and the first and second address value are different, so that a valid first address was determined.
  • This first address transmits the assignment unit DEV in the form of a reply message to the first subscriber.
  • the allocation unit DEV initially selects the first address Li equal to AI for the first subscriber. B2. C3. D4. E5.41 off.
  • the allocation unit may set the amount of possible addresses in advance. In this case, only addresses are added to the set ML which lead to address values which are not generated by addresses already contained in the set ML. For the above hash function, a maximum of 7 different address values 0 to 6 can be generated, so that a maximum of 7 addresses can be included in the set ML, as shown in the following list: Address Address value
  • FIG. 1 also shows a switch R at the edge of the network.
  • the switch determines on which path or partial path of three possible paths PI, P2, P3 a packet of the first subscriber Tl is forwarded.
  • the forwarding decision made by the switch in FIG. 1 relates to the path from the set of paths. In another example, the forwarding decision may involve only a partial path, from the switch to a next-in-place switch or hop.
  • the switch takes the destination address as the address from the received packet and reduces it to its associated address value.
  • the switch has a forwarding table, in which an assignment between address value and path or subpath is stored, which, for example, looks like this:
  • the switch is able to use the address value to determine the further route or partial path of the packet or message.
  • This embodiment shows the invention by way of less
  • the invention achieves a significant memory reduction in the above forwarding list, which can be efficiently traversed by the address value due to the address value.
  • either the original additional address can be replaced by the new address or the other subscriber receives the new address as an additional address, which he rewrites on receipt of a packet in the original further address or sending a packet with the original further address in the new address changes.
  • another unit (not shown in the figure) can also carry out the conversion of the address from the original address to the new address and vice versa.
  • the invention and its developments can be realized by means of a device DEV for creating a first address Li of a first subscriber T1 in a network NET with the first subscriber T1 and at least one second subscriber T2, the second subscriber T2 having a second address L2, and a length of the addresses Li, L2 is longer than a length of address values Kl, K2 associated with the addresses Li, L2, by the following means M1, M2:
  • the device DEV can be configured to create a first address Li of a first subscriber Tl for a network NET, which has at least two further subscribers TW1, TW2 with associated further addresses LW1, LW2, and a length of the addresses Li, L2, LWl, LW2 is longer than a length of the addresses Li, L2, LWl, LW2 associated address values Kl, K2, KWl, KW2 with the following means Ml, M2, M3:
  • FIG. 4 shows the sequence of the method with the steps S1 and S2. Furthermore, FIG. 4 also shows the device DEV. This device comprises a first means M1 for
  • the device may have a third means M3, which is designed to associate the first address.
  • the means M1, M2, M3 can be implemented in hardware, software or in a combination of hardware and software. For example, a process sor the steps S1 to S2 stored as program code in a memory attached to the processor and, if necessary, further steps of extensions of the method.
  • the processor has an input and output interface with which the request message can be read in and the first address can be provided to the first user in the form of a response message.
  • intermediate results of the individual processing steps can additionally be stored in the memory.
  • the means M1, M2 and M3 can also be realized by a fixed wiring of electronic components with a memory module.
  • Hash Function Wikipedia article, found on June 21, 2011, htt: / / en. wikipedia. org / wiki / Hash_function

Abstract

L'invention concerne un procédé et des dispositifs pour créer des adresses pour des abonnés dans un réseau de manière à éviter des collisions de fonction de hachage du fait de l'attribution des adresses.
PCT/EP2012/061215 2011-06-30 2012-06-13 Procédé et dispositifs pour créer des adresses pour des abonnés dans un réseau WO2013000711A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102011078424.1 2011-06-30
DE102011078424A DE102011078424A1 (de) 2011-06-30 2011-06-30 Verfahren und Vorrichtungen zum Erstellen von Adressen für Teilnehmer in einem Netzwerk

Publications (1)

Publication Number Publication Date
WO2013000711A1 true WO2013000711A1 (fr) 2013-01-03

Family

ID=46317385

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2012/061215 WO2013000711A1 (fr) 2011-06-30 2012-06-13 Procédé et dispositifs pour créer des adresses pour des abonnés dans un réseau

Country Status (2)

Country Link
DE (1) DE102011078424A1 (fr)
WO (1) WO2013000711A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10300155B2 (en) 2015-12-31 2019-05-28 Washington University Alpha-synuclein ligands

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030174710A1 (en) * 2002-03-14 2003-09-18 Mark Gooch Method and system for performing flow based hash transformation to generate hash pointers for a network device
GB2415855A (en) * 2004-07-02 2006-01-04 Toshiba Res Europ Ltd Variable network address lengths
WO2009156777A1 (fr) * 2008-06-23 2009-12-30 Telefonaktiebolaget Lm Ericsson (Publ) Prévention de collisions d'adresses de contrôle d'accès au support (mac) dans des réseaux commutés éther net

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7457300B2 (en) * 2003-01-21 2008-11-25 Telefonaktiebolaget L M Ericsson (Publ) Ethernet address management system
US20060248079A1 (en) * 2005-04-28 2006-11-02 Freescale Semiconductor Incorporated Method and apparatus for finding a perfect hash function and making minimal hash table for a given set of keys

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030174710A1 (en) * 2002-03-14 2003-09-18 Mark Gooch Method and system for performing flow based hash transformation to generate hash pointers for a network device
GB2415855A (en) * 2004-07-02 2006-01-04 Toshiba Res Europ Ltd Variable network address lengths
WO2009156777A1 (fr) * 2008-06-23 2009-12-30 Telefonaktiebolaget Lm Ericsson (Publ) Prévention de collisions d'adresses de contrôle d'accès au support (mac) dans des réseaux commutés éther net

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HASH FUNCTION, 21 June 2011 (2011-06-21), Retrieved from the Internet <URL:http://en.wikipedia.org/wiki/Hash_function>
HUNTLEY, C. ET AL.: "Effect of Hash Collisions on the Performance of LAN Switching Devices and Networks", IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS, 14 November 2006 (2006-11-14), pages 280 - 284, XP031053906

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10300155B2 (en) 2015-12-31 2019-05-28 Washington University Alpha-synuclein ligands

Also Published As

Publication number Publication date
DE102011078424A1 (de) 2013-01-03

Similar Documents

Publication Publication Date Title
DE69834122T2 (de) Verbindingsunterstützung in einer hochleistungsnetzwerkvorrichtung
DE102006012614B4 (de) Verfahren und Vorrichtung für den Durchlauf von Paketen durch eine Einrichtung zur Netzwerkadressenübersetzung
DE69727930T2 (de) Zusammenfassung von verbindungen in vermittlungskommunikationsnetzen
DE60221228T2 (de) Verfahren und system zur anycast-wegleitung zwischen mehreren wirtsrechnern
DE602006000007T2 (de) Automatische Erkennung von Pseudo-Wire Peer-Adressen in Ethernet-basierten Netzen
DE60311800T2 (de) Verfahren und vorrichtung zur verbesserung der netzwerkleitweglenkung
DE60302994T2 (de) Multicast Router mit Übersetzungsfunktion von Protokollen gemäß Any-Source-Multicast und Source-Specific-Multicast
DE60029430T2 (de) Mehrfach-sendefähiges adressauflösungsprotokoll
DE69531337T2 (de) Weglenkung von Transaktionsnachrichten in einem digitalen Kommunikationsnetz
DE102015102871B4 (de) Technologien für verteilten Leitweglenkungstabellennachschlag
US20190222538A1 (en) Packet Processing Method, Computing Device, and Packet Processing Apparatus
DE102012220834B4 (de) Verfahren und Vorrichtung zum Umsetzen eines flexiblen virtuellen lokalen Netzwerks
DE69835809T2 (de) Kommunikationssteuereinheit und Kommunikationssteuerungsverfahren angewendet für ein Mehrfachsende-unterstützendes LAN
DE69934192T2 (de) Verfahren und Einrichtung zur Netzverbindung mittels Brücken
DE69825596T2 (de) System und verfahren für ein vielschicht-netzelement
DE112015006397B4 (de) DNS Optimierung für Multi-Source Download bei Hybridzugriff
DE112008002665T5 (de) Bereitstellen einer Abstraktionsschicht in einem Clusterswitch, der mehrere Switches hat
DE202013012482U1 (de) Identifizieren eines Austrittspunkts zu einem Netzwerkstandort
DE112005003332T5 (de) Multicast-Architektur für drahtlose Maschennetze
DE60133175T2 (de) Kommunikationsnetz
DE112016002952T5 (de) Systeme und Verfahren zum Verarbeiten von Paketen in einem Computernetz
DE112005002981T5 (de) Maskierbarer inhaltsadressierbarer Speicher
US9363227B2 (en) Multicast source in group address mapping
DE602005001578T2 (de) Brücke zur Übersetzung zwsichen lokalen Ethernet- und 1394A-Anschlüssen für Geräte der Unterhaltungselektronik
WO2013000711A1 (fr) Procédé et dispositifs pour créer des adresses pour des abonnés dans un réseau

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

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

Country of ref document: EP

Kind code of ref document: A1