EP1754345A1 - Procede d'equilibrage selectif de charge - Google Patents

Procede d'equilibrage selectif de charge

Info

Publication number
EP1754345A1
EP1754345A1 EP05751717A EP05751717A EP1754345A1 EP 1754345 A1 EP1754345 A1 EP 1754345A1 EP 05751717 A EP05751717 A EP 05751717A EP 05751717 A EP05751717 A EP 05751717A EP 1754345 A1 EP1754345 A1 EP 1754345A1
Authority
EP
European Patent Office
Prior art keywords
switch
reference table
traffic information
processor
data
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
EP05751717A
Other languages
German (de)
English (en)
Inventor
Thomas Bahls
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
Siemens AG
Nokia Siemens Networks GmbH and Co KG
Siemens Corp
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 AG, Nokia Siemens Networks GmbH and Co KG, Siemens Corp filed Critical Siemens AG
Publication of EP1754345A1 publication Critical patent/EP1754345A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers

Definitions

  • the present invention relates to a method for a selective load balancing according to the preamble of claim 1. And even more particularly it relates to a method in which the means required for implementation are arranged outside a switch, with an effective dynamic load balancing taking place ,
  • Switches such as Ethernet LAN (local area network) switches, are known and are used as components of a packet-switched telecommunication network or a packet-switched telecommunication network. These switches cause the data packets to communicate between a large number of network nodes, which are based on a preset algorithm. Data packets arriving in the switch are temporarily stored in a buffer memory or register. The message header is read and an address for the data packet is defined. A reference table with addresses is consulted and a procedure is then derived in order to obtain the best possible connection between the switch and the destination network node of the data packet. A connection between two correspondingly long segments is shown in order to forward the data packets from the switch to the network node through the segments.
  • Ethernet LAN local area network
  • MAC addresses are physical addresses of a facility like this like the NIC (Network Interface Card) of a computer in the network.
  • the MAC address comprises up to two identical parts, each 6 bytes long. The first three bytes identify the company that made the NIC. The second three bytes are the serial number of the NIC itself.
  • NIC stands for Network Interface Card, which, as the name suggests, enables communication between the subscriber terminal and the network. NIC can also refer to the Ethernet card.
  • Packet-switched data switching comprises several known methods for forwarding data packets. Each of them depends on the in-circuit hardware and software. Such methods include: forwarding (cut-through), storage and forwarding (store and forward) and the transmission free of fragments (fragment-free).
  • forwarding cut-through
  • storage and forwarding store and forward
  • fragment-free the transmission free of fragments
  • the switch reads the MAC address as soon as a data packet has been recognized and immediately begins the pass-through or or forwarding after the six bytes have been stored, regardless of the remaining data packets that are still received or received.
  • storage and forwarding the entire data packet is stored in a memory, checked for errors and then sent on, based on the MAC address subsequently read. If an error is discovered in this process, the data packet is discarded.
  • Some switches are also known to combine forwarding and storage and forwarding procedures in varying degrees.
  • the procedure "transmission free of fragments" is equivalent to the transmission, with the difference that the first 64 bytes of the data packet are saved before the forwarding takes place.
  • a basis for this procedure is that most errors occur in the first 64 bytes occur, which means for the switch there is an opportunity to find out the errors early without having to accept the delay due to the storage of more than 64 bytes.
  • the switch collects certain basic information about the data packets to be forwarded, regardless of the type of pre-ringing that is carried out by the switch.
  • the switches are configured so that they design their own reference table based on learned or received information from a network node arranged in the network. Such learning is automatically initiated without any need for mediation by a network administrator.
  • the establishment of a reference table is commonly referred to as transparent bridging.
  • Transparent bridging comprises five parts: learning, flooding, filtering, sending and aging. In short, learning is a process in which the switch, when it encounters a new MAC address, simply adds the address with the respective network node to its own reference table.
  • Flooding is a process in which the switch searches for a network node whose address is previously unknown to it and in which it then supplies (floods) all the network segments known to it (except for the receiving segment) with the data packet. As a result, the appropriate desired recipient will then acknowledge receipt of the packet. With this acknowledgment, the flooding switch now knows the two network nodes and their location and can thus establish a connection between them and transmit the data packet. In the event that the switch detects two network nodes and determines that they have the same network in common, the switch will update its own reference table and consequently will not interfere in the communication between the two nodes sharing, which is the part of the Filtering was described.
  • Aging is a form of cleaning the switch's memory from addresses that have not been used within a specified period of time.
  • the reference table of the switch can be designed and the information of the network node connection is available through the memory allocated in the switch.
  • Switches work in a conventional manner on the data link or the second layer of the OSI reference model. Some switches, which are more similar to routers and are known as Layer 3 switches, operate on the third layer of the OSI reference model, i.e. at the network level. The applications that control the network run on the highest layer, the application layer.
  • a general basis for network control applications is the Signaling Network Management Protocol or the Simple Network Management Protocol (SNMP).
  • SNMP Simple Network Management Protocol
  • MIB management information base
  • the question is carried out via SNMP.
  • the MIB is a repository of properties and parameters that are controlled by a network device, such as a switch. Consequently, SNMP communicates with the switch via MIB, receives information from the switch and controls the switch in another way. This information may include an error counter, data load, and so on.
  • API Application Programming Interface
  • API Application Programming Interface
  • API is software that is used to enable communication with the controlled switches of the network.
  • API is a set of standard software of data formats that application programs use to establish contact with network services.
  • switches It is the hardware of the switch that recognizes the data packets and defines or executes hash functions and logically defines the assignment to a network node (via a hash value).
  • the procedure mentioned above is based on internal (with reference to the switch) measures (hardware and software).
  • switches remain relatively static and predictable in terms of how they work. In other words, the switches do not behave dynamically with regard to the different data loads and their requirements. As a result, certain ports on a switch can be more heavily loaded by data than other ports on the same switch. This poses a problem of the accumulation of data traffic on the switch, as a result of which the switch becomes slower and thus also the communication between the respective network nodes and ultimately (in different gradations) the overall network performance also decreases.
  • a known solution to this problem involves introducing some flexibility in the switch hardware. This higher flexibility represents a change to a number of parameters and / or hash functions in order to achieve a more balanced load distribution. The changes can be based on an analysis of the current traffic situations and their requirements. Such restructuring may be possible during ongoing operations. As always, the communication that has already been logically assigned to a special port of the switch cannot be redirected or redirected to another port. Therefore, a solution to switch over or to the U Data sharing required where the switch can operate more dynamically while data load can be redirected or redistributed regardless of the fact that the data loads have already been allocated. The solution must also be flexible to use, so that it can also be used for existing switches, which increases their performance without being forced to replace the switches.
  • the present invention is directed to solving this problem and specified in the characterizing part of patent claim 1. Refinements are specified in the dependent claims.
  • the present invention is directed to a method in which a processor external to the switch is provided in order to examine the data load in detail and to determine whether the load advantageously resembles a desired distribution. If this is not the case, the switch's reference table is read, processed and then switched back to active, so that after the execution of this process, the processed table redirects the data traffic to other ports, thereby achieving a more advantageous distribution result.
  • Figure 1 is a flow diagram of the method
  • Figure 2 is a box diagram of a system for performing the method shown.
  • FIG. 1 shows a flow diagram with the steps that are carried out by the illustrated invention in order to achieve a desired load balancing within a switch.
  • the method begins at step 100 and continues to step 102, the information of the data load being read out from the switch.
  • the switches provide multiple sources and several different significant sets of information indicative of the data load.
  • the sources of the information include SNMP, API, network support, network manager, switch storage and so on.
  • the information can be as simple as counting data packets that are routed via a special port, or it can also contain data from a network node or the data about details regarding the nature of the data packets sent.
  • the data is read out for one or more ports of the switch.
  • a comparison is made between the read load distribution and the desired load distribution in step 104 and it is determined whether the read load distribution advantageously corresponds to the desired load distribution.
  • the tolerance for this comparison is a matter of designing and applying the process.
  • the illustrated invention is also not intended to be limited to any type of data or data source.
  • the method returns to the beginning (step 108). However, if the data read out does not resemble the desired load distribution (step 110), the reference table is read and examined in detail (step 112). A determination is made as to how the reference table can be processed so that the data traffic currently handled by the switch can be redistributed among the ports of the switch in order to achieve the desired distribution of the traffic load. Because the present method for every type of desired load distribution for every type of switch, the processor-equipped ports and means for data storage is suitable, the external processor and its programmability must include a high degree of flexibility. The present processor and programming are therefore a matter of design. After processing, the reference table is sent back to the switch for implementation (step 116). The method then returns to the beginning after a preselected period of time (step 118) and the above steps are repeated.
  • FIG. 2 describes a box diagram of a system for performing the inventive method.
  • a switch 10 comprises four components: a switch table 20, a hash function 22, a processor interface 24 and a register 26.
  • the work tasks of these individual components have already been described above.
  • the switch table 20 shows the port of the switch via which packets for a specific network node are forwarded.
  • the hash function 22 is a processing of information according to special criteria.
  • the processor interfaces 24 enable communication with the processor 16 via a connection 14.
  • the register 26 is a temporary memory which is used for receiving, holding and transferring data.
  • the processor 16 includes software 18 for processing algorithms. Numerous segments 12 enable communication with the switch 10, each of them with connection or subscriber interfaces. As applied with this present invention, the algorithms can be selected so that their execution results in a desired distribution of the data load. The design of the algorithms is known to the expert experienced in his field.
  • stanchions are provided. For example: comparing the static hashes of the switch; a last bit of the srcMAC, which is zero or one, and a hash on the port; the number of frames transported from the register per port; other functions of SNMP functions that provide detailed information about the traffic load situation, qualitatively separated from the pure count, such as sorting by business customer, by private customer, the amount of connection interfaces, etc.

