EP1741258A2 - Procede pour la gestion redondante de donnees dans des reseaux informatiques - Google Patents

Procede pour la gestion redondante de donnees dans des reseaux informatiques

Info

Publication number
EP1741258A2
EP1741258A2 EP05716920A EP05716920A EP1741258A2 EP 1741258 A2 EP1741258 A2 EP 1741258A2 EP 05716920 A EP05716920 A EP 05716920A EP 05716920 A EP05716920 A EP 05716920A EP 1741258 A2 EP1741258 A2 EP 1741258A2
Authority
EP
European Patent Office
Prior art keywords
network
application programs
computers
address
computer
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
EP05716920A
Other languages
German (de)
English (en)
Inventor
Richard Ostrcil
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
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 filed Critical Siemens AG
Publication of EP1741258A2 publication Critical patent/EP1741258A2/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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
    • 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/35—Network arrangements, protocols or services for addressing or naming involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function

Definitions

  • the invention relates to a method for redundant data storage in a computer network, in which data are stored consistently on at least two computers in a network.
  • Computer networks have developed in recent years into an important communication medium through which a multitude of services are offered.
  • the world's best-known computer network is the Internet, as the totality of all interconnected networks that use the Internet Protocol IP as the transport protocol is called.
  • the Internet Protocol IP is responsible for the connectionless transport of data from a sender - possibly over several networks - to the recipient, whereby neither error detection nor error correction takes place.
  • Transport protocols such as the Transmission Control Protocol TCP or User Datagram Protocol UDP are based on the Internet protocol.
  • the Transmission Control Protocol TCP is a connection-oriented transport protocol that enables a logical, secure full-duplex point-to-point connection. It ensures that data packets are error-free and in the desired order underlying network can be transmitted according to the Internet Protocol IP.
  • the User Datagram Protocol UDP enables connectionless point-to-point communication.
  • the individual data packets (datagrams) are independent of each other.
  • the transfer is not secured. This means that data packets can be lost and that the order of reception does not have to match the order of transmission. A possible backup of the
  • UDP is generally used for simple services that expect a simple response (a datagram) to a simple request (a datagram).
  • World Wide Web WWW World Wide Web WWW
  • Audio sequences, still images and films can include ⁇ s using WWW browser, a local front-end software.
  • the World Wide Web is based on the client / server principle, on which all important applications on the Internet, in addition to the WWW, FTP or news are based.
  • applications designed according to the client-server principle use a client program that exchanges data with a specific service computer in the network - the server.
  • the server is usually for the
  • the Internet servers are operated either by commercial or non-commercial organizations, such as universities, which offer various online services, i.e. information services (weather reports, train schedules, news services) and communication services (e-mail, chat, forums), which are implemented using appropriate application programs.
  • information services weather reports, train schedules, news services
  • communication services e.g., chat, forums
  • An essential criterion for the quality of a service offered is the probability with which a potential user can also use the service, the corresponding measure - which results from the downtime during a certain observation period - the so-called availability of this service has a significant influence on the service User satisfaction and thus the success of the respective service.
  • the invention has for its object to provide an improved method for redundant data storage in computer networks. According to the invention, this is done with a method for redundant data storage in computer networks, in which data are stored consistently on at least two computers, the data storage provided
  • Application programs of the at least two computers have a matching address identifier, which these application programs have as part of a virtual subnet of a computer network, and the mutually independent computers have routing functions via which the application programs are accessed.
  • Transport protocols the Transmission Control Protocol TCP or the User Datagram Protocol UDP are used.
  • the addressing in the computer network N shown is carried out according to the Internet Protocol Version 4 by the so-called IP (Internet Protocol) address, which uniquely identifies each network participant on level 3 of the OSI layer model, that is to say on a logical level.
  • IP Internet Protocol
  • the IP address is a 32-bit word which has a first area which is used for addressing the network and a second area by means of which the computer in the network is identified.
  • the size of the two areas is standardized, we differentiate between 5 classes of IP addresses: - Class A networks with 7 bit network addressing and 24 bit for the subscriber address, - Class B networks with 14 bit network addressing and 16 bit subscriber addressing, - Class C networks with 21 bit network addressing and 8 bit subscriber address. - Class D for addressing within the network with 28 bit subscriber addresses and the class E reserved for research purposes
  • the class of the IP address is shown in the leading bits, addresses of class A can be recognized by the fact that the leading bit has the value 0, class B by the value 10 of the two leading bits, class C by 110 of the first three bits, etc ,
  • the routers of a network need the information about the address class in order to filter out the information about the address of the target network from the IP address of a target subscriber using the so-called netmask. While the network addresses are managed globally, the subscriber addresses are managed locally by the respective network operator. The latter also has the option of structuring his network by dividing it into subnets by assigning the subscriber addresses without using additional network numbers. To do this, the subscriber portion of the IP address is divided into a - subnetwork address and the - actual participant address divided.
  • the IP address is then structured in three parts, it includes the network address, the subnet address and the actual subscriber address.
  • a network of address class B is given as a simple example, in which the IP address has the binary number 10 in the leading two bits and a further 14 bits for the address of the network.
  • the subscriber addressing part of 16 bits provided for this network class is in turn divided into an 8 bit part for addressing the subnets SN1, ... SN 25, ..., SN 255 and an 8 bit element for addressing the subscribers TN in the subnets.
  • IP address In the generally used 4 octet notation of the IP addresses, in which the individual bytes (8 bits) are represented by decimal numerical values and separated by dots, a typical IP address looks as follows:
  • the address of the network N itself is 172.16.0.0.
  • the 254 possible nodes TN in the subnet SN 25 with the address 172.16.25.0 then have the following addresses: 172.16.25.1, ..., 172.16.25.254
  • the data to be kept redundant are now stored on two mutually independent computers R1, R2 of the network N. stored consistently, with data matching between the redundant units being ensured using known methods. It is possible that the two computers R1, R2 belong to a network N of an operator or different interconnected networks of different operators.
  • the associated application programs of the two computers are assigned a matching address identifier, which these application programs are part of a virtual one
  • subnet SN 25 of a computer network N such as the number 172.16.25.0.
  • the application program runs on a computer in this subnet SN 25, for example on a computer with the address 172.16.25.1.
  • This virtual subnet SN 25 is logically connected to the overall network via two routers.
  • the two mutually independent computers R1, R2, which, among other things, contain the application programs provided for the redundant and consistent storage of the data, are designed as routers, via which only the application programs - the virtual subnet - are accessed.
  • the other routers of the networks contain in their entirety
  • Routing tables therefore indicate that addresses of type 172.16.25.XXX, which relate to the virtual subnet SN 25, can only be reached via one of the two routers mentioned.
  • the entry in the routing table of the other routers contains the network address 172.16.25.0
  • Network mask 255.255.255.0 the cost of the route to this subnet and the interface through which this network N can be reached.
  • All data packets with these destination addresses therefore get to one of the two routers and are sent from this to the corresponding application program with the associated memory area forwarded.
  • the network N is equipped with a dynamic routing method, when one of the two application programs is occupied, the next request is automatically routed to the cheapest free memory area. If the two routers, via which the virtual subnet SN 25 can be reached, can be reached via equally expensive routes, one router is selected at random and thus a load sharing is carried out.
  • the present exemplary embodiment describes the use of the invention in a computer network N with addressing according to IP protocol version 4, but the invention can also be used advantageously, for example, with IP protocol version 6. Likewise, the application of the invention is possible for all common transport protocols based on IP, such as TCP or UDP.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Hardware Redundancy (AREA)
  • Multi Processors (AREA)