Landscapes

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

Abstract

L'invention concerne un procédé pour répartir une charge de trafic sur un commutateur, lequel procédé comprend les étapes suivantes : lecture des informations de trafic par le commutateur, acheminement des informations de trafic lues au processeur, exécution d'un algorithme par le processeur, ledit algorithme permettant une analyse précise de critères des informations de trafic, déterminer si les résultats de cette analyse précise sont comparables à un résultat prédéterminé, dans le cas d'un résultat négatif de cette comparaison, lecture des informations de la table de références et traitement desdites informations, afin que, lors d'une mise en oeuvre de la table de références traitée, la charge de données soit répartie, de sorte le résultat des analyses futures se trouve dans le cadre du résultat prédéterminé, puis transmission de la table de références traitée à un commutateur pour la mise en oeuvre effective de ladite table.
EP05751717A 2004-06-11 2005-05-21 Procede d'equilibrage selectif de charge Withdrawn EP1754345A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004028454A DE102004028454A1 (de) 2004-06-11 2004-06-11 Verfahren zum selektiven Lastausgleich
PCT/EP2005/005535 WO2005122498A1 (fr) 2004-06-11 2005-05-21 Procede d'equilibrage selectif de charge

Publications (1)

Publication Number Publication Date
EP1754345A1 true EP1754345A1 (fr) 2007-02-21

Family

ID=34970279

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05751717A Withdrawn EP1754345A1 (fr) 2004-06-11 2005-05-21 Procede d'equilibrage selectif de charge

Country Status (5)

Country Link
US (1) US20080285456A1 (fr)
EP (1) EP1754345A1 (fr)
CN (1) CN101147365A (fr)
DE (1) DE102004028454A1 (fr)
WO (1) WO2005122498A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160013976A1 (en) * 2014-07-14 2016-01-14 Futurewei Technologies, Inc. Wireless Through Link Traffic Reduction

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6345041B1 (en) * 1996-10-24 2002-02-05 Hewlett-Packard Company Method and apparatus for automatic load-balancing on multisegment devices
US20030237016A1 (en) * 2000-03-03 2003-12-25 Johnson Scott C. System and apparatus for accelerating content delivery throughout networks
US20020174246A1 (en) * 2000-09-13 2002-11-21 Amos Tanay Centralized system for routing signals over an internet protocol network
AU2002220005A1 (en) * 2000-12-04 2002-06-18 Rensselaer Polytechnic Institute System for proactive management of network routing
US7123581B2 (en) * 2001-10-09 2006-10-17 Tellabs Operations, Inc. Method and apparatus to switch data flows using parallel switch fabrics
US7239608B2 (en) * 2002-04-26 2007-07-03 Samsung Electronics Co., Ltd. Router using measurement-based adaptable load traffic balancing system and method of operation

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
US20080285456A1 (en) 2008-11-20
WO2005122498A1 (fr) 2005-12-22
DE102004028454A1 (de) 2006-01-05
CN101147365A (zh) 2008-03-19