Abstract

L'invention concerne un procédé pour la gestion redondante de données dans des réseaux informatiques, procédé selon lequel des données sont mémorisées de manière cohérente dans au moins deux ordinateurs (R1, R2). L'invention est caractérisée en ce que les programmes d'application, prévus pour la gestion des données, des deux ordinateurs comportent des identifiants d'adresses coïncidents qui présentent ces programmes d'application en tant que partie intégrante d'un sous-réseau virtuel (SN 25) d'un réseau informatique (N) et en ce que les ordinateurs indépendants l'un de l'autre possèdent des fonctions de routage permettant l'accès aux programmes d'application. Cela permet d'obtenir une gestion redondante de données simple et invisible pour l'utilisateur.
EP05716920A 2004-03-23 2005-03-04 Procede pour la gestion redondante de donnees dans des reseaux informatiques Withdrawn EP1741258A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004014195A DE102004014195B3 (de) 2004-03-23 2004-03-23 Verfahren zur redundanten Datenhaltung in Computernetzwerken
PCT/EP2005/050980 WO2005093573A2 (fr) 2004-03-23 2005-03-04 Procede pour la gestion redondante de donnees dans des reseaux informatiques

Publications (1)

Publication Number Publication Date
EP1741258A2 true EP1741258A2 (fr) 2007-01-10

Family

ID=34745453

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05716920A Withdrawn EP1741258A2 (fr) 2004-03-23 2005-03-04 Procede pour la gestion redondante de donnees dans des reseaux informatiques

Country Status (4)

Country Link
US (1) US20070136468A1 (fr)
EP (1) EP1741258A2 (fr)
DE (1) DE102004014195B3 (fr)
WO (1) WO2005093573A2 (fr)

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6470389B1 (en) * 1997-03-14 2002-10-22 Lucent Technologies Inc. Hosting a network service on a cluster of servers using a single-address image
WO2000052906A1 (fr) * 1999-03-05 2000-09-08 At & T Corporation Systeme, procede et appareil pour charge utile de reseau de service et gestion de fiabilite
JP4189076B2 (ja) * 1999-03-26 2008-12-03 株式会社東芝 耐障害コンピュータシステム
US6618377B1 (en) * 1999-03-30 2003-09-09 Cisco Technology, Inc. Flexible scheduling of network devices within redundant aggregate configurations
AU4347600A (en) * 1999-11-10 2001-06-06 Rainfinity, Inc. Distributed traffic controlling system and method for network data
JP2001211190A (ja) * 2000-01-25 2001-08-03 Hitachi Ltd 通信管理装置及び通信管理方法
US6944662B2 (en) * 2000-08-04 2005-09-13 Vinestone Corporation System and methods providing automatic distributed data retrieval, analysis and reporting services
US20030154236A1 (en) * 2002-01-22 2003-08-14 Shaul Dar Database Switch enabling a database area network
US7062517B2 (en) * 2002-08-14 2006-06-13 Hitachi, Ltd. Method and apparatus for centralized computer management
US7334218B2 (en) * 2002-09-02 2008-02-19 International Business Machines Corporation Method for adaptively assigning of data management applications to data objects
JP2004173136A (ja) * 2002-11-22 2004-06-17 Fujitsu Ltd ネットワーク管理装置
US20060095705A1 (en) * 2004-10-30 2006-05-04 James Wichelman Systems and methods for data storage management
US7779368B2 (en) * 2004-10-30 2010-08-17 Hewlett-Packard Development Company, L.P. Systems and methods for presenting managed data
US8886778B2 (en) * 2005-04-29 2014-11-11 Netapp, Inc. System and method for proxying network management protocol commands to enable cluster wide management of data backups

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO2005093573A3 (fr) 2006-04-27
WO2005093573A2 (fr) 2005-10-06
DE102004014195B3 (de) 2005-08-11
US20070136468A1 (en) 2007-06-14

Similar Documents

Publication Publication Date Title
DE69935138T2 (de) System und Verfahren zur Optimierung der Leistung und der Verfügbarkeit eines DHCP Dienstes
DE60225192T2 (de) Dynamische portkonfiguration eines netzwerkgerätes
DE10022431B4 (de) Integriertes IP-Netzwerk
DE60311297T2 (de) Gemeinsame port adressenumsetzung in einem router der als nat & nat-pt gateway agiert
DE60029430T2 (de) Mehrfach-sendefähiges adressauflösungsprotokoll
DE69838269T2 (de) Verfahren und Vorrichtung zur Erkennung, Korrektur und Abweisung von verfälschten Datenpaketen in einem Daten übermittelnden Kabelsystem
DE69924478T2 (de) Vorrichtung und verfahren für netzadressenübersetzung als externer service im zugriffsserver eines dienstanbieters
DE69836673T2 (de) Verfahren und Vorrichtung zur Konfigurierung eines Netzknotens um sich selbst Netzübergang zu sein
DE102005035201B4 (de) Netzknoteneinheit und Verfahren zur Weiterleitung von Datenpaketen
EP0998100B1 (fr) Procédé pour configurer un réseau de protocole internet
DE60304704T2 (de) Netzsystem, Router und Netzeinrichtungsverfahren
WO2007147424A1 (fr) Procédé et dispositif de mappage d'adresses
EP1421766A1 (fr) Pre-traitement d'adresses nat
EP1741258A2 (fr) Procede pour la gestion redondante de donnees dans des reseaux informatiques
EP2171943B1 (fr) Procédé de routage de messages de service
EP1081921B1 (fr) Procédé pour l' allocation d' adresses IP dans des réseaux de télécommunication
EP1623559B1 (fr) Procede d'echange de donnees entre des elements de reseau dans des reseaux a differentes zones d'adresse
EP2695364A1 (fr) Procédé d'adressage de messages dans un réseau d'ordinateurs
DE102005039343B4 (de) Verfahren zum Übertragen von Datenpaketen und Datenverarbeitungseinheit
EP3515034A1 (fr) Procédés, dispositifs, supports lisibles par ordinateur et systèmes d'établissement des liaisons certifiées avec des terminaux dans un réseau local
DE10251906B4 (de) Verfahren und Anordnung zur Inventarisierung von an einem Netzwerk angeschlossenen Netzkomponenten
DE69837608T2 (de) Internetzugangsverfahren
DE102019126486A1 (de) Verfahren zur Identifikation von Diensten in einem Netzwerk mit Internet-of-Things Sensoren/Aktoren
DE10029792A1 (de) Verfahren für eine Umwandlung einer Netzwerkadresse
DE102016010359B4 (de) Endanwenderspezifisches virtuelles globales Netzwerk

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

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

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

Designated state(s): DE FR GB

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

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

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