Similar Documents

Publication Publication Date Title
DE102015102871B4 (de) Technologien für verteilten Leitweglenkungstabellennachschlag
DE69827201T2 (de) Verfahren und system zur server-netzwerkvermittlung-mehrverbindung
DE69802259T2 (de) Verfahren und vorrichtung zur einrichtung eines anzapfpunktes in einem schaltnetzwerk
DE69834122T2 (de) Verbindingsunterstützung in einer hochleistungsnetzwerkvorrichtung
DE69934644T2 (de) Netzwerkvermittlungseinrichtung mit auf der Basis von Benutzung verteilten Umleitungsdatenbanken
DE69522666T2 (de) Netzwerk mit sicherer, schneller paketvermittlung und garantierter servicequalität
DE60303026T2 (de) System, verfahren und produkt zur verwaltung des datenverkehrs in einem netzwerk
DE69634928T2 (de) Netzwerkverwaltungssystem mit verbesserter Knotenerkennung und -überwachung
DE60031274T2 (de) Mehrfachanschlussverfahren und -gerät für vituelle ports
DE69026400T2 (de) System und Verfahren zur Verbindung von Anwendungen über verschiedene Netzwerke von Datenverarbeitungssystemen
DE602004004942T2 (de) Virtuelle Netzwerkadressen
DE69327576T2 (de) Paralleles Rechnersystem
DE69434330T2 (de) Übertragungsvorrichtgung und verfahren
DE602005003142T2 (de) Vorrichtung und verfahren zur unterstützung von verbindungsherstellung in einem offload der netzwerkprotokollverarbeitung
DE69220564T2 (de) Unterstützung von verbindungslosen Diensten im ATM-Netz unter Verwendung von Teilverbindungen
DE19929516B4 (de) Hochgeschwindigkeits-Netzwerkschalter
DE602004005785T2 (de) Dynamische Leitweglenkung in einem inhaltbasierten verteilten Netzwerk
DE602004004991T2 (de) Automatisierte Installation von Netzgeräten mit Informationen über Regeln, Authentifizierung und gerätespezische Daten
DE602004005242T2 (de) Zentralisierte konfiguration von verwalteten objekten des link-scope-typs in netzwerken, die auf dem internet-protokoll (ip) basieren
DE10296675T5 (de) Virtuelles Vernetzungssystem und -verfahren in einem Verarbeitungssystem
DE60130844T2 (de) Autonomes OSPF-System mit einem in zwei Teilbereiche getrennten Hauptnetz
DE112016002952T5 (de) Systeme und Verfahren zum Verarbeiten von Paketen in einem Computernetz
DE60131615T2 (de) Topologiebestimmung in atm-netzen
DE60133067T2 (de) Verfahren und Vorrichtung zum Wiederzusammensetzen von Paketen in einer Vermittlungsstelle
DE602004012529T2 (de) Steuerung von Multicast-Verkehr

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE ES FR GB IT

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

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

DAX Request for extension of the european patent (deleted)
RBV Designated contracting states (corrected)

Designated state(s): DE ES FR GB IT

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

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